University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Towards Cross-fertilization Between Propositional Satisfiability and Data Mining

Towards Cross-fertilization Between Propositional Satisfiability and Data Mining

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

In this talk, we overview our contribution to data mining and more generally to the cross-fertilization between data mining and propositional satisfiability (http://www.cril.univ-artois.fr/decMining/). We will focus on two contributions. First, we show how propositional satisfiability can be used to model and solve problems in data mining. As an illustration, we present a SAT -based declarative approach for enumerating top-k (closed, frequent) itemsets in transactional databases. Secondly, we discuss the potential contribution of data mining to propositional satisfiability. In this context, we present a first application of data mining to compress Boolean formulas conjunctive normal form.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity