This is a polynomial feature generator that operates directly on a csr_matrix and leverages data sparsity to achive time and space complexity of O(d^kD^k) where d is the density of the vector, D is the dimensionality, and k is the polynomial degree. The code currently supports 2nd and 3rd degree expansions.
-
Notifications
You must be signed in to change notification settings - Fork 1
Generate 2-3 degree polynomial or interaction features on a CSR matrix.
License
AWNystrom/SparseInteraction
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Generate 2-3 degree polynomial or interaction features on a CSR matrix.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published