An Ensemble of Competitive Learning Networks with Different Representations for Temporal Data Clustering

Yang, Y and Chen, K (2006) An Ensemble of Competitive Learning Networks with Different Representations for Temporal Data Clustering In: IJCNN'06, 2006-07-16 - 2006-07-21, Vancouver, Canada.

Full text not available from this repository.

Abstract

Temporal data clustering provides useful techniques for condensing and summarizing information conveyed in temporal data, which is demanded in various fields ranging from time series analysis to sequential data understanding. In this paper, we propose a novel approach to temporal data clustering by an ensemble of competitive learning networks incorporated by different representations of temporal data. In our approach, competitive learning networks of the rival-penalized learning mechanism are employed for clustering analyses based on different temporal data representations while an optimal selection function is applied to find out a final consensus partition from multiple partition candidates yielded by applying alternative consensus functions to results of competitive learning on different representations. Thanks to its capability of the rival penalized learning rules in automatic model selection and the synergy of fusing diverse partitions on different representations, our ensemble approach yields favorite results, which has been demonstrated in time series and motion trajectory clustering tasks.

Item Type:	Conference or Workshop Item (UNSPECIFIED)
Divisions :	Surrey research (other units)
Authors :	Name Email ORCID Yang, Y yun.yang@surrey.ac.uk Chen, K
Date :	30 October 2006
DOI :	10.1109/IJCNN.2006.247294
Contributors :	Contribution Name Email ORCID publisher IEEE,
Depositing User :	Symplectic Elements
Date Deposited :	17 May 2017 12:28
Last Modified :	23 Jan 2020 17:51
URI:	http://epubs.surrey.ac.uk/id/eprint/835451

Actions (login required)

View Item

Downloads