Study and improvement on hierarchical algorithm of association rule

Luo Zhong; Hongxia Xia; Jingling Yuan

doi:10.1117/12.460215

12 March 2002 Study and improvement on hierarchical algorithm of association rule

Luo Zhong, Hongxia Xia, Jingling Yuan

Proceedings Volume 4730, Data Mining and Knowledge Discovery: Theory, Tools, and Technology IV; (2002) https://doi.org/10.1117/12.460215
Event: AeroSense 2002, 2002, Orlando, FL, United States

Abstract

This paper introduces the problem of data mining association rules. We adopt the iterative method to enlarge the size of the item set gradually and describe the hierarchical algorithm in detail. The hierarchical algorithm produces a larger provisional sets based on the obtained frequent item sets and make sure that those provisional sets which will never be frequent item set are ignored under the premise of the known information. Finally, an improving algorithm which is to combine the last several procedures of iteration into a single scan of the database D. Mainly because that the more backwards the iterative processes approach the end, the less the provisional sets are there.

Citation Download Citation

Luo Zhong, Hongxia Xia, and Jingling Yuan "Study and improvement on hierarchical algorithm of association rule", Proc. SPIE 4730, Data Mining and Knowledge Discovery: Theory, Tools, and Technology IV, (12 March 2002); https://doi.org/10.1117/12.460215

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available