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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. ACM SIGMOD Conf. Management of data, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. 20th Int’l Conf. Very Large Databases, pp. 478–499 (1994)
Fu, W.-c., Kwong, W.-W., Tang, J.: Mining N-Most Interesting Itemsets. In: International Syposium on Methodologies for Intelligent Systems Date (2000)
Wang, K., He, Y., Han, J.: Mining Frequent Itemsets Using Support Constraints. In: Proc. 20th Int’l Conf. Very Large Databases (2000)
Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. In: Proc. ACM SIGMOD Conf. Management of data (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiang, C., Yi, Z., Yue, W. (2005). Mining Association Rules Based on Seed Items and Weights. In: Wang, L., Jin, Y. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2005. Lecture Notes in Computer Science(), vol 3613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539506_75
Download citation
DOI: https://doi.org/10.1007/11539506_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28312-6
Online ISBN: 978-3-540-31830-9
eBook Packages: Computer ScienceComputer Science (R0)