recommender-als: Recommendations using alternating least squares algorithm
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
This package provides a recommendation algorithm based on alternating least squares algorithm, as made famous by the Netflix Prize.
It takes as its input a list of user-item pairs and returns a list of recommendations for each user. The current implementation is limited to using unrated pairs.
The algorithm is parallelized and should be quick enough to train the model within seconds for a few thousand users and items. Getting recommendations from a computed model happens nearly instantly.
For implementation details, see "Large-scale Parallel Collaborative Filtering for the Netflix Prize" by Yunhong Zhou, Dennis Wilkinson, Robert Schreiber and Rong Pan.
Properties
| Versions | 0.1.0.0, 0.2.0.0, 0.2.0.0, 0.2.1.0, 0.2.1.1, 0.2.2.0 |
|---|---|
| Change log | ChangeLog.md |
| Dependencies | base (>=4.11 && <5), containers (>=0.5 && <1), data-default-class (>=0.1.2 && <1), hmatrix (>=0.20 && <1), parallel (>=3.2 && <4), random (>=1.1 && <2), vector (>=0.11 && <1) [details] |
| License | BSD-3-Clause |
| Copyright | Kari Pahula 2020 |
| Author | Kari Pahula |
| Maintainer | kaol@iki.fi |
| Category | Numeric |
| Home page | https://gitlab.com/kaol/recommender-als |
| Uploaded | by kaol at 2020-07-21T10:23:05Z |
Modules
[Index] [Quick Jump]
- Numeric
- Recommender
Downloads
- recommender-als-0.2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees