23 research outputs found
On dualization in products of forests, in
Abstract. Let P = P1 ×...×Pn be the product of n partially ordered sets, each with an acyclic precedence graph in which either the in-degree or the out-degree of each element is bounded. Given a subset A⊆P,it is shown that the set of maximal independent elements of A in P can be incrementally generated in quasi-polynomial time. We discuss some applications in data mining related to this dualization problem
Mining frequent itemsets a perspective from operations research
Many papers on frequent itemsets have been published. Besides somecontests in this field were held. In the majority of the papers the focus ison speed. Ad hoc algorithms and datastructures were introduced. Inthis paper we put most of the algorithms in one framework, usingclassical Operations Research paradigms such as backtracking, depth-first andbreadth-first search, and branch-and-bound. Moreover we presentexperimental results where the different algorithms are implementedunder similar designs.data mining;operation research;Frequent itemsets
Mining frequent itemsets a perspective from operations research
Many papers on frequent itemsets have been published. Besides some
contests in this field were held. In the majority of the papers the focus is
on speed. Ad hoc algorithms and datastructures were introduced. 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