메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1103-1112

An effective algorithm for mining 3-clusters in vertically partitioned data

Author keywords

Bi clustering; Formal concept analysis; Multi clustering

Indexed keywords

BI-CLUSTERING; COMPREHENSIVE STUDIES; CONVENTIONAL CLUSTERING; DATA POINTS; DATA TABLES; EFFECTIVE ALGORITHMS; FORMAL CONCEPT ANALYSIS; HIGH QUALITY; MATHEMATICAL FORMULATION; MULTI-CLUSTERING; NOVEL ALGORITHM; ONE DIMENSION; ONE STEP; OVERLAPPING CLUSTERS; REAL DATA SETS; VERTICALLY PARTITIONED DATA;

EID: 70349247042     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458228     Document Type: Conference Paper
Times cited : (15)

References (21)
  • 1
    • 33751356174 scopus 로고    scopus 로고
    • Efficient Mining of large maximal bicliques
    • G. Liu, K. Sim, and J. Li. Efficient Mining of large maximal bicliques In Dawak pp. 437-448, 2006.
    • (2006) Dawak , pp. 437-448
    • Liu, G.1    Sim, K.2    Li, J.3
  • 3
    • 0036361164 scopus 로고    scopus 로고
    • Cecilia M. Procopiuc, Michael Jones, Pankaj K. Agarwal, T. M. Murali, A Monte Carlo algorithm for fast projective clustering. Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data pp. 418-427
    • Cecilia M. Procopiuc, Michael Jones, Pankaj K. Agarwal, T. M. Murali, A Monte Carlo algorithm for fast projective clustering. Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data pp. 418-427
  • 4
    • 29844442223 scopus 로고    scopus 로고
    • TriCluster: An Effective Algorithm for Mining Coherent Clusters in 3D Microarray Data
    • Baltimore, MD, May
    • Lizhuang Zhao, Mohammed J. Zaki, TriCluster: An Effective Algorithm for Mining Coherent Clusters in 3D Microarray Data. ACM SIGMOD International Conference on Management of Data, Baltimore, MD, May 2005.
    • (2005) ACM SIGMOD International Conference on Management of Data
    • Zhao, L.1    Zaki, M.J.2
  • 5
    • 70349239771 scopus 로고    scopus 로고
    • T. Uno, M. Kiyomi, H. Arimura. LCM ver 3, Collaboration of Array, Bitmap and Prefix Tree for Frequent Itemset Mining Proceedings of the 2005 ACM OSDM Open Source Data Mining Workshop
    • T. Uno, M. Kiyomi, H. Arimura. LCM ver 3.: Collaboration of Array, Bitmap and Prefix Tree for Frequent Itemset Mining Proceedings of the 2005 ACM OSDM Open Source Data Mining Workshop.
  • 6
    • 6344277753 scopus 로고    scopus 로고
    • Mohammed J. Zaki, Karam Gouda, Fast Vertical Mining Using Diffsets, 9th International Conference on Knowledge Discovery and Data Mining, Washington, DC, August 2003.
    • Mohammed J. Zaki, Karam Gouda, Fast Vertical Mining Using Diffsets, 9th International Conference on Knowledge Discovery and Data Mining, Washington, DC, August 2003.
  • 16
    • 70349238122 scopus 로고    scopus 로고
    • S. Datta, H. Kargupta. Uniform Data Sampling from a Peer-to-Peer Network.In 2007 IEEE International Conference on Distributed Computing Systems (ICDCS 2007), Toronto, Canada, June, 2007
    • S. Datta, H. Kargupta. Uniform Data Sampling from a Peer-to-Peer Network.In 2007 IEEE International Conference on Distributed Computing Systems (ICDCS 2007), Toronto, Canada, June, 2007
  • 17
    • 70349231771 scopus 로고    scopus 로고
    • E. Januzaj, H.-P. Kriegel, and M. Pfeifle. Scalable Density-Based Distributed Clustering. In The 15th European Conference on Machine Learning (ECML) and the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD) , Pisa, Italy, September 2004
    • E. Januzaj, H.-P. Kriegel, and M. Pfeifle. Scalable Density-Based Distributed Clustering. In The 15th European Conference on Machine Learning (ECML) and the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD) , Pisa, Italy, September 2004
  • 19
    • 70349241050 scopus 로고    scopus 로고
    • Phoenix: Privacy Preserving Biclustering on Horizontally Partitioned Data amid Malicious Adversaries
    • San Jose
    • Waseem Ahmad, Ashfaq Khokhar, Phoenix: Privacy Preserving Biclustering on Horizontally Partitioned Data amid Malicious Adversaries. ACM SIGKDD. San Jose, 2007
    • (2007) ACM SIGKDD
    • Ahmad, W.1    Khokhar, A.2
  • 20
    • 70449102572 scopus 로고    scopus 로고
    • Arindam Banerjee, Sugato Basu, Srujana Merugu,Multi-way Clustering on Relation Graphs.Proceedings ofthe SIAM International Conference on Data Mining. SDM-2007
    • Arindam Banerjee, Sugato Basu, Srujana Merugu,"Multi-way Clustering on Relation Graphs.Proceedings ofthe SIAM International Conference on Data Mining. SDM-2007


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