{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:12:11Z","timestamp":1761487931387,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45681-3_10","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"112-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Unsupervised Learning: Self-aggregation in Scaled Principal Component Space*"],"prefix":"10.1007","author":[{"given":"Chris","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyuan","family":"Zha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1038\/35000501","volume":"403","author":"A. A. Alizadeh","year":"2000","unstructured":"A. A. Alizadeh, M. B. Eisen, et al. Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. Nature, 403:503\u2013511, 2000.","journal-title":"Nature"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"C. Ding, X. He, and H. Zha. A spectral method to separate disconnected and nearly-disconnected web graph components. In Proc. ACM Int\u2019l Conf Knowledge Disc. Data Mining (KDD 2001), pages 275\u2013280.","DOI":"10.1145\/502512.502551"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"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\u2019l Conf. Data Mining, pages 107\u2013114, 2001.","DOI":"10.1109\/ICDM.2001.989507"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W. E. Donath","year":"1973","unstructured":"W. E. Donath and A. J. Hoffman. Lower bounds for partitioning of graphs. IBM J. Res. Develop., 17:420\u2013425, 1973.","journal-title":"IBM J. Res. Develop."},{"key":"10_CR5","unstructured":"R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification, 2nd ed. Wiley, 2000."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M. Fiedler","year":"1973","unstructured":"M. Fiedler. Algebraic connectivity of graphs. Czech. Math. J., 23:298\u2013305, 1973.","journal-title":"Czech. Math. J."},{"key":"10_CR7","unstructured":"M. J. Greenacre. Theory and Applications of Correspondence Analysis. Academic press, 1984."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L. Hagen","year":"1992","unstructured":"L. Hagen and A. B. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE. Trans. on Computed Aided Desgin, 11:1074\u20131085, 1992.","journal-title":"IEEE. Trans. on Computed Aided Desgin"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"502","DOI":"10.2307\/2289936","volume":"84","author":"T. Hastie","year":"1989","unstructured":"T. Hastie and W. Stuetzle. Principal curves. J. Amer. Stat. Assoc, 84:502\u2013516, 1989.","journal-title":"J. Amer. Stat. Assoc"},{"key":"10_CR10","unstructured":"S. S. Haykin. Neural Networks: A Comprehensive Foundation. Prentice Hall, 1998, 2nd ed."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"J. Himberg. A som based cluster visualization and its application for false coloring. Proc Int\u2019l Joint Conf. Neural Networks, pages 587\u2013592, 2000.","DOI":"10.1109\/IJCNN.2000.861379"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"J. J. Hopfield","year":"1982","unstructured":"J. J. Hopfield. Neural networks and physical systems with emergent collective computation abilities. Proc. Nat\u2019l Acad Sci USA, 79:2554\u20132558, 1982.","journal-title":"Proc. Nat\u2019l Acad Sci USA"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A. K. Jain","year":"1999","unstructured":"A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31:264\u2013323, 1999.","journal-title":"ACM Computing Surveys"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"I. T. Jolliffe. Principal Component Analysis. Springer Verlag, 1986.","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"T. Kohonen. Self-organization and Associative Memory. Springer-Verlag, 1989.","DOI":"10.1007\/978-3-642-88163-3"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/aic.690370209","volume":"37","author":"M. A. Kramer","year":"1991","unstructured":"M. A. Kramer. Nonlinear principal component analysis using autoassociative neural networks. AIChE Journal, 37:233\u2013243, 1991.","journal-title":"AIChE Journal"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D. D. Lee","year":"1999","unstructured":"D. D. Lee and H. S. Seung. Learning the parts of objects with nonnegative matrix factorization. Nature, 401:788\u2013791, 1999.","journal-title":"Nature"},{"key":"10_CR18","unstructured":"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."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H. D. Simon, and K. P. Liou. Partitioning sparse matrices with egenvectors of graph. SIAM Journal of Matrix Anal. Appl., 11:430\u2013452, 1990.","journal-title":"SIAM Journal of Matrix Anal. Appl."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"S. T. Roweis","year":"2000","unstructured":"S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290:2323\u20132326, 2000.","journal-title":"Science"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B. Scholkopf","year":"1998","unstructured":"B. Scholkopf, A. Smola, and K. Muller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:1299\u20131319, 1998.","journal-title":"Neural Computation"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE. Trans. on Pattern Analysis and Machine Intelligence, 22:888\u2013905, 2000.","journal-title":"IEEE. Trans. on Pattern Analysis and Machine Intelligence"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"J. B. Tenenbaum","year":"2000","unstructured":"J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319\u20132323, 2000.","journal-title":"Science"},{"key":"10_CR24","unstructured":"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."}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:35:18Z","timestamp":1749573318000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}