메뉴 건너뛰기




Volumn 34, Issue 12, 2012, Pages 2315-2326

Consensus clustering based on a new probabilistic rand index with application to subtopic retrieval

Author keywords

Consensus clustering; Probabilistic Rand index; Rand index; Search results clustering; Subtopic retrieval

Indexed keywords

CONSENSUS CLUSTERING; OPTIMIZATION PROBLEMS; PERFORMANCE GAIN; RAND INDEX; SEARCH RESULTS CLUSTERING; STOCHASTIC OPTIMIZATION ALGORITHM; SUBTOPIC RETRIEVAL;

EID: 84867823027     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2012.80     Document Type: Article
Times cited : (57)

References (43)
  • 1
    • 77950369345 scopus 로고    scopus 로고
    • Data clustering: 50 years beyond K-means
    • A.K. Jain, "Data Clustering: 50 Years beyond K-Means," Pattern Recognition Letters, vol. 31, no. 8, pp. 651-666, 2010.
    • (2010) Pattern Recognition Letters , vol.31 , Issue.8 , pp. 651-666
    • Jain, A.K.1
  • 3
    • 0041965980 scopus 로고    scopus 로고
    • Cluster ensembles-A knowledge reuse framework for combining multiple partitions
    • A. Strehl and J. Ghosh, "Cluster Ensembles-A Knowledge Reuse Framework for Combining Multiple Partitions," J. Machine Learning Research, vol. 3, pp. 583-617, 2002.
    • (2002) J. Machine Learning Research , vol.3 , pp. 583-617
    • Strehl, A.1    Ghosh, J.2
  • 6
    • 58249083744 scopus 로고    scopus 로고
    • Clustering aggregation by probability accumulation
    • X. Wang, C. Yang, and J. Zhou, "Clustering Aggregation by Probability Accumulation," Pattern Recognition, vol. 45, no. 2, pp. 668-675, 2009.
    • (2009) Pattern Recognition , vol.45 , Issue.2 , pp. 668-675
    • Wang, X.1    Yang, C.2    Zhou, J.3
  • 8
  • 13
    • 84950632109 scopus 로고
    • Objective criteria for the evaluation of clustering methods
    • W.M. Rand, "Objective Criteria for the Evaluation of Clustering Methods," J. Am. Statistical Assoc., vol. 66, pp. 846-850, 1971.
    • (1971) J. Am. Statistical Assoc. , vol.66 , pp. 846-850
    • Rand, W.M.1
  • 14
    • 0000008146 scopus 로고
    • Comparing partitions
    • L. Hubert and P. Arabie, "Comparing Partitions," J. Classification, vol. 2, no. 1, pp. 193-218, 1985.
    • (1985) J. Classification , vol.2 , Issue.1 , pp. 193-218
    • Hubert, L.1    Arabie, P.2
  • 15
    • 71149091239 scopus 로고    scopus 로고
    • Information theoretic measures for clustering comparison: Is a correction for chance necessary?
    • N.X. Vinh, J. Epps, and J. Bailey, "Information Theoretic Measures for Clustering Comparison: Is a Correction for Chance Necessary?" Proc. 26th Ann. Int'l Conf. Machine Learning, pp. 1073-1080, 2009.
    • (2009) Proc. 26th Ann. Int'l Conf. Machine Learning , pp. 1073-1080
    • Vinh, N.X.1    Epps, J.2    Bailey, J.3
  • 16
    • 33847142393 scopus 로고    scopus 로고
    • A fuzzy extension of the Rand index and other related indexes for clustering and classification assessment
    • DOI 10.1016/j.patrec.2006.11.010, PII S0167865506002935
    • R.J.G.B. Campello, "A Fuzzy Extension of the Rand Index and Other Related Indexes for Clustering and Classification Assessment," Pattern Recognition Letters, vol. 28, no. 7, pp. 833-841, 2007. (Pubitemid 46290586)
    • (2007) Pattern Recognition Letters , vol.28 , Issue.7 , pp. 833-841
    • Campello, R.J.G.B.1
  • 17
  • 18
    • 0003229898 scopus 로고
    • The median procedure for partitions
    • I.J. Cox, P. Hansen, and B. Julesz, eds., Am. Math. Soc.
    • J. Barthélemy and B. Leclerc, "The Median Procedure for Partitions," Partitioning Data Sets, I.J. Cox, P. Hansen, and B. Julesz, eds., pp. 3-34, Am. Math. Soc., 1995.
    • (1995) Partitioning Data Sets , pp. 3-34
    • Barthélemy, J.1    Leclerc, B.2
  • 19
    • 0345007607 scopus 로고    scopus 로고
    • The complexity of computing medians of relations
    • Y. Wakabayashi, "The Complexity of Computing Medians of Relations," Resenhas, vol. 3, no. 3, pp. 323-349, 1998.
    • (1998) Resenhas , vol.3 , Issue.3 , pp. 323-349
    • Wakabayashi, Y.1
  • 30
    • 43649094611 scopus 로고    scopus 로고
    • On the approximation of correlation clustering and consensus clustering
    • DOI 10.1016/j.jcss.2007.06.024, PII S0022000007000980
    • P. Bonizzoni, G.D. Vedova, R. Dondi, and T. Jiang, "On the Approximation of Correlation Clustering and Consensus Clustering," J. Computer and System Sciences, vol. 74, no. 5, pp. 671-696, 2008. (Pubitemid 351685699)
    • (2008) Journal of Computer and System Sciences , vol.74 , Issue.5 , pp. 671-696
    • Bonizzoni, P.1    Della Vedova, G.2    Dondi, R.3    Jiang, T.4
  • 33
    • 13444283223 scopus 로고    scopus 로고
    • Finding median partitions using information-theoretical-based genetic algorithms
    • D. Cristofor and D. Simovici, "Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms," J. Universal Computer Science, vol. 8, no. 2, pp. 153-172, 2002.
    • (2002) J. Universal Computer Science , vol.8 , Issue.2 , pp. 153-172
    • Cristofor, D.1    Simovici, D.2
  • 36
    • 20844452619 scopus 로고    scopus 로고
    • A concept-driven algorithm for clustering search results
    • S. Osinski and D. Weiss, "A Concept-Driven Algorithm for Clustering Search Results," IEEE Intelligent Systems, vol. 20, no. 3, pp. 48-54, May 2005. (Pubitemid 40860490)
    • (2005) IEEE Intelligent Systems , vol.20 , Issue.3 , pp. 48-54
    • Osinski, S.1    Weiss, D.2
  • 38
    • 0027681165 scopus 로고
    • Suffix arrays: A new method for on- line string searches
    • U. Manber and G. Myers, "Suffix Arrays: A New Method for On- Line String Searches," SIAM J. Computing, vol. 22, no. 5, pp. 935-948, 1993.
    • (1993) SIAM J. Computing , vol.22 , Issue.5 , pp. 935-948
    • Manber, U.1    Myers, G.2
  • 40
    • 0001704377 scopus 로고
    • On-line construction of suffix trees
    • E. Ukkonen, "On-Line Construction of Suffix Trees," Algorithmica, vol. 14, no. 3, pp. 249-260, 1995.
    • (1995) Algorithmica , vol.14 , Issue.3 , pp. 249-260
    • Ukkonen, E.1


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