Clusterpath: An algorithm for clustering using convex fusion penalties

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 745-752

  Hocking, Toby Dylan ^a   Joulin, Armand ^a   Bach, Francis ^a   Vert, Jean Philippe ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b INSERM U900   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX RELAXATION; EFFICIENT ALGORITHM; GEOMETRIC INTERPRETATION; HIER-ARCHICAL CLUSTERING; OBJECTIVE FUNCTIONS; SPECTRAL CLUSTERING; TREE STRUCTURES;

LEARNING SYSTEMS; RELAXATION PROCESSES; TREES (MATHEMATICS);

CLUSTERING ALGORITHMS;

EID: 80053439464     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Bach, F. and Harchoui, Zaïd. DIFFRAC: a discriminative and flexible framework for clustering. In Adv. NIPS, 2008.
2. Boyd, S. and vandenberghe, L. Convex Optimization. Cambridge U. P., 2003.
3. Chen, X., Kim, S., Lin, Q., Carbonell, J. G., and Xing, E. P. Graph-structured multi-task regression and an efficient optimization method for general fused lasso, 2010. arXiv: 1005.3579.
4. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. Introduction to Algorithms, chapter 26. MIT Press, 2001.
5. Efron, B., Hastie, T., Johnstone, I., and Tibshirani, R. Least angle regression. Annals of statistics, 32(2):40-99, 2004.
6. Frank, M. and Wolfe, P. An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3: 95110, 1956.
7. Friedman, J., Hastie, T., Hoefling, H., and Tibshirani, R. Pathwise coordinate optimization. The Annals of Applied Statistics, 1(2):30-32, 2007.
8. Fujishige, S., Hayashi, T., and Isotani, S. The minimum-norm-point algorithm applied to submodular function minimization and linear programming, 2006. RIMS preprint No 1571. Kyoto University.
9. Hoefling, H. A path algorithm for the fused lasso signal approximator. arXiv:0910.0526, 2009.
10. Hubert, L. and Arabie, P. Comparing partitions. J. Classification, 2:193-218, 1985.
11. Krause, A. and Guestrin, C. Beyond convexity: Submodularity in machine learning. In IJCAI, 2009.
12. Lindsten, Fredrik, Ohlsson, Henrik, and Ljung, Lennart. Clustering using sum-of-norms regularization; with application to particle filter output computation. Technical Report LiTH-ISY-R-2993, Department of Electrical Engineering, Linkping University, February 2011.
13. Mattingley, J. and Boyd, S. CVXMOD: Convex optimization software in Python (web page and software), July 2008. URL http://cvxmod.net/.
14. Ng, A. Y., Jordan, M. I., and Weiss, Y. On spectral clustering: Analysis and an algorithm. In Adv. NIPS, 2001.
15. Rosset, S. and Zhu, J. Piecewise linear regularized solution paths. Annals of Statistics, 35(3):1012-1030, 2007.
16. Shen, X. and Huang, H.-C. Grouping pursuit through a regularization solution surface. Journal of the American Statistical Association, 105(490):727-739, 2010.
17. Tibshirani, R. Regression Shrinkage and Selection Via the Lasso. J. R. Statist. Soc. B., 58(1):267-288, 1996.
18. Tibshirani, R. and Saunders, M. Sparsity and smoothness via the fused lasso. J. R. Statist. Soc. B., 67:9-08, 2005.
19. Tibshirani, R., Walther, G., and Hastie, T. Estimating the number of clusters in a data set via the gap statistic. J. R. Statist. Soc. B, 63:41-23, 2001.
20. Vert, J.-P. and Bleakley, K. Fast detection of multiple change-points shared by many signals using group LARS. In Adv. NIPS, 2010.
21. Xu, L., Neufeld, J., Larson, B., and Schuurmans, D. Maximum margin clustering. In Adv. NIPS, 2004.
22. Yuan, M. and Lin, Y. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, 68(B):4-7, 2006.
23. Zhao, P., Rocha, G., and Yu, B. The composite absolute penalties family for grouped and hierarchical variable selection. Ann. Stat., 37(6A):3468-3497, 2009.