Download PDF

PKDD, Date: 2010/09/20 - 2010/09/24, Location: Barcelona

Publication date: 2010-09-01
Volume: 6323 Pages: 563 - 578
ISSN: 978-3-642-15938-1
Publisher: Springer

Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part III

Author:

Zimmermann, Albrecht
Bringmann, Björn ; Rückert, Ulrich ; Balcázar, José ; Bonchi, Francesco ; Gionis, Aristides ; Sebag, Michèle

Keywords:

Science & Technology, Technology, Computer Science, Artificial Intelligence, Computer Science

Abstract:

Instructure-activity-relationships(SAR)oneaimsatfinding classifiers that predict the biological or chemical activity of a compound from its molecular graph. Many approaches to SAR use sets of binary substructure features, which test for the occurrence of certain substruc- tures in the molecular graph. As an alternative to enumerating very large sets of frequent patterns, numerous pattern set mining and pattern set selection techniques have been proposed. Existing approaches can be broadly classified into those that focus on minimizing correspondences, that is, the number of pairs of training instances from different classes with identical encodings and those that focus on maximizing the num- ber of equivalence classes, that is, unique encodings in the training data. In this paper we evaluate a number of techniques to investigate which criterion is a better indicator of predictive accuracy. We find that min- imizing correspondences is a necessary but not sufficient condition for good predictive accuracy, that equivalence classes are a better indica- tor of success and that it is important to have a good match between training set and pattern set size. Based on these results we propose a new, improved algorithm which performs local minimization of corre- spondences, yet evaluates the effect of patterns on equivalence classes globally. Empirical experiments demonstrate its efficacy and its superior run time behavior.