Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals-Reference-Cited by-同舟云学术

Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals

Published:2014 Issue: Volume: Page:357-368
ISSN:0302-9743
Container-title:Data Warehousing and Knowledge Discovery
language:
Short-container-title:

Author:

Durand Nicolas,Quafafou Mohamed

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-10160-6_32

Reference15 articles.

1. 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)

2. Mannila, H., Toivonen, H.: Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery 1(3), 241–258 (1997)

3. De Marchi, F., Petit, J.: Zigzag: a New Algorithm for Mining Large Inclusion Dependencies in Database. In: ICDM 2003, pp. 27–34 (November 2003)

4. Berge, C.: Hypergraphs: Combinatorics of Finite Sets, vol. 45. North Holland Mathematical Library (1989)

5. 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)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Efficient Method for Mining Informative Association Rules in Knowledge Extraction;Lecture Notes in Computer Science;2020

2. Detecting behavior types of moving object trajectories;International Journal of Data Science and Analytics;2018-01-25

3. Semantic Pattern Mining Based Web Service Recommendation;Service-Oriented Computing;2016

4. Frequent Itemset Border Approximation by Dualization;Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVI;2016