A graph model for mutual information based clustering

Journal of Intelligent Information Systems

Volumn 37, Issue 2, 2011, Pages 187-216

  Yoshida, Tetsuya ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

Clustering; Cut; Graph; Mutual information

Indexed keywords

CLUSTERING; CLUSTERING PROBLEMS; COMBINATORIAL PROBLEM; CONDITIONAL PROBABILITY DISTRIBUTIONS; CONSTRAINED OPTIMIZATION PROBLEMS; CUT; DATA OBJECTS; DATA SETS; EDGE-WEIGHTED GRAPH; GRAPH; GRAPH MODEL; GRAPH-BASED; MUTUAL INFORMATIONS; STATIONARY DISTRIBUTION; TEXT CLUSTERING;

CONSTRAINED OPTIMIZATION; GRAPH THEORY; PROBABILITY DISTRIBUTIONS;

PROBLEM SOLVING;

EID: 80053307397     PISSN: 09259902     EISSN: 15737675     Source Type: Journal    
DOI: 10.1007/s10844-010-0132-5     Document Type: Article

References (46)

1. Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan P. (1998). Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of 1998 ACM-SIGMOD (pp. 94-105). (Pubitemid 128655960)
2. Akaike, H. (1973). Information theory and an extention of the maximum likelihood principle. In B. N. Petrov, & F. E. Csaki (Eds.), 2nd international symposium on information theory (pp. 267-281).
3. Bekkerman, R., Sahami, M., & Learned-Miller, E. (2006). Combinatorial Markov random fields. In Proceedings of the 17th European conference on machine learning (ECML-06) (pp. 30-41). (Pubitemid 44618819)
4. M Belkin P Niyogi 2002 Laplacian eigenmaps for dimensionality reduction and data representation Neural Computation 15 1373 1396 10.1162/ 089976603321780317
5. Chung, F. (1997). Spectral graph theory. American Mathematical Society.
6. Cover, T., & Thomas, J. (2006). Elements of information theory. Wiley.
7. A Dempster N Laird D Rubin 1977 Maximum likelihood from incomplete data via the EM algorithm Journal of the Royal Statistical Society 39 2 1 38 501537 0364.62022
8. Dhillon, J., Mallela, S., & Modha, D. (2003). Information-theoretic co-clustering. In KDD 2003 (pp. 89-98).
9. J Dhillon D Modha 2001 Concept decompositions for large sparse text data using clustering Machine Learning 42 143 175 0970.68167 10.1023/A:1007612920971 (Pubitemid 32872402)
10. Diestel, R. (2006). Graph theory. Springer.
11. H Elghazel H Kheddouci V Deslandres A Dussauchoy 2008 A graph b-coloring framework for data clustering Journal of Mathematical Modelling and Algorithms 7 4 389 423 2470753 1191.68466 10.1007/s10852-008-9093-x
12. Elghazel, H., Yoshida, T., Deslandres, V., Hacid, M., & Dussauchoy, A. (2007). A new greedy algorithm for improving b-coloring clustering. In Proc. of the 6th workshop on graph-based representations (pp. 228-239).
13. Ester, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of KDD-96 (pp. 226-231).
14. Frey, B. J. (1998). Graphical models for machine learning and digital communication. MIT Press.
15. Ghosh, J. (2003). Scalable clustering (pp. 341-364). Lawrence Erlbaum Associates.
16. A Guénoche P Hansen B Jaumard 1991 Efficient algorithms for divisive hierarchical clustering with the diameter criterion Journal of Classification 8 5 30 1114217 0739.62050 10.1007/BF02616245
17. Guha, S., Rastogi, R., & Shim, K. (1998). Cure: An efficient clustering algorithm for large databases. In Proceedings of the ACM SIGMOD conference (pp. 73-84). (Pubitemid 128655958)
18. H Hacid T Yoshida 2010 Neighborhood graphs for indexing and retrieving multidimensional data Journal of Intelligent Information Systems 34 93-11 10.1007/s10844-009-0081-z
19. M Halkidi Y Batistakis M Vazirgiannis 2002 Clustering validity checking methods: Part II ACM SIGMOD Record 31 3 19 27 10.1145/601858.601862
20. P Hansen M Delattre 1978 Complete-link cluster analysis by graph coloring Journal of the American Statistical Association 73 397 403 10.2307/2286672
21. J Hartigan M Wong 1979 Algorithm AS136: A k-means clustering algorithm Journal of Applied Statistics 28 100 108 0447.62062 10.2307/2346830
22. E Hartuv R Shamir 2000 A clustering algorithm based on graph connectivity Information Processing Letters 76 175 181 1807676 0996.68525 10.1016/S0020-0190(00)00142-3 (Pubitemid 32035371)
23. W Irving DF Manlov 1999 The b-chromatic number of a graph Discrete Applied Mathematics 91 127 141 1670155 0933.05051 10.1016/S0166-218X(98)00146-2
24. A Jain M Murty T Flynn 1999 Data clustering: A review ACM Computing Surveys 31 264 323 10.1145/331499.331504
25. Li, T., Ma, S., & Ogihara, M. (2004). Entropy-based criterion in categorical clustering. In Proceedings of the 21st ICML (ICML-04) (pp. 536-543). (Pubitemid 40290850)
26. U Maulik S Bandyopadhyay 2002 Performance evaluation of some clustering algorithms and validity indices IEEE Transactions On Pattern Analysis and Machine Intelligence 24 12 1650 1654 10.1109/TPAMI.2002.1114856
27. Muhlenbach, F., & Lallich, S. (2009). A new clustering algorithm based on regions of influence with self-detection of the best number of clusters. In Proc. of 2009 IEEE international conference on data mining (ICDM'09) (pp. 884-889).
28. R Ng J Han 2002 Clarans: a method for clustering objects for spatial data mining IEEE Transactions on Knowledge and Data Engineering 14 5 1003 1016 10.1109/TKDE.2002.1033770 (Pubitemid 35242611)
29. Ogino, H., & Yoshida, T. (2010). Toward improving re-coloring based clustering with graph b-coloring. In Proceedings of PRICAI-2010 (pp. 206-218).
30. Pereira, F., Tishby, N., & Lee, L. (1993). Distributional clustering of English words. In Proc. of the 30th annual meeting of the Association for Computational Linguistics (pp. 183-190).
31. JR Quinlan 1986 Induction of decision trees Machine Learning 1 81 106
32. Quinlan, J. R. (1993). C4.5: Programs For machine learning. Morgan Kaufmann.
33. J Rissanen 1978 Modeling by shortest data description methods in instance-based learning and data mining Automatica 14 465 471 0418.93079 10.1016/0005-1098(78)90005-5 (Pubitemid 9397141)
34. Ristad, E. (1995). A natural law of succession. Technical Report CS-TR-495-95, Princeton University.
35. S Roweis L Saul 2000 Nonlinear dimensionality reduction by locally linear embedding Science 290 2323 2326 10.1126/science.290.5500.2323 (Pubitemid 32041578)
36. Slonim, N. (2002). The information bottleneck: Theory and applications. PhD thesis, Hebrew University.
37. Slonim, N., Friedman, N., & Tishby, N. (2002). Unsupervised document classification using sequential information maximization. In SIGIR-02 (pp. 129-136).
38. Slonim, N., & Tishby, N. (2000). Agglomerative information bottleneck. In Advances in neural information processing systems (NIPS) (Vol.12, pp. 617-623).
39. M Stoer F Wagner 1997 A simple min-cut algorithm Journal of ACM 44 4 585 591 1481316 0891.68071 10.1145/263867.263872 (Pubitemid 127617705)
40. A Strehl J Ghosh 2002 Cluster ensembles-A knowledge reuse framework for combining multiple partitions Journal of Machine Learning Research Journal of Machine Learning Research, 3 3 583 617 1991087
41. J Tenenbaum J de Silva J Langford 2000 A global geometric framework for nonlinear dimensionality reduction Science 290 22 2319 2323 10.1126/science.290. 5500.2319 (Pubitemid 32041577)
42. Tishby, N., Pereira, F., & Bialek, W. (1999). The information bottleneck method. In Proc. of the 37th allerton conference on communication and computation (pp. 368-377).
43. GT Toussaint 2005 Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining International Journal of Computational Geometry Applications 15 2 101 150 2137722 1067.68166 10.1142/S0218195905001622 (Pubitemid 40630512)
44. R Urquhart 1982 Graph theoretical clustering based on limited neighbourhood sets Pattern Recognition 15 3 173 187 2604956 0483.62050 10.1016/0031-3203(82)90069-3 (Pubitemid 12517467)
45. U von Luxburg 2007 A tutorial on spectral clustering Statistics and Computing 17 4 395 416 2409803 10.1007/s11222-007-9033-z
46. CT Zahn 1971 Graph-theoretical methods for detecting and describing gestalt clusters IEEE Transactions on Computers 20 68 86 0264.68040 10.1109/T-C.1971.223083