In this paper we introduce new algebraic forms, SOP+ and DSOP+, to represent functions f : f0; 1gn ! 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

BERNASCONI, ANNA;LUCCIO, FABRIZIO;PAGLI, LINDA
2010

Abstract

In this paper we introduce new algebraic forms, SOP+ and DSOP+, to represent functions f : f0; 1gn ! 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.
9783642131219
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11568/194073
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact