Browse our site
About
People
Research Areas
Projects
Publications
Seminars
Future
Past
News
You are here:
Home
Seminars
Past
Partial Implications in Data Mining and Logic
Partial Implications in Data Mining and Logic
Main information
By:
José Luis Balcázar (Universitat Politècnica de Catalunya)
Date:
Wednesday, 17th of April 2013, 14h00
Location:
FCT/UNL, Seminar Room (Ed. II)
Abstract
One of the most widely studied notions in Data Mining, namely Association Rules, is in fact a probabilistic logic notion: a minor variation of propositional partial implications; in turn, these are a natural variant of Horn clauses. The difference is in the semantics: we allow for a limited amount of exceptions. Some of the studies of redundancy in data mining are casted, as well, in a natural form as the corresponding logic notion of entailment, where the presence of exceptions, and the ways to measure them, fully change the rules of the game. We discuss in some depth the main practical notion of redundancy; characterize it in several ways, both model-theoretic and in terms of syntactic calculi; explore some applications, and propose a natural open problem on which we will be able to report ongoing partial progress.
Download Slides
here
.
Short-bio
Professor José Luis Balcázar is Full Professor at Universitat Politècnica de Catalunya. He has worked for quite some time in Computational Complexity in the past, but focuses since almost two decades in computational, algorithmic, and logic problems related to Machine Learning and Data Mining. He has been advisor of 9 PhD dissertations and has published some seventy papers in international journals or conferences, as well as some books. His aim is to contribute new knowledge that balances a fully precise mathematical justification with a clear perspective of applicability or interest to wider research communities.
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541
