{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/time-series-clustering-via-community","title":"Time Series Clustering via Community Detection in Networks","arxiv_id":"1508.04757","date":"2015-08-19","proceeding":null,"authors":["Leonardo N. Ferreira","Liang Zhao"],"abstract":"In this paper, we propose a technique for time series clustering using\ncommunity detection in complex networks. Firstly, we present a method to\ntransform a set of time series into a network using different distance\nfunctions, where each time series is represented by a vertex and the most\nsimilar ones are connected. Then, we apply community detection algorithms to\nidentify groups of strongly connected vertices (called a community) and,\nconsequently, identify time series clusters. Still in this paper, we make a\ncomprehensive analysis on the influence of various combinations of time series\ndistance functions, network generation methods and community detection\ntechniques on clustering results. Experimental study shows that the proposed\nnetwork-based approach achieves better results than various classic or\nup-to-date clustering techniques under consideration. Statistical tests confirm\nthat the proposed method outperforms some classic clustering algorithms, such\nas $k$-medoids, diana, median-linkage and centroid-linkage in various data\nsets. Interestingly, the proposed method can effectively detect shape patterns\npresented in time series due to the topological structure of the underlying\nnetwork constructed in the clustering process. At the same time, other\ntechniques fail to identify such patterns. Moreover, the proposed method is\nrobust enough to group time series presenting similar pattern but with time\nshifts and/or amplitude variations. In summary, the main point of the proposed\nmethod is the transformation of time series from time-space domain to\ntopological domain. Therefore, we hope that our approach contributes not only\nfor time series clustering, but also for general time series analysis tasks.","url_abs":"http://arxiv.org/abs/1508.04757v1","url_pdf":"http://arxiv.org/pdf/1508.04757v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"time-series-clustering-via-community","repo_url":"https://github.com/lnferreira/time_series_clustering_via_community_detection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"community-detection","task_name":"Community Detection"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":"time-series-clustering","task_name":"Time Series Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"lnferreira/time_series_clustering_via_community_detection","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0ca15893acb6dbd2439bf93b298b3f917612eb54bcf541f08ca48ac3e6bad7eb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}