By Topic

Knowledge discovery with a subset-superset approach for Mining Heterogeneous Data with dynamic support

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ashutosh Kumar Dubey ; Department of CSE, Trinity Institute of Technology and Research, Bhopal ; Animesh Kumar Dubey ; Vipul Agarwal ; Yogeshver Khandagre

Data Mining provides a useful insight on finding frequent patterns. Data mining is an inter-disciplinary field, whose core is at the intersection of machine learning, statistics and databases. In this paper we proposed an efficient method for knowledge discovery which is based on subset and superset approach. In this approach we also use dynamic minimum support so that we reduce the execution time. A frequent superset means it contains more transactions then the minimum support. It utilize the concept that if the item set is not frequent but the superset may be frequent which is consider for the further data mining task. By this approach we can also find improved association, which shows that which item set is most acceptable association with others. A frequent subset means it contains less transactions then the minimum support. It utilizes the behavior that the less count may be frequent if we attached the less count with the higher order set. Here we also provide the flexibility to find multiple minimum supports which is useful for comparison with associated items and dynamic support range. Our algorithm provides the flexibility for improved association and dynamic support. Comparative result shows the effectiveness of our algorithm.

Published in:

Software Engineering (CONSEG), 2012 CSI Sixth International Conference on

Date of Conference:

5-7 Sept. 2012