F. Murtagh, “A survey of recent advances in hierarchical clustering algorithms,” The Computer Journal , vol. 26, no. 4, pp. 354–359, 1983
1983
Earlier work this paper cites.
F. S. Samaria and A. C. Harter, “Parameterisation of a stochastic model for human face identification,” in Applications of Computer Vision, 1994., Proceedings of the Second IEEE Workshop on . IEEE, 1994, pp. 138–142
1994
Earlier work this paper cites.
M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic et al. , “Query by image and video content: The qbic system,” computer , vol. 28, no. 9, pp. 23–32, 1995
1995
Earlier work this paper cites.
M. Ester, H.-P. Kriegel, J. Sander, X. Xu et al. , “A density-based algorithm for discovering clusters in large spatial databases with noise.” in Kdd , vol. 96, no. 34, 1996, pp. 226–231
1996
Earlier work this paper cites.
T. Zhang, R. Ramakrishnan, and M. Livny, “Birch: an efficient data clustering method for very large databases,” in ACM Sigmod Record , vol. 25, no. 2. ACM, 1996, pp. 103–114
1996
Earlier work this paper cites.
S. Nayar, S. Nene, and H. Murase, “Columbia object image library (coil 100),” Department of Comp. Science, Columbia University, Tech. Rep. CUCS-006-96 , 1996
1996
Earlier work this paper cites.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” arXiv preprint physics/0004057 , 2000
2000
Earlier work this paper cites.
J. C. Bezdek and R. J. Hathaway, “Some notes on alternating optimization,” in AFSS International Conference on Fuzzy Systems . Springer, 2002, pp. 288–300
2002
Earlier work this paper cites.
D. Comaniciu and P. Meer, “Mean shift: A robust approach toward feature space analysis,” IEEE Transactions on pattern analysis and machine intelligence , vol. 24, no. 5, pp. 603–619, 2002
2002
Earlier work this paper cites.
S. Theodoridis and K. Koutroumbas, “Pattern recognition,” 2003
2003
Earlier work this paper cites.
Y. Seldin, S. Starik, and M. Werman, “Unsupervised clustering of images using their joint segmentation,” in Proceedings of the 3rd International Workshop on Statistical and Computational Theories of Vision (SCTV 2003) , 2003
2003
Earlier work this paper cites.
J. Goldberger, S. Gordon, and H. Greenspan, “Unsupervised image-set clustering using an information theoretic framework,” IEEE transactions on image processing , vol. 15, no. 2, pp. 449–458, 2006
2006
Earlier work this paper cites.
D. Nister and H. Stewenius, “Scalable recognition with a vocabulary tree,” in Computer vision and pattern recognition, 2006 IEEE computer society conference on , vol. 2. Ieee, 2006, pp. 2161–2168
2006
Earlier work this paper cites.
M. Everingham, A. Zisserman, C. K. Williams, L. Van Gool, M. Allan, C. M. Bishop, O. Chapelle, N. Dalal, T. Deselaers, G. Dorkó et al. , “The pascal visual object classes challenge 2007 (voc2007) results,” 2007
2007
Earlier work this paper cites.
D. Arthur and S. Vassilvitskii, “k-means++: The advantages of careful seeding,” in Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms . Society for Industrial and Applied Mathematics, 2007, pp. 1027–1035
2007
Earlier work this paper cites.