{"id":"https://openalex.org/W2060200003","doi":"https://doi.org/10.1109/bigdata.2014.7004359","title":"FS<sup>3</sup>: A sampling based method for top-k frequent subgraph mining","display_name":"FS<sup>3</sup>: A sampling based method for top-k frequent subgraph mining","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2060200003","doi":"https://doi.org/10.1109/bigdata.2014.7004359","mag":"2060200003"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2014.7004359","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2014.7004359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Big Data (Big Data)","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/A5091759842","display_name":"Tanay Kumar Saha","orcid":"https://orcid.org/0000-0002-7478-9222"},"institutions":[{"id":"https://openalex.org/I55769427","display_name":"Indiana University \u2013 Purdue University Indianapolis","ror":"https://ror.org/05gxnyn08","country_code":"US","type":"education","lineage":["https://openalex.org/I55769427","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tanay Kumar Saha","raw_affiliation_strings":["Dept. of Computer and Information Science, Indiana university\u2014Purdue university Indianapolis, Indiana, USA","Dept. of Computer and Information Science, Indiana university-Purdue university Indianapolis, Indiana, IN-46202, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer and Information Science, Indiana university\u2014Purdue university Indianapolis, Indiana, USA","institution_ids":["https://openalex.org/I55769427"]},{"raw_affiliation_string":"Dept. of Computer and Information Science, Indiana university-Purdue university Indianapolis, Indiana, IN-46202, USA","institution_ids":["https://openalex.org/I55769427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044451399","display_name":"Mohammad Al Hasan","orcid":"https://orcid.org/0000-0002-8279-1023"},"institutions":[{"id":"https://openalex.org/I55769427","display_name":"Indiana University \u2013 Purdue University Indianapolis","ror":"https://ror.org/05gxnyn08","country_code":"US","type":"education","lineage":["https://openalex.org/I55769427","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Al Hasan","raw_affiliation_strings":["Dept. of Computer and Information Science, Indiana university\u2014Purdue university Indianapolis, Indiana, USA","Dept. of Computer and Information Science, Indiana university-Purdue university Indianapolis, Indiana, IN-46202, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer and Information Science, Indiana university\u2014Purdue university Indianapolis, Indiana, USA","institution_ids":["https://openalex.org/I55769427"]},{"raw_affiliation_string":"Dept. of Computer and Information Science, Indiana university-Purdue university Indianapolis, Indiana, IN-46202, USA","institution_ids":["https://openalex.org/I55769427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1794,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79325304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"72","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"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.998199999332428,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9976000189781189,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6188551187515259},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.61160808801651},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.6033942699432373},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5717124342918396},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.50571608543396},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5002267360687256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43163472414016724},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.4116251468658447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38411182165145874},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35789093375205994},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.33182668685913086},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32367587089538574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2640953063964844},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.2628372311592102},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.19936707615852356},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08096456527709961},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07453259825706482}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6188551187515259},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.61160808801651},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.6033942699432373},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5717124342918396},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.50571608543396},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5002267360687256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43163472414016724},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4116251468658447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38411182165145874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35789093375205994},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.33182668685913086},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32367587089538574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2640953063964844},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.2628372311592102},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.19936707615852356},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08096456527709961},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07453259825706482},{"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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata.2014.7004359","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2014.7004359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4699999988079071,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W25964860","https://openalex.org/W1521790300","https://openalex.org/W1524882660","https://openalex.org/W1607305617","https://openalex.org/W1641749581","https://openalex.org/W1973815317","https://openalex.org/W1985147554","https://openalex.org/W2004734764","https://openalex.org/W2101156500","https://openalex.org/W2108150886","https://openalex.org/W2110034858","https://openalex.org/W2114062029","https://openalex.org/W2128994830","https://openalex.org/W2143211346","https://openalex.org/W2150881673","https://openalex.org/W2155325661","https://openalex.org/W2160556205","https://openalex.org/W2161723275","https://openalex.org/W2162481448","https://openalex.org/W2164281374","https://openalex.org/W2166064672","https://openalex.org/W2168209541","https://openalex.org/W2170726034","https://openalex.org/W2171271527","https://openalex.org/W2971253248","https://openalex.org/W3020882730","https://openalex.org/W4250255282","https://openalex.org/W6636291875","https://openalex.org/W6636756987","https://openalex.org/W6685146747"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W2604893261","https://openalex.org/W2151689585","https://openalex.org/W2380816257","https://openalex.org/W3087071515","https://openalex.org/W2361654510","https://openalex.org/W2915540008","https://openalex.org/W2954463587","https://openalex.org/W2382155842","https://openalex.org/W2036065890"],"abstract_inverted_index":{"Mining":[0],"labeled":[1],"subgraph":[2,33,134],"is":[3,37,69,123,173],"a":[4,70,76,94,105,136,146,188],"popular":[5],"research":[6],"task":[7,27,35],"in":[8,16,52,85,135,144,152],"data":[9],"mining":[10,143],"because":[11],"of":[12,46,79,104,142,164,187],"its":[13],"potential":[14],"application":[15],"many":[17],"different":[18],"scientific":[19],"domains.":[20],"All":[21],"the":[22,32,44,50,53,86,102,110,132,140,149,153,156,181,185],"existing":[23],"methods":[24],"for":[25],"this":[26,59],"explicitly":[28],"or":[29],"implicitly":[30],"solve":[31],"isomorphism":[34],"which":[36,68],"computationally":[38],"expensive,":[39],"so":[40],"they":[41],"suffer":[42],"from":[43],"lack":[45],"scalability":[47],"problem":[48],"when":[49],"graphs":[51,166],"input":[54],"database":[55,163],"are":[56,82,114,180],"large.":[57],"In":[58],"work,":[60],"we":[61],"propose":[62],"FS":[63,89,119,169],"3":[66,92,122,172],",":[67],"sampling":[71,100],"based":[72],"method.":[73],"It":[74,130],"mines":[75],"small":[77],"collection":[78],"subgraphs":[80,107,113,178,186],"that":[81,109,148,168,179],"most":[83,157,182],"frequent":[84,112,158,183],"probabilistic":[87],"sense.":[88],"performs":[93],"Markov":[95],"Chain":[96],"Monte":[97],"Carlo":[98],"(MCMC)":[99],"over":[101,139],"space":[103],"fixed-size":[106],"such":[108,145],"potentially":[111],"sampled":[115,133],"more":[116],"often.":[117],"Besides,":[118],"equipped":[124],"with":[125],"an":[126],"innovative":[127],"queue":[128,138,154],"manager.":[129],"stores":[131],"finite":[137],"course":[141],"manner":[147],"top-k":[150],"positions":[151],"contain":[155],"subgraphs.":[159],"Our":[160],"experiments":[161],"on":[162],"large":[165],"show":[167],"efficient,":[174],"and":[175],"it":[176],"obtains":[177],"amongst":[184],"given":[189],"size.":[190]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}