Abstract
In Data Mining applications of the frequent sets problem, such as finding association rules, a commonly used generalization is to see each transaction as the characteristic function of the corresponding itemset. This allows one to find also correlations between items not being in the transactions; but this may lead to the risk of a large and hard to interpret output. We propose a bottom-up algorithm in which the exploration of facts corresponding to items not being in the transactions is delayed with respect to positive information of items being in the transactions. This allows the user to dose the association rules found in terms of the amount of correlation allowed between absences of items. The algorithm takes advantage of the relationships between the corresponding frequencies of such itemsets. With a slight modification, our algorithm can be used as well to find all frequent itemsets consisting of an arbitrary number of present positive attributes and at most a predetermined number k of present negative attributes.
Work supported in part by the EU ESPRIT IST-1999-14186 (ALCOM-FT), EU EP27150 (NeuroColt), CIRIT 1997SGR-00366 and PB98-0937-C04 (FRESCO).
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
Agrawal R., Imielinski T., Swami A.N.: Mining association rules between sets of items in large databases. Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD’93), ACM Press Washington D.C., May 26–28 (1993) 207–216.
Agrawal R., Mannila H., Srikant R., Toivonen H., Verkamo A.I.: Fast discovery of association rules, in Fayyad U.M., Piatetsky-Shapiro G., Smyth Rp., Uthurusamy R. Eds, Advances in Knowledge Discoveryand Data Mining, AAAI Press, Menlo Park, CA; (1996) 307–328.
Baixeries J., Casas-Garriga G. and Balcázar J.L.: Frequent sets, sequences, and taxonomies: new, efficient algorithmic proposals. Tech. Rep. LSI-00-78-R. UPC. Barcelona (2000).
Brin S., Motwani R., Ullman J.D., Tsur S.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. Int. Conf. Management of Data, ACM Press (1997) 255–264.
Fayyad U.M., Piatetsky-Shapiro G., Smyth P.: From data mining to knowledge discovery: An overview. In Fayyad U.M., Piatetsky-Shapiro G., Smyth P. and Uthurusamy R., eds, Advances in Knowledge Discoveryand Data Mining, AAAI Press, Menlo Park, CA, (1996) 1–34.
Gunopulos D., Khardon R., Mannila H., Toivonen H. Data Mining, Hypergraph Transversals, and Machine Learning. Proceedings of the Sixteenth ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, ACM Press, Tucson, Arizona, May 12–14, (1997) 209–216.
Mannila H:, Toivonen H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery. 1(3) (1997) 241–258.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fortes, I., Balcázar, J.L., Morales, R. (2001). Bounding Negative Information in Frequent Sets Algorithms. In: Jantke, K.P., Shinohara, A. (eds) Discovery Science. DS 2001. Lecture Notes in Computer Science(), vol 2226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45650-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-45650-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42956-2
Online ISBN: 978-3-540-45650-6
eBook Packages: Springer Book Archive