{"id":"https://openalex.org/W3156588038","doi":"https://doi.org/10.1145/3442590","title":"TipTap: Approximate Mining of Frequent <i>k</i> -Subgraph Patterns in Evolving Graphs","display_name":"TipTap: Approximate Mining of Frequent <i>k</i> -Subgraph Patterns in Evolving Graphs","publication_year":2021,"publication_date":"2021-04-21","ids":{"openalex":"https://openalex.org/W3156588038","doi":"https://doi.org/10.1145/3442590","mag":"3156588038"},"language":"en","primary_location":{"id":"doi:10.1145/3442590","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3442590","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"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":"ACM Transactions on Knowledge Discovery from Data","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/A5087869348","display_name":"Muhammad Anis Uddin Nasir","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Muhammad Anis Uddin Nasir","raw_affiliation_strings":["King Digital Entertainment Ltd, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"King Digital Entertainment Ltd, Stockholm, Sweden","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044399544","display_name":"\u00c7i\u011fdem Aslay","orcid":"https://orcid.org/0000-0002-5556-8977"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Cigdem Aslay","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041680508","display_name":"Gianmarco De Francisci Morales","orcid":"https://orcid.org/0000-0002-2415-494X"},"institutions":[{"id":"https://openalex.org/I134940468","display_name":"Institute for Scientific Interchange","ror":"https://ror.org/00te2x188","country_code":"IT","type":"facility","lineage":["https://openalex.org/I134940468"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianmarco De Francisci Morales","raw_affiliation_strings":["ISI Foundation, Turin, Italy"],"affiliations":[{"raw_affiliation_string":"ISI Foundation, Turin, Italy","institution_ids":["https://openalex.org/I134940468"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021368473","display_name":"Matteo Riondato","orcid":"https://orcid.org/0000-0003-2523-4420"},"institutions":[{"id":"https://openalex.org/I177605424","display_name":"Amherst College","ror":"https://ror.org/028vqfs63","country_code":"US","type":"education","lineage":["https://openalex.org/I177605424"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matteo Riondato","raw_affiliation_strings":["Amherst College, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"Amherst College, Amherst, MA, USA","institution_ids":["https://openalex.org/I177605424"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5087869348"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8377,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.91751586,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"15","issue":"3","first_page":"1","last_page":"35"},"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.9997000098228455,"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.9997000098228455,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6408421993255615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4801301658153534},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4286607801914215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4171428084373474},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.38411813974380493},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.26493164896965027},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09184122085571289}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6408421993255615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4801301658153534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4286607801914215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4171428084373474},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.38411813974380493},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.26493164896965027},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09184122085571289},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3442590","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3442590","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"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":"ACM Transactions on Knowledge Discovery from Data","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/1bd1cc3f-ec29-4762-8224-f2fe716e034a","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/1bd1cc3f-ec29-4762-8224-f2fe716e034a","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nasir, M A U, Aslay, C, de Francisi Morales, G & Riondato, M 2021, 'TipTap: Approximate Mining of Frequent k -Subgraph Patterns in Evolving Graphs', ACM Transactions on Knowledge Discovery from Data, vol. 15, no. 3, 48, pp. 1-35. https://doi.org/10.1145/3442590","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W416419572","https://openalex.org/W1510837191","https://openalex.org/W1527356121","https://openalex.org/W1549235005","https://openalex.org/W1641749581","https://openalex.org/W1985644065","https://openalex.org/W1990600049","https://openalex.org/W1991417304","https://openalex.org/W2013729009","https://openalex.org/W2019827052","https://openalex.org/W2020742901","https://openalex.org/W2029538739","https://openalex.org/W2037774459","https://openalex.org/W2050295713","https://openalex.org/W2085668204","https://openalex.org/W2093063455","https://openalex.org/W2094308804","https://openalex.org/W2097056866","https://openalex.org/W2101654328","https://openalex.org/W2102135646","https://openalex.org/W2107418220","https://openalex.org/W2107476341","https://openalex.org/W2111023939","https://openalex.org/W2117848926","https://openalex.org/W2119050385","https://openalex.org/W2119885577","https://openalex.org/W2122255072","https://openalex.org/W2128227281","https://openalex.org/W2136593687","https://openalex.org/W2148603752","https://openalex.org/W2170833472","https://openalex.org/W2171121044","https://openalex.org/W2172030265","https://openalex.org/W2190928263","https://openalex.org/W2278390984","https://openalex.org/W2443728350","https://openalex.org/W2750225748","https://openalex.org/W2768759015","https://openalex.org/W2804080114","https://openalex.org/W2890468844","https://openalex.org/W2914761779","https://openalex.org/W2962867216","https://openalex.org/W3135209803","https://openalex.org/W4230674625","https://openalex.org/W4238284510","https://openalex.org/W4248364277"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W231720905","https://openalex.org/W1979597421","https://openalex.org/W1482551403","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819"],"abstract_inverted_index":{"\u201cPerhaps":[0],"he":[1],"could":[2],"dance":[3],"first":[4],"and":[5,56,89,104,207,268],"think":[6],"afterwards,":[7],"if":[8],"it":[9],"isn\u2019t":[10],"too":[11],"much":[12],"to":[13,62,82,127,154,188,213,239],"ask":[14],"him.\u201d":[15],"S.":[16],"Beckett,":[17],"Waiting":[18],"for":[19,74],"Godot":[20],"Given":[21],"a":[22,42,47,123,138,179,195,215,229,241],"labeled":[23],"graph,":[24,55],"the":[25,37,51,54,83,87,90,95,117,132,147,162,168,171,199,209,249,252],"collection":[26],"of":[27,50,53,86,94,125,131,146,165,170,182,198,204,208,251,256],"k":[28,134,184],"-vertex":[29,135,185],"induced":[30],"connected":[31,183],"subgraph":[32],"patterns":[33,68],"that":[34,77,158,225,245,261],"appear":[35],"in":[36,101,167,202],"graph":[38],"more":[39,72,266],"frequently":[40],"than":[41,270],"user-specified":[43],"minimum":[44],"threshold":[45],"provides":[46],"compact":[48],"summary":[49],"characteristics":[52],"finds":[57],"applications":[58],"ranging":[59],"from":[60,116,232,248],"biology":[61],"network":[63],"science.":[64],"However,":[65],"finding":[66],"these":[67],"is":[69,246],"challenging,":[70],"even":[71],"so":[73],"dynamic":[75],"graphs":[76],"evolve":[78],"over":[79,161],"time,":[80],"due":[81],"streaming":[84,106],"nature":[85],"input":[88],"exponential":[91],"time":[92,143],"complexity":[93],"problem.":[96],"We":[97,119,193],"study":[98],"this":[99],"task":[100],"both":[102],"incremental":[103],"fully-dynamic":[105],"settings,":[107],"where":[108],"arbitrary":[109],"edges":[110],"can":[111],"be":[112],"added":[113],"or":[114],"removed":[115],"graph.":[118,253],"present":[120],"TipTap":[121,174,262],",":[122],"suite":[124],"algorithms":[126,201],"compute":[128],"high-quality":[129,264],"approximations":[130],"frequent":[133],"subgraphs":[136,166],"w.r.t.":[137],"given":[139],"threshold,":[140],"at":[141],"any":[142],"(i.e.,":[144],"point":[145],"stream),":[148],"with":[149],"high":[150],"probability.":[151],"In":[152],"contrast":[153],"existing":[155,271],"state-of-the-art":[156],"solutions":[157],"require":[159],"iterating":[160],"entire":[163],"set":[164],"vicinity":[169],"updated":[172],"edge,":[173],"operates":[175],"by":[176],"efficiently":[177,267],"maintaining":[178],"uniform":[180],"sample":[181,210,243],"subgraphs,":[186],"thanks":[187],"an":[189],"optimized":[190],"neighborhood-exploration":[191],"procedure.":[192],"provide":[194],"theoretical":[196],"analysis":[197,220],"proposed":[200],"terms":[203],"their":[205],"unbiasedness":[206],"size":[211,244,250],"needed":[212],"obtain":[214],"desired":[216],"approximation":[217],"quality.":[218],"Our":[219],"relies":[221],"on":[222],"sample-complexity":[223],"bounds":[224],"use":[226],"Vapnik\u2013Chervonenkis":[227],"dimension,":[228],"key":[230],"concept":[231],"statistical":[233],"learning":[234],"theory,":[235],"which":[236],"allows":[237],"us":[238],"derive":[240],"sufficient":[242],"independent":[247],"The":[254],"results":[255,265],"our":[257],"empirical":[258],"evaluation":[259],"demonstrates":[260],"returns":[263],"accurately":[269],"baselines.":[272]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}