Projects that are tagged with sparse.


Logo JMLR MLPACK 1.0.11

by rcurtin - December 11, 2014, 18:20:35 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 36082 views, 7057 downloads, 6 subscriptions

Rating Whole StarWhole StarWhole StarWhole Star1/2 Star
(based on 1 vote)

About: A scalable, fast C++ machine learning library, with emphasis on usability.

Changes:
  • Proper handling of dimension calculation in PCA.
  • Load parameter vectors properly for LinearRegression models.
  • Linker fixes for AugLagrangian specializations under Visual Studio.
  • Add support for observation weights to LinearRegression.
  • MahalanobisDistance<> now takes root of the distance by default and therefore satisfies the triangle inequality (TakeRoot now defaults to true).
  • Better handling of optional Armadillo HDF5 dependency.
  • Fixes for numerous intermittent test failures.
  • math::RandomSeed() now sets the seed for recent (>= 3.930) Armadillo versions.
  • Handle Newton method convergence better for SparseCoding::OptimizeDictionary() and make maximum iterations a parameter.
  • Known bug: CosineTree construction may fail in some cases on i386 systems (376).

Logo Sparse PCA 1.0

by tbuehler - January 8, 2012, 19:01:47 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2891 views, 654 downloads, 1 subscription

About: A Matlab implementation of Sparse PCA using the inverse power method for nonlinear eigenproblems.

Changes:

Initial Announcement on mloss.org.


Logo sccan 0.0

by stnava - January 13, 2011, 18:14:20 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3508 views, 864 downloads, 1 subscription

About: A work in progress

Changes:

Initial Announcement on mloss.org.


Logo redsvd 0.1.0

by hillbig - August 30, 2010, 18:13:55 CET [ Project Homepage BibTeX Download ] 4038 views, 865 downloads, 1 subscription

About: redsvd is a library for solving several matrix decomposition (SVD, PCA, eigen value decomposition) redsvd can handle very large matrix efficiently, and optimized for a truncated SVD of sparse matrices. For example, redsvd can compute a truncated SVD with top 20 singular values for a 100K x 100K matrix with 10M nonzero entries in about two second.

Changes:

Initial Announcement on mloss.org.