{"id":"https://openalex.org/W4206828380","doi":"https://doi.org/10.1145/3487351.3488275","title":"Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network","display_name":"Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network","publication_year":2021,"publication_date":"2021-11-08","ids":{"openalex":"https://openalex.org/W4206828380","doi":"https://doi.org/10.1145/3487351.3488275"},"language":"en","primary_location":{"id":"doi:10.1145/3487351.3488275","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3487351.3488275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining","raw_type":"proceedings-article"},"type":"conference-paper","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/A5053021349","display_name":"Takayasu Fushimi","orcid":"https://orcid.org/0000-0003-3448-8182"},"institutions":[{"id":"https://openalex.org/I148798404","display_name":"Tokyo University of Technology","ror":"https://ror.org/021a26605","country_code":"JP","type":"education","lineage":["https://openalex.org/I148798404"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takayasu Fushimi","raw_affiliation_strings":["Tokyo University of Technology, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo University of Technology, Japan","institution_ids":["https://openalex.org/I148798404"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103121106","display_name":"Kazumi Saito","orcid":"https://orcid.org/0000-0002-8972-5002"},"institutions":[{"id":"https://openalex.org/I41802502","display_name":"Kanagawa University","ror":"https://ror.org/02j6c0d67","country_code":"JP","type":"education","lineage":["https://openalex.org/I41802502"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kazumi Saito","raw_affiliation_strings":["Kanagawa University, Japan and RIKEN, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kanagawa University, Japan and RIKEN, Japan","institution_ids":["https://openalex.org/I41802502"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055573686","display_name":"Hiroshi Motoda","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroshi Motoda","raw_affiliation_strings":["Osaka University, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Osaka University, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8167,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.90913249,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9939000010490417,"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/T10222","display_name":"Genomics and Chromatin Dynamics","score":0.9643999934196472,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7249149680137634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6464501619338989},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5064994096755981},{"id":"https://openalex.org/keywords/motif","display_name":"Motif (music)","score":0.4726996421813965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.456617534160614},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.45044365525245667},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4067188501358032}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7249149680137634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6464501619338989},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5064994096755981},{"id":"https://openalex.org/C32276052","wikidata":"https://www.wikidata.org/wiki/Q908349","display_name":"Motif (music)","level":2,"score":0.4726996421813965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.456617534160614},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.45044365525245667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4067188501358032},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3487351.3488275","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3487351.3488275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.800000011920929,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1553420678","https://openalex.org/W1603920809","https://openalex.org/W1763086816","https://openalex.org/W2041874687","https://openalex.org/W2054499597","https://openalex.org/W2060071214","https://openalex.org/W2066303519","https://openalex.org/W2066645376","https://openalex.org/W2092986233","https://openalex.org/W2122124368","https://openalex.org/W2125895010","https://openalex.org/W2139694815","https://openalex.org/W2153624566","https://openalex.org/W2583739452","https://openalex.org/W2742066726","https://openalex.org/W2743418339","https://openalex.org/W2951687014","https://openalex.org/W2952116439","https://openalex.org/W2963294336","https://openalex.org/W2982295803","https://openalex.org/W6638950445","https://openalex.org/W6657874962","https://openalex.org/W6690388481"],"related_works":["https://openalex.org/W3170299350","https://openalex.org/W2368410102","https://openalex.org/W2605676258","https://openalex.org/W2368037387","https://openalex.org/W190186656","https://openalex.org/W2902352756","https://openalex.org/W2377079823","https://openalex.org/W2599962286","https://openalex.org/W2319582300","https://openalex.org/W2477549100"],"abstract_inverted_index":{"Counting":[0],"motifs":[1],"in":[2],"an":[3],"uncertain":[4],"graph":[5,21],"for":[6,49],"which":[7],"each":[8,75],"link":[9],"is":[10,16,22,35,99,110,115,125,131],"associated":[11],"with":[12],"a":[13,55,79,141],"connection":[14,149],"probability":[15,73],"computationally":[17],"expensive":[18,69],"when":[19,94],"the":[20,26,61,72,85,95,107,119,128,148],"huge":[23],"due":[24],"to":[25,36],"extremely":[27],"large":[28],"number":[29,86],"of":[30,64,74,87,97,135],"possible":[31,76,88],"worlds.":[32],"Natural":[33],"approach":[34],"rely":[37],"on":[38,68,78,147],"sampling-based":[39,121],"approximation":[40],"methods,":[41],"but":[42],"this":[43],"still":[44],"needs":[45],"many":[46],"sample":[47],"graphs":[48],"obtaining":[50],"accurate":[51],"results.":[52],"We":[53],"propose":[54],"novel":[56],"method":[57,109],"that":[58,90,106,143],"analytically":[59],"computes":[60],"expected":[62],"frequency":[63],"motif":[65,81,98],"without":[66],"relying":[67],"sampling.":[70],"Marginalizing":[71],"world":[77],"candidate":[80],"can":[82],"drastically":[83],"reduce":[84],"worlds":[89],"need":[91],"be":[92],"considered":[93],"size":[96],"small.":[100],"Experiments":[101],"using":[102],"real-world":[103],"data":[104],"confirm":[105],"proposed":[108],"effective":[111],"and":[112,127],"efficient.":[113],"It":[114,138],"far":[116],"better":[117],"than":[118],"state-of-the-art":[120],"method.":[122],"The":[123],"accuracy":[124],"guaranteed":[126],"running":[129],"time":[130],"about":[132],"4":[133],"order":[134],"magnitude":[136],"faster.":[137],"runs":[139],"at":[140],"speed":[142],"does":[144],"not":[145],"depend":[146],"probability.":[150]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}