{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:15:06Z","timestamp":1746591306244,"version":"3.40.5"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030461492"},{"type":"electronic","value":"9783030461508"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-46150-8_11","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T01:02:40Z","timestamp":1588294960000},"page":"173-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons"],"prefix":"10.1007","author":[{"given":"Sungjin","family":"Im","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahshid","family":"Montazer Qaem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"11_CR1","unstructured":"Aboud, A.: Correlation clustering with penalties and approximating the reordering buffer management problem. Master\u2019s thesis. The Technion Israel Institute of Technology (2008)"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s00453-008-9211-1","volume":"57","author":"N Ailon","year":"2010","unstructured":"Ailon, N.: Aggregation of partial rankings, p-ratings and top-m lists. Algorithmica 57(2), 284\u2013300 (2010)","journal-title":"Algorithmica"},{"issue":"5","key":"11_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 23 (2008)","journal-title":"J. ACM"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Altman, A., Tennenholtz, M.: Ranking systems: the pagerank axioms. In: ACM EC (2005)","DOI":"10.1145\/1064009.1064010"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Ammar, A., Shah, D.: Ranking: Compare, don\u2019t score. In: IEEE Allerton (2011)","DOI":"10.1109\/Allerton.2011.6120246"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: ACM STOC, pp. 574\u2013583 (2014)","DOI":"10.1145\/2591796.2591805"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s101070100271","volume":"92","author":"S Arora","year":"2002","unstructured":"Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math Program. 92(1), 1\u201336 (2002)","journal-title":"Math Program."},{"issue":"3\/4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"324","DOI":"10.2307\/2334029","volume":"39","author":"RA Bradley","year":"1952","unstructured":"Bradley, R.A., Terry, M.E.: Rank analysis of incomplete block designs: I. the method of paired comparisons. Biometrika 39(3\/4), 324\u2013345 (1952)","journal-title":"Biometrika"},{"key":"11_CR9","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: ACM-SIAM SODA (2001)"},{"key":"11_CR10","unstructured":"Chen, K.: A constant factor approximation algorithm for k-median clustering with outliers. In: ACM-SIAM SODA (2008)"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/1798596.1798608","volume":"6","author":"D Coppersmith","year":"2010","unstructured":"Coppersmith, D., Fleischer, L.K., Rurda, A.: Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Trans. Algorithms 6(3), 55 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"11_CR12","unstructured":"Duchi, J.C., Mackey, L.W., Jordan, M.I.: On the consistency of ranking algorithms. In: ICML, pp. 327\u2013334 (2010)"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G Even","year":"1998","unstructured":"Even, G., (Seffi) Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2), 151\u2013174 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A Frieze","year":"1999","unstructured":"Frieze, A., Kannan, R.: Quick approximation to matrices and applications. Combinatorica 19(2), 175\u2013220 (1999)","journal-title":"Combinatorica"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Guha, S., Li, Y., Zhang, Q.: Distributed partial clustering. In: ACM SPAA (2017)","DOI":"10.1145\/3087556.3087568"},{"issue":"7","key":"11_CR16","first-page":"757","volume":"10","author":"S Gupta","year":"2017","unstructured":"Gupta, S., Kumar, R., Lu, K., Moseley, B., Vassilvitskii, S.: Local search methods for k-means with outliers. PVLDB 10(7), 757\u2013768 (2017)","journal-title":"PVLDB"},{"issue":"4","key":"11_CR17","first-page":"577","volume":"88","author":"JG Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus 88(4), 577\u2013591 (1959)","journal-title":"Daedalus"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: ACM STOC (2007)","DOI":"10.1145\/1250790.1250806"},{"key":"11_CR19","unstructured":"Lu, T., Boutilier, C.: Learning mallows models with pairwise preferences. In: ICML (2011)"},{"key":"11_CR20","volume-title":"Individual Choice Behavior a Theoretical Analysis","author":"RD Luce","year":"1959","unstructured":"Luce, R.D.: Individual Choice Behavior a Theoretical Analysis. Wiley, Hoboken (1959)"},{"key":"11_CR21","unstructured":"Malkomes, G., Kusner, M.J., Chen, W., Weinberger, K.Q., Moseley, B.: Fast distributed k-center clustering with outliers on massive data. In: NIPS (2015)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Muller, E., S\u00e1nchez, P.I., Mulle, Y., Bohm, K.: Ranking outlier nodes in subspaces of attributed graphs. In: IEEE ICDEW (2013)","DOI":"10.1109\/ICDEW.2013.6547453"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.2016.1534","volume":"65","author":"S Negahban","year":"2016","unstructured":"Negahban, S., Oh, S., Shah, D.: Rank centrality: ranking from pairwise comparisons. Oper. Res. 65(1), 266\u2013287 (2016)","journal-title":"Oper. Res."},{"key":"11_CR24","unstructured":"Rajkumar, A., Agarwal, S.: A statistical convergence perspective of algorithms for rank aggregation from pairwise data. In: ICML (2014)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-77918-6_21","volume-title":"Approximation and Online Algorithms","author":"A van Zuylen","year":"2008","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 260\u2013273. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77918-6_21"},{"key":"11_CR26","unstructured":"Wauthier, F., Jordan, M., Jojic, N.: Efficient ranking from pairwise comparisons. In: ICML (2013)"},{"key":"11_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46150-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T09:24:46Z","timestamp":1746523486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46150-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461492","9783030461508"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46150-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"733","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"130","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.04","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}