{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:00:14Z","timestamp":1743094814615,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662452363"},{"type":"electronic","value":"9783662452370"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45237-0_6","type":"book-chapter","created":{"date-parts":[[2014,10,25]],"date-time":"2014-10-25T10:37:20Z","timestamp":1414233440000},"page":"43-54","source":"Crossref","is-referenced-by-count":1,"title":["Spectral Clustering Based on Analysis of Eigenvector Properties"],"prefix":"10.1007","author":[{"given":"Ma\u0142gorzata","family":"Luci\u0144ska","sequence":"first","affiliation":[]},{"given":"S\u0142awomir T.","family":"Wierzcho\u0144","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"I. Dhillon","year":"2007","unstructured":"Dhillon, I., Guan, Y., Kulis, B.: Weighted graph cuts without eigenvectors: a multilevel approach. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a029(11), 1944\u20131957 (2007)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/BF01591018","volume":"25","author":"M. Fiedler","year":"1975","unstructured":"Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal\u00a025, 619\u2013633 (1975)","journal-title":"Czechoslovak Mathematical Journal"},{"issue":"37","key":"6_CR3","doi-asserted-by":"publisher","first-page":"14761","DOI":"10.1073\/pnas.1120432109","volume":"109","author":"M. Filoche","year":"2012","unstructured":"Filoche, M., Mayboroda, S.: Universal mechanism for Anderson and weak localization. Proc. of the National Academy of Sciences\u00a0109(37), 14761\u201314766 (2012)","journal-title":"Proc. of the National Academy of Sciences"},{"key":"6_CR4","first-page":"7","volume":"3","author":"J. Fridlyand","year":"2002","unstructured":"Fridlyand, J., Dudoit, S.: A prediction-based resampling method to estimate the number of clusters in a dataset. Genome Biology\u00a03, 7 (2002)","journal-title":"Genome Biology"},{"key":"6_CR5","unstructured":"Fischer, I., Poland, J.: Amplifying the Block Matrix Structure for Spectral Clustering. Technical Report No. IDSIA-03-05, Telecommunications Lab, pp. 21\u201328 (2005)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L. Hagen","year":"1992","unstructured":"Hagen, L., Kahng, A.: New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on Computer-Aided Design\u00a011, 1074\u20131088 (1992)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11590316_1","volume-title":"Pattern Recognition and Machine Intelligence","author":"A. Jain","year":"2005","unstructured":"Jain, A., Law, M.: Data clustering: A user\u2019s dilemma. In: Pal, S.K., Bandyopadhyay, S., Biswas, S. (eds.) PReMI 2005. LNCS, vol.\u00a03776, pp. 1\u201310. Springer, Heidelberg (2005)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings: good, bad and spectral. In: 41st Symposium on Foundations of Computer Science, FOCS (2000)","DOI":"10.1109\/SFCS.2000.892125"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/978-3-319-07176-3_65","volume-title":"Artificial Intelligence and Soft Computing","author":"M. Luci\u0144ska","year":"2014","unstructured":"Luci\u0144ska, M.: A spectral clustering algorithm based on eigenvector localization. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2014, Part II. LNCS, vol.\u00a08468, pp. 749\u2013759. Springer, Heidelberg (2014)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Manning, C.D., Raghavan, P., Scht\u00e4uze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511809071"},{"key":"6_CR11","unstructured":"Meila, M., Shi, J.: A random walks view of spectral segmentation. In: Proc. of 10th International Workshop on Artificial Intelligence and Statistics (2001)"},{"key":"6_CR12","first-page":"849","volume-title":"Advances in Neural Information Processing Systems","author":"A. Ng","year":"2002","unstructured":"Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Dietterich, T.G., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processing Systems, vol.\u00a014, pp. 849\u2013856. MIT Press, Cambridge (2002)"},{"key":"6_CR13","unstructured":"Pentney, W., Meila, M.: Spectral clustering of biological sequence data. In: AAAI 2005, pp. 845\u2013850 (2005)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.patcog.2011.04.032","volume":"45","author":"F. Shang","year":"2012","unstructured":"Shang, F., Jiao, L.C., Shi, J., Wang, F., Gong, M.: Fast affinity propagation clustering: A multilevel approach. Pattern Recognition\u00a045, 474\u2013486 (2012)","journal-title":"Pattern Recognition"},{"key":"6_CR15","unstructured":"http:\/\/mlearn.ics.uci.edu\/MLRepository.html"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U. Luxburg von","year":"2007","unstructured":"von Luxburg, U.: A Tutorial on spectral clustering. Statistics and Computing\u00a017(4), 395\u2013416 (2007)","journal-title":"Statistics and Computing"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Yan, D., Huang, L., Jordan, M.: Fast approximate spectral clustering. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 907\u2013916 (2009)","DOI":"10.1145\/1557019.1557118"},{"key":"6_CR18","unstructured":"Zelnik-Manor, L., Perona, P.: Self-tuning spectral clustering. In: Proceedings of the Advances in Neural Information Processing Systems, vol.\u00a017, pp. 1601\u20131608 (2005)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1162\/neco.2009.11-07-651","volume":"21","author":"K. Zhang","year":"2009","unstructured":"Zhang, K., Kwok, J.T.: Density-weighted Nystr\u00f6m method for computing large kernel eigen-systems. Neural Computation\u00a021, 121\u2013146 (2009)","journal-title":"Neural Computation"}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45237-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T15:36:25Z","timestamp":1547825785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45237-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662452363","9783662452370"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45237-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}