Data clustering: Principal components, Hopfield and self-aggregation networks

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 479-484

  Ding, Chris H Q ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COHERENT FRAMEWORKS; CONNECTION WEIGHTS; DATA CLUSTERING; HOPFIELD NETWORKS; OBJECTIVE FUNCTIONS; PRINCIPAL COMPONENTS; SELF AGGREGATION;

ARTIFICIAL INTELLIGENCE;

CLUSTERING ALGORITHMS;

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

References (24)

1. A.A. Alizadeh, M.B. Eisen, et al. Distinct types of dimise large B-cell lymphoma identified by gene expression profiling. Nature, 403:503-511,2000. (Pubitemid 30082188)
2. I. Borg and P. Gronen. Modern multidimensional scaling: theory and applications. Springer Verlag, 1997.
3. M. Collins, S. Dasgupta, and R. Schapire. A generalization of principal component analysis to the exponential family. Neural Info. Processing Systems (NIPS 2001),2001.
4. S. Deerwester, S.T. Dumais, T.K. Landauer, G.W. Furnas, and R.A. Harshman. Indexing by latent semantic analysis. J. Amer. Soc. Info. Sci, 41:391-407,1990.
5. C. Ding, X. He, and H. Zha. A spectral method to separate disconnected and nearly-disconnected web graph components. In Proc. ACM Int'l Conf Knowledge Disc. Data Mining (KDD), pages 275-280,2001.
6. C. Ding, X. He, H. Zha, M. Gu, and H. Simon. A min-max cut algorithm for graph partitioning and data clustering. Proc. IEEE Int'l Conf Data Mining, pages 107-114,2001.
7. C. Ding, X. He, H. Zha, and H. Simon. Unsupervised learning: self-aggregation in scaled principal component space. Proc. 6th European Conf Principles of Data Mining and Knowledge Discovery (PDKK 2002), pages 112-124,2002.
8. C. Ding. Document retrieval and clustering: from principal component analysis to self-aggregation networks. Int'l Workshop onAl and Statistics, pages 78-85,2003.
9. M. Fiedler. Algebraic connectivity of graphs. Czech. Math. J., 23:298-305,1973.
10. M. J. Greenacre. Theory and Applications of Correspondence Analysis. Academic press, 1984.
11. L. Hagen and A.B. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE. Trans, on Computed Aided Desgin, 11:1074-1085,1992.
12. T Hastie and W. Stuetzle. Principal curves. J. Amer. Stat. Assoc, 84:502-516,1989.
13. S.S. Haykin. Neural Networks: A Comprehensive Foundation. Prentice Hall, 1998,2nd ed.
14. J.J. Hopfield. Neural networks and physical systems with emergent collective computation abilities. Proc. Nat'l AcadSci USA, 79:2554-2558,1982.
15. T. Kohonen. Self-organization and Associative Memory. Springer-Verlag, 1989.
16. M. A. Kramer. Nonlinear principal component analysis using autoassociativc neural networks. AIChE Journal, 37:233-243,1991.
17. D. D. Lee and H. S. Seung. Learning the parts of objects with nonnegative matrix factorization. Nature, 401:788-791,1999.
18. J. Mathews and R.L. Walker. Mathematical Methods of Physics. Addison-Wcsley, 1971.
19. M. Meila and J. Shi. A random walks view of spectral segmentation. Al-statistics Workshop, 2001.
20. A.Y. Ng, M.I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. Proc. Neural Info. Processing Systems (NIPS 2001), 2001.
21. A. Pothen, H. D. Simon, and K. P. Liou. Partitioning sparse matrices with egenvectors of graph. SIAM Journal of Matrix Anal. Appl, 11:430-452, 1990.
22. B. Scholkopf, A. Smola, and K. Muller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:1299-1319,1998. (Pubitemid 128463674)
23. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE. Trans, on Pattern Analysis and Machine Intelligence, 22:888-905,2000.
24. H. Zha, X. He, C. Ding, M. Gu, and H.D. Simon. Bipartite graph partitioning and data clustering. Proc. 10th Int'l Conf Information and Knowledge Management (CIKM 2001), pages 25-31,2001