Abstract
The grade correspondence analysis (GCA) has been used to solve classification problems with a response variable and a vector of nonnegative explanatory variables. Still it can be used in various other areas as well. In this paper, so called sorting GCA algorithm is applied first to a data matrix. This algorithm results in a set of row and column permutations, corresponding to local maxima of Spearman’s ρ. Usually the results are slight variations of the main order that can be found in the data, but some reflect minor orders. Applying the GCA algorithm again to the table of GCA results provides an opportunity to find clusters of results and therefore various prime orders of the data. Another problem considered in this paper concerns the comparing and merging of populations of data collected from different sources. GCA methods allow us to detect the differences and associations among populations and therefore provide insight relative to their being merged into one table.
Partially supported by the State Committee for Scientific Research under the research project # 8 T11F 013 17
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
Ciok A., Kowalczyk T., Pleszczynska T.: Algorithms of grade correspondence-cluster analysis, The Collected Papers on Theoretical and Applied Computer Science, 1995, 7, 5–22
van der Heijden P. G. M., Correspondence Analysis of Longitudinal Categorical Data, DSWO Press, Leiden, 1987.
Matyja O., Szczesny W.: Visualization in prediction based on grade correspondence analysis, In Klopotek M.A., Michalewicz M., Wierzchon S.T. (Eds), Intelligent Information Systems, Proceedings of the IIS’2000 Symposium, Bystra, Poland 12–16 June, 2000, Physica-Verlag, 2000, 289–301.
Szczesny W.: Grade correspondence analysis applied to questionnaire data. The analysis of level of skill, degree of disability, and employment status of disabled computer specialists in Poland. Submitted.
Szczesny W.: Detecting rows and columns of contingency table, which outlie from a total positivity pattern. Control and Cybernetics, 2000, vol. 29, no. 4. (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szczesny, W., Matyja, O. (2001). Using Grade Correspondence Analysis to Merge Populations and Detect Latent Orders. In: Kłopotek, M.A., Michalewicz, M., Wierzchoń, S.T. (eds) Intelligent Information Systems 2001. Advances in Intelligent and Soft Computing, vol 10. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1813-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1813-0_10
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1407-1
Online ISBN: 978-3-7908-1813-0
eBook Packages: Springer Book Archive