{"type":"ScholarlyArticle","title":"The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding","authors":[{"name":"Luc De Raedt","slug":"luc-de-raedt","given":"Luc","family":"de Raedt","affiliation":""},{"name":"Stefan Kramer","slug":"stefan-kramer","given":"Stefan","family":"Kramer","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2001/117","pdf":"https://ijcai.org/proceedings/2001/0117.pdf","markdown":"https://ijcai.org/proceedings/2001/117.md","bibtex":"https://ijcai.org/proceedings/2001/bibtex/117","volume":{"slug":"2001","title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2001","url":"https://ijcai.org/proceedings/2001/","year":2001,"location":"Seattle, Washington, USA","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":117,"pages":{"first":853,"last":861},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}