Mining top-k frequent closed itemsets is not in APX

Authors:
Chienwen Wu
Affiliations:
National Taipei University of Technology, Taipei, Taiwan, R.O.C
Venue:
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Year:
2006

Citing 6
Cited 1

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Discovering all most specific sentences

ACM Transactions on Database Systems (TODS)
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

Data Mining and Knowledge Discovery
On the complexity of inducing categorical and quantitative association rules

Theoretical Computer Science
Finding the most interesting correlations in a database: how hard can it be?

Information Systems
TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets

IEEE Transactions on Knowledge and Data Engineering

Hierarchical document clustering using local patterns

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mining top-k frequent closed itemsets was initially proposed and exactly solved by Wang et al. [IEEE Transactions on Knowledge and Data Engineering 17 (2005) 652-664]. However, in the literature, no research has ever considered the complexity of this problem. In this paper, we present a set of proofs showing that, in the general case, the problem of mining top-k frequent closed itemsets is not in APX. This indicates that heuristic algorithms rather than exact algorithms are preferred to solve the problem.