{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:25:43Z","timestamp":1740115543427,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"abstract":"<jats:p>Given multiple user-input rank lists, rank aggregation or combining the rankings to obtain a consensus (joint ordering) provides an interesting and classical domain of research, pertinent to applications across information retrieval, natural language processing, web search, etc. Efficient computation of such joint ranking poses a challenging task as optimal rank aggregation based on the Kemeny measure has been shown to be NP-hard.<\/jats:p>","DOI":"10.3233\/978-1-61499-589-0-37","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T12:06:08Z","timestamp":1740053168000},"source":"Crossref","is-referenced-by-count":0,"title":["Unsupervised Rank Aggregation using Hierarchical User Similarity Clustering"],"prefix":"10.3233","author":[{"family":"Dutta Sourav","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Thirteenth Scandinavian Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T12:42:07Z","timestamp":1740055327000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISBN&isbn=978-1-61499-588-3&spage=37&doi=10.3233\/978-1-61499-589-0-37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-589-0-37","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2015]]}}}