Constrained 1-spectral clustering

Journal of Machine Learning Research

Volumn 22, Issue , 2012, Pages 1143-1151

  Rangapuram, Syama Sundar ^a   Hein, Matthias ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLUSTERING ALGORITHMS; ECONOMIC AND SOCIAL EFFECTS; OPTIMIZATION;

CONSTRAINED SPECTRAL CLUSTERING; CONTINUOUS OPTIMIZATION PROBLEMS; EFFICIENT IMPLEMENTATION; LARGE DATASETS; NORMALIZED CUTS; PRIOR INFORMATION; SPECTRAL CLUSTERING; UNCONSTRAINED PROBLEMS;

CONSTRAINED OPTIMIZATION;

EID: 84904657104     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (19)

1. Basu, S., Davidson, I., & Wagstaff, K. (2008). Constrained clustering: Advances in algorithms, theory, and applications. Chapman & Hall.
2. Beck, A., & Teboulle, M. (2009). Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Transactions on Image Processing, 18, 2419-2434.
3. Bühler, T., & Hein, M. (2009). Spectral clustering based on the graph p-Laplacian. Proc. 26th Int. Conf. on Machine Learning (ICML) (pp. 81-88). Omnipress.
4. Coleman, T., Saunderson, J., & Wirth, A. (2008). Spectral clustering with inconsistent advice. Proceedings of the 25th international conference on Machine learning (pp. 152-159). New York, NY, USA: ACM.
5. Eriksson, A., Olsson, C., & Kahl, F. (2007). Normalized cuts revisited: A reformulation for segmentation with linear grouping constraints. IEEE 11th International Conference on Computer Vision (ICCV) (pp. 1-8).
6. Guattery, S., & Miller, G. L. (1998). On the quality of spectral separators. SIAM Journal on Matrix Analysis and Applications, 19, 701-719.
7. Hagen, L. W., & Kahng, A. B. (1991). Fast spectral methods for ratio cut partitioning and clustering. Proc. Internat. Conf. on Computer Aided Design (pp. 10-13).
8. Hein, M., & Bühler, T. (2010). An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse PCA. Advances in Neural Information Processing Systems 23 (NIPS) (pp. 847-855).
9. Hein, M., & Setzer, S. (2011). Beyond spectral clustering-tight relaxations of balanced graph cuts. In J. Shawe-Taylor, R. Zemel, P. Bartlett, F. Pereira and K. Weinberger (Eds.), Advances in neural information processing systems 24, 2366-2374.
10. Hiriart-Urruty, J.-B., & Lemaréchal, C. (2001). Fundamentals of convex analysis. Berlin: Springer.
11. Kamvar, S., Klein, D., & Manning, C. (2003). Spectral learning. Proc. of the 18th International Joint Conference On Artificial Intelligence (IJCAI) (pp. 561-566). Morgan Kaufmann.
12. Li, Z., Liu, J., & Tang, X. (2009). Constrained clustering via spectral regularization. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (pp. 421-428).
13. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22, 888-905.
14. Szlam, A., & Bresson, X. (2010). Total variation and Cheeger cuts. Proc. of the 27th International Conference on Machine Learning (ICML) (pp. 1039-1046). Omnipress.
15. Von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17, 395-416.
16. Wagstaff, K., Cardie, C., Rogers, S., & Schrödl, S. (2001). Constrained k-means clustering with background knowledge. Proc. of the 18th International Conference on Machine Learning (ICML) (pp. 577-584).
17. Wang, X., & Davidson, I. (2010). Flexible Constrained Spectral Clustering. Proc. of the 16th ACM SIGKDD International conference on Knowledge Discovery and Data mining (KDD) (pp. 563-572). ACM Press.
18. Xu, L., Li, W., & Schuurmans, D. (2009). Fast normalized cut with linear constraints. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (pp. 421-428).
19. Yu, S. X., & Shi, J. (2004). Segmentation given partial grouping constraints. IEEE Trans. on Pattern Analysis and Machine Intelligence, 26, 173-183.