 A Method for Aggregating Ranked Services for Personal Preference Based SelectionKenneth K. Fletcher
International Journal of Web Services Research (IJWSR), 2019, vol. 16, issue 2, 1-23 Abstract: Typically, users' service requests, which are similar with varying preferences on non-functional attributes, may result in ranked lists of services that partially meet their needs due to conflicting non-functional attributes. The resultant multiple ranked lists of services that partially satisfies the user's request makes it challenging for the user to choose an optimal service, based on his/her preference. This work proposes a method that aggregates multiple ranked lists of services into a single aggregated ranked list, where top ranked services are selected for the user. Two algorithms are proposed; 1) Rank Aggregation for Complete Lists (RACoL), that aggregates complete ranked lists and 2) Rank Aggregation for Incomplete Lists (RAIL) to aggregate incomplete ranked lists. Examples using real-world airline services to evaluate both algorithms show that the results from both proposed algorithms closely represent the sets of ranked lists better than using alternative approaches. Experiments were also carried out to validate their performance. Date: 2019 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:igg:jwsr00:v:16:y:2019:i:2:p:1-23 Access Statistics for this article International Journal of Web Services Research (IJWSR) is currently edited by Liang-Jie Zhang More articles in International Journal of Web Services Research (IJWSR) from IGI Global |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.