{"id":"https://openalex.org/W4409218590","doi":"https://doi.org/10.14778/3712221.3712225","title":"Efficient Top- <i>k</i> Frequent Subgraph Mining using Tight Upper and Lower Bounds","display_name":"Efficient Top- <i>k</i> Frequent Subgraph Mining using Tight Upper and Lower Bounds","publication_year":2024,"publication_date":"2024-11-01","ids":{"openalex":"https://openalex.org/W4409218590","doi":"https://doi.org/10.14778/3712221.3712225"},"language":"en","primary_location":{"id":"doi:10.14778/3712221.3712225","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3712221.3712225","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-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/A5103096016","display_name":"Seonho Lee","orcid":"https://orcid.org/0000-0003-2620-811X"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Seonho Lee","raw_affiliation_strings":["Seoul National University"],"affiliations":[{"raw_affiliation_string":"Seoul National University","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111887068","display_name":"Yeunjun Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yeunjun Lee","raw_affiliation_strings":["Seoul National University"],"affiliations":[{"raw_affiliation_string":"Seoul National University","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039462502","display_name":"Kunsoo Park","orcid":"https://orcid.org/0000-0001-5225-0907"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kunsoo Park","raw_affiliation_strings":["Seoul National University"],"affiliations":[{"raw_affiliation_string":"Seoul National University","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103096016"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":0.8084,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.8360936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"18","issue":"3","first_page":"557","last_page":"570"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9965999722480774,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/combinatorics","display_name":"Combinatorics","score":0.536762535572052},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44228360056877136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4351065158843994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3740921914577484}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.536762535572052},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44228360056877136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4351065158843994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3740921914577484},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3712221.3712225","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3712221.3712225","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W642836142","https://openalex.org/W1508044906","https://openalex.org/W1516019649","https://openalex.org/W1985147554","https://openalex.org/W1985644065","https://openalex.org/W1990600049","https://openalex.org/W1996229963","https://openalex.org/W2011039300","https://openalex.org/W2019827052","https://openalex.org/W2111708605","https://openalex.org/W2122255072","https://openalex.org/W2126359798","https://openalex.org/W2131792733","https://openalex.org/W2136940180","https://openalex.org/W2161723275","https://openalex.org/W2415186390","https://openalex.org/W2750225748","https://openalex.org/W2759365150","https://openalex.org/W2790634852","https://openalex.org/W2798875768","https://openalex.org/W2800857198","https://openalex.org/W2888799009","https://openalex.org/W2913114028","https://openalex.org/W2970204999","https://openalex.org/W2992820505","https://openalex.org/W3007212946","https://openalex.org/W3014850249","https://openalex.org/W3037419610","https://openalex.org/W3099551098","https://openalex.org/W3109773888","https://openalex.org/W3164237119","https://openalex.org/W3183473866","https://openalex.org/W3194035949","https://openalex.org/W4224220027","https://openalex.org/W4230931370","https://openalex.org/W4246662059","https://openalex.org/W4298274365","https://openalex.org/W4302047290","https://openalex.org/W4323864059","https://openalex.org/W4327662602","https://openalex.org/W4372046852","https://openalex.org/W4383220110","https://openalex.org/W4383749419","https://openalex.org/W4404678370","https://openalex.org/W6685146747"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"Frequent":[0],"subgraph":[1,51,77],"mining":[2,52],"is":[3,53,82,95,125,183],"an":[4,44,152],"important":[5],"and":[6,19,43,151],"well-studied":[7],"problem":[8],"with":[9],"numerous":[10],"applications":[11],"such":[12],"as":[13],"the":[14,25,31,61,117,134,140,156,165,178],"prediction":[15],"of":[16,33,87,119,133,142,155,173,177],"protein":[17],"functionalities":[18],"graph":[20,37,41,62],"indexing.":[21],"Many":[22],"studies":[23],"use":[24],"minimum-image-based":[26],"support":[27],"(MNI)":[28],"to":[29,54,106,114,170],"measure":[30],"frequency":[32],"subgraphs":[34,59,88,120],"in":[35,60,73,175],"single":[36],"mining.":[38,78],"Given":[39],"a":[40,102,112,129,148,185],"G":[42,63],"integer":[45],"k":[46,49,57,75],",":[47],"top-":[48,56,74],"frequent":[50,58,76],"find":[55],"based":[64],"on":[65],"MNI.":[66],"However,":[67],"there":[68],"are":[69],"two":[70],"main":[71],"challenges":[72],"(1)":[79],"Computing":[80],"MNI":[81,91,123,135,143,157],"time-consuming.":[83],"(2)":[84],"The":[85],"number":[86,118],"for":[89,121,188,193],"which":[90,122],"should":[92],"be":[93],"computed":[94],"large.":[96],"In":[97],"this":[98,189],"paper,":[99],"we":[100],"propose":[101,111],"novel":[103],"algorithm":[104,163,182],"Minting":[105],"address":[107],"these":[108],"challenges.":[109],"We":[110,137],"method":[113],"significantly":[115],"reduce":[116],"computation":[124,141],"required":[126],"by":[127,145,168],"using":[128],"tight":[130],"upper":[131,153],"bound":[132,150,154],"value.":[136,158],"also":[138,184],"improve":[139],"itself":[144],"utilizing":[146],"both":[147],"lower":[149],"Experiments":[159],"shows":[160],"that":[161],"our":[162],"outperforms":[164],"state-of-the-art":[166],"algorithms":[167],"up":[169],"three":[171],"orders":[172],"magnitude":[174],"terms":[176],"elapsed":[179],"time.":[180],"Our":[181],"feasible":[186],"solution":[187],"challenging":[190],"problem,":[191],"even":[192],"large":[194],"k.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}