This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
preferencebasedpatternminingtutorial [2016/09/07 16:47] mplantev [Speakers] |
preferencebasedpatternminingtutorial [2016/09/07 16:53] mplantev [Tutorial Description] |
||
---|---|---|---|
Line 9: | Line 9: | ||
* **[[https:// | * **[[https:// | ||
- | * | + | * **[[http:// |
+ | * **[[http:// | ||
+ | ===== Tutorial Description ===== | ||
+ | ==== Context and Goal ==== | ||
- | Email: bruno.cremilleux@unicaen.fr | + | The paradigm of constraint-based pattern mining assumes a strong assumption: the user knows what he/she is looking for and, even more, he/she is able to express queries to pattern mining solvers. In practice, he/she has only a vague idea of what useful patterns could be and it is very hard to derive appropriate queries for the solvers. It explains |
- | Web: https:// | + | mining. The aim of this tutorial is to provide a comprehensive overview of preferences and relevant methods in the preference-based pattern mining |
- | Marc Plantevit, Université de Lyon, France. He received his PhD in computer | + | |
- | science in 2008 from the University | + | |
- | professor in the computer science department | + | ==== Content ==== |
- | since 2009. His research interest include constraint-based pattern mining | + | |
- | Currently, he is very interested with sophisticate | + | Constraint-based pattern mining |
- | attributed | + | |
- | mining. | + | |
- | Email: marc.plantevit@liris.cnrs.fr | + | Preferences in pattern mining do not come from scratch. In constraint-based |
- | Web: http:// | + | pattern mining, the utility functions finely measure the interest of a pattern |
+ | and can be seen as a quantitative preference model. Many other mechanisms | ||
+ | have been developed such as mining the most interesting patterns with | ||
+ | one measure (top-k patterns) or more (skyline patterns), reducing | ||
+ | redundancy by integrating subjective interestingness and then putting | ||
+ | the pattern mining task to an optimization problem. | ||
- | Arnaud Soulet, Université François Rabelais de Tours, France. He received | ||
- | his PhD in 2006 from the University of Caen. He is currently associate professor | ||
- | in computer science since 2007 at the University François Rabelais of Tours. | ||
- | He has an expertise in constraint-based pattern mining and involvement in the | ||
- | mining process like pattern mining techniques for preference elicitation. | ||
- | Email: arnaud.soulet@univ-tours.fr | ||
- | Web: http:// | ||
- | ===== Tutorial Description ===== | ||
+ | ==== Context and Goal ==== | ||
+ | ==== Context and Goal ==== | ||
===== Outline ===== | ===== Outline ===== |