메뉴 건너뛰기




Volumn 2838, Issue , 2003, Pages 47-58

Adaptive constraint pushing in frequent pattern mining

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE CONTROL SYSTEMS; ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DATABASE SYSTEMS; HEURISTIC METHODS; ITERATIVE METHODS; SEMANTICS; DATA MINING; ECONOMIC AND SOCIAL EFFECTS;

EID: 9444236236     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39804-2_7     Document Type: Conference Paper
Times cited : (13)

References (6)
  • 5
    • 0032092760 scopus 로고    scopus 로고
    • Exploratory mining and pruning optimizations of constrained associations rules
    • Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98), New York, June 1-4. ACM Press
    • R. T. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98), volume 27,2 of ACM SIGMOD Record, pages 13-24, New York, June 1-4 1998. ACM Press.
    • (1998) ACM SIGMOD Record , vol.27 , Issue.2 , pp. 13-24
    • Ng, R.T.1    Lakshmanan, L.V.S.2    Han, J.3    Pang, A.4
  • 6
    • 0035016447 scopus 로고    scopus 로고
    • Mining frequent item sets with convertible constraints
    • J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent item sets with convertible constraints. In ICDE'01, pages 433-442, 2001.
    • (2001) ICDE'01 , pp. 433-442
    • Pei, J.1    Han, J.2    Lakshmanan, L.V.S.3


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