Abstract
Previous methods on mining association rules require users to input a minimum support threshold. However, there can be too many or too few resulting rules if the threshold is set inappropriately. It is difficult for end-users to find the suitable threshold. In this paper, we propose a different setting in which the user does not provide a support threshold, but instead indicates the amount of results that is required.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Megiddo, R. Srikant: Discovering Predictive Association Rules. Proc. of the 4th Int’l Conf. on Knowledge Discovery in Databases and Data Mining (1998)
J. Han, Y. Fu: Discovery of Multiple-Level Association Rules from Large Databases. Proc. of the 21st Int’l Conf. on Very Large Data Bases (1995) 420–431
S. Brin, R. Motwani, C. Silverstein: Beyond Market Baskets: Generalizing Association Rules to Correlations. Proc. of the 1997 ACM SIGMOD International Conference on Management of Data (1997) 265–276
R. Agrawal, R. Srikant: Fast Algorithms for Mining Association Rules. Proc. of the 20th Int’l Conf. on Very Large Data Bases (1994) 487–499
R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan: Automatic Subspace Clustering of High Dimensional Data for Data Mining Application. Proc. of the 1996 ACM SIGMOD Int’l Conf. on Management of Data (1998) 94–105
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wai-chee Fu, A., Wang-wai Kwong, R., Tang, J. (2000). Mining N-most Interesting Itemsets. In: Raś, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-39963-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41094-2
Online ISBN: 978-3-540-39963-6
eBook Packages: Computer ScienceComputer Science (R0)