Analyzing closed frequent itemsets with convex polytopes

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

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Vanetik, Natalia
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 30.07.2020
Subjects
Computing costs
Distance measurement
Linear programming
Polytopes
Online AccessGet full text

Cover

More Information
Summary:Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
ISSN:2331-8422