Unsupervised learning: Self-aggregation in scaled principal component space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2431 LNAI, Issue , 2002, Pages 112-124

  Ding, Chris ^a   He, Xiaofeng ^a   Zha, Hongyuan ^b   Simon, Horst ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b The Center for Nanotechnology Education and Utilization   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA MINING; MACHINE LEARNING; MATRIX ALGEBRA;

DATA CLUSTERING; DIMENSIONALITY REDUCTION; DYNAMIC PROCESS; FORM CLUSTERS; INHERENT PATTERNS; NON-LINEAR SCALING; PRINCIPAL COMPONENT SPACE; SELF AGGREGATION;

PRINCIPAL COMPONENT ANALYSIS;

EID: 33749544332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45681-3_10     Document Type: Conference Paper

References (24)

1. A. A. Alizadeh, M. B. Eisen, et al. Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. Nature, 403:503-511, 2000. 116, 118
2. 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 2001), pages 275-280. 113
3. C. Ding, X. He, H. Zha, M. Gu, and H. Simon. A min-max cut algorithm for graph partitioning and data clustering. Proc. 1st IEEE Int'l Conf. Data Mining, pages 107-114, 2001. 122
4. W. E. Donath and A. J. Hoffman. Lower bounds for partitioning of graphs. IBM J. Res. Develop., 17:420-425, 1973. 122
5. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification, 2nd ed. Wiley, 2000. 112
6. M. Fiedler. Algebraic connectivity of graphs. Czech. Math. J., 23:298-305, 1973. 122
7. M. J. Greenacre. Theory and Applications of Correspondence Analysis. Academic press, 1984. 120
8. 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. 122
9. T. Hastie and W. Stuetzle. Principal curves. J. Amer. Stat. Assoc, 84:502-516, 1989. 112
10. S. S. Haykin. Neural Networks: A Comprehensive Foundation. Prentice Hall, 1998, 2nd ed. 113, 122
11. J. Himberg. A som based cluster visualization and its application for false coloring. Proc Int'l Joint Conf. Neural Networks, pages 587-592, 2000. 122
12. J. J. Hopfield. Neural networks and physical systems with emergent collective computation abilities. Proc. Nat'l Acad Sci USA, 79:2554-2558, 1982. 113, 122
13. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31:264-323, 1999. 112
14. I. T. Jolliffe. Principal Component Analysis. Springer Verlag, 1986. 112
15. T. Kohonen. Self-organization and Associative Memory. Springer-Verlag, 1989. 122
16. M. A. Kramer. Nonlinear principal component analysis using autoassociative neural networks. AIChE Journal, 37:233-243, 1991. 112
17. D. D. Lee and H. S. Seung. Learning the parts of objects with nonnegative matrix factorization. Nature, 401:788-791, 1999. 112
18. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. Proc. Neural Info. Processing Systems (NIPS 2001), Dec. 2001. 122
19. 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. 122
20. S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290:2323-2326, 2000. 112
21. B. Scholkopf, A. Smola, and K. Muller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:1299-1319, 1998. 112
22. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE. Trans. on Pattern Analysis and Machine Intelligence, 22:888-905, 2000. 122
23. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000. 112
24. H. Zha, C. Ding, M. Gu, X. He, and H. D. Simon. Spectral relaxation for k-means clustering. Proc. Neural Info. Processing Systems (NIPS 2001), Dec. 2001. 121