The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding
Lists
Only you see this
Abstract
A tight integration of Mitchell's version space algorithm with Agrawal et al.'s Apriori algorithm is presented. The algorithm can be used to generate patterns that satisfy a variety of constraints on data. Constraints that can be imposed on patterns include the generality relation among patterns and imposing a minimum or a maximum frequency on data sets of interest. The theoretical framework is applied to an important application in chemo-informatics, i.e. that of finding fragments of interest within a given set of compounds. Fragments are linearly connected substructures of compounds. An implementation as well as preliminary experiments within the application are presented.
BibTeX
@inproceedings{raedt2001levelwise,
author = {Luc De Raedt and Stefan Kramer},
title = {{The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding}},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2001},
url = {https://openreview.net/forum?id=B1Wc2Gzu-H},
}Loading related content...