메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1083-1092

Data weaving: Scaling up the state-of-the-art in data clustering

Author keywords

Information theoretic clustering; Multi modal clustering; Parallel and distributed data mining

Indexed keywords

CONTINGENCY TABLE; DATA CLUSTERING; DATA-MINING TOOLS; INFORMATION-THEORETIC CLUSTERING; LARGE DATASETS; MULTI-MODAL; MULTI-MODAL CLUSTERING; MULTIDIMENSIONAL DATA; NOVEL METHODS; PARALLEL AND DISTRIBUTED DATA MINING; PARALLEL CLUSTERING; PARALLELIZATIONS; PARALLELIZING; SCALING-UP; SMALL DATA SET;

EID: 70349242259     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458226     Document Type: Conference Paper
Times cited : (10)

References (35)
  • 1
    • 31844439558 scopus 로고    scopus 로고
    • Multi-way distributional clustering via pairwise interactions
    • R. Bekkerman, R. El-Yaniv, and A. McCallum. Multi-way distributional clustering via pairwise interactions. In Proceedings of ICML-22, pages 41-48, 2005.
    • (2005) Proceedings of ICML-22 , pp. 41-48
    • Bekkerman, R.1    El-Yaniv, R.2    McCallum, A.3
  • 13
    • 84949510307 scopus 로고    scopus 로고
    • A data clustering algorithm on distributed memory multiprocessors
    • Large-Scale Parallel Data Mining, of
    • I. S. Dhillon and D. S. Modha. A data clustering algorithm on distributed memory multiprocessors. In Large-Scale Parallel Data Mining, volume 1759 of Lecture Notes in Artificial Intelligence, 2000.
    • (2000) Lecture Notes in Artificial Intelligence , vol.1759
    • Dhillon, I.S.1    Modha, D.S.2
  • 15
    • 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 Exploration Newsletter, 2(2):34-38, 2000.
    • (2000) SIGKDD Exploration Newsletter , vol.2 , Issue.2 , pp. 34-38
    • Forman, G.1    Zhang, B.2
  • 17
    • 32344447271 scopus 로고    scopus 로고
    • Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering
    • B. Gao, T.-Y. Liu, X. Zheng, Q.-S. Cheng, and W.-Y. Ma. Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. In Proceedings of ACM SIGKDD, 2005.
    • (2005) Proceedings of ACM SIGKDD
    • Gao, B.1    Liu, T.-Y.2    Zheng, X.3    Cheng, Q.-S.4    Ma, W.-Y.5
  • 22
    • 84876811202 scopus 로고    scopus 로고
    • Rcv1: A new benchmark collection for text categorization research
    • D. D. Lewis, Y. Yang, T. G. Rose, and F. Li. Rcv1: A new benchmark collection for text categorization research. JMLR, 5:361-397, 2004.
    • (2004) JMLR , vol.5 , pp. 361-397
    • Lewis, D.D.1    Yang, Y.2    Rose, T.G.3    Li, F.4
  • 24
    • 36849020504 scopus 로고    scopus 로고
    • A probabilistic framework for relational clustering
    • B. Long, Z. Zhang, and P. S. Yu. A probabilistic framework for relational clustering. In Proceedings of the ACM SIGKDD, pages 470-479, 2007.
    • (2007) Proceedings of the ACM SIGKDD , pp. 470-479
    • Long, B.1    Zhang, Z.2    Yu, P.S.3
  • 26
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • A. McCallum, K. Nigam, and L. H. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In Proceedings of ACM SIGKDD, pages 169-178, 2000.
    • (2000) Proceedings of ACM SIGKDD , pp. 169-178
    • McCallum, A.1    Nigam, K.2    Ungar, L.H.3
  • 30
    • 0036993190 scopus 로고    scopus 로고
    • Unsupervised document classification using sequential information maximization
    • N. Slonim, N. Friedman, and N. Tishby. Unsupervised document classification using sequential information maximization. In Proceedings of SIGIR-25, 2002.
    • (2002) Proceedings of SIGIR-25
    • Slonim, N.1    Friedman, N.2    Tishby, N.3
  • 34
    • 34250617022 scopus 로고    scopus 로고
    • The information bottleneck method
    • Allerton Conference on Communication, Control, and Computing
    • N. Tishby, F. Pereira, and W. Bialek. The information bottleneck method, 1999. Invited paper to the 37th Annual Allerton Conference on Communication, Control, and Computing.
    • (1999) Invited paper to the 37th Annual
    • Tishby, N.1    Pereira, F.2    Bialek, W.3
  • 35
    • 22844454592 scopus 로고    scopus 로고
    • A fast parallel clustering algorithm for large spatial databases
    • X. Xu, J. Jäger, and H.-P. Kriegel. A fast parallel clustering algorithm for large spatial databases. Data Mining and Knowledge Discovery, 3(3):263-290, 1999.
    • (1999) Data Mining and Knowledge Discovery , vol.3 , Issue.3 , pp. 263-290
    • Xu, X.1    Jäger, J.2    Kriegel, H.-P.3


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