{"id":"https://openalex.org/W2893121393","doi":"https://doi.org/10.3233/ida-173573","title":"A bounded-size clustering algorithm on fully-dynamic streaming graphs","display_name":"A bounded-size clustering algorithm on fully-dynamic streaming graphs","publication_year":2018,"publication_date":"2018-09-26","ids":{"openalex":"https://openalex.org/W2893121393","doi":"https://doi.org/10.3233/ida-173573","mag":"2893121393"},"language":"en","primary_location":{"id":"doi:10.3233/ida-173573","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ida-173573","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/55b2c816-a809-4199-ab9c-ff9532f886be","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100658349","display_name":"Jianpeng Zhang","orcid":"https://orcid.org/0000-0002-4106-6562"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jianpeng Zhang","raw_affiliation_strings":["Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands","National Digital Switching System Engineering and Technological R&D Center, Zhengzhou, Henan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"National Digital Switching System Engineering and Technological R&D Center, Zhengzhou, Henan, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029055424","display_name":"Yulong Pei","orcid":"https://orcid.org/0000-0003-3739-5627"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Yulong Pei","raw_affiliation_strings":["Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019818981","display_name":"George Fletcher","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"George Fletcher","raw_affiliation_strings":["Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022601535","display_name":"Mykola Pechenizkiy","orcid":"https://orcid.org/0000-0003-4955-0743"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mykola Pechenizkiy","raw_affiliation_strings":["Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100658349"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.1481,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.47848782,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"22","issue":"5","first_page":"1039","last_page":"1058"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9958000183105469,"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/bounded-function","display_name":"Bounded function","score":0.690564751625061},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6847798824310303},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5965719819068909},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38459542393684387},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32376521825790405},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31042057275772095},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2120235562324524}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.690564751625061},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6847798824310303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5965719819068909},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38459542393684387},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32376521825790405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31042057275772095},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2120235562324524},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.3233/ida-173573","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ida-173573","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:pure.tue.nl:openaire/55b2c816-a809-4199-ab9c-ff9532f886be","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/55b2c816-a809-4199-ab9c-ff9532f886be","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zhang, J, Pei, Y, Fletcher, G & Pechenizkiy, M 2018, 'A bounded-size clustering algorithm on fully-dynamic streaming graphs', Intelligent Data Analysis, vol. 22, no. 5, pp. 1039-1058. https://doi.org/10.3233/IDA-173573","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/55b2c816-a809-4199-ab9c-ff9532f886be","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/55b2c816-a809-4199-ab9c-ff9532f886be","pdf_url":"https://research.tue.nl/nl/publications/55b2c816-a809-4199-ab9c-ff9532f886be","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Intelligent Data Analysis, 22(5), 1039 - 1058. IOS Press","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:878634","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=878634","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1088-467X","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:878634","is_oa":false,"landing_page_url":"http://repository.tue.nl/878634","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1088-467X","raw_type":"Article / Letter to the editor"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/55b2c816-a809-4199-ab9c-ff9532f886be","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/55b2c816-a809-4199-ab9c-ff9532f886be","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zhang, J, Pei, Y, Fletcher, G & Pechenizkiy, M 2018, 'A bounded-size clustering algorithm on fully-dynamic streaming graphs', Intelligent Data Analysis, vol. 22, no. 5, pp. 1039-1058. https://doi.org/10.3233/IDA-173573","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1090431409","display_name":null,"funder_award_id":"61521003","funder_id":"https://openalex.org/F4320327720","funder_display_name":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China"},{"id":"https://openalex.org/G3462010920","display_name":null,"funder_award_id":"61309020","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G4137032510","display_name":null,"funder_award_id":"61521003","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320327720","display_name":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W182707955","https://openalex.org/W207664590","https://openalex.org/W1971630691","https://openalex.org/W1971680255","https://openalex.org/W1988074911","https://openalex.org/W2004329885","https://openalex.org/W2006023152","https://openalex.org/W2007154613","https://openalex.org/W2010151376","https://openalex.org/W2018045523","https://openalex.org/W2023655578","https://openalex.org/W2070232376","https://openalex.org/W2094308804","https://openalex.org/W2110620844","https://openalex.org/W2111925081","https://openalex.org/W2131079631","https://openalex.org/W2131681506","https://openalex.org/W2145977038","https://openalex.org/W2163557584","https://openalex.org/W2165048571","https://openalex.org/W2201498425","https://openalex.org/W2278390984","https://openalex.org/W2288434581","https://openalex.org/W2399614914","https://openalex.org/W2403737806","https://openalex.org/W2470861207","https://openalex.org/W2593265540","https://openalex.org/W2951271819","https://openalex.org/W2963316155","https://openalex.org/W3126033509","https://openalex.org/W4241081801","https://openalex.org/W4251624562","https://openalex.org/W6607446534","https://openalex.org/W6608386959","https://openalex.org/W6643319821","https://openalex.org/W6651388497","https://openalex.org/W6679686813","https://openalex.org/W6681558250","https://openalex.org/W6683812293","https://openalex.org/W6684020221","https://openalex.org/W6696068884","https://openalex.org/W6712823843","https://openalex.org/W6713458123","https://openalex.org/W6729011678"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"Many":[0],"contemporary":[1],"data":[2],"sources":[3],"in":[4,83,134,146],"a":[5],"variety":[6],"of":[7,30,71,132,168,171,179],"domains":[8],"can":[9],"naturally":[10],"be":[11],"represented":[12],"as":[13],"fully-dynamic":[14],"streaming":[15,23,64,91,100],"graphs.":[16,172],"How":[17],"to":[18,53,113,122,142,165],"design":[19,95],"an":[20,89,108],"efficient":[21],"online":[22,160],"clustering":[24,35,47,65,92,111],"algorithm":[25,112,157],"on":[26],"such":[27],"graphs":[28],"is":[29,163],"great":[31],"concern.":[32],"However,":[33],"existing":[34,63],"approaches":[36,48],"are":[37],"inappropriate":[38],"for":[39,57],"this":[40,84],"specific":[41],"tas":[42],"k":[43],"because:":[44],"(1)":[45],"static":[46],"require":[49],"expensive":[50],"computational":[51],"cost":[52],"cluster":[54,103],"the":[55,62,115,120,124,130,135,143,154,169,184],"graph":[56],"each":[58,147],"update":[59],"and":[60,94,102,128,138,162],"(2)":[61],"neither":[66],"could":[67],"fully":[68],"support":[69],"insertion/deletion":[70],"edges":[72,133,145],"nor":[73],"take":[74],"temporal":[75,136],"information":[76],"into":[77],"account.":[78],"To":[79],"tackle":[80],"these":[81],"issues,":[82],"work,":[85],"firstly":[86],"we":[87,106],"propose":[88],"appropriate":[90],"model":[93],"two":[96],"new":[97],"core":[98],"components:":[99],"reservoir":[101],"manager.":[104],"Then":[105],"present":[107],"evolution-aware":[109],"bounded-size":[110],"handle":[114],"edge":[116],"additions/deletions.":[117],"It":[118],"requires":[119],"clusters":[121],"satisfy":[123],"maximum":[125],"cluster-size":[126],"constraint,":[127],"maintains":[129],"recency":[131],"sequence":[137],"gives":[139],"high":[140],"priority":[141],"recent":[144],"cluster.":[148],"The":[149],"experimental":[150],"results":[151],"show":[152],"that":[153],"proposed":[155],"BSC":[156],"outperforms":[158],"current":[159],"algorithms":[161],"capable":[164],"keep":[166],"track":[167],"evolution":[170],"Furthermore,":[173],"it":[174],"obtains":[175],"almost":[176],"one":[177],"order":[178],"magnitude":[180],"higher":[181],"throughput":[182],"than":[183],"state-of-the-art":[185],"algorithms.":[186]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"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"}