DocumentCode
2542166
Title
Fuzzy clustering of sampled functions
Author
Höppner, Frank ; Klawonn, Frank
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Univ. of Appl. Sci., Emden, Germany
fYear
2000
fDate
2000
Firstpage
251
Lastpage
255
Abstract
Fuzzy clustering algorithms perform cluster analysis on a data set that consists of feature attribute vectors. In the context of multiple sampled functions, a set of samples (e.g. a time series) becomes a single datum. We show how the already known algorithms can be used to perform fuzzy cluster analysis on this kind of data sets by replacing the conventional prototypes with sets of prototypes. This approach allows reusing the known algorithms and works also with other data than sampled functions. Furthermore, to reduce the computational costs in case of single-input/single-output functions we present a new fuzzy clustering algorithm, which uses for the first time a more complex input data type (data points aggregated to data-lines instead of raw data). The new alternating optimisation algorithm performs duster analysis directly on this more compact representation of the sampled functions
Keywords
fuzzy set theory; pattern clustering; cluster analysis; computational costs; data set; feature attribute vectors; fuzzy clustering algorithms; multiple sampled functions; optimisation algorithm; sampled functions; single-input/single-output function; Algorithm design and analysis; Approximation algorithms; Clustering algorithms; Computational efficiency; Function approximation; Fuzzy sets; Fuzzy systems; Performance analysis; Piecewise linear techniques; Prototypes;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Information Processing Society, 2000. NAFIPS. 19th International Conference of the North American
Conference_Location
Atlanta, GA
Print_ISBN
0-7803-6274-8
Type
conf
DOI
10.1109/NAFIPS.2000.877431
Filename
877431
Link To Document