Transfer Learning for Subsequence Clustering from Multiple Source Domains

In many data-sparse applications, acquiring sufficient data for clustering can be challenging. To address the clustering of sparse subsequences within a target domain, this paper proposes a novel transfer learning subsequence clustering algorithm leveraging multiple source domains. Based on an improved Fuzzy C-Means algorithm, the method transfers knowledge from multiple source domains to guide target domain subsequence clustering. Crucially, canonical correlation coefficients between the target domain and each source domain are computed to determine the weight of transferred knowledge, thereby mitigating negative transfer. The proposed algorithm is evaluated extensively on diverse synthetic and real-world datasets. Experimental results demonstrate its superior performance compared to related clustering algorithms across multiple established public datasets and two real-world case studies.

Authors

Institutions

Publication Details

Published
2025-07-11
DOI
https://doi.org/10.1109/cisat66811.2025.11181984
Primary Topic
Speech and Audio Processing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Transfer Learning for Subsequence Clustering from Multiple Source Domains

Q. Xu, Ling Wang, Rongxian Wang
Speech and Audio Processing
article

Transfer Learning for Subsequence Clustering from Multiple Source Domains

Q. Xu, Ling Wang, Rongxian Wang
article en

Abstract

In many data-sparse applications, acquiring sufficient data for clustering can be challenging. To address the clustering of sparse subsequences within a target domain, this paper proposes a novel transfer learning subsequence clustering algorithm leveraging multiple source domains. Based on an improved Fuzzy C-Means algorithm, the method transfers knowledge from multiple source domains to guide target domain subsequence clustering. Crucially, canonical correlation coefficients between the target domain and each source domain are computed to determine the weight of transferred knowledge, thereby mitigating negative transfer. The proposed algorithm is evaluated extensively on diverse synthetic and real-world datasets. Experimental results demonstrate its superior performance compared to related clustering algorithms across multiple established public datasets and two real-world case studies.

University of Science and Technology Beijing (CN)
Openalex Percentile: Top 66%
Speech and Audio Processing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Transfer Learning for Subsequence Clustering from Multiple Source Domains — Q. Xu, Ling Wang, et al. · (2025) | TGRS Research Map | TGRS