Abstract
In this paper, we present a new approach to approximate the negative border and the positive border of frequent itemsets. This approach is based on the transition from a border to the other one by computing the minimal transversals of a hypergraph. We also propose a new method to compute approximate minimal hypergraph transversals based on hypergraph reduction. The experiments realized on different data sets show that our propositions to approximate frequent itemset borders produce good results.
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.
Similar content being viewed by others
References
Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery 15, 55–86 (2007)
Mannila, H., Toivonen, H.: Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery 1(3), 241–258 (1997)
De Marchi, F., Petit, J.: Zigzag: a New Algorithm for Mining Large Inclusion Dependencies in Database. In: ICDM 2003, pp. 27–34 (November 2003)
Berge, C.: Hypergraphs: Combinatorics of Finite Sets, vol. 45. North Holland Mathematical Library (1989)
Abreu, R., van Gemund, A.: A Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis. In: SARA 2009 (July 2009)
Ruchkys, D.P., Song, S.W.: A Parallel Approximation Hitting Set Algorithm for Gene Expression Analysis. In: SBAC-PAD 2002, pp. 75–81 (2002)
Moens, S., Goethals, B.: Randomly Sampling Maximal Itemsets. In: IDEA 2013, Chicago, Illinois, USA, pp. 79–86 (2013)
Vreeken, J., van Leeuwen, M., Siebes, A.: Krimp: Mining Itemsets that Compress. Data Mining and Knowledge Discovery 23(1) (2011)
Afrati, F., Gionis, A., Mannila, H.: Approximating a Collection of Frequent Sets. In: KDD 2004, pp. 12–19 (August 2004)
Hagen, M.: Algorithmic and Computational Complexity Issues of MONET. PhD thesis, Friedrich-Schiller-Universitat Jena (November 2008)
Vinterbo, S., Øhrn, A.: Minimal Approximate Hitting Sets and Rule Templates. Approximate Reasoning 25, 123–143 (2000)
Rioult, F., Zanuttini, B., Crémilleux, B.: Nonredundant Generalized Rules and Their Impact in Classification. In: Ras, Z.W., Tsay, L.-S. (eds.) Advances in Intelligent Information Systems. SCI, vol. 265, pp. 3–25. Springer, Heidelberg (2010)
Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Itemsets. In: ICDM 2001, pp. 163–170 (November 2001)
Satoh, K., Uno, T.: Enumerating Maximal Frequent Sets Using Irredundant Dualization. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 256–268. Springer, Heidelberg (2003)
Dong, G., Li, J.: Mining Border Descriptions of Emerging Patterns from DatasetPairs. Knowledge and Information Systems 8(2), 178–202 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Durand, N., Quafafou, M. (2014). Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals. In: Bellatreche, L., Mohania, M.K. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2014. Lecture Notes in Computer Science, vol 8646. Springer, Cham. https://doi.org/10.1007/978-3-319-10160-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-10160-6_32
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10159-0
Online ISBN: 978-3-319-10160-6
eBook Packages: Computer ScienceComputer Science (R0)