메뉴 건너뛰기




Volumn 4426 LNAI, Issue , 2007, Pages 1037-1045

Graph nodes clustering based on the commute-time kernel

Author keywords

[No Author keywords available]

Indexed keywords

FUZZY CLUSTERING; GRAPH THEORY; MATRIX ALGEBRA; PROBLEM SOLVING;

EID: 38049162603     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71701-0_117     Document Type: Conference Paper
Times cited : (62)

References (23)
  • 1
    • 11844255164 scopus 로고    scopus 로고
    • M. W. Berry, editor, Springer-Verlag New York, Inc, Secaucus, NJ, USA
    • M. W. Berry, editor. Survey of Text Mining. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2003.
    • (2003) Survey of Text Mining
  • 3
    • 0034824884 scopus 로고    scopus 로고
    • Concept decompositions for large sparse text data using clustering
    • I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1):143-175, 2001.
    • (2001) Machine Learning , vol.42 , Issue.1 , pp. 143-175
    • Dhillon, I.S.1    Modha, D.S.2
  • 5
    • 3142750484 scopus 로고    scopus 로고
    • Clustering large graphs via the singular value decomposition
    • P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering large graphs via the singular value decomposition. Machine Learning, 56(1-3):9-33, 2004.
    • (2004) Machine Learning , vol.56 , Issue.1-3 , pp. 9-33
    • Drineas, P.1    Frieze, A.2    Kannan, R.3    Vempala, S.4    Vinay, V.5
  • 8
    • 33847766633 scopus 로고    scopus 로고
    • Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation
    • F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19(3):355-369. 2007.
    • (2007) IEEE Transactions on Knowledge and Data Engineering , vol.19 , Issue.3 , pp. 355-369
    • Fouss, F.1    Pirotte, A.2    Renders, J.-M.3    Saerens, M.4
  • 9
    • 0036565280 scopus 로고    scopus 로고
    • Mercer kernel-based clustering in feature space
    • May
    • M. Girolami. Mercer kernel-based clustering in feature space. IEEE Transactions on Neural Networks, 13(3):780-784, May 2002.
    • (2002) IEEE Transactions on Neural Networks , vol.13 , Issue.3 , pp. 780-784
    • Girolami, M.1
  • 10
    • 10644261327 scopus 로고    scopus 로고
    • Evaluation of the performance of clustering algorithms in kernel-induced feature space
    • D.-W. Kim, K. Y. Lee, D. Lee, and K. H. Lee. Evaluation of the performance of clustering algorithms in kernel-induced feature space. Pattern Recognition, 38(4):607-611, 2005.
    • (2005) Pattern Recognition , vol.38 , Issue.4 , pp. 607-611
    • Kim, D.-W.1    Lee, K.Y.2    Lee, D.3    Lee, K.H.4
  • 11
    • 2942564706 scopus 로고    scopus 로고
    • Detecting community structure in networks
    • M. Newman. Detecting community structure in networks. The European Physical Journal B, 38:321-330, 2004.
    • (2004) The European Physical Journal B , vol.38 , pp. 321-330
    • Newman, M.1
  • 12
    • 0041875229 scopus 로고    scopus 로고
    • On spectral clustering: Analysis and an algorithm
    • T. Dietterich, S. Becker, and Z. Ghahramani, editors, Vancouver, Canada, MIT Press
    • A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In T. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processiong Systems, volume 14, pages 849-856, Vancouver, Canada, 2001. MIT Press.
    • (2001) Advances in Neural Information Processiong Systems , vol.14 , pp. 849-856
    • Ng, A.Y.1    Jordan, M.I.2    Weiss, Y.3
  • 13
    • 84948481845 scopus 로고
    • An algorithm for suffix stripping
    • M. F. Porter. An algorithm for suffix stripping. Program, 14(3):130-137, 1980.
    • (1980) Program , vol.14 , Issue.3 , pp. 130-137
    • Porter, M.F.1
  • 14
    • 22944459214 scopus 로고    scopus 로고
    • M. Saerens, F. Fouss, L. Yen, and P. Dupont. The principal components analysis of a graph, and its relationships to spectral clustering. Proceedings of the 15th European Conference on Machine Learning (ECML 2004). Lecture Notes in Artificial Intelligence, 3201, Springer-Verlag, Berlin, pages 371-383, 2004.
    • M. Saerens, F. Fouss, L. Yen, and P. Dupont. The principal components analysis of a graph, and its relationships to spectral clustering. Proceedings of the 15th European Conference on Machine Learning (ECML 2004). Lecture Notes in Artificial Intelligence, Vol. 3201, Springer-Verlag, Berlin, pages 371-383, 2004.
  • 19
    • 84880106426 scopus 로고    scopus 로고
    • S. White and P. Smyth. A spectral clustering approach to finding communities in graph. In SDM, 2005.
    • S. White and P. Smyth. A spectral clustering approach to finding communities in graph. In SDM, 2005.
  • 23
    • 4444347719 scopus 로고    scopus 로고
    • A novel kernelized fuzzy c-means algorithm with application in medical image segmentation
    • D.-Q. Zhang and S.-C. Chen. A novel kernelized fuzzy c-means algorithm with application in medical image segmentation. Artificial Intelligence in Medicine, 32(1):37-50, 2004.
    • (2004) Artificial Intelligence in Medicine , vol.32 , Issue.1 , pp. 37-50
    • Zhang, D.-Q.1    Chen, S.-C.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.