6th International Conference, HAIS 2011, Wroclaw, Poland, May 23-25, 2011, Proceedings, Part II

The two LNAI volumes 6678 and 6679 constitute the proceedings of the 6th International Conference on Hybrid Artificial Intelligent Systems, HAIS 2011, held in Wroclaw, Poland, in May 2011. The 114 papers published in these proceedings were carefully reviewed and selected from 241 submissions. They are organized in topical sessions on hybrid intelligence systems on logistics and intelligent optimization; metaheuristics for combinatorial optimization and modelling complex systems; hybrid systems for context-based information fusion; methods of classifier fusion; intelligent systems for data mining and applications; systems, man, and cybernetics; hybrid artificial intelligence systems in management of production systems; habrid artificial intelligent systems for medical applications; and hybrid intelligent approaches in cooperative multi-robot systems

6th International Conference, HAIS 2011, Wroclaw, Poland, May 23-25, 2011, Proceedings, Part I

The two LNAI volumes 6678 and 6679 constitute the proceedings of the 6th International Conference on Hybrid Artificial Intelligent Systems, HAIS 2011, held in Wroclaw, Poland, in May 2011. The 114 papers published in these proceedings were carefully reviewed and selected from 241 submissions. They are organized in topical sessions on hybrid intelligence systems on logistics and intelligent optimization; metaheuristics for combinatorial optimization and modelling complex systems; hybrid systems for context-based information fusion; methods of classifier fusion; intelligent systems for data mining and applications; systems, man, and cybernetics; hybrid artificial intelligence systems in management of production systems; habrid artificial intelligent systems for medical applications; and hybrid intelligent approaches in cooperative multi-robot systems

Anytime Discovery of a Diverse Set of Patterns with Monte Carlo Tree Search

International audienceThe discovery of patterns that accurately discriminate one class label from another remains a challenging data mining task. Subgroup discovery (SD) is one of the frameworks that enables to elicit such interesting patterns from labeled data. A question remains fairly open: How to select an accurate heuristic search technique when exhaustive enumeration of the pattern space is infeasible? Existing approaches make use of beam-search, sampling, and genetic algorithms for discovering a pattern set that is non-redundant and of high quality w.r.t. a pattern quality measure. We argue that such approaches produce pattern sets that lack of diversity: Only few patterns of high quality, and different enough, are discovered. Our main contribution is then to formally define pattern mining as a game and to solve it with Monte Carlo tree search (MCTS). It can be seen as an exhaustive search guided by random simulations which can be stopped early (limited budget) by virtue of its best-first search property. We show through a comprehensive set of experiments how MCTS enables the anytime discovery of a diverse pattern set of high quality. It out-performs other approaches when dealing with a large pattern search space and for different quality measures. Thanks to its genericity, our MCTS approach can be used for SD but also for many other pattern mining tasks