메뉴 건너뛰기




Volumn , Issue , 2000, Pages 310-314

Exploring constraints to efficiently mine emerging patterns from large high-dimensional datasets

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA ACQUISITION; PATTERN RECOGNITION; SET THEORY;

EID: 0034593078     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/347090.347158     Document Type: Conference Paper
Times cited : (70)

References (11)
  • 1
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules
    • R Agrawal & R Srikant. Fast algorithms for mining association rules. In Proc. VLDB, 1994.
    • (1994) Proc. VLDB
    • Agrawal, R.1    Srikant, R.2
  • 2
    • 85172415673 scopus 로고    scopus 로고
    • Brute-force mining of high-confidence classification rules
    • R J Bayardo. Brute-force mining of high-confidence classification rules. In Proc. KDD, 1997.
    • (1997) Proc. KDD
    • Bayardo, R.J.1
  • 3
    • 0032091573 scopus 로고    scopus 로고
    • Efficiently mining long patterns from databases
    • R J Bayardo. Efficiently mining long patterns from databases. In Proc. SIGMOD, 1998.
    • (1998) Proc. SIGMOD
    • Bayardo, R.J.1
  • 4
  • 5
    • 0002034653 scopus 로고    scopus 로고
    • Efficient mining of emerging patterns: Discovering trends and differences
    • G Dong & J Li. Efficient mining of emerging patterns: Discovering trends and differences. In Proc. KDD, 1999.
    • (1999) Proc. KDD
    • Dong, G.1    Li, J.2
  • 6
    • 33847196995 scopus 로고    scopus 로고
    • Discovering emerging patterns in real datasets
    • G Dong, J Li, & X Zhang. Discovering emerging patterns in real datasets. In Proc. IDC, 1999.
    • (1999) Proc. IDC
    • Dong, G.1    Li, J.2    Zhang, X.3
  • 8
    • 0347087668 scopus 로고    scopus 로고
    • Optimization of constrained frequent set queries with 2-variable constraints
    • L V S Lakshmanan, J Han R Ng, & A Pang. Optimization of constrained frequent set queries with 2-variable constraints. In Proc. SIGMOD, 1999.
    • (1999) Proc. SIGMOD
    • Lakshmanan, L.V.S.1    Han, J.2    Ng, R.3    Pang, A.4
  • 9
    • 0032092760 scopus 로고    scopus 로고
    • Exploratory mining and pruning optimizations of constrained associations rules
    • R Ng, L V S Lakshmanan, J Han, & A Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. SIGMOD, 1998.
    • (1998) Proc. SIGMOD
    • Ng, R.1    Lakshmanan, L.V.S.2    Han, J.3    Pang, A.4
  • 10
    • 85152617336 scopus 로고
    • An SE-tree based characterization of the induction problem
    • R Rymon. An SE-tree based characterization of the induction problem. In Proc. ICML, 1993.
    • (1993) Proc. ICML
    • Rymon, R.1
  • 11
    • 0000835392 scopus 로고
    • OPUS: An efficient admissible algorithm for unordered search
    • G I Webb. OPUS: An efficient admissible algorithm for unordered search. In Journal of Artificial Intelligence Research, 3:431-465, 1995.
    • (1995) Journal of Artificial Intelligence Research , vol.3 , pp. 431-465
    • Webb, G.I.1


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