메뉴 건너뛰기




Volumn , Issue , 2011, Pages 983-984

Equivalence class transformation based mining of frequent itemsets from uncertain data

Author keywords

data mining; frequent patterns; probabilistic databases; set of transaction ids (tidset); vertical mining

Indexed keywords

FREQUENT ITEMSET MINING; FREQUENT ITEMSETS; FREQUENT PATTERNS; PROBABILISTIC DATABASE; REAL-LIFE APPLICATIONS; SET OF TRANSACTION IDS (TIDSET); TRANSFORMATION BASED; UNCERTAIN DATAS; VERTICAL MINING;

EID: 79959311325     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1982185.1982399     Document Type: Conference Paper
Times cited : (18)

References (12)
  • 1
    • 70350664429 scopus 로고    scopus 로고
    • Frequent pattern mining with uncertain data
    • C.C. Aggarwal et al. Frequent pattern mining with uncertain data. In Proc. KDD 2009, pp. 29-37.
    • Proc. KDD 2009 , pp. 29-37
    • Aggarwal, C.C.1
  • 2
    • 0001882616 scopus 로고    scopus 로고
    • Fast algorithms for mining association rules
    • R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487-499.
    • Proc. VLDB 1994 , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 79956332483 scopus 로고    scopus 로고
    • Efficient pattern mining of uncertain data with sampling
    • T. Calders et al. Efficient pattern mining of uncertain data with sampling. In Proc. PAKDD 2010, pp. 480-487.
    • Proc. PAKDD 2010 , pp. 480-487
    • Calders, T.1
  • 4
    • 38049177468 scopus 로고    scopus 로고
    • Mining frequent itemsets from uncertain data
    • C.-K. Chui et al. Mining frequent itemsets from uncertain data. In Proc. PAKDD 2007, pp. 47-58.
    • Proc. PAKDD 2007 , pp. 47-58
    • Chui, C.-K.1
  • 6
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han et al. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD 2000, pp. 1-12.
    • Proc. ACM SIGMOD 2000 , pp. 1-12
    • Han, J.1
  • 7
    • 79959320027 scopus 로고    scopus 로고
    • Frequent itemset mining of uncertain data streams using the damped window model
    • C.K.-S. Leung and F. Jiang. Frequent itemset mining of uncertain data streams using the damped window model. In Proc. ACM SAC 2011.
    • Proc. ACM SAC 2011
    • Leung, C.K.-S.1    Jiang, F.2
  • 8
    • 44649151137 scopus 로고    scopus 로고
    • A tree-based approach for frequent pattern mining from uncertain data
    • C.K.-S. Leung et al. A tree-based approach for frequent pattern mining from uncertain data. In Proc. PAKDD 2008, pp. 653-661.
    • Proc. PAKDD 2008 , pp. 653-661
    • Leung, C.K.-S.1
  • 9
    • 77954748923 scopus 로고    scopus 로고
    • Mining uncertain data for frequent itemsets that satisfy aggregate constraints
    • C.K.-S. Leung et al. Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In Proc. ACM SAC 2010, pp. 1034-1038.
    • Proc. ACM SAC 2010 , pp. 1034-1038
    • Leung, C.K.-S.1
  • 10
    • 35248836871 scopus 로고    scopus 로고
    • Maintenance of maximal frequent itemsets in large databases
    • W. Lian et al. Maintenance of maximal frequent itemsets in large databases. In Proc. ACM SAC 2007, pp. 388-392.
    • Proc. ACM SAC 2007 , pp. 388-392
    • Lian, W.1
  • 11
    • 78149320187 scopus 로고    scopus 로고
    • H-Mine: Hyper-structure mining of frequent patterns in large databases
    • J. Pei et al. H-Mine: Hyper-structure mining of frequent patterns in large databases. In Proc. IEEE ICDM 2001, pp. 441-448.
    • Proc. IEEE ICDM 2001 , pp. 441-448
    • Pei, J.1
  • 12
    • 0033718951 scopus 로고    scopus 로고
    • Scalable algorithms for association mining
    • May/June
    • M.J. Zaki. Scalable algorithms for association mining. IEEE TKDE, 12(3), pp. 372-390. May/June 2000.
    • (2000) IEEE TKDE , vol.12 , Issue.3 , pp. 372-390
    • Zaki, M.J.1


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