메뉴 건너뛰기




Volumn 9, Issue 5, 1997, Pages 813-825

Using a hash-based method with transaction trimming for mining association rules

Author keywords

Association rules; Data mining; Hashing; Performance analysis

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATABASE SYSTEMS; ITERATIVE METHODS; KNOWLEDGE BASED SYSTEMS;

EID: 0031220368     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.634757     Document Type: Article
Times cited : (361)

References (17)
  • 3
    • 0027621699 scopus 로고
    • Mining Association Rules between Sets of Items in Large Databases
    • May
    • R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules between Sets of Items in Large Databases," Proc. ACM SIGMOD, pp. 207-216, May 1993.
    • (1993) Proc. ACM SIGMOD , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 5
  • 6
    • 0029212693 scopus 로고
    • Mining Sequential Patterns
    • Mar.
    • R. Agrawal and R. Srikant, "Mining Sequential Patterns," Proc. 11th Int'l Conf. Data Eng., pp. 3-14, Mar. 1995.
    • (1995) Proc. , vol.11 , pp. 3-14
    • Agrawal, R.1    Srikant, R.2
  • 7
    • 0026676150 scopus 로고
    • Knowledge Mining by Imprecise Querying: A Classification-Based Approach
    • Feb.
    • T.M. Anwar, H.W. Beck, and S.B. Navathe, "Knowledge Mining by Imprecise Querying: A Classification-Based Approach," Proc. Eighth Int'l Conf. Data Eng., pp. 622-630, Feb. 1992.
    • (1992) Proc. Eighth Int'l Conf. Data Eng. , pp. 622-630
    • Anwar, T.M.1    Beck, H.W.2    Navathe, S.B.3
  • 9
    • 0002401815 scopus 로고
    • Discovery of Multiple-Level Association Rules from Large Databases
    • Sept.
    • J. Han and Y. Fu, "Discovery of Multiple-Level Association Rules from Large Databases," Proc. 21th Int'l Conf. Very Large Data Bases, pp. 420-431, Sept. 1995.
    • (1995) Proc. 21th Int'l Conf. Very Large Data Bases , pp. 420-431
    • Han, J.1    Fu, Y.2
  • 10
    • 0029224819 scopus 로고
    • Set-Oriented Mining for Association Rules in Relational Databases
    • Mar.
    • M. Houtsma and A. Swami, "Set-Oriented Mining for Association Rules in Relational Databases," Proc. 11th Int'l Conf. Data Eng., pp. 25-33, Mar. 1995.
    • (1995) Proc. 11th Int'l Conf. Data Eng. , pp. 25-33
    • Houtsma, M.1    Swami, A.2
  • 11
    • 0348150721 scopus 로고
    • File Structures Using Hashing Functions
    • July
    • E.G. Coffman Jr. and J. Eve, "File Structures Using Hashing Functions," Comm. ACM, vol. 13, no. 7, pp. 427-432 and 436, July 1970.
    • (1970) Comm. ACM , vol.13 , Issue.7 , pp. 427-432
    • Coffman Jr., E.G.1    Eve, J.2
  • 14
    • 0003136237 scopus 로고
    • Efficient and Effective Clustering Methods for Spatial Data Mining
    • Sept.
    • R.T. Ng and J. Han, "Efficient and Effective Clustering Methods for Spatial Data Mining," Proc. 18th Int'l Conf. Very Large Data Bases, pp. 144-155, Sept. 1994.
    • (1994) Proc. 18th Int'l Conf. Very Large Data Bases , pp. 144-155
    • Ng, R.T.1    Han, J.2
  • 15
  • 16
    • 33744584654 scopus 로고
    • Induction of Decision Trees
    • J.R. Quinlan, "Induction of Decision Trees," Machine Learning, vol. 1, no. 81-106, 1986.
    • (1986) Machine Learning , vol.1 , Issue.81-106
    • Quinlan, J.R.1
  • 17
    • 0028449142 scopus 로고
    • Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results
    • Minneapolis, May
    • J.T.-L. Wang, G.-W. Chirn, T.G. Marr, B. Shapiro, D. Shasha, and K. Zhang, "Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results," Proc. ACM SIGMOD, Minneapolis, pp. 115-125, May 1994.
    • (1994) Proc. ACM SIGMOD , pp. 115-125
    • Wang, J.T.-L.1    Chirn, G.-W.2    Marr, T.G.3    Shapiro, B.4    Shasha, D.5    Zhang, K.6


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