Recursive information granulation : aggregation and interpretation issues

This paper contributes to the conceptual and algorithmic framework of information granulation. We revisit the role of information granules that are relevant to several main classes of technical pursuits involving temporal and spatial granulation. A detailed algorithm of information granulation, rega...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society. - 1996. - 33(2003), 1 vom: 28., Seite 96-112
1. Verfasser: Bargiela, A (VerfasserIn)
Weitere Verfasser: Pedrycz, W
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2003
Zugriff auf das übergeordnete Werk:IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
Schlagworte:Journal Article
Beschreibung
Zusammenfassung:This paper contributes to the conceptual and algorithmic framework of information granulation. We revisit the role of information granules that are relevant to several main classes of technical pursuits involving temporal and spatial granulation. A detailed algorithm of information granulation, regarded as an optimization problem reconciling two conflicting design criteria, namely, a specificity of information granules and their experimental relevance (coverage of numeric data), is provided in the paper. The resulting information granules are formalized in the language of set theory (interval analysis). The uniform treatment of data points and data intervals (sets) allows for a recursive application of the algorithm. We assess the quality of information granules through application of the fuzzy c-means (FCM) clustering algorithm. Numerical studies deal with two-dimensional (2D) synthetic data and experimental traffic data
Beschreibung:Date Completed 02.10.2012
Date Revised 01.02.2008
published: Print
Citation Status PubMed-not-MEDLINE
ISSN:1941-0492
DOI:10.1109/TSMCB.2003.808190