forked from teekuningas/sparsecca
-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
12 additions
and
14 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,30 +1,28 @@ | ||
## sparsecca | ||
# sparsecca | ||
|
||
Python implementations for Sparse CCA algorithms. Includes: | ||
|
||
* Sparse (multiple) CCA based on Penalized Matrix Decomposition (PMD) from Witten et al, 2009. | ||
* Sparse CCA based on Iterative Penalized Least Squares from Mai et al, 2019. | ||
|
||
One main difference between these two is that while the first is very simple it assumes datasets to be white. | ||
|
||
### Installation | ||
|
||
#### Dependencies | ||
One main difference between these two is that while the first is very simple it assumes datasets to be white. | ||
|
||
In addition to basic scientific packages such as numpy and scipy, iterative penalized least squares needs either glmnet\_python or pyglmnet to be installed. | ||
## Installation | ||
|
||
#### This package can be installed normally with | ||
### sparsecca is available on PyPI | ||
|
||
``` | ||
git clone https://github.com/theislab/sparsecca | ||
cd sparsecca | ||
pip install . | ||
pip install sparsecca | ||
``` | ||
|
||
### Usage | ||
### Iterative penalized least squares support | ||
|
||
In addition to basic scientific packages such as numpy and scipy, iterative penalized least squares needs either glmnet\_python or pyglmnet to be installed. | ||
|
||
## Usage | ||
|
||
See examples, https://teekuningas.github.io/sparsecca | ||
|
||
### Acknowledgements | ||
## Acknowledgements | ||
|
||
Great thanks to the original authors, see Witten et al, 2009 and Mai et al, 2019. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters