Soft memberships for spectral clustering, with application to permeable language distinction

Pattern Recognition

Volumn 42, Issue 1, 2009, Pages 43-53

  Nock, Richard ^a   Vaillant, Pascal ^b   Henry, Claudia ^a   Nielsen, Frank ^c  

^a UNIVERSITÉ DES ANTILLES ET DE LA GUYANE   (France)

^b Inst d'Enseignement Sup Guyane   (French Guiana)

^c ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Soft membership; Spectral clustering; Stochastic processes; Text classification

Indexed keywords

CHLORINE COMPOUNDS; CLASSIFICATION (OF INFORMATION); FLOW OF SOLIDS; LINGUISTICS; MARKOV PROCESSES; QUERY LANGUAGES; SOFTWARE AGENTS;

CHALLENGING PROBLEM; MARKOV CHAINS; NOVEL CONSTRUCTION; SOFT MEMBERSHIP; SPECTRAL CLUSTERING; STOCHASTIC PROCESSES; TEXT CLASSIFICATION; TEXT CLUSTERING; UNSUPERVISED CLASSIFICATION;

TEXT PROCESSING;

EID: 51849120013     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2008.06.024     Document Type: Article

References (17)

1. Bach F.R., and Jordan M.I. Learning spectral clustering. In: Thrun S., Saul L., and Schoelkopf B. (Eds). NIPS* 16 (2003), MIT Press, Cambridge, MA
2. M. Belkhin, J. Goldsmith, in: Proceedings of the ACL'02 Workshop on Morphological and Phonological Learning, 2002.
3. Belkhin M., and Niyogi P. Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Dietterich T.G., Becker S., and Ghahramani Z. (Eds). NIPS* 14 (2001), MIT Press, Cambridge, MA
4. C. Ding, A Tutorial on Spectral Clustering, in: Tutorials of the 21th ICML, 2004.
5. R. Jin, C. Ding, F. Kang, A probabilistic approach for optimizing spectral clustering, in: NIPS* 18. MIT Press, Cambridge, MA, 2005.
6. Meilǎ M., Shi J., Becker S., and Ghahramani Z. Learning segmentation by random walks. In: Dietterich T.G., Becker S., and Ghahramani Z. (Eds). NIPS* 14 (2001), MIT Press, Cambridge, MA
7. B. Mohar, Some applications of Laplace eigenvalues of graphs, in: G. Hann, G. Sabidussi (Eds.), Graph Symmetry: Algebraic Methods and Applications, NATO ASI Series, 1997, pp. 225-275.
8. Ng A.Y., Jordan M.I., and Weiss Y. On spectral clustering: analysis and an algorithm. In: Dietterich T.G., Becker S., and Ghahramani Z. (Eds). NIPS* 14 (2001), MIT Press, Cambridge, MA
9. H. Zha, X. He, C. Ding, M. Gu, H. Simon, Spectral relaxation for k-means clustering, in: NIPS* 14, 2001, pp. 1057-1064.
10. F.R.K. Chung, Spectral Graph Theory, vol. 92. Regional Conference Series in Mathematics, American Mathematical Society, Providence, RI, 1997.
11. Shi J., and Malik J. Normalized cuts and image segmentation. IEEE TPAMI 22 (2000) 888-905
12. Dempster A.P., Laird N.M., and Rubin D.B. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. B 39 (1977) 1-38
13. Kannan R., Vempala S., and Vetta A. On clusterings: good, bad and spectral. J. ACM 51 (2004) 497-515
14. Sinclair A., and Jerrum M. Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82 (1989) 93-133
15. F. Peng, D. Schuurmans, Combining naive bayes and n-gram language models for text classification, in: Proceedings of the 25th ECIR, 2003.
16. Friedman J., Hastie T., and Tibshirani R. Additive logistic regression: a statistical view of boosting. Annals of Statistics 28 (2000) 337-374
17. McDiarmid C. Concentration. In: Habib M., McDiarmid C., Ramirez-Alfonsin J., and Reed B. (Eds). Probabilistic Methods for Algorithmic Discrete Mathematics (1998), Springer, Berlin 1-54