{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T07:33:32Z","timestamp":1765438412055},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T00:00:00Z","timestamp":1426291200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10618-015-0406-1","type":"journal-article","created":{"date-parts":[[2015,3,13]],"date-time":"2015-03-13T10:21:07Z","timestamp":1426242067000},"page":"1233-1257","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Beyond rankings: comparing directed acyclic graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Eric","family":"Malmi","sequence":"first","affiliation":[]},{"given":"Nikolaj","family":"Tatti","sequence":"additional","affiliation":[]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,14]]},"reference":[{"issue":"2","key":"406_CR1","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/s00453-008-9211-1","volume":"57","author":"N Ailon","year":"2010","unstructured":"Ailon N (2010) Aggregation of partial rankings, p-ratings and top- $$m$$ m lists. Algorithmica 57(2):284\u2013300","journal-title":"Algorithmica"},{"issue":"5","key":"406_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon N, Charikar M, Newman A (2008) Aggregating inconsistent information: ranking and clustering. J ACM 55(5):23","journal-title":"J ACM"},{"key":"406_CR3","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos A, Kumar R, Mahdian M (2008) Influence and correlation in social networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining. pp 7\u201315","DOI":"10.1145\/1401890.1401897"},{"key":"406_CR4","doi-asserted-by":"crossref","unstructured":"Barbieri N, Bonchi F, Manco G (2013) Cascade-based community detection. In: Proceedings of the sixth ACM international conference on Web search and data mining. pp 33\u201342","DOI":"10.1145\/2433396.2433403"},{"key":"406_CR5","unstructured":"Bender MA, Fineman JT, Gilbert S, Tarjan RE (2011) A new approach to incremental cycle detection and related problems. arXiv:1112.0784"},{"key":"406_CR6","unstructured":"Borda J (1781) M\u00e9moire sur les \u00e9lections au scrutin. Histoire de l\u2019Acad\u00e9mie Royale des Sciences"},{"key":"406_CR7","doi-asserted-by":"crossref","unstructured":"Brandenburg F, Glei\u00dfner A, Hofmeier A (2012) Comparing and aggregating partial orders with Kendall tau distances. In: WALCOM: algorithms and computation. Lecture notes in computer science, vol 7157. Springer Berlin Heidelberg, pp 88\u201399","DOI":"10.1007\/978-3-642-28076-4_11"},{"issue":"2","key":"406_CR8","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/s10878-012-9467-x","volume":"26","author":"F Brandenburg","year":"2013","unstructured":"Brandenburg F, Glei\u00dfner A, Hofmeier A (2013) The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders. J Comb Optim 26(2):310\u2013332","journal-title":"J Comb Optim"},{"issue":"3","key":"406_CR9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke H, Shearer K (1998) A graph distance metric based on the maximal common subgraph. Pattern Recognit Lett 19(3):255\u2013259","journal-title":"Pattern Recognit Lett"},{"issue":"1","key":"406_CR10","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439\u2013485","journal-title":"Ann Math"},{"key":"406_CR11","doi-asserted-by":"crossref","unstructured":"Dwork C, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the web. In: Proceedings of the 10th international conference on World Wide Web. pp 613\u2013622","DOI":"10.1145\/371920.372165"},{"key":"406_CR12","doi-asserted-by":"crossref","unstructured":"Even G, Naor J, Schieber B, Sudan M (1995) Approximating minimum feedback sets and multi-cuts in directed graphs. In: Proceedings of the 4th international conference on integer programming and combinatorial optimization. pp 14\u201328","DOI":"10.1007\/3-540-59408-6_38"},{"issue":"3","key":"406_CR13","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1137\/05063088X","volume":"20","author":"R Fagin","year":"2006","unstructured":"Fagin R, Kumar R, Mahdian M, Sivakumar D, Vee E (2006) Comparing partial rankings. SIAM J Discrete Math 20(3):628\u2013648","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"406_CR14","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"R Fagin","year":"2003","unstructured":"Fagin R, Kumar R, Sivakumar D (2003) Comparing top- $$k$$ k lists. SIAM J Discrete Math 17(1):134\u2013160","journal-title":"SIAM J Discrete Math"},{"issue":"4","key":"406_CR15","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1214\/aos\/1176344722","volume":"7","author":"JH Friedman","year":"1979","unstructured":"Friedman JH, Rafsky LC (1979) Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests. Ann Stat 7(4):697\u2013717","journal-title":"Ann Stat"},{"key":"406_CR16","unstructured":"Gomez-Rodriguez M, Balduzzi D, Sch\u00f6lkopf B (2011) Uncovering the temporal dynamics of diffusion networks. In: Proceedings of the 28th international conference on machine learning. pp 561\u2013568"},{"issue":"4","key":"406_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/2086737.2086741","volume":"5","author":"M Gomez-Rodriguez","year":"2012","unstructured":"Gomez-Rodriguez M, Leskovec J, Krause A (2012) Inferring networks of diffusion and influence. ACM Trans Knowl Discov Data 5(4):21","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"338","key":"406_CR18","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1080\/01621459.1972.10482401","volume":"67","author":"LA Goodman","year":"1972","unstructured":"Goodman LA, Kruskal WH (1972) Measures of association for cross classifications, iv: simplification of asymptotic variances. J Am Stat Assoc 67(338):415\u2013421","journal-title":"J Am Stat Assoc"},{"key":"406_CR19","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LVS (2008) Discovering leaders from community actions. In: Proceedings of the 17th ACM conference on information and knowledge management. pp 499\u2013508","DOI":"10.1145\/1458082.1458149"},{"key":"406_CR20","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LVS (2010) Learning influence probabilities in social networks. In: Proceedings of the third ACM international conference on Web search and data mining. pp 241\u2013250","DOI":"10.1145\/1718487.1718518"},{"issue":"1","key":"406_CR21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193\u2013218","journal-title":"J Classif"},{"issue":"10","key":"406_CR22","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X Jiang","year":"2001","unstructured":"Jiang X, Munger A, Bunke H (2001) An median graphs: properties, algorithms, and applications. IEEE Trans Pattern Anal Mach Intell 23(10):1144\u20131151","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"406_CR23","unstructured":"Kann V (1992) On the approximability of np-complete optimization problems. Ph.D. thesis, KTH"},{"key":"406_CR24","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations. Springer, New York","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"406_CR25","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining. pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"406_CR26","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","volume":"30","author":"M Kendall","year":"1938","unstructured":"Kendall M (1938) A new measure of rank correlation. Biometrika 30:81\u201393","journal-title":"Biometrika"},{"key":"406_CR27","volume-title":"Rank correlation methods","author":"M Kendall","year":"1976","unstructured":"Kendall M (1976) Rank correlation methods, 4th edn. Hodder Arnold, London","edition":"4"},{"key":"406_CR28","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu C, Schudy W (2007) How to rank with few errors. In: Proceedings of the 39th annual ACM symposium on theory of computing. pp 95\u2013103","DOI":"10.1145\/1250790.1250806"},{"key":"406_CR29","unstructured":"Laming D (2003) Human judgment: the eye of the beholder. Cengage Learning EMEA"},{"key":"406_CR30","doi-asserted-by":"crossref","unstructured":"Macchia L, Bonchi F, Gullo F, Chiarandini L (2013) Mining summaries of propagations. In: Proceedings of the 13th IEEE international conference on data mining. pp 498\u2013507","DOI":"10.1109\/ICDM.2013.163"},{"key":"406_CR31","volume-title":"Analyzing and modeling rank data","author":"JI Madden","year":"1995","unstructured":"Madden JI (1995) Analyzing and modeling rank data. Chapman & Hall, London"},{"issue":"3\u20134","key":"406_CR32","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/S0167-9473(02)00165-2","volume":"41","author":"TB Murphy","year":"2003","unstructured":"Murphy TB, Martin D (2003) Mixtures of distance-based models for ranking data. Comp Stat Data Anal 41(3\u20134):645\u2013655","journal-title":"Comp Stat Data Anal"},{"key":"406_CR33","doi-asserted-by":"crossref","unstructured":"Saito K, Nakano R, Kimura M (2008) Prediction of information diffusion probabilities for independent cascade model. In: Knowledge-based intelligent information and engineering systems. pp 67\u201375","DOI":"10.1007\/978-3-540-85567-5_9"},{"key":"406_CR34","unstructured":"Su H, Gionis A, Rousu J (2014) Structured prediction of network response. In: Proceedings of the 31st international conference on machine learning. pp 442\u2013450"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0406-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-015-0406-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0406-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:29:46Z","timestamp":1559244586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-015-0406-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,14]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["406"],"URL":"https:\/\/doi.org\/10.1007\/s10618-015-0406-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,14]]}}}