메뉴 건너뛰기




Volumn 1574, Issue , 1999, Pages 54-64

LGen – A lattice-based candidate set generation algorithm for I/O efficient association rule mining

Author keywords

Apriori; Association rules; Data mining; Lattice; Lgen

Indexed keywords

ASSOCIATION RULES;

EID: 84947740422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48912-6_8     Document Type: Conference Paper
Times cited : (4)

References (11)
  • 1
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • Washington, D.C., May
    • R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD, Washington, D.C., May 1993.
    • (1993) Proc. ACM SIGMOD
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 2
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • Santiago, Chile
    • R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. of the 20th VLDB Conference, Santiago, Chile, 1994.
    • (1994) Proc. of the 20th VLDB Conference
    • Agrawal, R.1    Srikant, R.2
  • 5
    • 0029733589 scopus 로고    scopus 로고
    • Maintenance of discovered association rules in large databases: An incremental updating technique
    • New Orleans, Louisiana, IEEE computer Society
    • David W. Cheung, Jiawei Han, Vincent T. Ng, and C. Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In Proceedings of the Twelfth International Conference on Data Engineering, New Orleans, Louisiana, 1996. IEEE computer Society.
    • (1996) Proceedings of the Twelfth International Conference on Data Engineering
    • Cheung, D.W.1    Han, J.2    Ng, V.T.3    Wong, C.Y.4
  • 7
    • 0002401815 scopus 로고
    • Discovery of multiple-level association rules from large databases
    • Zurich, Switzerland
    • Jiawei Han and Yongjian Fu. Discovery of multiple-level association rules from large databases. In Proc. of the 21st VLDB Conference, Zurich, Switzerland, 1995.
    • (1995) Proc. of the 21st VLDB Conference
    • Han, J.1    Fu, Y.2
  • 8
    • 84976830511 scopus 로고
    • An effective hash-based algorithm for mining association rules
    • San Jose, California, May
    • Jong Soo Park, Ming-Syan Chen, and Philip S. Yu. An effective hash-based algorithm for mining association rules. In Proc. ACM SIGMOD, San Jose, California, May 1995.
    • (1995) Proc. ACM SIGMOD
    • Park, J.S.1    Chen, M.-S.2    Yu, P.S.3
  • 9
    • 0030157416 scopus 로고    scopus 로고
    • Mining quantitative association rules in large relational tables
    • H. V. Jagadish and Inderpal singh Mumick, editors, Montreal, Canada, June
    • Ramakrishnan Srikant and Rakesh Agrawal. Mining quantitative association rules in large relational tables. In H. V. Jagadish and Inderpal singh Mumick, editors, Proc. ACM SIGMOD, Montreal, Canada, June 1996.
    • (1996) Proc. ACM SIGMOD
    • Srikant, R.1    Agrawal, R.2
  • 10
    • 0002663969 scopus 로고    scopus 로고
    • Sampling large databases for association rules
    • Bombay, India, September
    • Hannu Toivonen. Sampling large databases for association rules. In Proc. of the 22th VLDB Conference, Bombay, India, September 1996.
    • (1996) Proc. of the 22th VLDB Conference
    • Toivonen, H.1
  • 11
    • 84947762231 scopus 로고    scopus 로고
    • LGen - A lattice-based candidate set generation algorithm for I/O efficient association rule mining
    • Dept. of CSIS, The University of Hong Kong
    • C.L. Yip, K.K. Loo, B. Kao, D. Cheung, and C.K. Cheng. LGen - a lattice-based candidate set generation algorithm for I/O efficient association rule mining. Technical report TR-99-01, Dept. of CSIS, The University of Hong Kong, 1999.
    • (1999) Technical report TR-99-01
    • Yip, C.L.1    Loo, K.K.2    Kao, B.3    Cheung, D.4    Cheng, C.K.5


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