Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/9231
DC FieldValueLanguage
dc.contributor.authorAgathokleous, Marilena-
dc.contributor.authorTsapatsoulis, Nicolas-
dc.contributor.authorDjouvas, Constantinos-
dc.contributor.otherΑγαθοκλέους, Μαριλένα-
dc.contributor.otherΤσαπατσούλης, Νικόλας-
dc.contributor.otherΤζιούβας, Κωνσταντίνος-
dc.date.accessioned2017-01-25T10:40:59Z-
dc.date.available2017-01-25T10:40:59Z-
dc.date.issued2016-09-
dc.identifier.citation2016 Joint Workshop on Interfaces and Human Decision Making for Recommender Systems, IntRS 2016; Boston; United States; 16 September 2016 through 19 September 2016en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14279/9231-
dc.description.abstractVoting Advice Applications (VAAs) are Web tools that inform citizens about the political stances of parties (and/or candidates) that participate in upcoming elections. The traditional process that they follow is to call the users and the parties to state their position in a set of policy statements, usually grouped into meaningful categories (e.g., external policy, economy, society, etc). Having the aforementioned information, VAA can provide recommendation to users regarding the proximity/distance that a user has to each participating party. A social recommendation approach of VAAs (so-called SVAAs) calculates the closeness between each party's devoted users and the current user and ranks parties according the estimated 'party users' - user similarity. In our paper we stand on this approach and we assume that 'typical' voters of particular parties can be characterized by answer patterns (sequences of choices for all policy statements included in the VAA) and that the answer choice in each policy statement can be 'predicted' from previous answer choices. Thus, we resort to Hidden Markov Models (HMMs), which are proved to be effective machine learning tools for sequential and correlated data. Based on the principles of collaborative filtering we try to model 'party users' using HMMs and then exploit these models to recommend each VAA user the party whose model best fits their answer pattern. For our experiments we use three datasets based on the 2014 elections to the European Parliament.en_US
dc.formatpdfen_US
dc.language.isoenen_US
dc.rights© 2016, CEUR-WS. All rights reserved.en_US
dc.subjectCollaborative filteringen_US
dc.subjectExpectation maximizationen_US
dc.subjectHidden Markov Modelsen_US
dc.subjectRecommender systemsen_US
dc.subjectVoting Advice Applicationsen_US
dc.titleEstimating party-user similarity in Voting Advice Applications using Hidden Markov Modelsen_US
dc.typeConference Papersen_US
dc.collaborationCyprus University of Technologyen_US
dc.subject.categoryElectrical Engineering - Electronic Engineering - Information Engineeringen_US
dc.countryCyprusen_US
dc.subject.fieldEngineering and Technologyen_US
dc.publicationPeer Revieweden_US
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_c94f-
item.openairetypeconferenceObject-
item.languageiso639-1en-
crisitem.author.deptDepartment of Communication and Internet Studies-
crisitem.author.deptDepartment of Communication and Marketing-
crisitem.author.deptDepartment of Communication and Internet Studies-
crisitem.author.facultyFaculty of Communication and Media Studies-
crisitem.author.facultyFaculty of Communication and Media Studies-
crisitem.author.facultyFaculty of Communication and Media Studies-
crisitem.author.orcid0000-0002-6739-8602-
crisitem.author.orcid0000-0003-1215-7294-
crisitem.author.parentorgFaculty of Communication and Media Studies-
crisitem.author.parentorgFaculty of Communication and Media Studies-
crisitem.author.parentorgFaculty of Communication and Media Studies-
Appears in Collections:Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation
CORE Recommender
Show simple item record

Page view(s) 50

448
Last Week
4
Last month
10
checked on May 12, 2024

Google ScholarTM

Check


Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.