메뉴 건너뛰기




Volumn , Issue , 2012, Pages 553-562

On clustering heterogeneous social media objects with outlier links

Author keywords

Noisy links; Robust clustering; Social media networks

Indexed keywords

CLUSTERING PROCESS; LINK INFORMATIONS; LINK STRUCTURE; NOISY LINKS; PROBABILITY MEASURES; RANDOM FIELDS; ROBUST CLUSTERING; SOCIAL MEDIA; STATE-OF-THE-ART ALGORITHMS;

EID: 84858063639     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2124295.2124363     Document Type: Conference Paper
Times cited : (63)

References (23)
  • 3
    • 13444282389 scopus 로고    scopus 로고
    • Hierarchical clustering of www image search results using visual, textual, and link information
    • D. Cai, X. He, Z. Li, W.-Y. Ma, and J.-R.Wen. Hierarchical clustering of www image search results using visual, textual, and link information. In ACM Multimedia Conference, 2004.
    • (2004) ACM Multimedia Conference
    • Cai, D.1    He, X.2    Li, Z.3    Ma, W.-Y.4    Wen, J.-R.5
  • 6
    • 36849005505 scopus 로고    scopus 로고
    • Evolutionary spectral clustering by incorporating temporal smoothness
    • Y. Chi, X. Song, D. Zhou, K. Hino, and B. Tseng. Evolutionary spectral clustering by incorporating temporal smoothness. In KDD, 2007.
    • (2007) KDD
    • Chi, Y.1    Song, X.2    Zhou, D.3    Hino, K.4    Tseng, B.5
  • 8
    • 0026961606 scopus 로고
    • Scatter/gather: A cluster-based approach to browsing large document collections
    • D. Cutting, D. Karger, J. Pedersen, and J. Tukey. Scatter/gather: A cluster-based approach to browsing large document collections. In Proceedings of the SIGIR, 1992.
    • (1992) Proceedings of the SIGIR
    • Cutting, D.1    Karger, D.2    Pedersen, J.3    Tukey, J.4
  • 9
    • 0002629270 scopus 로고
    • Maximum-likelihood from incomplete data via the em algorithm
    • A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum-likelihood from incomplete data via the em algorithm. J. Royal Statist. Soc., B(39):1-38, 1977.
    • (1977) J. Royal Statist. Soc., B , Issue.39 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 12
    • 33745630997 scopus 로고    scopus 로고
    • Discovering large dense subgraphs in massive graphs
    • D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, 2005.
    • (2005) VLDB
    • Gibson, D.1    Kumar, R.2    Tomkins, A.3
  • 16
    • 84858045065 scopus 로고    scopus 로고
    • Image ad feature co-clustering
    • G. Qiu. Image ad feature co-clustering. In ICPR Conference, 2004.
    • (2004) ICPR Conference
    • Qiu, G.1
  • 17
    • 57349135211 scopus 로고    scopus 로고
    • Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering
    • M. Rege, M. Dong, and J. Hua. Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering. In Proc. of International Conference on World Wide Web, 2008.
    • (2008) Proc. of International Conference on World Wide Web
    • Rege, M.1    Dong, M.2    Hua, J.3
  • 18
    • 70350647698 scopus 로고    scopus 로고
    • Scalable graph clustering using stochastic flows: Applications to community discovery
    • V. Satuluri and S. Parthasarathy. Scalable graph clustering using stochastic flows: applications to community discovery. In KDD Conference, 2009.
    • (2009) KDD Conference
    • Satuluri, V.1    Parthasarathy, S.2
  • 21
    • 70350679112 scopus 로고    scopus 로고
    • Combining link and content for community detection: A discriminative approach
    • T. Yang, R. Jin, Y. Chi, and S. Zhu. Combining link and content for community detection: a discriminative approach. In ACM KDD Conference, 2009.
    • (2009) ACM KDD Conference
    • Yang, T.1    Jin, R.2    Chi, Y.3    Zhu, S.4
  • 22
    • 77955045035 scopus 로고    scopus 로고
    • Graph clustering based on structural/attribute similarities
    • Y. Zhou, H. Cheng, and J. X. Yu. Graph clustering based on structural/attribute similarities. In VLDB Conference, 2009.
    • (2009) VLDB Conference
    • Zhou, Y.1    Cheng, H.2    Yu, J.X.3


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