{"id":"https://openalex.org/W2945213772","doi":"https://doi.org/10.1109/rivf.2019.8713702","title":"Incremental Clustering for Time Series Data Based on an Improved Leader Algorithm","display_name":"Incremental Clustering for Time Series Data Based on an Improved Leader Algorithm","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2945213772","doi":"https://doi.org/10.1109/rivf.2019.8713702","mag":"2945213772"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2019.8713702","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2019.8713702","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","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/A5000630985","display_name":"Huynh Thi Thu Thuy","orcid":null},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Huynh Thi Thu Thuy","raw_affiliation_strings":["Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology, Ho Chi Minh City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059729965","display_name":"Duong Tuan Anh","orcid":"https://orcid.org/0000-0003-3340-7117"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Duong Tuan Anh","raw_affiliation_strings":["Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology, Ho Chi Minh City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108249484","display_name":"Vo Thi Ngoc Chau","orcid":null},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Vo Thi Ngoc Chau","raw_affiliation_strings":["Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology, Ho Chi Minh City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47265099"],"apc_list":null,"apc_paid":null,"fwci":0.167,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.42668452,"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":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9983000159263611,"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/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9983000159263611,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9965999722480774,"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/T12761","display_name":"Data Stream Mining Techniques","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.9098755121231079},{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.8317679762840271},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7601525187492371},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.7127861976623535},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.6824406385421753},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.6455843448638916},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.6191380620002747},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5644673109054565},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"Fuzzy clustering","score":0.4524213373661041},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.44534674286842346},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.4134824872016907},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37039995193481445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34428733587265015}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.9098755121231079},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.8317679762840271},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7601525187492371},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.7127861976623535},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.6824406385421753},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.6455843448638916},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.6191380620002747},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5644673109054565},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.4524213373661041},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.44534674286842346},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.4134824872016907},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37039995193481445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34428733587265015},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2019.8713702","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2019.8713702","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","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":16,"referenced_works":["https://openalex.org/W1523439439","https://openalex.org/W1581502805","https://openalex.org/W1992419399","https://openalex.org/W2022902860","https://openalex.org/W2065179205","https://openalex.org/W2088340225","https://openalex.org/W2095897464","https://openalex.org/W2103016999","https://openalex.org/W2117544284","https://openalex.org/W2153233077","https://openalex.org/W2182408148","https://openalex.org/W2221464266","https://openalex.org/W2296343138","https://openalex.org/W4235169531","https://openalex.org/W4255469293","https://openalex.org/W6685469828"],"related_works":["https://openalex.org/W2160785859","https://openalex.org/W2390610678","https://openalex.org/W3140018618","https://openalex.org/W3146523624","https://openalex.org/W2188840951","https://openalex.org/W2241871771","https://openalex.org/W2897883632","https://openalex.org/W2171583777","https://openalex.org/W2555816786","https://openalex.org/W2407786351"],"abstract_inverted_index":{"Incremental":[0],"clustering":[1,19,46,69,77,90,195],"is":[2,54,65,72,184],"one":[3],"of":[4,58,94,98,105,113,148,154,190],"the":[5,59,130,134,146,149,155],"most":[6],"important":[7],"tasks":[8,30],"in":[9,23,115,158],"streaming":[10,15],"data":[11,28,120,126],"mining.":[12],"As":[13],"for":[14,48,107,133],"time":[16,26,49,106,159],"series,":[17],"incremental":[18,45,68],"can":[20],"be":[21],"used":[22],"some":[24,83,139],"advanced":[25],"series":[27,160],"mining":[29],"such":[31,85],"as":[32,86],"anomaly":[33],"detection":[34],"and":[35,100,123,181],"motif":[36],"discovery.":[37],"In":[38],"this":[39,125],"paper,":[40],"we":[41,117,163],"propose":[42],"a":[43,66,73,95,103,119],"novel":[44],"method":[47,53,70],"series.":[50],"The":[51,168],"proposed":[52],"an":[55],"improved":[56],"variant":[57],"Leader":[60,64,80,157,180],"algorithm,":[61],"called":[62],"I-Leader.":[63],"well-known":[67],"which":[71,92],"single-pass":[74],"distance-based":[75],"partitional":[76],"method.":[78],"However,":[79],"suffers":[81],"from":[82],"weaknesses":[84,112],"producing":[87],"not":[88],"good":[89],"result":[91],"consists":[93],"large":[96],"number":[97],"clusters":[99],"therefore":[101],"requiring":[102],"lot":[104],"clustering.":[108,161],"To":[109],"overcome":[110],"these":[111,191],"Leader,":[114],"I-Leader":[116,150,165,174,183],"employ":[118],"summarization":[121,127],"technique":[122],"use":[124],"to":[128,144],"maintain":[129],"high":[131],"quality":[132],"clusters.":[135],"We":[136],"have":[137],"conducted":[138],"experiments":[140],"on":[141],"several":[142],"datasets":[143],"compare":[145,164],"performance":[147],"algorithm":[151,175],"with":[152,166,193],"that":[153,172],"original":[156],"Besides,":[162],"k-Means.":[167,182],"experimental":[169],"results":[170],"show":[171],"our":[173],"runs":[176],"faster":[177],"than":[178,188],"both":[179,189],"also":[185],"more":[186],"effective":[187],"algorithms":[192],"better":[194],"results.":[196]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}