Sequential minimal optimization in adaptive-bandwidth convex clustering

Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

Volumn , Issue , 2011, Pages 896-907

  Takahashi, Rikiya ^a  

^a IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; CLUSTER COMPUTING; CONVEX OPTIMIZATION; DATA MINING; IMAGE SEGMENTATION; MAXIMUM PRINCIPLE; MIXTURES; NEWTON-RAPHSON METHOD; SPACE DIVISION MULTIPLE ACCESS;

ADAPTIVE BANDWIDTH; CLUSTER ASSIGNMENT; EXPECTATION-MAXIMIZATION ALGORITHMS; FAST CONVERGENCE; NUMBER OF ITERATIONS; OPTIMIZATION ALGORITHMS; PREDICTIVE CAPABILITIES; SEQUENTIAL MINIMAL OPTIMIZATION;

CLUSTERING ALGORITHMS;

EID: 84868282055     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972818.77     Document Type: Conference Paper

References (31)

1. I. S. Abramson. On bandwidth variation in kernel estimatesa square root law. Annals of Statistics, 10(4):1217-1223, 1982.
2. M. R. Anderberg. Cluster analysis for applications. Academic Press, New York, 1973.
3. C. Antoniak. Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems. Annals of Statistics, 2:1152-1174, 1974.
4. D. M. Blei and M. I. Jordan. Variational inference for Dirichlet process mixtures. Bayesian Analysis, 1(1):121-144, 2006.
5. M. Á. Carreira-Perpiñán. Gaussian mean shift is an EM algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(5):767-776, 2007.
6. I. Csiszár and P. C. Shields. Information theory and statistics: A tutorial. Foundations and Trends in Communications and Information Theory, 1(4):417-528, 2004.
7. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SCG '04: Proceedings of the twentieth annual symposium on Computational geometry, pages 253-262, New York, NY, USA, 2004. ACM.
8. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39(1):1-38, 1977.
9. I. S. Dhillon, Y. Guan, and B. Kulis. Kernel k-means, spectral clustering and normalized cuts. In 10th ACM KDD Conference, pages 551-556, 2004.
10. T. S. Ferguson. Bayesian density estimation by mixtures of normal distributions. In Recent Advances in Statistics, pages 287-302, 1983.
11. E. W. Forgy. Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics, 21:768-769, 1965.
12. O. Grygorash, Y. Zhou, and Z. Jorgensen. Minimum spanning tree based clustering algorithms. In Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '06), pages 73-81, Washington, DC, USA, 2006. IEEE Computer Society.
13. H. Ishwaran and L. F. James. Gibbs sampling methods for stick-breaking priors. Journal of the American Statistical Association, 96:161-173, 2001.
14. K. Kurihara, M. Welling, and Y. W. Teh. Collapsed variational Dirichlet process mixture models. In Proceedings of the International Joint Conference on Artificial Intelligence, volume 20, 2007.
15. D. Lashkari and P. Golland. Convex clustering with exemplar-based models. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, pages 825-832. MIT Press, Cambridge, MA, 2008.
16. J. B. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 281-297, 1967.
17. O. Papaspiliopoulos and G. O. Roberts. Retrospective MCMC for Dirichlet process hierarchical models. Biometrika, 95:169-186, 2008.
18. J. C. Platt. Fast training of support vector machines using sequential minimal optimization. In Advances in kernel methods: support vector learning, pages 185-208. MIT Press, Cambridge, MA, USA, 1999.
19. R. A. Redner and H. F. Walker. Mixture densities, maximum likelihood, and the EM algorithm. SIAM Review, 26:195-239, 1984.
20. K. Rose. Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. In Proceedings of the IEEE, volume 86, pages 2210-2239, 1998.
21. S. Sain and D. Scott. On locally adaptive density estimation. Journal of the American Statistical Association, 91:1525-1534, 1996.
22. I. H. Salgado-Ugarte and M. A. Pérez-Hernández. Exploring the use of variable bandwidth kernel density estimators. Stata Journal, 3(2):133-147, 2003.
23. B.W. Silverman. Density Estimation for Statistics and Data Analysis. Chapman and Hall, London, United Kingdom, 1986.
24. D. Tarlow, R. Zemel, and B. Frey. Flexible priors for exemplar-based clustering. In The 24th Conference on Uncertainty in Artificial Intelligence (UAI-2008), 2008.
25. N. Ueda and R. Nakano. Deterministic annealing EM algorithm. Neural Networks, 11(2):271-282, 1998.
26. V. N. Vapnik. The Nature of Statistical Learning Theory. Springer, 1995.
27. S. Walker. Sampling the Dirichlet mixture model with slices. Communications in Statistics. Simulation and Computation, 36:45-54, 2007.
28. L. Xu and M. I. Jordan. On convergence properties of the EM algorithm for Gaussian mixtures. Neural Computation, 8:129-151, 1995.
29. C. Yang, R. Duraiswami, N. A. Gumerov, and L. Davis. Improved fast gauss transform and efficient kernel density estimation. In Proceedings of the Ninth IEEE International Conference on Computer Vision (ICCV'03), volume 1, pages 664-671, 2003.
30. C. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, C-20(1):68-86, 1971.
31. L. Zelnik-Manor and P. Perona. Self-tuning spectral clustering. In L. K. Saul, Y. Weiss, and L. Bottou, editors, Advances in Neural Information Processing Systems 17, pages 1601-1608. MIT Press, Cambridge, MA, 2005.