Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
spark
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
cs525-sp18-g07
spark
Commits
93b96b44
Commit
93b96b44
authored
11 years ago
by
Nick Pentreath
Browse files
Options
Downloads
Patches
Plain Diff
Adding implicit feedback ALS to MLlib user guide
parent
c6ceaeae
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
docs/mllib-guide.md
+20
-4
20 additions, 4 deletions
docs/mllib-guide.md
with
20 additions
and
4 deletions
docs/mllib-guide.md
+
20
−
4
View file @
93b96b44
...
...
@@ -144,10 +144,9 @@ Available algorithms for clustering:
# Collaborative Filtering
[
Collaborative
filtering
](
http://en.wikipedia.org/wiki/Recommender_system#Collaborative_filtering
)
[
Collaborative filtering
](
http://en.wikipedia.org/wiki/Recommender_system#Collaborative_filtering
)
is commonly used for recommender systems. These techniques aim to fill in the
missing entries of a user-
product
association matrix. MLlib currently supports
missing entries of a user-
item
association matrix. MLlib currently supports
model-based collaborative filtering, in which users and products are described
by a small set of latent factors that can be used to predict missing entries.
In particular, we implement the
[
alternating least squares
...
...
@@ -158,7 +157,24 @@ following parameters:
*
*numBlocks*
is the number of blacks used to parallelize computation (set to -1 to auto-configure).
*
*rank*
is the number of latent factors in our model.
*
*iterations*
is the number of iterations to run.
*
*lambda*
specifies the regularization parameter in ALS.
*
*lambda*
specifies the regularization parameter in ALS.
*
*implicitPrefs*
specifies whether to use the
*explicit feedback*
ALS variant or one adapted for
*implicit feedback*
data
*
*alpha*
is a parameter applicable to the implicit feedback variant of ALS that governs the
*baseline*
confidence in preference observations
## Explicit vs Implicit Feedback
The standard approach to matrix factorization based collaborative filtering treats
the entries in the user-item matrix as
*explicit*
preferences given by the user to the item.
It is common in many real-world use cases to only have access to
*implicit feedback*
(e.g. views, clicks, purchases, likes, shares etc.). The approach used in MLlib to deal with
such data is taken from
[
Collaborative Filtering for Implicit Feedback Datasets
](
http://research.yahoo.com/pub/2433
)
.
Essentially instead of trying to model the matrix of ratings directly, this approach treats the data as
a combination of binary preferences and
*confidence values*
. The ratings are then related
to the level of confidence in observed user preferences, rather than explicit ratings given to items.
The model then tries to find latent factors that can be used to predict the expected preference of a user
for an item.
Available algorithms for collaborative filtering:
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment