메뉴 건너뛰기




Volumn 2, Issue , 2008, Pages 333-340

Extracting non-redundant approximate rules from multi-level datasets

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATIVE PROCESSING; TAXONOMIES;

EID: 57649155353     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2008.54     Document Type: Conference Paper
Times cited : (5)

References (23)
  • 4
    • 0035747563 scopus 로고    scopus 로고
    • Rapid Association Rule Mining
    • ACM, Atlanta, Georgia, USA
    • A. Das, W.-K. Ng & Y.-K. Woon, 'Rapid Association Rule Mining', in CIKM'01 ACM, Atlanta, Georgia, USA, 2001.
    • (2001) CIKM'01
    • Das, A.1    Ng, W.-K.2    Woon, Y.-K.3
  • 5
    • 0002401815 scopus 로고
    • Discovery of Multiple-Level Association Rules from Large Databases
    • Zurich, Switzerland
    • J. Han & Y. Fu, 'Discovery of Multiple-Level Association Rules from Large Databases', in 21st International Conference on Very Large Databases, Zurich, Switzerland, 1995, pp. 420-431.
    • (1995) 21st International Conference on Very Large Databases , pp. 420-431
    • Han, J.1    Fu, Y.2
  • 6
    • 0033311838 scopus 로고    scopus 로고
    • Mining Multiple-Level Association Rules in Large Databases
    • Sep/Oct
    • J. Han & Y. Fu, 'Mining Multiple-Level Association Rules in Large Databases', IEEE Transactions on Knowledge and Data Engineering, Vol. 11, pp. 798-805, Sep/Oct., 1999.
    • (1999) IEEE Transactions on Knowledge and Data Engineering , vol.11 , pp. 798-805
    • Han, J.1    Fu, Y.2
  • 7
    • 0003372359 scopus 로고    scopus 로고
    • Mining Frequent Patterns by Pattern-Growth: Methodology and Implications
    • Dec
    • J. Han & J. Pei, 'Mining Frequent Patterns by Pattern-Growth: Methodology and Implications', ACM SIGKDD Explorations Newsletter, Vol. 2, pp. 14-20, Dec., 2000.
    • (2000) ACM SIGKDD Explorations Newsletter , vol.2 , pp. 14-20
    • Han, J.1    Pei, J.2
  • 8
    • 0037272307 scopus 로고    scopus 로고
    • Mining Fuzzy Multiple-Level Association Rules from Quantitative Data
    • Jan
    • T.-P. Hong, K.-Y. Lin & B.-C. Chien, 'Mining Fuzzy Multiple-Level Association Rules from Quantitative Data', Applied Intelligence, Vol. 18, pp. 79-90, Jan., 2003.
    • (2003) Applied Intelligence , vol.18 , pp. 79-90
    • Hong, T.-P.1    Lin, K.-Y.2    Chien, B.-C.3
  • 11
    • 0034593061 scopus 로고    scopus 로고
    • Multi-Level Organization and Summarization of the Discovered Rules
    • Boston, Massachusetts, USA: ACM Press
    • B. Liu, M. Hu & W. Hsu, 'Multi-Level Organization and Summarization of the Discovered Rules', in Conference on Knowledge Discovery in Data, Boston, Massachusetts, USA: ACM Press, 2000.
    • (2000) Conference on Knowledge Discovery in Data
    • Liu, B.1    Hu, M.2    Hsu, W.3
  • 13
    • 0033096890 scopus 로고    scopus 로고
    • Efficient mining of association rules using closed itemset lattices
    • N. Pasquier, Y. Bastide, R. Taouil & L. Lakhal, 'Efficient mining of association rules using closed itemset lattices', Information Systems, Vol. 24, Issue 1, pp. 25-46, 1999.
    • (1999) Information Systems , vol.24 , Issue.1 , pp. 25-46
    • Pasquier, N.1    Bastide, Y.2    Taouil, R.3    Lakhal, L.4
  • 16
    • 1442272748 scopus 로고    scopus 로고
    • CT-ITL: Efficient Frequent Item Set Mining using a Compressed Prefix Tree with Pattern Growth
    • Adelaide, Australia
    • Y. G. Sucahyo & R. P. Gopalan, 'CT-ITL: Efficient Frequent Item Set Mining using a Compressed Prefix Tree with Pattern Growth', in 14th Australasian Database Conference, Adelaide, Australia, 2003.
    • (2003) 14th Australasian Database Conference
    • Sucahyo, Y.G.1    Gopalan, R.P.2
  • 17
    • 57649159170 scopus 로고    scopus 로고
    • Mining Level-Crossing Association Rules from Large Databases
    • R. S. Thakur, R. C. Jain & K. P. Pardasani, 'Mining Level-Crossing Association Rules from Large Databases', Journal of Computer Science, Vol. 12, pp. 76-81, 2006.
    • (2006) Journal of Computer Science , vol.12 , pp. 76-81
    • Thakur, R.S.1    Jain, R.C.2    Pardasani, K.P.3
  • 21
    • 0034592942 scopus 로고    scopus 로고
    • Generating Non-Redundant Association Rules
    • M. J. Zaki, 'Generating Non-Redundant Association Rules', in Proceedings of the KDD Conference, 2000, pp. 34-43.
    • (2000) Proceedings of the KDD Conference , pp. 34-43
    • Zaki, M.J.1
  • 22
    • 4444337294 scopus 로고    scopus 로고
    • Mining Non-Redundant Association Rules
    • M. J. Zaki, 'Mining Non-Redundant Association Rules', Data Mining and Knowledge Discovery, Vol. 9, pp. 223-248, 2004.
    • (2004) Data Mining and Knowledge Discovery , vol.9 , pp. 223-248
    • Zaki, M.J.1


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