Files in this item
Towards improving solution dominance with incomparability conditions : a case-study using Generator Itemset Mining
Item metadata
dc.contributor.author | Kocak, Gokberk | |
dc.contributor.author | Akgün, Özgür | |
dc.contributor.author | Miguel, Ian | |
dc.contributor.author | Guns, Tias | |
dc.date.accessioned | 2020-04-22T14:30:05Z | |
dc.date.available | 2020-04-22T14:30:05Z | |
dc.date.issued | 2019-09-30 | |
dc.identifier | 261443873 | |
dc.identifier | e7497498-8ec5-40ba-b669-443ad10422b3 | |
dc.identifier.citation | Kocak , G , Akgün , Ö , Miguel , I & Guns , T 2019 , Towards improving solution dominance with incomparability conditions : a case-study using Generator Itemset Mining . in The 18th workshop on Constraint Modelling and Reformulation (ModRef 2019), Proceedings . 25th International Conference on Principles and Practice of Constraint Programming (CP 2019) , Stamford , Connecticut , United States , 30/09/19 . < https://arxiv.org/abs/1910.00505 > | en |
dc.identifier.citation | conference | en |
dc.identifier.other | ORCID: /0000-0001-9519-938X/work/62668407 | |
dc.identifier.other | ORCID: /0000-0002-6317-0141/work/62668486 | |
dc.identifier.other | ORCID: /0000-0002-6930-2686/work/68281423 | |
dc.identifier.uri | https://hdl.handle.net/10023/19839 | |
dc.description | Funding: EPSRC (EP/P015638/1). | en |
dc.description.abstract | Finding interesting patterns is a challenging task in data mining. Constraint based mining is a well-known approach to this, and one for which constraint programming has been shown to be a well-suited and generic framework. Dominance programming has been proposed as an extension that can capture an even wider class of constraint-based mining problems, by allowing to compare relations between patterns. In this paper, in addition to specifying a dominance relation, we introduce the ability to specify an incomparability condition. Using these two concepts we devise a generic framework that can do a batch-wise search that avoids checking incomparable solutions. We extend the ESSENCE language and underlying modelling pipeline to support this. We use generator itemset mining problem as a test case and give a declarative specification for that. We also present preliminary experimental results on this specific problem class with a CP solver backend to show that using the incomparability condition during search can improve the efficiency of dominance programming and reduces the need for post-processing to filter dominated solutions. | |
dc.format.extent | 14 | |
dc.format.extent | 282659 | |
dc.language.iso | eng | |
dc.relation.ispartof | The 18th workshop on Constraint Modelling and Reformulation (ModRef 2019), Proceedings | en |
dc.subject | Constraint programming | en |
dc.subject | Constraint modelling | en |
dc.subject | Data mining | en |
dc.subject | Itemset mining | en |
dc.subject | Pattern mining | en |
dc.subject | Dominance programming | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | ZA4050 Electronic information resources | en |
dc.subject | 3rd-DAS | en |
dc.subject.lcc | QA75 | en |
dc.subject.lcc | ZA4050 | en |
dc.title | Towards improving solution dominance with incomparability conditions : a case-study using Generator Itemset Mining | en |
dc.type | Conference item | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.url | https://modref.github.io/ModRef2019 | en |
dc.identifier.url | https://arxiv.org/abs/1910.00505 | en |
dc.identifier.url | https://modref.github.io/papers/ModRef2019_Towards%20Improving%20Solution%20Dominance%20with%20Incomparability%20Conditions%20A%20case-study%20using%20Generator%20Itemset%20Mining.pdf | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.