Analyzing closed frequent itemsets with convex polytopes

Details Analyzing closed frequent itemsets with convex polytopes Analyzing closed frequent itemsets with convex polytopes

2012-03-20

arxiv.org/abs/1203.4380v1

Computer Science

Databases

14 pages, 4 pdf figures

Scientific paper

Computing frequent itemsets in transactional databases is a vital but computationally expensive task. Measuring the difference of two datasets is often done by computing their respective frequent itemsets despite high computational cost. We propose a linear programming-based approach to this problem and show that there exists a distance measure for transactional database that relies on closed frequent itemsets but does not require their generation. We also prove that classification of datasets up to their frequent itemsets is a hopeless task since well-described canonical forms do not exist for this problem.

Affiliated with

Also associated with

No associations

Rating

Analyzing closed frequent itemsets with convex polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Analyzing closed frequent itemsets with convex polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analyzing closed frequent itemsets with convex polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494566