{"id":"https://openalex.org/W2586762046","doi":"https://doi.org/10.1145/3022227.3022242","title":"Top-k frequent induced subgraph mining on a sliding window using sampling","display_name":"Top-k frequent induced subgraph mining on a sliding window using sampling","publication_year":2017,"publication_date":"2017-01-05","ids":{"openalex":"https://openalex.org/W2586762046","doi":"https://doi.org/10.1145/3022227.3022242","mag":"2586762046"},"language":"en","primary_location":{"id":"doi:10.1145/3022227.3022242","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3022227.3022242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication","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/A5035175339","display_name":"Thuy\u2010Van T. Duong","orcid":"https://orcid.org/0000-0002-4619-5371"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Van T. T. Duong","raw_affiliation_strings":["Kyung Hee University, Yongin-si, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Kyung Hee University, Yongin-si, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045182513","display_name":"Kifayat Ullah Khan","orcid":"https://orcid.org/0000-0002-3916-1659"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kifayat Ullah Khan","raw_affiliation_strings":["Kyung Hee University, Yongin-si, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Kyung Hee University, Yongin-si, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039165136","display_name":"Young-Koo Lee","orcid":"https://orcid.org/0000-0003-2314-5395"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Young-Koo Lee","raw_affiliation_strings":["Kyung Hee University, Yongin-si, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Kyung Hee University, Yongin-si, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035175339"],"corresponding_institution_ids":["https://openalex.org/I35928602"],"apc_list":null,"apc_paid":null,"fwci":0.4836,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70790359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"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.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9976999759674072,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9811999797821045,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/sliding-window-protocol","display_name":"Sliding window protocol","score":0.7234165072441101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7203155755996704},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6924048066139221},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.6917703151702881},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5735475420951843},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.5135848522186279},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4970565140247345},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4679276943206787},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4554760456085205},{"id":"https://openalex.org/keywords/data-stream-mining","display_name":"Data stream mining","score":0.42404162883758545},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35093581676483154},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33533596992492676}],"concepts":[{"id":"https://openalex.org/C102392041","wikidata":"https://www.wikidata.org/wiki/Q592860","display_name":"Sliding window protocol","level":3,"score":0.7234165072441101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7203155755996704},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6924048066139221},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.6917703151702881},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5735475420951843},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.5135848522186279},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4970565140247345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4679276943206787},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4554760456085205},{"id":"https://openalex.org/C89198739","wikidata":"https://www.wikidata.org/wiki/Q3079880","display_name":"Data stream mining","level":2,"score":0.42404162883758545},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35093581676483154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33533596992492676},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"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/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3022227.3022242","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3022227.3022242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W26569054","https://openalex.org/W845171161","https://openalex.org/W1641749581","https://openalex.org/W2004734764","https://openalex.org/W2060200003","https://openalex.org/W2085668204","https://openalex.org/W2109742433","https://openalex.org/W2110893883","https://openalex.org/W2136593687","https://openalex.org/W2139071457","https://openalex.org/W2170726034","https://openalex.org/W2171271527","https://openalex.org/W2612786048","https://openalex.org/W2616506039","https://openalex.org/W2809882961","https://openalex.org/W4230765542","https://openalex.org/W6685146747"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W1482551403","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2393701947"],"abstract_inverted_index":{"Finding":[0],"Frequent":[1,81],"Induced":[2,82],"Subgraph":[3,83],"in":[4,19,27,40,106,114,185],"a":[5,75,86,91,118,128],"stream":[6],"of":[7,103,124,158,163,181],"graph":[8,41],"data":[9,93],"is":[10,61],"critical":[11],"for":[12,35,64,79],"many":[13],"application":[14],"such":[15],"as":[16],"frequent":[17,37,145],"substructures":[18],"biological":[20],"networks,":[21],"chemical":[22],"compounds,":[23],"or":[24],"community":[25],"detection":[26],"social":[28],"networks.":[29],"Some":[30],"approaches":[31],"have":[32],"been":[33],"proposed":[34,177],"mining":[36,65],"induced":[38],"subgraph":[39,54],"database.":[42],"However,":[43],"existing":[44],"methods":[45],"take":[46],"long":[47],"execution":[48,154,186],"time":[49,155,187],"since":[50],"they":[51],"perform":[52],"numerous":[53],"isomorphism":[55],"(SI)":[56],"operations,":[57],"thus,":[58],"these":[59],"approach":[60,184],"not":[62],"efficience":[63],"on":[66,85,137,167],"streaming":[67],"environment.":[68],"In":[69],"this":[70],"paper,":[71],"we":[72,116],"propose":[73],"k-FISMW,":[74],"new":[76],"sampling-based":[77],"method":[78,178],"top-k":[80],"Mining":[84],"sliding":[87,108],"Window.":[88],"We":[89,152,173],"use":[90],"specialized":[92],"structure":[94],"called":[95],"WSTable":[96],"(Window":[97],"Summary":[98],"Table)":[99],"to":[100,121],"maintain":[101],"information":[102],"recent":[104],"graphs":[105],"the":[107,138,143,182],"windows.":[109],"To":[110],"avoid":[111],"SI":[112],"operations":[113],"kFISM,":[115],"present":[117],"measure,":[119],"indFreq,":[120],"compute":[122],"frequency":[123],"subgraphs.":[125],"k-FISMW":[126,166],"executes":[127],"biased":[129],"random":[130],"walkbased":[131],"sampling":[132],"over":[133],"fixed-size":[134],"vertex-induced":[135],"subgraphs":[136,146,164],"current":[139],"window":[140],"so":[141],"that":[142,175],"potentially":[144],"are":[147],"visited":[148],"with":[149],"high":[150],"probability.":[151],"evaluate":[153],"and":[156,170,188],"accuracy":[157],"finding":[159],"our":[160,176],"desired":[161],"types":[162],"using":[165],"both":[168],"real-life":[169],"synthetic":[171],"dataset.":[172],"observe":[174],"outperforms":[179],"state":[180],"art":[183],"accuracy.":[189]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}