메뉴 건너뛰기




Volumn 22, Issue 8, 2009, Pages 569-579

Discovering pattern-based subspace clusters by pattern tree

Author keywords

Clustering analysis; Pattern similarity; Pattern tree; Subspace clustering

Indexed keywords

CLUSTERING ANALYSIS; CLUSTERING QUALITY; CONTROL PARAMETERS; DATA OBJECTS; EXISTING METHOD; FREQUENT ITEMSETS; LARGE DATASETS; MINING FREQUENT ITEMSETS; PATTERN SIMILARITY; PATTERN TREE; PATTERN TREES; PATTERN-BASED CLUSTERING; REAL DATA SETS; SUBSPACE CLUSTERING; SUBSPACE CLUSTERS; TARGET SUBSPACES; TRADITIONAL CLUSTERING;

EID: 70349759705     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2009.02.011     Document Type: Article
Times cited : (14)

References (31)
  • 3
    • 17044376078 scopus 로고    scopus 로고
    • Subspace clustering for high dimensional data: a review
    • Parsons L., Haque E., and Liu H. Subspace clustering for high dimensional data: a review. SIGKDD Explorations 6 1 (2004) 90-105
    • (2004) SIGKDD Explorations , vol.6 , Issue.1 , pp. 90-105
    • Parsons, L.1    Haque, E.2    Liu, H.3
  • 14
    • 33847018674 scopus 로고    scopus 로고
    • GHIC: a hierarchical pattern-based clustering algorithm for grouping web transactions
    • Yang Y.H., and Padmanabhan B.J. GHIC: a hierarchical pattern-based clustering algorithm for grouping web transactions. IEEE Transactions on Knowledge and Data Engineering 17 9 (2005) 1300-1304
    • (2005) IEEE Transactions on Knowledge and Data Engineering , vol.17 , Issue.9 , pp. 1300-1304
    • Yang, Y.H.1    Padmanabhan, B.J.2
  • 16
    • 0036361164 scopus 로고    scopus 로고
    • C. Procopiuc, M. Jones, P. Agarwal, A Monte-Carlo algorithm for fast projective clustering, in: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002, pp. 418-427.
    • C. Procopiuc, M. Jones, P. Agarwal, A Monte-Carlo algorithm for fast projective clustering, in: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002, pp. 418-427.
  • 17
    • 0242387333 scopus 로고    scopus 로고
    • Efficient and Scalable Subspace Clustering for Very Large Data Sets
    • MAFIA:, Technical Report, 1999, 9906-010
    • S. Goil, H. Nagesh, A. Choudhary, MAFIA: Efficient and Scalable Subspace Clustering for Very Large Data Sets, Technical Report, 1999, 9906-010.
    • Goil, S.1    Nagesh, H.2    Choudhary, A.3
  • 24
    • 0041627879 scopus 로고    scopus 로고
    • Extracting conserved gene expression motifs from gene expression data
    • World Scientific
    • Murali T.M., and Kasif S. Extracting conserved gene expression motifs from gene expression data. Proceedings of Pacific Symposium Biocomputing (2003), World Scientific 77-88
    • (2003) Proceedings of Pacific Symposium Biocomputing , pp. 77-88
    • Murali, T.M.1    Kasif, S.2
  • 29
    • 70349779480 scopus 로고    scopus 로고
    • Mining frequent patterns with the pattern tree
    • Huang H., Wu X.D., and Relue R. Mining frequent patterns with the pattern tree. New Generation Computing 23 4 (2005) 315-337
    • (2005) New Generation Computing , vol.23 , Issue.4 , pp. 315-337
    • Huang, H.1    Wu, X.D.2    Relue, R.3
  • 30
    • 70349778758 scopus 로고    scopus 로고
    • .
  • 31
    • 70349765816 scopus 로고    scopus 로고
    • .


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