{"id":"https://openalex.org/W2240561375","doi":"https://doi.org/10.1109/icdm.2015.12","title":"Hierarchies in Directed Networks","display_name":"Hierarchies in Directed Networks","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W2240561375","doi":"https://doi.org/10.1109/icdm.2015.12","mag":"2240561375"},"language":"en","primary_location":{"id":"doi:10.1109/icdm.2015.12","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2015.12","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067444605","display_name":"Nikolaj Tatti","orcid":"https://orcid.org/0000-0002-2087-5360"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Nikolaj Tatti","raw_affiliation_strings":["HlIT, Aalto University, Espoo, Finland"],"affiliations":[{"raw_affiliation_string":"HlIT, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067444605"],"corresponding_institution_ids":["https://openalex.org/I9927081"],"apc_list":null,"apc_paid":null,"fwci":1.9087,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.86025244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"30","issue":null,"first_page":"991","last_page":"996"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6608774065971375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5325602293014526},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5187235474586487},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4486255943775177},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4416045844554901},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4412408173084259},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4228525757789612},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4153950810432434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4002886712551117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37333035469055176},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3484060764312744},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34563764929771423},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31267204880714417},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12943387031555176}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6608774065971375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5325602293014526},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5187235474586487},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4486255943775177},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4416045844554901},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4412408173084259},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4228525757789612},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4153950810432434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4002886712551117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37333035469055176},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3484060764312744},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34563764929771423},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31267204880714417},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12943387031555176},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icdm.2015.12","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2015.12","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W180666578","https://openalex.org/W1597864774","https://openalex.org/W2011039300","https://openalex.org/W2017967162","https://openalex.org/W2053913299","https://openalex.org/W2057685268","https://openalex.org/W2069323107","https://openalex.org/W2070745908","https://openalex.org/W2121009082","https://openalex.org/W2122062324","https://openalex.org/W2126112131","https://openalex.org/W2131689821","https://openalex.org/W2135940835","https://openalex.org/W2143698439","https://openalex.org/W2149342630","https://openalex.org/W2156036190","https://openalex.org/W6607356515","https://openalex.org/W6679897980"],"related_works":["https://openalex.org/W2365264209","https://openalex.org/W2509431957","https://openalex.org/W2026999166","https://openalex.org/W1599954583","https://openalex.org/W4211007821","https://openalex.org/W2802395037","https://openalex.org/W4389565704","https://openalex.org/W1996802783","https://openalex.org/W3207031006","https://openalex.org/W1976216854"],"abstract_inverted_index":{"Interactions":[0],"in":[1,42,83,127,196,215],"many":[2],"real-world":[3],"phenomena":[4],"can":[5,48,75,119,165,201,212],"be":[6,49,120,166],"explained":[7],"by":[8,179],"a":[9,40,53],"stronghierarchical":[10],"structure.":[11],"Typically,":[12],"this":[13,130,193],"structure":[14],"or":[15],"ranking":[16],"is":[17,32,80,102,108,195,234],"not":[18],"known,":[19],"instead":[20],"we":[21,85,132,200,208,211,226],"only":[22,64],"have":[23,86],"observed":[24],"outcomes":[25],"of":[26,45,113,152,174,183],"the":[27,30,34,43,78,95,111,114,139,150,181,186,224],"interactions,":[28],"and":[29,124,144,199],"goal":[31],"toinfer":[33],"hierarchy":[35,41],"from":[36,66],"these":[37,155],"observations.":[38],"Discovering":[39],"context":[44],"directed":[46],"networks":[47],"formulated":[50],"asfollows:":[51],"given":[52],"graph,":[54],"partition":[55],"vertices":[56],"into":[57],"levels":[58,68],"such":[59,100],"that,":[60],"ideally,":[61],"there":[62],"are":[63],"edges":[65,93],"upper":[67],"to":[69,87,135,185,222],"lower":[70],"levels.":[71,153],"The":[72],"ideal":[73],"case":[74],"onlyhappen":[76],"if":[77],"graph":[79],"acyclic.":[81],"Consequently,":[82],"practice":[84],"introducea":[88],"penalty":[89,101,233],"function":[90],"that":[91,148,192,210,228],"penalizes":[92],"violating":[94,106],"hierarchy.":[96],"A":[97],"practicalvariant":[98],"for":[99,141,217],"agony,":[103],"where":[104],"each":[105],"edge":[107],"penalized":[109],"basedon":[110],"severity":[112],"violation.":[115],"Hierarchy":[116],"minimizing":[117],"agony":[118,184,203,214],"discoveredin":[121],"O(m^2)":[122],"time,":[123],"much":[125],"faster":[126],"practice.":[128],"In":[129,206],"paper":[131],"introduce":[133],"severalextensions":[134],"agony.":[136],"We":[137,169],"extend":[138],"definition":[140],"weighted":[142],"graphs":[143],"allow":[145],"acardinality":[146],"constraint":[147],"limits":[149],"number":[151],"While,":[154],"areconceptually":[156],"trivial":[157],"extensions,":[158],"current":[159],"algorithms":[160],"cannot":[161],"handle":[162],"them,":[163],"northey":[164],"easily":[167],"extended.":[168],"provide":[170],"an":[171,235],"exact":[172],"algorithm":[173],"O(m^2":[175],"log":[176],"n)":[177],"time":[178],"showing":[180],"connection":[182],"capacitated":[187],"circulation":[188],"problem.":[189,237],"Wealso":[190],"show":[191,209,227],"bound":[194],"fact":[197],"pessimistic":[198],"compute":[202,213],"forlarge":[204],"datasets.":[205],"addition,":[207],"polynomialtime":[216],"any":[218,231],"convex":[219],"penalty,":[220],"and,":[221],"complete":[223],"picture,":[225],"minimizinghierarchy":[229],"with":[230],"concave":[232],"NP-hard":[236]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}