메뉴 건너뛰기




Volumn 4, Issue , 2006, Pages 3342-3347

A cluster ensemble framework for large data sets

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY;

EID: 34548139373     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2006.384634     Document Type: Conference Paper
Times cited : (23)

References (33)
  • 1
    • 0041965980 scopus 로고    scopus 로고
    • Clusters ensembles- a knowledge reuse framework for combining multiple partitions
    • A. Strehl and J. Ghosh, "Clusters ensembles- a knowledge reuse framework for combining multiple partitions," Journal of Machine learning Research, 3, 2002, pp. 583-617.
    • (2002) Journal of Machine learning Research , vol.3 , pp. 583-617
    • Strehl, A.1    Ghosh, J.2
  • 2
    • 34548569516 scopus 로고    scopus 로고
    • B. Long, Z. (Mark) Zhang, and Philip S. Yu, Combining Multiple Clusterings by Soft Correspondence, ICDM 2005, pp. 282-289.
    • B. Long, Z. (Mark) Zhang, "and Philip S. Yu, " Combining Multiple Clusterings by Soft Correspondence," ICDM 2005, pp. 282-289.
  • 3
    • 85089828762 scopus 로고    scopus 로고
    • A scaleable and Robust Framework for Structure Discovery
    • K. Punera and J. Ghosh, "A scaleable and Robust Framework for Structure Discovery,",ICDM 2005, pp. 757-760.
    • ICDM 2005 , pp. 757-760
    • Punera, K.1    Ghosh, J.2
  • 4
    • 34547963309 scopus 로고    scopus 로고
    • Effective and Efficient Distributed Model-based Clustering
    • H. Kriegel, P. Kroger, A. Pryakhin, M. Scubert, "Effective and Efficient Distributed Model-based Clustering," ICDM 2005, pp. 258-265.
    • ICDM 2005 , pp. 258-265
    • Kriegel, H.1    Kroger, P.2    Pryakhin, A.3    Scubert, M.4
  • 5
    • 14344258244 scopus 로고    scopus 로고
    • Solving cluster ensemble problem by bipartite graph partitioning
    • X.Z Fern and C.E Brodley. "Solving cluster ensemble problem by bipartite graph partitioning," ICML 2004.
    • ICML 2004
    • Fern, X.Z.1    Brodley, C.E.2
  • 8
    • 0038391443 scopus 로고    scopus 로고
    • Bagging to improve the accuracy of a clustering procedure
    • S. Dudoit and J. Fridlyand "Bagging to improve the accuracy of a clustering procedure," Bioinformatics, 2003
    • (2003) Bioinformatics
    • Dudoit, S.1    Fridlyand, J.2
  • 9
    • 17444400440 scopus 로고    scopus 로고
    • Distributed Data Clustering can be Efficient and Exact
    • G. Forman and B. Zhang, "Distributed Data Clustering can be Efficient and Exact," SIGKDD Explorations, 2000
    • (2000) SIGKDD Explorations
    • Forman, G.1    Zhang, B.2
  • 10
    • 0002719797 scopus 로고
    • The Hungarian Method for the Assignment Problem
    • Kuhn, H.W., "The Hungarian Method for the Assignment Problem," Naval. Res. Logist. Quart., 2, 1955, pp. 83-97.
    • (1955) Naval. Res. Logist. Quart , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 11
    • 11144277437 scopus 로고    scopus 로고
    • Scalable Clustering: A Distributed Approach
    • P. Hore and L. Hall, "Scalable Clustering: A Distributed Approach," FUZZ-IEEE, 2004.
    • (2004) FUZZ-IEEE
    • Hore, P.1    Hall, L.2
  • 13
  • 14
    • 84957012677 scopus 로고    scopus 로고
    • Finding Consistent Clusters in Data Partitions
    • Proc. Int. Workshop on multiple Classifier Systems, Eds. F. Roli, J. Kittler
    • A.L.N Fred, "Finding Consistent Clusters in Data Partitions," Proc. Int. Workshop on multiple Classifier Systems, Eds. F. Roli, J. Kittler, LNCS 2364, 2002, pp. 309-318.
    • (2002) LNCS , vol.2364 , pp. 309-318
    • Fred, A.L.N.1
  • 15
    • 0002679222 scopus 로고    scopus 로고
    • Scalability of Clustering Algorithms Revisited
    • F. Farnstrom, J. Lewis, and C. Elkan, "Scalability of Clustering Algorithms Revisited," SIGKDD Explorations, 2(1), 2000, pp. 51-57.
    • (2000) SIGKDD Explorations , vol.2 , Issue.1 , pp. 51-57
    • Farnstrom, F.1    Lewis, J.2    Elkan, C.3
  • 17
  • 21
    • 0002815587 scopus 로고    scopus 로고
    • A General Method for Scaling Up Machine Learning Algorithms and its Application to Clustering
    • Domingos, P. and Hulten, G., "A General Method for Scaling Up Machine Learning Algorithms and its Application to Clustering," Proc. Eighteenth Int'l. Conf. on Machine Learning, 2001, 106-113.
    • (2001) Proc. Eighteenth Int'l. Conf. on Machine Learning , pp. 106-113
    • Domingos, P.1    Hulten, G.2
  • 23
    • 84924704849 scopus 로고
    • Algorithms for Clustering Data. Prentice Hall
    • NJ, USA
    • AK Jain and RC Dubes, "Algorithms for Clustering Data. Prentice Hall," Englewood Cliffs NJ, USA, 1988
    • (1988) Englewood Cliffs
    • Jain, A.K.1    Dubes, R.C.2
  • 24
    • 0343586025 scopus 로고    scopus 로고
    • A Data-Clustering Algorithm On Distributed Memory Multiprocessors
    • ot ACM SIGKDD
    • Inderjit S. Dhillon and Dharmendra S. Modha, "A Data-Clustering Algorithm On Distributed Memory Multiprocessors," Proc. of Large-scale Parallel KDD Systems Workshop, ot ACM SIGKDD, 1999, pp. 245-260.
    • (1999) Proc. of Large-scale Parallel KDD Systems Workshop , pp. 245-260
    • Dhillon, I.S.1    Modha, D.S.2
  • 33
    • 34548111527 scopus 로고    scopus 로고
    • Personal communication: We communicated with one of the authors of [2, We were told that their experiment might choose 6 classes randomly and they have no record of it except the last experiment
    • Personal communication: We communicated with one of the authors of [2]. We were told that their experiment might choose 6 classes randomly and they have no record of it except the last experiment.


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