English

Analyzing closed frequent itemsets with convex polytopes

Databases 2020-08-03 v4
Authors: Natalia Vanetik
View on arXiv ↗ PDF ↗

Abstract

Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.

Keywords

computational geometry permutation polynomials computational complexity

Cite

@article{arxiv.1203.4380,
  title  = {Analyzing closed frequent itemsets with convex polytopes},
  author = {Natalia Vanetik},
  journal= {arXiv preprint arXiv:1203.4380},
  year   = {2020}
}

Comments

Published as another paper with different data model

Related papers

View all related →
Programming Languages · Computer Science
Computing Convex Hulls with a Linear Solver
Florence Benoy, Andy King, Fred Mesnard
2007-05-23
Combinatorics · Mathematics
Polytope Extensions with Linear Diameters
Volker Kaibel, Kirill Kukharenko
2024-09-25
Combinatorics · Mathematics
The Best Ways to Slice a Polytope
Marie-Charlotte Brandenburg, Jesús A. De Loera, Chiara Meroni
2025-06-02
Artificial Intelligence · Computer Science
Frequent Itemset Mining with Multiple Minimum Supports: a Constraint-based Approach
Mohamed-Bachir Belaid, Nadjib Lazaar
2021-09-17
Combinatorics · Mathematics
Polymake and Lattice Polytopes
Michael Joswig, Benjamin Müller, Andreas Paffenholz
2009-02-18
Computational Geometry · Computer Science
Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
Roman Vershynin
2025-10-20
Data Structures and Algorithms · Computer Science
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron +1
2017-11-22
Combinatorics · Mathematics
Drawing polytopal graphs with polymake
Ewgenij Gawrilow, Michael Joswig, Thilo Rörig, Nikolaus Witte
2007-11-16
Optimization and Control · Mathematics
A convex programming approach to solve posynomial systems
Marianne Akian, Xavier Allamigeon, Marin Boyet, Stéphane Gaubert
2020-05-15
Optimization and Control · Mathematics
Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset
Dmitrii Lozovanu
2025-02-13
Optimization and Control · Mathematics
Computation of Polytopic Invariants for Polynomial Dynamical Systems using Linear Programming
Mohamed Amin Ben Sassi, Antoine Girard
2015-03-17
Optimization and Control · Mathematics
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
Andreas Ernst, Lars Grüne, Janosch Rieger
2019-04-03
Combinatorics · Mathematics
Geometric Reasoning with polymake
Ewgenij Gawrilow, Michael Joswig
2007-05-23
Combinatorics · Mathematics
Polytope numbers and their properties
H. K. Kim, J. Y. Lee
2012-06-05
Data Structures and Algorithms · Computer Science
Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
Kobe Grobben, Phablo F. S. Moura, Hande Yaman
2026-02-12
Methodology · Statistics
Stochastic linear programming with a distortion risk constraint
Karl Mosler, Pavel Bazovkin
2017-12-18
Statistics Theory · Mathematics
Hierarchical Models, Marginal Polytopes, and Linear Codes
Thomas Kahle, Walter Wenzel, Nihat Ay
2016-04-08
Combinatorics · Mathematics
Some Algorithmic Problems in Polytope Theory
Volker Kaibel, Marc E. Pfetsch
2007-05-23
Combinatorics · Mathematics
Combinatorial Polytope Enumeration
Sandeep Koranne, Anand Kulkarni
2009-08-13
Combinatorics · Mathematics
Mixing Convex Polytopes
Gabe Cunningham
2012-01-17
Combinatorics · Mathematics
The Hamiltonian Circuit Polytope
Latife Genc-Kaya, J. N. Hooker
2018-12-07
Combinatorics · Mathematics
Finding Descriptions of Polytopes via Extended Formulations and Liftings
Volker Kaibel, Andreas Loos
2011-09-06
Optimization and Control · Mathematics
On the Sequential Multiknapsack polytope
Paolo Detti
2014-06-13
Programming Languages · Computer Science
Experiments with a Convex Polyhedral Analysis Tool for Logic Programs
Kim Henriksen, Gourinath Banda, John Gallagher
2007-12-18
Data Structures and Algorithms · Computer Science
Faster Randomized Interior Point Methods for Tall/Wide Linear Programs
Agniva Chowdhury, Gregory Dexter, Palma London, Haim Avron +1
2022-09-26
R2 v1 2026-06-21T20:36:54.609Z