Abstract
Clustering and Disjoint Principal Component Analysis (CDPCA) is a constrained principal component analysis recently proposed for clustering of objects and partitioning of variables, simultaneously, which we have implemented in R language. In this paper, we deal in detail with the alternating least-squares algorithm for CDPCA and highlight its algebraic features for constructing both interpretable principal components and clusters of objects. Two applications are given to illustrate the capabilities of this new methodology.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
dāAspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.G.: A direct formulation for sparse PCA using semidefinite programming. SIAM 49(3), 434ā448 (2007)
Jolliffe, I.T.: Principal Component Analysis, 2nd edn. Springer, New York (2002)
Jolliffe, I.T., Trendafilov, N.T., Uddin, M.: A modified principal component technique based on the lasso. J. Comput. Graph. Stat. 12(3), 531ā547 (2003)
Ma, Z.: Sparse principal component analysis and iterative thresholding. Ann. Stat. 41(2), 772ā801 (2013)
Macedo, E., Freitas, A.: Statistical methods and optimization in data mining. In: III International Conference of Optimization and Applications, OPTIMA 2012, pp. 164ā169 (2012)
R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing. http://www.R-project.org/
UCI Repository: Winsconsin Breast Cancer Data Set. http://archive.ics.uci.edu/ml/datasets/Breast+Cancer+Wisconsin+(Original)
Vichi, M., Saporta, G.: Clustering and disjoint principal component analysis. Comput. Stat. Data Anal. 53, 3194ā3208 (2009)
Vines, S.: Simple principal components. Appl. Stat. 49, 441ā451 (2000)
Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16, 645ā648 (2005)
Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Stat. 15(2), 262ā286 (2006)
Acknowledgments
The authors would like to thank the anonymous referee for all the valuable and constructive comments which have helped to improve this paper. A special thanks to Professor Maurizio Vichi for providing us a Matlab version of the ALS algorithm for performing CDPCA. This work was partially supported by Portuguese funds through the CIDMA - Center for Research and Development in Mathematics and Applications, and the Portuguese Foundation for Science and Technology (FCT ā FundaĆ§Ć£o para a CiĆŖncia e a Tecnologia), within project UID/MAT/04106/2013.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Macedo, E., Freitas, A. (2015). The Alternating Least-Squares Algorithm for CDPCA. In: Plakhov, A., Tchemisova, T., Freitas, A. (eds) Optimization in the Natural Sciences. EmC-ONS 2014. Communications in Computer and Information Science, vol 499. Springer, Cham. https://doi.org/10.1007/978-3-319-20352-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-20352-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20351-5
Online ISBN: 978-3-319-20352-2
eBook Packages: Computer ScienceComputer Science (R0)