Analyzing closed frequent itemsets with convex polytopes
Natalia Vanetik
TL;DR
This paper explores the geometric structure of frequent itemsets by representing them as convex polytopes and utilizes linear programming techniques to analyze and identify these itemsets efficiently.
Contribution
It introduces a novel approach to analyze closed frequent itemsets using convex polytopes and linear programming, providing a geometric perspective.
Findings
Polytope representation of frequent itemsets
Linear programming for itemset analysis
Efficient identification of closed frequent itemsets
Abstract
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Data Quality and Management · Advanced Database Systems and Queries