Towards fast algorithms for the preference consistency problem based on hierarchical models

Simple item page
dc.contributor.authorGeorge, Anne-Marie
dc.contributor.authorWilson, Nic
dc.contributor.authorO'Sullivan, Barry
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2020-12-01T16:00:24Z
dc.date.available2020-12-01T16:00:24Z
dc.date.issued2016-07
dc.date.updated2020-11-04T13:15:00Z
dc.description.abstractIn this paper, we construct and compare algorithmic approaches to solve the Preference Consistency Problem for preference statements based on hierarchical models. Instances of this problem contain a set of preference statements that are direct comparisons (strict and non-strict) between some alternatives, and a set of evaluation functions by which all alternatives can be rated. An instance is consistent based on hierarchical preference models, if there exists an hierarchical model on the evaluation functions that induces an order relation on the alternatives by which all relations given by the preference statements are satisfied. Deciding if an instance is consistent is known to be NP-complete for hierarchical models. We develop three approaches to solve this decision problem. The first involves a Mixed Integer Linear Programming (MILP) formulation, the other two are recursive algorithms that are based on properties of the problem by which the search space can be pruned. Our experiments on synthetic data show that the recursive algorithms are faster than solving the MILP formulation and that the ratio between the running times increases extremely quickly.en
dc.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationGeorge, A.-M., Wilson, N. and O'Sullivan, B. (2016) 'Towards Fast Algorithms for the Preference Consistency Problem Based on Hierarchical Models', IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, New York, USA, 9-15 July, pp. 1081-1087. isbn: 978-1-57735-770-4en
dc.identifier.endpage1087en
dc.identifier.isbn978-1-57735-770-4
dc.identifier.isbn978-1-57735-771-1
dc.identifier.startpage1081en
dc.identifier.urihttps://hdl.handle.net/10468/10798
dc.language.isoenen
dc.publisherAAAI Press / International Joint Conferences on Artificial Intelligenceen
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/en
dc.relation.urihttps://www.ijcai.org/Proceedings/2016
dc.rights© 2016 International Joint Conferences on Artificial Intelligenceen
dc.subjectAI technologyen
dc.subjectArtificial intelligence (AI)en
dc.subjectPreference inference techniquesen
dc.subjectPreference consistency problemen
dc.titleTowards fast algorithms for the preference consistency problem based on hierarchical modelsen
dc.typeConference itemen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
GeorgeWilsonOSullivan-IJCAI2016.pdf
Size:
247.41 KB
Format:
Adobe Portable Document Format
Description:
Accepted version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Conference Items
Insight Centre for Data Analytics - Conference Items