Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01465114
Contributor : Nicolas Durand <>
Submitted on : Tuesday, February 14, 2017 - 6:02:50 PM
Last modification on : Wednesday, September 12, 2018 - 1:26:07 AM
Long-term archiving on : Monday, May 15, 2017 - 5:53:23 PM

File

dq_dawak2014.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01465114, version 1

Collections

Citation

Nicolas Durand, Mohamed Quafafou. Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals. 16th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2014), 2014, Munich, Germany. pp.357-368. ⟨hal-01465114⟩

Share

Metrics

Record views

253

Files downloads

218