{"id":"https://openalex.org/W3174066147","doi":null,"title":"Building Information Filtering Networks with Topological Constraints: Algorithms and Applications","display_name":"Building Information Filtering Networks with Topological Constraints: Algorithms and Applications","publication_year":2020,"publication_date":"2020-12-28","ids":{"openalex":"https://openalex.org/W3174066147","mag":"3174066147"},"language":"en","primary_location":{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10118525","doi":null,"is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10118525/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Doctoral thesis, UCL (University College London).","raw_type":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5074070446","display_name":"Guido Previde Massara","orcid":"https://orcid.org/0000-0003-0502-2789","observed_orcids":["https://orcid.org/0000-0003-0502-2789"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Guido Previde Massara","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0502-2789","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5074070446"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9589999914169312,"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.9589999914169312,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.022700000554323196,"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.0026000000070780516,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/network-structure-learning","display_name":"network structure learning","score":0.7689999938011169},{"id":"https://openalex.org/keywords/sparse-networks","display_name":"sparse networks","score":0.7310000061988831},{"id":"https://openalex.org/keywords/simplicial-complex","display_name":"simplicial complexes","score":0.9160000085830688},{"id":"https://openalex.org/keywords/preferential-attachment","display_name":"preferential attachment","score":0.8169999718666077},{"id":"https://openalex.org/keywords/topological-constraints","display_name":"topological constraints","score":0.7409999966621399},{"id":"https://openalex.org/keywords/planar-networks","display_name":"planar networks","score":0.796999990940094},{"id":"https://openalex.org/keywords/chordal-graphs","display_name":"chordal graphs","score":0.5979999899864197},{"id":"https://openalex.org/keywords/network-filtering","display_name":"network filtering","score":0.3619999885559082},{"id":"https://openalex.org/keywords/weighted-graphs","display_name":"weighted graphs","score":0.4189999997615814}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6220396757125854},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5388495922088623},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.5182294845581055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4878568649291992},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48002734780311584},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.45406338572502136},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4135967493057251},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.378558486700058},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3452829122543335},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3363834321498871},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15702420473098755},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10118525","doi":null,"is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10118525/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Doctoral thesis, UCL (University College London).","raw_type":"Thesis"},{"id":"mag:3174066147","doi":null,"is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10118525/","pdf_url":null,"source":{"id":"https://openalex.org/S4306508231","display_name":"Doctoral thesis, UCL (University College London).","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Doctoral thesis, UCL (University College London).","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":78,"referenced_works":["https://openalex.org/W19838944","https://openalex.org/W114565888","https://openalex.org/W784404897","https://openalex.org/W1499349936","https://openalex.org/W1510822302","https://openalex.org/W1523985187","https://openalex.org/W1530964327","https://openalex.org/W1533368239","https://openalex.org/W1546874952","https://openalex.org/W1590183771","https://openalex.org/W1593793857","https://openalex.org/W1669131436","https://openalex.org/W1915374658","https://openalex.org/W1967087646","https://openalex.org/W1973221524","https://openalex.org/W1973793454","https://openalex.org/W1989681298","https://openalex.org/W1991566301","https://openalex.org/W2003265371","https://openalex.org/W2009582911","https://openalex.org/W2015296998","https://openalex.org/W2023206319","https://openalex.org/W2024773026","https://openalex.org/W2032841680","https://openalex.org/W2035331304","https://openalex.org/W2042297594","https://openalex.org/W2047028564","https://openalex.org/W2053015976","https://openalex.org/W2054358802","https://openalex.org/W2058815839","https://openalex.org/W2063698478","https://openalex.org/W2063982965","https://openalex.org/W2068738661","https://openalex.org/W2071391326","https://openalex.org/W2091455378","https://openalex.org/W2099741732","https://openalex.org/W2100732445","https://openalex.org/W2113700325","https://openalex.org/W2124101779","https://openalex.org/W2129564794","https://openalex.org/W2129899995","https://openalex.org/W2132555912","https://openalex.org/W2145544165","https://openalex.org/W2153624566","https://openalex.org/W2158598102","https://openalex.org/W2159245256","https://openalex.org/W2163166770","https://openalex.org/W2163352248","https://openalex.org/W2165408259","https://openalex.org/W2168819643","https://openalex.org/W2170202041","https://openalex.org/W2173134612","https://openalex.org/W2330192890","https://openalex.org/W2334279301","https://openalex.org/W2336797636","https://openalex.org/W2391304757","https://openalex.org/W2405938317","https://openalex.org/W2417308975","https://openalex.org/W2541919214","https://openalex.org/W2582550385","https://openalex.org/W2613416984","https://openalex.org/W2763558783","https://openalex.org/W2793160739","https://openalex.org/W2799073717","https://openalex.org/W2799799141","https://openalex.org/W2801225136","https://openalex.org/W2809476308","https://openalex.org/W2809684781","https://openalex.org/W2896630850","https://openalex.org/W2907531917","https://openalex.org/W2912587023","https://openalex.org/W2914082376","https://openalex.org/W2949684159","https://openalex.org/W3027444915","https://openalex.org/W3103539750","https://openalex.org/W3121775428","https://openalex.org/W4238452917","https://openalex.org/W4250628534"],"related_works":["https://openalex.org/W7097549865","https://openalex.org/W3049382060","https://openalex.org/W7096258641","https://openalex.org/W1817754535","https://openalex.org/W4317695586","https://openalex.org/W2610921943","https://openalex.org/W3017408240","https://openalex.org/W2921772381","https://openalex.org/W7161950125","https://openalex.org/W7098115835"],"abstract_inverted_index":{"We":[0,103,412,480],"propose":[1,104,269],"a":[2,19,47,62,72,82,88,108,129,223,263,274,322,329,344,352,368,384,424,449,593,601,605,617,624,628],"new":[3,54,63,83,97,120,142],"methodology":[4,37,127,595],"for":[5,278,387,596,619],"learning":[6,36],"the":[7,40,57,68,100,105,113,116,119,123,133,141,145,150,153,160,163,167,173,176,191,197,201,215,219,237,239,245,252,259,270,279,293,300,303,312,319,349,360,388,393,408,430,436,453,464,476,489,497,504,513,516,525,533,544,555,568,587,598,621],"structure":[8,277],"of":[9,42,90,107,115,132,162,169,236,281,296,302,328,370,395,398,416,432,452,466,515,527,535,563,570,600,623],"sparse":[10,282],"networks":[11,25,434],"from":[12],"data;":[13],"in":[14,79,152,255,351,367,444],"doing":[15],"so":[16],"we":[17,23,268,285,309,334,428,508,523,531,585,611],"adopt":[18],"dual":[20],"perspective":[21],"where":[22,46],"consider":[24],"both":[26],"as":[27,31,273,292,401,403,538,567],"weighted":[28],"graphs":[29],"and":[30,122,144,244,284,299,339,496,522,541,549,581],"simplicial":[32,101,228,539],"complexes.":[33],"The":[34,126,356,379,442],"proposed":[35],"belongs":[38],"to":[39,67,75,87,99,111,190,204,241,287,343,420,483,503,512,554,591],"family":[41],"preferential":[43,59],"attachment":[44,60,124,146,246,304],"algorithms,":[45],"network":[48,69,203,220],"is":[49,65,85,156,178,217,448],"extended":[50],"by":[51,70,92,136,158,180,325,359,462,561,604,627],"iteratively":[52],"adding":[53,71,93],"vertices.":[55],"In":[56,306],"conventional":[58],"algorithm":[61,380],"vertex":[64,84,121,143,240],"added":[66,86,243],"single":[73],"edge":[74],"another":[76],"existing":[77],"vertex;":[78],"our":[80,510,528,575,614],"approach":[81,576],"set":[89],"vertices":[91,229,341],"one":[94,556],"or":[95,376],"more":[96,460,579],"simplices":[98],"complex.":[102],"use":[106,394,465,586],"score":[109,135,256,354],"function":[110],"quantify":[112],"strength":[114],"association":[117],"between":[118],"points.":[125,305],"performs":[128],"greedy":[130],"optimisation":[131],"total":[134],"selecting,":[137],"at":[138],"each":[139,234],"step,":[140],"points":[147,247],"that":[148,185,218,250,333,346,471,557,613],"maximise":[149],"gain":[151,350,389,399,417],"score.":[154],"Sparsity":[155],"enforced":[157],"restricting":[159],"space":[161],"feasible":[164],"configurations":[165],"through":[166],"imposition":[168],"topological":[170,183,198,260,276],"constraints":[171,290],"on":[172,475,547],"candidate":[174],"networks;":[175],"constraint":[177,199,216],"fulfilled":[179],"allowing":[181,463],"only":[182,209,227],"operations":[184,211],"are":[186,212,248,405,472],"invariant":[187,331,469],"with":[188,407,435,574],"respect":[189],"required":[192],"property.":[193],"For":[194],"instance,":[195],"if":[196,214],"requires":[200],"constructed":[202],"be":[205,206,222,231,242,365,458,559],"planar,":[207],"then":[208,226],"planarity-invariant":[210],"allowed;":[213],"must":[221],"clique":[224,271,297,323,536],"forest,":[225],"can":[230,364,457,558],"added.":[232],"At":[233],"step":[235],"algorithm,":[238],"those":[249],"provide":[251,481,592,616],"maximum":[253],"increase":[254],"while":[257],"maintaining":[258],"constraints.":[261],"As":[262,423,608],"concrete":[264],"but":[265,391,455],"general":[266],"realisation":[267,427],"forest":[272,324],"possible":[275,594],"representation":[280],"networks,":[283],"allow":[286],"specify":[288],"further":[289],"such":[291,566],"allowed":[294],"range":[295],"sizes":[298],"saturation":[301],"this":[307],"thesis":[308],"originally":[310],"introduce":[311],"Maximally":[313,438],"Filtered":[314,439],"Clique":[315,336,361,409,477],"Forest":[316],"(MFCF)":[317],"algorithm:":[318],"MFCF":[320],"builds":[321],"repeated":[326],"application":[327],"suitably":[330],"operation":[332],"call":[335],"Expansion":[337,362,410,478],"operator":[338,363],"adds":[340],"according":[342],"strategy":[345],"greedily":[347],"maximises":[348],"local":[353],"function.":[355],"gains":[357],"produced":[358],"validated":[366],"number":[369,397],"ways,":[371],"including":[372],"statistical":[373],"testing,":[374],"cross-validation":[375],"value":[377],"thresholding.":[378],"does":[381],"not":[382,473],"prescribe":[383],"specific":[385,425],"form":[386],"function,":[390],"allows":[392],"any":[396],"functions":[400,418],"long":[402],"they":[404],"consistent":[406],"operator.":[411,479],"describe":[413],"several":[414],"examples":[415],"suited":[419],"different":[421],"problems.":[422],"practical":[426],"study":[429,532],"extraction":[431],"planar":[433],"Triangulated":[437],"Graph":[440],"(TMFG).":[441],"TMFG,":[443],"its":[445],"simplest":[446],"form,":[447],"specialised":[450,467],"version":[451],"MFCF,":[454],"it":[456],"made":[459],"powerful":[461],"planarity":[468],"operators":[470],"based":[474,546],"applications":[482],"two":[484],"well":[485],"known":[486],"applied":[487],"problems:":[488],"Maximum":[490],"Weight":[491],"Planar":[492],"Subgraph":[493],"Problem":[494],"(MWPSP)":[495],"Covariance":[498,505],"Selection":[499,506],"problem.":[500],"With":[501],"regards":[502],"problem":[507],"compare":[509],"results":[511],"state":[514],"art":[517],"solution":[518,618],"(the":[519],"Graphical":[520],"Lasso)":[521],"highlight":[524],"benefits":[526],"methodology.":[529],"Finally,":[530,584],"geometry":[534],"trees":[537],"complexes":[540],"note":[542],"how":[543],"statistics":[545],"cliques":[548],"separators":[550],"provides":[551],"information":[552],"equivalent":[553],"achieved":[560],"means":[562],"homological":[564],"methods,":[565],"analysis":[569],"Betti":[571],"numbers,":[572],"however":[573],"being":[577],"computationally":[578],"efficient":[580],"intuitively":[582],"simpler.":[583],"geometric":[588],"tools":[589,615],"developed":[590],"inferring":[597,620],"size":[599,622],"dataset":[602,625],"generated":[603,626],"factor":[606,629],"model.":[607,630],"an":[609],"example":[610],"show":[612]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2021-07-05T00:00:00"}