The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 853-861.
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.
@inproceedings{ijcai2001p117,
title = {The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding},
author = {de Raedt, Luc and Kramer, Stefan},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {853--861},
year = {2001},
url = {https://ijcai.org/proceedings/2001/117},
}
TY - CPAPER TI - The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding AU - de Raedt, Luc AU - Kramer, Stefan T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 853 EP - 861 UR - https://ijcai.org/proceedings/2001/117 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
