In this paper we introduce new algebraic forms, SOP + and DSOP + , to represent functions f:{0,1} n →ℕ, based on arithmetic sums of products. These expressions are a direct generalization of the classical SOP and DSOP forms. We propose optimal and heuristic algorithms for minimal SOP + and DSOP + synthesis. We then show how the DSOP + form can be exploited for Data Mining applications. In particular we propose a new compact representation for the database of transactions to be used by the LCM algorithms for mining frequent closed itemsets.
Fun at a department store : data mining meets switching theory / A. Bernasconi, V. Ciriani, F. Luccio, L. Pagli - In: Fun with algorithms : 5. International conference, FUN 2010 : Ischia, Italy, june 2-4, 2010 : proceedings / [a cura di] P. Boldi. - Berlin : Springer, 2010. - ISBN 9783642131219. - pp. 41-52 (( Intervento presentato al 5. convegno FUN International Conference tenutosi a Ischia nel 2010.
Fun at a department store : data mining meets switching theory
V. CirianiSecondo
;
2010
Abstract
In this paper we introduce new algebraic forms, SOP + and DSOP + , to represent functions f:{0,1} n →ℕ, based on arithmetic sums of products. These expressions are a direct generalization of the classical SOP and DSOP forms. We propose optimal and heuristic algorithms for minimal SOP + and DSOP + synthesis. We then show how the DSOP + form can be exploited for Data Mining applications. In particular we propose a new compact representation for the database of transactions to be used by the LCM algorithms for mining frequent closed itemsets.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
