<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">
</head>
<body text="#000000" bgcolor="#ffffff">
<h1 class="documentFirstHeading"><span class=""
id="parent-fieldname-title">¡Vuelven las Charlas del DC! Esta
vez con galletitas <br>
</span></h1>
<h1 class="documentFirstHeading"><span class=""
id="parent-fieldname-title">Primera Charla 2011: lunes 14 de
Abril a las 15.00 - Prof. Linda Pagli, Università di Pisa </span></h1>
<strong>Orador:</strong> Linda Pagli - Dipartimento di Informatica,
Università di Pisa
<div> </div>
<div><strong>Título</strong>: Data mining meets switching theory</div>
<div> </div>
<p><strong>Resumen: </strong>We introduce new algebraic forms, SOP+
and DSOP+, to<span class="moz-txt-citetags"> </span>represent
functions from f : {0,1}^n to N, based on arithmetic sums of<span
class="moz-txt-citetags"> </span>products. These expressions
are a direct generalization of the classical <span
class="moz-txt-citetags"></span>SOP and DSOP forms. We propose
optimal and heuristic algorithms for <span
class="moz-txt-citetags"></span>minimal SOP+ and DSOP+
synthesis. We then show how the DSOP+ form can be <span
class="moz-txt-citetags"></span>exploited for Data Mining
applications. In particular we propose a new <span
class="moz-txt-citetags"></span>compact representation for the
database of transactions to be used by <span
class="moz-txt-citetags"></span>the<span
class="moz-txt-citetags"> </span>LCM algorithms for mining
frequent closed itemsets.</p>
<p style="text-align: justify;"><b>Lugar</b>: Depto. de Computación,
sala a designar. <br>
</p>
<br>
<br>
</body>
</html>