乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T18:20:31Z","timestamp":1732040431981},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100011698","name":"Junta de Comunidades de Castilla-La Mancha","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011698","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011033","name":"Gobierno de Espana Agencia Estatal de Investigacion","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1016\/j.ins.2021.04.034","type":"journal-article","created":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T00:13:38Z","timestamp":1618964018000},"page":"144-171","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"special_numbering":"C","title":["A highly scalable algorithm for weak rankings aggregation"],"prefix":"10.1016","volume":"570","author":[{"given":"Juan A.","family":"Aledo","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 A.","family":"G\u00e1mez","sequence":"additional","affiliation":[]},{"given":"Alejandro","family":"Rosete","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2021.04.034_b0005","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1016\/j.amc.2013.07.081","article-title":"Tackling the rank aggregation problem with evolutionary algorithms","volume":"222","author":"Aledo","year":"2013","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ins.2021.04.034_b0010","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.amc.2016.06.005","article-title":"Using extension sets to aggregate partial rankings in a flexible setting","volume":"290","author":"Aledo","year":"2016","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ins.2021.04.034_b0015","doi-asserted-by":"crossref","unstructured":"J.A. Aledo, J.A. G\u00e1mez, D. Molina, A. Rosete, FSS-OBOP: feature subset selection guided by a bucket order consensus ranking, in: 2016 IEEE Symposium Series on Computational Intelligence, SSCI, 2016, pp. 1\u20138.","DOI":"10.1109\/SSCI.2016.7849924"},{"issue":"7","key":"10.1016\/j.ins.2021.04.034_b0020","first-page":"936","article-title":"Consensus-based journal rankings: a complementary tool for bibliometric evaluation","volume":"69","author":"Aledo","year":"2018","journal-title":"JASIST"},{"key":"10.1016\/j.ins.2021.04.034_b0025","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.dss.2017.03.006","article-title":"Utopia in the solution of the bucket order problem","volume":"97","author":"Aledo","year":"2017","journal-title":"Decis. Support Syst."},{"issue":"3","key":"10.1016\/j.ins.2021.04.034_b0030","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1016\/j.ejor.2018.04.031","article-title":"Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem","volume":"270","author":"Aledo","year":"2018","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.ins.2021.04.034_b0035","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.mathsocsci.2011.08.008","article-title":"Experiments with Kemeny ranking: What works when?","volume":"64","author":"Ali","year":"2012","journal-title":"Math. Social Sci."},{"issue":"2","key":"10.1016\/j.ins.2021.04.034_b0040","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.ejor.2015.08.048","article-title":"Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach","volume":"249","author":"Amodio","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.ins.2021.04.034_b0045","series-title":"Social Choice and Individual Values","author":"Arrow","year":"1951"},{"issue":"1","key":"10.1016\/j.ins.2021.04.034_b0050","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1002\/sta4.132","article-title":"Time-varying rankings with the bayesian mallows model","volume":"6","author":"Asfaw","year":"2017","journal-title":"Stat"},{"issue":"4","key":"10.1016\/j.ins.2021.04.034_b0055","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s003550050123","article-title":"The number of weak orderings of a finite set","volume":"15","author":"Bailey","year":"1998","journal-title":"Soc. Choice Welfare"},{"issue":"1","key":"10.1016\/j.ins.2021.04.034_b0060","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","article-title":"Correlation clustering","volume":"56","author":"Bansal","year":"2004","journal-title":"Mach. Learn."},{"issue":"5","key":"10.1016\/j.ins.2021.04.034_b0065","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s10458-013-9236-y","article-title":"Theoretical and empirical evaluation of data reduction for exact kemeny rank aggregation","volume":"28","author":"Betzler","year":"2014","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"10.1016\/j.ins.2021.04.034_b0070","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.csda.2012.08.008","article-title":"A generative model for rank data based on insertion sort algorithm","volume":"58","author":"Biernacki","year":"2013","journal-title":"Comput. Stat. Data Anal."},{"issue":"3","key":"10.1016\/j.ins.2021.04.034_b0075","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in combinatorial optimization: Overview and conceptual comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10.1016\/j.ins.2021.04.034_b0080","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s13748-011-0005-3","article-title":"A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems","volume":"1","author":"Ceberio","year":"2012","journal-title":"Prog. Artif. Intell."},{"issue":"2","key":"10.1016\/j.ins.2021.04.034_b0085","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/TEVC.2013.2260548","article-title":"A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem","volume":"18","author":"Ceberio","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10.1016\/j.ins.2021.04.034_b0090","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/j.dss.2009.12.003","article-title":"An approach to group ranking decisions in a dynamic environment","volume":"48","author":"Chen","year":"2010","journal-title":"Decis. Support Syst."},{"key":"10.1016\/j.ins.2021.04.034_b0095","doi-asserted-by":"crossref","unstructured":"W. Cheng, J. H\u00fchn, E. H\u00fcllermeier, Decision tree and instance-based learning for label ranking, in: Proceedings of the 26th Annual International Conference on Machine Learning, ICML \u201909, ACM, 2009, pp. 161\u2013168.","DOI":"10.1145\/1553374.1553395"},{"issue":"1","key":"10.1016\/j.ins.2021.04.034_b0100","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.dss.2010.12.012","article-title":"Emphasizing the rank positions in a distance-based aggregation procedure","volume":"51","author":"Contreras","year":"2011","journal-title":"Decis. Support Syst."},{"issue":"2","key":"10.1016\/j.ins.2021.04.034_b0105","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ejor.2005.03.048","article-title":"Distance-based and ad hoc consensus models in ordinal preference ranking","volume":"172","author":"Cook","year":"2006","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.ins.2021.04.034_b0110","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1051\/ro\/1986200201151","article-title":"An axiomatic approach to distance on partial orderings","volume":"20","author":"Cook","year":"1986","journal-title":"RAIRO-Oper. Res."},{"issue":"3","key":"10.1016\/j.ins.2021.04.034_b0115","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1007\/s11336-016-9505-1","article-title":"A recursive partitioning method for the prediction of preference rankings based upon kemeny distances","volume":"81","author":"D\u2019Ambrosio","year":"2016","journal-title":"Psychometrika"},{"key":"10.1016\/j.ins.2021.04.034_b0120","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.cor.2017.01.017","article-title":"A differential evolution algorithm for finding the median ranking under the kemeny axiomatic approach","volume":"82","author":"D\u2019Ambrosio","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"507","key":"10.1016\/j.ins.2021.04.034_b0125","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1080\/01621459.2013.878660","article-title":"Bayesian aggregation of order-based rank data","volume":"109","author":"Deng","year":"2014","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.ins.2021.04.034_b0130","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.ins.2018.04.041","article-title":"A new hierarchical ranking aggregation method","volume":"453","author":"Ding","year":"2018","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2021.04.034_b0135","doi-asserted-by":"crossref","unstructured":"C. Dwork, R. Kumar, M. Naor, D. Sivakumar, Rank aggregation methods for the web, in: Proceedings of the 10th International Conference on World Wide Web, WWW \u201901, ACM, 2001, pp. 613\u2013622","DOI":"10.1145\/371920.372165"},{"issue":"2","key":"10.1016\/j.ins.2021.04.034_b0140","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00355-011-0603-9","article-title":"The original Borda count and partial voting","volume":"40","author":"Emerson","year":"2013","journal-title":"Soc. Choice Welfare"},{"key":"10.1016\/j.ins.2021.04.034_b0145","doi-asserted-by":"crossref","unstructured":"R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, E. Vee, Comparing and aggregating rankings with ties, in: Proceedings of the Twenty-third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2004, pp. 47\u201358.","DOI":"10.1145\/1055558.1055568"},{"key":"10.1016\/j.ins.2021.04.034_b0150","doi-asserted-by":"crossref","unstructured":"J. Feng, Q. Fang, W. Ng, Discovering bucket orders from full rankings, in: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, ACM, 2008, pp. 55\u201366","DOI":"10.1145\/1376616.1376625"},{"issue":"2","key":"10.1016\/j.ins.2021.04.034_b0155","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1666\/04087.1","article-title":"Spectral ordering and biochronology of european fossil mammals","volume":"32","author":"Fortelius","year":"2006","journal-title":"Paleobiology"},{"key":"10.1016\/j.ins.2021.04.034_b0160","series-title":"Preference Learning","year":"2010"},{"key":"10.1016\/j.ins.2021.04.034_b0165","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ins.2018.11.039","article-title":"pRankAggreg: a fast clustering based partial rank aggregation","volume":"478","author":"Gao","year":"2019","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.ins.2021.04.034_b0170","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s11590-016-1047-z","article-title":"Rank aggregation in cyclic sequences","volume":"11","author":"Garc\u00eda-Nov\u00e9","year":"2017","journal-title":"Optim. Lett."},{"issue":"1","key":"10.1016\/j.ins.2021.04.034_b0175","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10479-005-3971-7","article-title":"Metaheuristics in combinatorial optimization","volume":"140","author":"Gendreau","year":"2005","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.ins.2021.04.034_b0180","series-title":"Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD \u201906","first-page":"561","article-title":"Algorithms for discovering bucket orders from data","author":"Gionis","year":"2006"},{"issue":"498","key":"10.1016\/j.ins.2021.04.034_b0185","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1080\/01621459.2012.682539","article-title":"Moderate-deviation-based inference for random degeneration in paired rank lists","volume":"107","author":"Hall","year":"2012","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.ins.2021.04.034_b0190","series-title":"Mathematical Models in the Social Sciences","author":"Kemeny","year":"1962"},{"key":"10.1016\/j.ins.2021.04.034_b0195","series-title":"Proceedings of the 2011 SIAM International Conference on Data Mining","first-page":"872","article-title":"On discovering bucket orders from preference data","author":"Kenkre","year":"2011"},{"issue":"5","key":"10.1016\/j.ins.2021.04.034_b0200","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1002\/wics.111","article-title":"Rank aggregation methods","volume":"2","author":"Lin","year":"2010","journal-title":"Wiley Interdisc. Rev.: Comput. Stat."},{"key":"10.1016\/j.ins.2021.04.034_b0205","series-title":"Handbook of Metaheuristics","first-page":"363","article-title":"Iterated local search: framework and applications","author":"Louren\u00e7o","year":"2010"},{"key":"10.1016\/j.ins.2021.04.034_b0210","unstructured":"Y. Lu, Implementing an empirical study of rank aggregation approaches based on real world instances, CoRR abs\/1402.5259 (2014) 1\u201310."},{"key":"10.1016\/j.ins.2021.04.034_b0215","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ins.2016.12.037","article-title":"Multiobjective pso-based rank aggregation: application in gene ranking from microarray data","volume":"385\u2013386","author":"Mandal","year":"2017","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2021.04.034_b0220","series-title":"Proceedings of the 3rd Conference on Algorithmic Decision Theory","first-page":"259","article-title":"Preflib: a library for preferences (http:\/\/www.preflib.org)","author":"Mattei","year":"2013"},{"key":"10.1016\/j.ins.2021.04.034_b0225","unstructured":"S. Najdi, A.A. Gharbali, J.M. Fonseca, Feature ranking and rank aggregation for automatic sleep stage classification: a comparative study, Biomed. Eng. Inline 16 (Suppl. 1) (78) (2017) 1\u201319."},{"key":"10.1016\/j.ins.2021.04.034_b0230","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.asoc.2016.01.053","article-title":"Prototypes construction from partial rankings to characterize the attractiveness of companies in Belgium","volume":"42","author":"Napoles","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.ins.2021.04.034_b0235","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.csda.2017.05.010","article-title":"A novel method for estimating the common signals for consensus across multiple ranked lists","volume":"115","author":"Svendova","year":"2017","journal-title":"Comput. Stat. Data Anal."},{"issue":"7","key":"10.1016\/j.ins.2021.04.034_b0240","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ipl.2008.12.003","article-title":"A randomized approximation algorithm for computing bucket orders","volume":"109","author":"Ukkonen","year":"2009","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10.1016\/j.ins.2021.04.034_b0245","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0135023","article-title":"A consistent extension of condorcet\u2019s election principle","volume":"35","author":"Young","year":"1978","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"10.1016\/j.ins.2021.04.034_b0250","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.2307\/1961757","article-title":"Condorcet\u2019s theory of voting","volume":"82","author":"Young","year":"1988","journal-title":"Am. Polit. Sci. Rev."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025521003613?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025521003613?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T12:29:35Z","timestamp":1698928175000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025521003613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":50,"alternative-id":["S0020025521003613"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2021.04.034","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A highly scalable algorithm for weak rankings aggregation","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2021.04.034","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 The Authors. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}