{"id":"https://openalex.org/W3028970645","doi":"https://doi.org/10.3233/ida-194601","title":"Distributed frequent subgraph mining on evolving graph using SPARK","display_name":"Distributed frequent subgraph mining on evolving graph using SPARK","publication_year":2020,"publication_date":"2020-05-21","ids":{"openalex":"https://openalex.org/W3028970645","doi":"https://doi.org/10.3233/ida-194601","mag":"3028970645"},"language":"en","primary_location":{"id":"doi:10.3233/ida-194601","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ida-194601","pdf_url":null,"source":{"id":"https://openalex.org/S2498839158","display_name":"Intelligent Data Analysis","issn_l":"1088-467X","issn":["1088-467X","1571-4128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Data Analysis","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/A5110508571","display_name":"N. Senthilselvan","orcid":null},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N. Senthilselvan","raw_affiliation_strings":["School of Computing, SASTRA Deemed University, Thanjavur, India"],"affiliations":[{"raw_affiliation_string":"School of Computing, SASTRA Deemed University, Thanjavur, India","institution_ids":["https://openalex.org/I932239252"]}]},{"author_position":"middle","author":{"id":null,"display_name":"V. Subramaniyaswamy","orcid":null},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"V. Subramaniyaswamy","raw_affiliation_strings":["School of Computing, SASTRA Deemed University, Thanjavur, India"],"affiliations":[{"raw_affiliation_string":"School of Computing, SASTRA Deemed University, Thanjavur, India","institution_ids":["https://openalex.org/I932239252"]}]},{"author_position":"middle","author":{"id":null,"display_name":"V. Vijayakumar","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"V. Vijayakumar","raw_affiliation_strings":["School of Computer Science and Engineering, University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090855504","display_name":"Hamid Reza Karimi","orcid":"https://orcid.org/0000-0001-7629-3266"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Hamid Reza Karimi","raw_affiliation_strings":["Department of Mechanical Engineering, Politecnico di Milano, Milan, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Politecnico di Milano, Milan, Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031370066","display_name":"N. Aswin","orcid":null},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N. Aswin","raw_affiliation_strings":["School of Computing, SASTRA Deemed University, Thanjavur, India"],"affiliations":[{"raw_affiliation_string":"School of Computing, SASTRA Deemed University, Thanjavur, India","institution_ids":["https://openalex.org/I932239252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036334864","display_name":"Logesh Ravi","orcid":"https://orcid.org/0000-0002-0034-4714"},"institutions":[{"id":"https://openalex.org/I20107917","display_name":"Sri Ramachandra Institute of Higher Education and Research","ror":"https://ror.org/0108gdg43","country_code":"IN","type":"education","lineage":["https://openalex.org/I20107917"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Logesh Ravi","raw_affiliation_strings":["Sri Ramachandra Faculty of Engineering and Technology, Sri Ramachandra Institute of Higher Education and Research, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Sri Ramachandra Faculty of Engineering and Technology, Sri Ramachandra Institute of Higher Education and Research, Chennai, India","institution_ids":["https://openalex.org/I20107917"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I932239252"],"apc_list":null,"apc_paid":null,"fwci":0.3926,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.61151723,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"3","first_page":"495","last_page":"513"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.998199999332428,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9968000054359436,"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/computer-science","display_name":"Computer science","score":0.6689131855964661},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5519471168518066},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.47595950961112976},{"id":"https://openalex.org/keywords/spark","display_name":"SPARK (programming language)","score":0.4597037732601166},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.429398775100708},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4203530550003052},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4045935869216919},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21193468570709229},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.09870040416717529}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6689131855964661},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5519471168518066},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.47595950961112976},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.4597037732601166},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.429398775100708},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4203530550003052},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4045935869216919},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21193468570709229},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.09870040416717529},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/ida-194601","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ida-194601","pdf_url":null,"source":{"id":"https://openalex.org/S2498839158","display_name":"Intelligent Data Analysis","issn_l":"1088-467X","issn":["1088-467X","1571-4128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Data Analysis","raw_type":"journal-article"},{"id":"pmh:oai:re.public.polimi.it:11311/1167225","is_oa":false,"landing_page_url":"http://hdl.handle.net/11311/1167225","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6399999856948853,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1197347346","https://openalex.org/W1506285740","https://openalex.org/W1510837191","https://openalex.org/W1515347377","https://openalex.org/W1560868107","https://openalex.org/W1569347009","https://openalex.org/W1592376869","https://openalex.org/W1605319014","https://openalex.org/W1641749581","https://openalex.org/W1643374769","https://openalex.org/W1847986000","https://openalex.org/W1880114935","https://openalex.org/W1970259423","https://openalex.org/W1974111257","https://openalex.org/W1995950372","https://openalex.org/W2004734764","https://openalex.org/W2019827052","https://openalex.org/W2027770225","https://openalex.org/W2037963635","https://openalex.org/W2062705952","https://openalex.org/W2075173616","https://openalex.org/W2080042412","https://openalex.org/W2094472563","https://openalex.org/W2095840978","https://openalex.org/W2102039273","https://openalex.org/W2102135646","https://openalex.org/W2108150886","https://openalex.org/W2118349699","https://openalex.org/W2122255072","https://openalex.org/W2130426318","https://openalex.org/W2135107236","https://openalex.org/W2136593687","https://openalex.org/W2136940180","https://openalex.org/W2162481448","https://openalex.org/W2170726034","https://openalex.org/W2415186390","https://openalex.org/W2464274269","https://openalex.org/W2464391576","https://openalex.org/W2470515822","https://openalex.org/W2509529080","https://openalex.org/W2546743940","https://openalex.org/W2593372140","https://openalex.org/W2750225748","https://openalex.org/W2752054654","https://openalex.org/W2795466160","https://openalex.org/W2797905791","https://openalex.org/W3102781172","https://openalex.org/W6634912251"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W167435155","https://openalex.org/W2953496651","https://openalex.org/W2886672068","https://openalex.org/W2397707437","https://openalex.org/W1992416685","https://openalex.org/W872425053","https://openalex.org/W2811238889","https://openalex.org/W3151217588","https://openalex.org/W3208942821"],"abstract_inverted_index":{"Within":[0],"the":[1,19,39,57,64,144,155],"graph":[2,48,123,167],"mining":[3,36,160],"context,":[4],"frequent":[5,32,118,135],"subgraph":[6],"identification":[7],"plays":[8],"a":[9,25,51,90,97,106,125,130],"key":[10],"role":[11],"in":[12,24,34,47,75,124],"retrieving":[13],"required":[14],"information":[15],"or":[16],"patterns":[17],"from":[18,96,120,164],"huge":[20,53,165],"amount":[21],"of":[22,30,41,56,132,157,161],"data":[23],"short":[26],"period.":[27],"The":[28,85],"problem":[29],"finding":[31],"items":[33],"traditional":[35],"changed":[37],"to":[38,88,92,116,142],"innovation":[40],"subgraphs":[42,95,119,133,163],"that":[43],"recurrently":[44],"occur":[45],"s":[46],"datasets":[49,153],"containing":[50],"single":[52,98],"graph.":[54,101],"Majority":[55],"existing":[58],"methods":[59],"target":[60],"static":[61],"graphs,":[62],"and":[63,136,151],"distributed":[65,126],"solution":[66],"for":[67,159],"dynamic":[68],"graphs":[69],"has":[70],"not":[71],"been":[72],"explored.":[73],"But,":[74],"modern":[76],"applications":[77],"like":[78],"Facebook,":[79],"robotics":[80],"utilizes":[81],"large":[82,99],"evolving":[83,100,122,166],"graphs.":[84],"goal":[86],"is":[87,109,140],"design":[89],"method":[91],"find":[93],"recurrent":[94,162],"In":[102],"this":[103],"research":[104],"paper,":[105],"novel":[107],"approach":[108],"proposed":[110],"called":[111],"DFSME,":[112],"which":[113,139],"uses":[114],"SPARK":[115],"discover":[117],"an":[121],"environment.":[127],"DFSME":[128,158],"maintains":[129],"set":[131],"between":[134],"infrequent":[137],"subgraphs,":[138],"used":[141],"decrease":[143],"search":[145],"space.":[146],"Our":[147],"experiments":[148],"with":[149],"synthetic":[150],"real-world":[152],"authorize":[154],"effectiveness":[156],"datasets.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}