메뉴 건너뛰기




Volumn , Issue , 2006, Pages 810-811

Efficient mining of max frequent patterns in a generalized environment

Author keywords

Data mining; Max frequent itemsets

Indexed keywords

COMPACT REPRESENTATION; MAX FREQUENT PATTERNS;

EID: 34547622826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183614.1183742     Document Type: Conference Paper
Times cited : (1)

References (3)
  • 1
    • 0032091573 scopus 로고    scopus 로고
    • Efficiently Mining Long Patterns from Databases
    • R. J. Bayardo Jr. Efficiently Mining Long Patterns from Databases. In SIGMOD, pages 85-93, 1998.
    • (1998) SIGMOD , pp. 85-93
    • Bayardo Jr., R.J.1
  • 2
    • 0002880407 scopus 로고
    • Mining Generalized Association Rules
    • R. Srikant and R. Agrawal. Mining Generalized Association Rules. In VLDB, pages 407-419, 1995.
    • (1995) VLDB , pp. 407-419
    • Srikant, R.1    Agrawal, R.2
  • 3
    • 1642409826 scopus 로고    scopus 로고
    • Fast Algorithms for Mining Generalized Frequent Patterns of Generalized Association Rules
    • March
    • K. Sriphaew and T. Theeramunkong. Fast Algorithms for Mining Generalized Frequent Patterns of Generalized Association Rules. IEICE Transactions on Information and Systems, E87-D(3), March 2004.
    • (2004) IEICE Transactions on Information and Systems , vol.E87-D , Issue.3
    • Sriphaew, K.1    Theeramunkong, T.2


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