Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

New Knowledge-Transmission Mechanisms Based Horizontal Collaborative Fuzzy Clustering Algorithms for Unequal-Length Time Series

View through CrossRef
In clustering of unequal-length time series, how to deal with the unequal lengths is a crucial step. In this paper, the given unequal-length clustering problem is first changed into several equal-length clustering sub-problems by dividing the given group of unequal-length time series into some groups of equal-length subsequences. For each sub-problem, the standard fuzzy c-means algorithm can give the clustering result represented by a partition matrix and cluster centers. In order to obtain the final clustering result, horizontal collaborative fuzzy clustering algorithm is employed to fuse the clustering results of the sub-problems. In horizontal collaborative fuzzy clustering algorithm, the collaborative knowledge is transmitted by partition matrixes whose sizes should be the same to the final partition matrix. But in the scenario here, the obtained partition matrixes most often have different sizes, thus we cannot directly use the horizontal collaborative fuzzy clustering algorithm. This paper here presents two new manners for extending the partition matrixes to have same size to the final partition matrix. In the first new manner, each added element in the extended partition matrix is the element in the same position of the extending matrix. In the second new manner, each added column is same to the corresponding column of the extending matrix; while each added element in the pre-existing column is set to be 0. The main difference between the two manners is that the normalization condition does not hold for some columns in the first new manner. Thus, normalization should be made for those columns. Meanwhile, this paper investigates the selection of the extending matrix which is crucial in the two new extending manners. Both the two new extending manners can make the partition knowledge be effectively transmitted and thus assume the proposed clustering algorithms good clustering results. Experiments showed the effectiveness of the proposed manners.
Title: New Knowledge-Transmission Mechanisms Based Horizontal Collaborative Fuzzy Clustering Algorithms for Unequal-Length Time Series
Description:
In clustering of unequal-length time series, how to deal with the unequal lengths is a crucial step.
In this paper, the given unequal-length clustering problem is first changed into several equal-length clustering sub-problems by dividing the given group of unequal-length time series into some groups of equal-length subsequences.
For each sub-problem, the standard fuzzy c-means algorithm can give the clustering result represented by a partition matrix and cluster centers.
In order to obtain the final clustering result, horizontal collaborative fuzzy clustering algorithm is employed to fuse the clustering results of the sub-problems.
In horizontal collaborative fuzzy clustering algorithm, the collaborative knowledge is transmitted by partition matrixes whose sizes should be the same to the final partition matrix.
But in the scenario here, the obtained partition matrixes most often have different sizes, thus we cannot directly use the horizontal collaborative fuzzy clustering algorithm.
This paper here presents two new manners for extending the partition matrixes to have same size to the final partition matrix.
In the first new manner, each added element in the extended partition matrix is the element in the same position of the extending matrix.
In the second new manner, each added column is same to the corresponding column of the extending matrix; while each added element in the pre-existing column is set to be 0.
The main difference between the two manners is that the normalization condition does not hold for some columns in the first new manner.
Thus, normalization should be made for those columns.
Meanwhile, this paper investigates the selection of the extending matrix which is crucial in the two new extending manners.
Both the two new extending manners can make the partition knowledge be effectively transmitted and thus assume the proposed clustering algorithms good clustering results.
Experiments showed the effectiveness of the proposed manners.

Related Results

Konstruksi Sistem Inferensi Fuzzy Menggunakan Subtractive Fuzzy C-Means pada Data Parkinson
Konstruksi Sistem Inferensi Fuzzy Menggunakan Subtractive Fuzzy C-Means pada Data Parkinson
Abstract. Fuzzy Inference System requires several stages to get the output, 1) formation of fuzzy sets, 2) formation of rules, 3) application of implication functions, 4) compositi...
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Here in this paper, we provide characterizations of fuzzy quasi-ideal in terms of level and strong level subsets. Along with it, we provide expression for the generated fuzzy quasi...
ω – SUBSEMIRING FUZZY
ω – SUBSEMIRING FUZZY
Mapping ρ is called a fuzzy subset of an empty set of S if ρ is the mapping from S to the closed interval [0,1]. A fuzzy subset ρ introduced into this paper is a fuzzy subset of se...
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
Background Several scholars defined the concepts of fuzzy soft set theory and their application on decision-making problem. Based on this concept, researchers defined the generalis...
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
Background Several scholars defined the concepts of fuzzy soft set theory and their application on decision-making problem. Based on this concept, researchers defined the generalis...
An optimal communication in WSN enabled by fuzzy clustering and improved meta-heuristic model
An optimal communication in WSN enabled by fuzzy clustering and improved meta-heuristic model
Purpose Wireless sensor networks (WSN) have been widely adopted for various applications due to their properties of pervasive computing. It is necessary to prolong the WSN lifetime...
FUZZY‐FUZZY AUTOMATA
FUZZY‐FUZZY AUTOMATA
Based on the concept of fuzzy sets of type 2 (or fuzzy‐fuzzy sets) defined by L. A. Zadeh, fuzzy‐fuzzy automata ate newly formulated and some properties of these automata are inves...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background: Clustering is one of the most important data mining methods. The k-means (c-means ) and its derivative methods are the hotspot in the field of clustering research in re...

Back to Top