Mining frequent itemsets: a perspective from operations research

Wim Pijls and Walter A. Kosters

Statistica Neerlandica, 2010, vol. 64, issue 4, 367-387

Abstract: Mining frequent itemsets is a flourishing research area. Many papers on this topic have been published and even some contests have been held. Most papers focus on speed and introduce ad hoc algorithms and data structures. In this paper we put most of the algorithms in one framework, using classical Operations Research paradigms such as backtracking, depth‐first and breadth‐first search and branch‐and‐bound. Moreover, we present experimental results where the different algorithms are implemented under similar designs.

Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.2010.00452.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:64:y:2010:i:4:p:367-387

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().