BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Towards Cross-fertilization Between Propositional Satisfiability a
 nd Data Mining - LAKHDAR SAÏS\, CRIL
DTSTART:20150907T140000Z
DTEND:20150907T150000Z
UID:TALK60568@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:In this talk\, we overview our contribution to data mining and
  more generally to the cross-fertilization between data mining and  propos
 itional satisfiability (http://www.cril.univ-artois.fr/decMining/).  We wi
 ll  focus on two contributions. First\, we show how propositional satisfia
 bility can be  used to model and solve problems in data mining. As an illu
 stration\, we present a  SAT-based declarative approach for enumerating to
 p-k (closed\, frequent)  itemsets in transactional databases. Secondly\, w
 e discuss the potential  contribution of data mining to propositional sati
 sfiability. In this context\, we  present a first application of data mini
 ng to compress Boolean formulas  conjunctive normal form. 
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR