Creates a full rank matrix out of a given matrix. The intended use is for one-hot encoded design matrices that should be used in linear models to ensure that significant associations can be correctly interpreted. However, 'fullRankMatrix' can be applied to any matrix to make it full rank. It removes columns with only 0's, merges duplicated columns and discovers linearly dependent columns and replaces them with linearly independent columns that span the space of the original columns. Columns are renamed to reflect those modifications. This results in a full rank matrix that can be used as a design matrix in linear models. The algorithm and some functions are inspired by Kuhn, M. (2008) <doi:10.18637/jss.v028.i05>.
Version: 0.1.0 Suggests: knitr, rmarkdown, igraph, testthat (≥ 3.0.0), WeightIt, caret, plm, spelling Published: 2024-06-28 DOI: 10.32614/CRAN.package.fullRankMatrix Author: Paula Weidemueller [aut, cre, cph] (Twitter: @PaulaH_W), Constantin Ahlmann-Eltze [aut] (Twitter: @const_ae) Maintainer: Paula Weidemueller <paulahw3214 at gmail.com> BugReports: https://github.com/Pweidemueller/fullRankMatrix/issues License: MIT + file LICENSE URL: https://github.com/Pweidemueller/fullRankMatrix NeedsCompilation: no Language: en-US Citation: fullRankMatrix citation info Materials: README NEWS CRAN checks: fullRankMatrix results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=fullRankMatrix to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4