Mining association rules based on seed items and weights

Authors:
Chen Xiang;Zhang Yi;Wu Yue
Affiliations:
College of Computer Science and Engineering, University of Electronic Science and Technology of China;College of Computer Science and Engineering, University of Electronic Science and Technology of China;College of Computer Science and Engineering, University of Electronic Science and Technology of China
Venue:
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
Year:
2005

Citing 5
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Mining Frequent Itemsets Using Support Constraints

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining N-most Interesting Itemsets

ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traditional algorithms of mining association rules, such as Apriori, often suffered from the bottleneck of itemset generation because the database is too large or the threshold of minimum support is not suitable. Furthermore, the traditional methods often treated each item evenly. It resulted in some problems. In this paper, a new algorithm to solve the above problems is proposed. The approach is to replace the database with the base set based on some seed items and assign weights to each item in the base set. Experiments on performance study will prove the superiority of the new algorithm.