{"id":"https://openalex.org/W4414117091","doi":"https://doi.org/10.1109/fuzz62266.2025.11152279","title":"Mining of Top-K Subgraphs From Uncertain Graph Data","display_name":"Mining of Top-K Subgraphs From Uncertain Graph Data","publication_year":2025,"publication_date":"2025-07-06","ids":{"openalex":"https://openalex.org/W4414117091","doi":"https://doi.org/10.1109/fuzz62266.2025.11152279"},"language":"en","primary_location":{"id":"doi:10.1109/fuzz62266.2025.11152279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz62266.2025.11152279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Fuzzy Systems (FUZZ)","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/A5119589061","display_name":"Ishan Choubey","orcid":null},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Ishan Choubey","raw_affiliation_strings":["IIIT-Hyderabad,Telangana,India"],"affiliations":[{"raw_affiliation_string":"IIIT-Hyderabad,Telangana,India","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064495970","display_name":"R. Uday Kiran","orcid":"https://orcid.org/0000-0002-5417-0289"},"institutions":[{"id":"https://openalex.org/I141591182","display_name":"University of Aizu","ror":"https://ror.org/02pg0e883","country_code":"JP","type":"education","lineage":["https://openalex.org/I141591182"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"R. Uday Kiran","raw_affiliation_strings":["The University of Aizu,Aizu-Wakamatsu,Japan"],"affiliations":[{"raw_affiliation_string":"The University of Aizu,Aizu-Wakamatsu,Japan","institution_ids":["https://openalex.org/I141591182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119051402","display_name":"Nivesh Mittapally","orcid":null},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nivesh Mittapally","raw_affiliation_strings":["IIIT-Hyderabad,Telangana,India"],"affiliations":[{"raw_affiliation_string":"IIIT-Hyderabad,Telangana,India","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083660084","display_name":"P. Krishna Reddy","orcid":null},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P. Krishna Reddy","raw_affiliation_strings":["IIIT-Hyderabad,Telangana,India"],"affiliations":[{"raw_affiliation_string":"IIIT-Hyderabad,Telangana,India","institution_ids":["https://openalex.org/I65181880"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5119589061"],"corresponding_institution_ids":["https://openalex.org/I65181880"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31501601,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9973000288009644,"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"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9936000108718872,"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/graph","display_name":"Graph","score":0.5074999928474426},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.444599986076355},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.39739999175071716},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.36899998784065247},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.3603000044822693},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.32659998536109924}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5407999753952026},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5210999846458435},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5074999928474426},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.444599986076355},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.40299999713897705},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.39739999175071716},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.36899998784065247},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3603000044822693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34950000047683716},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.32659998536109924},{"id":"https://openalex.org/C2778865114","wikidata":"https://www.wikidata.org/wiki/Q7882489","display_name":"Uncertain data","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31029999256134033},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.2831000089645386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26899999380111694},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26170000433921814}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fuzz62266.2025.11152279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz62266.2025.11152279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Fuzzy Systems (FUZZ)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W107619411","https://openalex.org/W1495741242","https://openalex.org/W1641749581","https://openalex.org/W1985644065","https://openalex.org/W2060200003","https://openalex.org/W2084591860","https://openalex.org/W2084777082","https://openalex.org/W2094500233","https://openalex.org/W2118349699","https://openalex.org/W2158501189","https://openalex.org/W2168209541","https://openalex.org/W2170726034","https://openalex.org/W2800857198","https://openalex.org/W2996693990","https://openalex.org/W3172286028","https://openalex.org/W4308834893"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"A":[0],"graph":[1,77],"transactional":[2,78],"database":[3],"(GTD)":[4],"is":[5],"a":[6,27,65,82],"collection":[7],"of":[8,20,55,114],"graphs.":[9],"Frequent":[10],"Top-k":[11],"Subgraph":[12],"Pattern":[13],"Mining":[14],"involves":[15],"finding":[16,34],"the":[17,42,46,53,96,111,126,133],"complete":[18],"set":[19],"top-k":[21,70,85,93,103],"frequently":[22],"occurring":[23],"subgraph":[24,87,105],"patterns":[25,36],"in":[26,37,74,95],"GTD.":[28],"Most":[29],"previous":[30],"studies":[31],"focused":[32],"on":[33,118],"these":[35],"certain":[38],"graphs":[39],"by":[40],"disregarding":[41],"crucial":[43],"information":[44,131],"regarding":[45],"existential":[47],"probabilities":[48],"that":[49,125],"may":[50],"exist":[51],"between":[52],"edges":[54],"any":[56],"two":[57],"nodes.":[58],"With":[59],"this":[60,62],"motivation,":[61],"paper":[63],"proposes":[64],"novel":[66,83],"model":[67,128],"to":[68,90,109],"discover":[69],"(frequently":[71],"occurring)":[72],"subgraphs":[73,94],"an":[75,101],"uncertain":[76,86,104],"database.":[79],"We":[80,98],"introduce":[81,100],"algorithm,":[84],"miner":[88,106],"(TUSM),":[89],"find":[91],"all":[92],"data.":[97],"also":[99],"approximate":[102],"(ATUSM)":[107],"algorithm":[108],"tackle":[110],"computational":[112],"expansiveness":[113],"TUSM.":[115],"Experimental":[116],"results":[117],"synthetic":[119],"and":[120,132],"protein-protein":[121],"interaction":[122],"datasets":[123],"demonstrate":[124],"proposed":[127],"finds":[129],"valuable":[130],"algorithms":[134],"are":[135],"efficient.":[136]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}
