@becker

Generic Pattern Trees for Exhaustive Exceptional Model Mining

, , and . European Conference on Machine Learning and Knowledge Discovery in Databases, page 277--292. Berlin, Heidelberg, Springer Berlin Heidelberg, (2012)

Abstract

Exceptional model mining has been proposed as a variant of subgroup discovery especially focusing on complex target concepts. Currently, efficient mining algorithms are limited to heuristic (non exhaustive) methods. In this paper, we propose a novel approach for fast exhaustive exceptional model mining: We introduce the concept of valuation bases as an intermediate condensed data representation, and present the general GP-growth algorithm based on FP-growth. Furthermore, we discuss the scope of the proposed approach by drawing an analogy to data stream mining and provide examples for several different model classes. Runtime experiments show improvements of more than an order of magnitude in comparison to a naive exhaustive depth-first search.

Links and resources

DOI:
10.1007/978-3-642-33486-3_18
URL:
BibTeX key:
lemmerich2012generic
search on:

Comments and Reviews  
(0)

There is no review or comment yet. You can write one!

Tags


Cite this publication