{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:16:55Z","timestamp":1771474615449,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540717003","type":"print"},{"value":"9783540717010","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71701-0_117","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T11:31:38Z","timestamp":1182339098000},"page":"1037-1045","source":"Crossref","is-referenced-by-count":45,"title":["Graph Nodes Clustering Based on the Commute-Time Kernel"],"prefix":"10.1007","author":[{"given":"Luh","family":"Yen","sequence":"first","affiliation":[]},{"given":"Francois","family":"Fouss","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Decaestecker","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Francq","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Saerens","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"117_CR1","volume-title":"Survey of Text Mining","author":"M.W. Berry","year":"2003","unstructured":"Berry, M.W.: Survey of Text Mining. Springer, New York (2003)"},{"key":"117_CR2","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1145\/1014052.1014118","volume-title":"Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining","author":"I.S. Dhillon","year":"2004","unstructured":"Dhillon, I.S., Guan, Y., Kulis, B.: Kernel k-means, spectral clustering and normalized cuts. In: Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 551\u2013556. ACM Press, New York (2004)"},{"issue":"1","key":"117_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1007612920971","volume":"42","author":"I.S. Dhillon","year":"2001","unstructured":"Dhillon, I.S., Modha, D.S.: Concept decompositions for large sparse text data using clustering. Machine Learning\u00a042(1), 143\u2013175 (2001), \n                    \n                      citeseer.ist.psu.edu\/article\/dhillon01concept.html","journal-title":"Machine Learning"},{"key":"117_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1015330.1015407","volume-title":"ICML \u201904: Proceedings of the twenty-first international conference on Machine learning","author":"C. Ding","year":"2004","unstructured":"Ding, C., He, X.: Linearized cluster assignment via spectral ordering. In: ICML \u201904: Proceedings of the twenty-first international conference on Machine learning, Banff, Alberta, Canada, p. 30. ACM Press, New York (2004)"},{"issue":"1-3","key":"117_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P. Drineas","year":"2004","unstructured":"Drineas, P., et al.: Clustering large graphs via the singular value decomposition. Machine Learning\u00a056(1-3), 9\u201333 (2004)","journal-title":"Machine Learning"},{"key":"117_CR6","volume-title":"Cluster Analysis","author":"B.S. Everitt","year":"2001","unstructured":"Everitt, B.S., Landau, S., Leese, M.: Cluster Analysis. Arnold Publishers, New Delhi (2001)"},{"issue":"4","key":"117_CR7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1080\/15427951.2004.10129093","volume":"1","author":"G.W. Flake","year":"2003","unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Math.\u00a01(4), 385\u2013408 (2003)","journal-title":"Internet Math."},{"issue":"3","key":"117_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F. Fouss","year":"2007","unstructured":"Fouss, F., et al.: Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering\u00a019(3), 355\u2013369 (2007)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"117_CR9","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1109\/TNN.2002.1000150","volume":"13","author":"M. Girolami","year":"2002","unstructured":"Girolami, M.: Mercer kernel-based clustering in feature space. IEEE Transactions on Neural Networks\u00a013(3), 780\u2013784 (2002)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"4","key":"117_CR10","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.patcog.2004.09.006","volume":"38","author":"D.-W. Kim","year":"2005","unstructured":"Kim, D.-W., et al.: Evaluation of the performance of clustering algorithms in kernel-induced feature space. Pattern Recognition\u00a038(4), 607\u2013611 (2005)","journal-title":"Pattern Recognition"},{"key":"117_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J.: Detecting community structure in networks. The European Physical Journal B\u00a038, 321\u2013330 (2004)","journal-title":"The European Physical Journal B"},{"key":"117_CR12","first-page":"849","volume-title":"Advances in Neural Information Processiong Systems, vol. 14","author":"A.Y. Ng","year":"2001","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Dietterich, T., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processiong Systems, vol. 14, Vancouver, Canada, pp. 849\u2013856. MIT Press, Cambridge (2001)"},{"issue":"3","key":"117_CR13","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"M.F. Porter","year":"1980","unstructured":"Porter, M.F.: An algorithm for suffix stripping. Program\u00a014(3), 130\u2013137 (1980)","journal-title":"Program"},{"key":"117_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-540-30115-8_35","volume-title":"Machine Learning: ECML 2004","author":"M. Saerens","year":"2004","unstructured":"Saerens, M., et al.: The principal components analysis of a graph, and its relationships to spectral clustering. In: Boulicaut, J.-F., et al. (eds.) ECML 2004. LNCS (LNAI), vol.\u00a03201, pp. 371\u2013383. Springer, Heidelberg (2004)"},{"key":"117_CR15","volume-title":"Learning with kernels","author":"B. Scholkopf","year":"2002","unstructured":"Scholkopf, B., Smola, A.: Learning with kernels. MIT Press, Cambridge (2002)"},{"key":"117_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J. Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)"},{"key":"117_CR17","unstructured":"van Dongen, S.: Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht (2000)"},{"key":"117_CR18","volume-title":"Text Mining: Predictive Methods for Analyzing Unstructured Information","author":"S. Weiss","year":"2004","unstructured":"Weiss, S., et al.: Text Mining: Predictive Methods for Analyzing Unstructured Information. Springer, Heidelberg (2004)"},{"key":"117_CR19","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A spectral clustering approach to finding communities in graph. In: SDM (2005)","DOI":"10.1137\/1.9781611972757.25"},{"key":"117_CR20","first-page":"49","volume-title":"ICCIMA \u201903: Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications","author":"Z.-D. Wu","year":"2003","unstructured":"Wu, Z.-D., Xie, W.-X., Yu, J.-P.: Fuzzy c-means clustering algorithm based on kernel method. In: ICCIMA \u201903: Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications, Washington, DC, USA, p. 49. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"117_CR21","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/502585.502591","volume-title":"Proc. of ACM 10th Int\u2019l Conf. Information and Knowledge Management (CIKM 2001)","author":"H. Zha","year":"2001","unstructured":"Zha, H., et al.: Bipartite graph partitioning and data clustering. In: Proc. of ACM 10th Int\u2019l Conf. Information and Knowledge Management (CIKM 2001), pp. 25\u201332. ACM Press, New York (2001)"},{"key":"117_CR22","unstructured":"Zhang, D.-Q., Chen, S.-C.: Fuzzy clustering using kernel method. In: Proceedings of the 2002 International Conference on Control and Automation, ICCA, pp. 162\u2013163 (2002)"},{"issue":"1","key":"117_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.artmed.2004.01.012","volume":"32","author":"D.-Q. Zhang","year":"2004","unstructured":"Zhang, D.-Q., Chen, S.-C.: A novel kernelized fuzzy c-means algorithm with application in medical image segmentation. Artificial Intelligence in Medicine\u00a032(1), 37\u201350 (2004)","journal-title":"Artificial Intelligence in Medicine"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71701-0_117.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:25:07Z","timestamp":1605745507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71701-0_117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717003","9783540717010"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71701-0_117","relation":{},"subject":[]}}