Abstract
Finding a linear structure in multidimensional data is a main purpose of the principal component analysis (PCA). This paper describes a feature clustering method to detect monotonic chain structures embedded in symbolic data tables based on the Cartesian system model (CSM) which is a mathematical model to manipulate symbolic objects.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
BOCK, H.-H. and DIDAY, E. (2000): Analysis of Symbolic Data, Springer-Verlag, Berlin.
ICHINO, M and YAGUCHI, H. (1994): Generalized Minkowski metrics for mixed feature-type data analysis, IEEE Trans. on Syst. Man, Cybern., 24(4), 698–708.
ICHINO, M. and YAGUCHI, H. (1998): Symbolic pattern classifiers based on the Cartesian system model. In C. Hayashi, et al., (Eds), Data Science, Classification, and Related Methods, Springer-Verlag, Tokyo.
LIN, T.Y. and CERCONE, N. (1997): Rough Sets and Data Mining, Kluwer Academic Publishers.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ichino, M. (2007). Feature Clustering Method to Detect Monotonic Chain Structures in Symbolic Data. In: Brito, P., Cucumel, G., Bertrand, P., de Carvalho, F. (eds) Selected Contributions in Data Analysis and Classification. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73560-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-73560-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73558-8
Online ISBN: 978-3-540-73560-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)