Fetching the paper…
Reading the bibliography…
Clustering is an effective technique in data mining to generate groups that are the matter of interest.
A. K. Jain and R. C. Dubes, Algorithms for clustering data . Prentice-Hall, Inc, 1988
1988
Earlier work this paper cites.
A. K. Jain and R. C. Dubes, “Algorithms for clustering data,” Englewood Cliffs,NJ: Prentice-Hall , 1988
1988
Earlier work this paper cites.
L. Hagen, , and A. B. Kahng, “New spectral methods for ratio cut partitioning and clustering,” Trans. Computer-aided design of integrated circuits and systems , 1992
1992
Earlier work this paper cites.
F. S. Samaria and A. C. Harter, “Parameterisation of a stochastic model for human face identification,” in Proc. Applications of Computer Vision , 1994, pp. 138–142
1994
Earlier work this paper cites.
S. A. Nene, S. K. Nayar, and H. Murase, “Columbia object image library (coil-20),” CUCS-005-96, Columbia University, Tech. Rep., 1996
1996
Earlier work this paper cites.
A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: a review,” ACM computing surveys , vol. 31, no. 3, pp. 264–323, 1999
1999
Earlier work this paper cites.
M. J. Lyons, J. Budynek, and S. Akamatsu, “Automatic classification of single facial images,” IEEE Trans. PAMI , vol. 21, no. 12, pp. 1357–1362, 1999
1999
Earlier work this paper cites.
J. Shi and J. Malik, “Normalized cuts and image segmentation,” Trans. PAMI , pp. 888–905, 2000
2000
Earlier work this paper cites.
A. S. Georghiades, P. N. Belhumeur, and D. Kriegman, “From few to many: Illumination cone models for face recognition under variable lighting and pose,” IEEE Trans. PAMI , vol. 23, no. 6, pp. 643–660, 2001
2001
Earlier work this paper cites.
C. H. Ding, X. He, H. Zha, M. Gu, and H. D. Simon, “A min-max cut algorithm for graph partitioning and data clustering,” in Proc. ICDM , 2001
2001
Earlier work this paper cites.
M. Girolami, “Mercer kernel-based clustering in feature space,” IEEE Trans. Neural Networks , vol. 13, no. 3, pp. 780–784, 2002
2002
Earlier work this paper cites.
A. Strehl and J. Ghosh, “Cluster ensembles—a knowledge reuse framework for combining multiple partitions,” Machine Learning Research , vol. 3, pp. 583–617, 2003
2003
Cited alongside, same era.
D. la Torre, Fernando, and T. Kanade, “Discriminative cluster analysis,” in Proc. ICML , 2006, pp. 241–248
2006
Cited alongside, same era.
B. Saha and P. Mitra, “Fast incremental minimum-cut based algorithm for graph clustering,” Proc. ICDM , pp. 207–211, 2006
2006
Cited alongside, same era.
J. Ye, Z. Zhao, and H. Liu, “Adaptive distance metric learning for clustering,” in Proc. CVPR , 2007, pp. 1–7
2007
Cited alongside, same era.
C. Ding and T. Li, “Adaptive dimension reduction using discriminant analysis and k-means clustering,” in Proc. ICML , 2007, pp. 521–528
2007
Cited alongside, same era.
Y. Zhou, R. Jin, and S. Hoi, “Exclusive lasso for multi-task feature selection,” Proc. ICAIS , pp. 988–995, 2010
2010
Later among the works it cites.
X. Wang and I. Davidson, “Flexible constrained spectral clustering,” in Proc. KDD , 2010, pp. 563–572
2010
Later among the works it cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proc. IEEE , 2011
2011
Later among the works it cites.
C. Chen, Y. Zhuang, F. Nie, Y. Yang, F. Wu, and J. Xiao, “Learning a 3d human pose distance metric from geometric pose descriptor,” IEEE Trans. Visualization and Computer Graphics , vol. 17, no. 11, 2011
2011
Later among the works it cites.
O. Wu, W. Hu, S. J. Maybank, M. Zhu, and B. Li, “Efficient clustering aggregation based on data fragments,” IEEE Transactions on Systems, Man, and Cybernetics, Part B , vol. 42, no. 3, pp. 913–926, 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Ye, Z. Zhao, and H. Liu, “Adaptive distance metric learning for clustering,” in Proc. CVPR , 2007, pp. 1–7
2007
Cited alongside, same era.
J. Ye, Z. Zhao, and M. Wu, “Discriminative k-means for clustering,” in Proc. NIPS , 2007, pp. 1649–1656
2007
Cited alongside, same era.
M. Filippone, F. Camastra, F. Masulli, and S. Rovetta, “A survey of kernel and spectral methods for clustering,” Pattern recognition , vol. 41, no. 1, pp. 176–190, 2008
2008
Cited alongside, same era.
C. Zhang and S. Xia, “K-means clustering algorithm with improved initial center,” in Proc. Knowledge Discovery and Data Mining , 2009, pp. 790–792
2009
Cited alongside, same era.
D. S. Turaga, M. Vlachos, and O. Verscheure, “On k-means cluster preservation using quantization schemes,” Proc. ICDM , 2009
2009
Cited alongside, same era.
A. Raj and C. H. Wiggins, “An information-theoretic derivation of min-cut-based clustering,” IEEE PAMI , vol. 32, no. 6, 2010
2010
Cited alongside, same era.
2012
Later among the works it cites.
F. Nie, D. Xu, and X. Li, “Initialization independent clustering with actively self-training method,” IEEE Transactions on Systems, Man, and Cybernetics, Part B , vol. 42, no. 1, pp. 17–27, 2012
2012
Later among the works it cites.
L. Wu, S. C. Hoi, R. Jin, J. Zhu, and N. Yu, “Learning bregman distance functions for semi-supervised clustering,” IEEE Trans. Knowledge and Data Eng. , vol. 24, no. 3, pp. 478–491, 2012
2012
Later among the works it cites.
J. Wang, J. Wang, Q. Ke, G. Zeng, and S. Li, “Fast approximate k-means via cluster closures,” in Proc. CVPR , 2012
2012
Later among the works it cites.
C. Wang, Z. She, and L. Cao, “Coupled clustering ensemble: Incorporating coupling relationships both between base clusterings and objects,” in Proc. ICDE , 2013
2013
Later among the works it cites.
J. Yuan, E. Bae, X.-C. Tai, and Y. Boykov, “A spatially continuous max-flow and min-cut framework for binary labeling problems,” Numerische Mathematik , 2014
2014
Closest in time.
X. Chang, F. Nie, Z. Ma, Y. Yang, and X. Zhou, “A convex formulation for shrunk spectral clustering,” in Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, January 25–30, 2015, Austin Texas, USA. , 2015
2015
Closest in time.