<?xml version="1.0" encoding="UTF-8"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>Statistical Learning on Sparse Matrices</dc:title>
  <dc:title>R package rsparse version 0.5.3</dc:title>
  <dc:subject>CRAN Task View: MissingData (https://CRAN.R-project.org/view=MissingData)</dc:subject>
  <dc:description>Implements many algorithms for statistical learning on 
  sparse matrices - matrix factorizations, matrix completion, 
  elastic net regressions, factorization machines. 
  Also 'rsparse' enhances 'Matrix' package by providing methods for 
  multithreaded &lt;sparse, dense&gt; matrix products and native slicing of 
  the sparse matrices in Compressed Sparse Row (CSR) format.
  List of the algorithms for regression problems:
  1) Elastic Net regression via Follow The Proximally-Regularized Leader (FTRL) 
  Stochastic Gradient Descent (SGD), as per McMahan et al(, &lt;doi:10.1145/2487575.2488200&gt;)
  2) Factorization Machines via SGD, as per Rendle (2010, &lt;doi:10.1109/ICDM.2010.127&gt;)
  List of algorithms for matrix factorization and matrix completion:
  1) Weighted Regularized Matrix Factorization (WRMF) via Alternating Least 
  Squares (ALS) - paper by Hu, Koren, Volinsky (2008, &lt;doi:10.1109/ICDM.2008.22&gt;)
  2) Maximum-Margin Matrix Factorization via ALS, paper by Rennie, Srebro 
  (2005, &lt;doi:10.1145/1102351.1102441&gt;)
  3) Fast Truncated Singular Value Decomposition (SVD), Soft-Thresholded SVD, 
  Soft-Impute matrix completion via ALS - paper by Hastie, Mazumder 
  et al. (2014, &lt;doi:10.48550/arXiv.1410.2596&gt;)
  4) Linear-Flow matrix factorization, from 'Practical linear models for 
  large-scale one-class collaborative filtering' by Sedhain, Bui, Kawale et al 
  (2016, ISBN:978-1-57735-770-4)
  5) GlobalVectors (GloVe) matrix factorization via SGD, paper by Pennington, 
  Socher, Manning (2014, &lt;https://aclanthology.org/D14-1162/&gt;)
  Package is reasonably fast and memory efficient - it allows to work with large
  datasets - millions of rows and millions of columns. This is particularly useful 
  for practitioners working on recommender systems.</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Depends: R (&gt;= 3.6.0), methods, Matrix (&gt;= 1.3)</dc:relation>
  <dc:relation>Imports: MatrixExtra (&gt;= 0.1.7), Rcpp (&gt;= 0.11), data.table (&gt;=
1.10.0), float (&gt;= 0.2-2), RhpcBLASctl, lgr (&gt;= 0.2)</dc:relation>
  <dc:relation>LinkingTo: Rcpp, RcppArmadillo (&gt;= 0.9.100.5.0)</dc:relation>
  <dc:relation>Suggests: testthat, covr</dc:relation>
  <dc:creator>Dmitriy Selivanov &lt;selivanov.dmitriy@gmail.com&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Dmitriy Selivanov [aut, cre, cph] (ORCID:
    &lt;https://orcid.org/0000-0001-5413-1506&gt;),
  David Cortes [ctb],
  Drew Schmidt [ctb] (configure script for BLAS, LAPACK detection),
  Wei-Chen Chen [ctb] (configure script and work on linking to float
    package)</dc:contributor>
  <dc:rights>GPL (&gt;= 2)</dc:rights>
  <dc:date>2025-02-17</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=rsparse</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.rsparse</dc:identifier>
</oai_dc:dc>
