| clear query|facets|time |
Search criteria: relavance computation.
Results from 1 to 10 from
135 (0.694s).
|
|
|
Did you mean:
|
|
Loading phrases to help you
refine your search...
|
|
|
No results found for relavance computation.
|
|
|
Search results for computation :
|
|
|
Re: Bug in similarity computation - Mahout - [mail # dev]
|
|
...IIRC Sarwar et.al.'s "Item-Based Collaborative Filtering Recommendation Algorithms" explicitly mentions to only use the co-rated cases for Pearson correlation. On 06.04.20...
|
|
|
Author: Sebastian Schelter,
2011-04-06, 15:43
|
|
|
[MAHOUT-1169] Multithreaded recommendation computation from a factorization - Mahout - [issue]
|
|
...Similar to the latest changes to the ALS code, the code to compute recommendations from a factorization should also take advantage of sharing read-only data and multithreading....
|
|
|
http://issues.apache.org/jira/browse/MAHOUT-1169
Author: Sebastian Schelter,
2013-03-21, 20:19
|
|
|
Re: Understanding similaraties computation in RecommenderJob - Mahout - [mail # user]
|
|
... confusion. I'll try to give a brief explanation of the similarity computation, feel free to ask more questions if things don't get clear. RecommenderJob starts ItemSimilarityJob which creates...
|
|
... an item x user matrix from the preference data and uses RowSimilarityJob to compute the pairwise similarities of the rows of this matrix (the items). So the best place to start is looking...
|
[+ show more]
[- hide]
| ... at at RowSimilarityJob. RowSimilarityJob uses an implementation of DistributedVectorSimilarity to compute the similarities in two phases. In the first phase each item-vector is shown... |
| ... to the similarity implementation and it can compute a "weight" for it. In the second phase for all pairs of rows that have at least one cooccurrence the method similarity(...) is called with the formerly... |
| ... computed weights and a list of all cooccurring values. This generic approach allows us to use different implementations of DistributedVectorSimilarity so we can support a wide range of similarity... |
|
|
Author: Sebastian Schelter,
2011-01-18, 10:32
|
|
|
Re: Understanding similaraties computation in RecommenderJob - Mahout - [mail # user]
|
|
...B are [user2: 4, user3: 2, user4: 1] Let's now assume we want to use the tanimoto coefficient as similarity measure for those items, which is computed by dividing the number of shared ratings...
|
|
... cooccurring ratings between the item vectors are collected, which are 3 and 4 from user2 and 5 and 2 from user3, these together with the previously computed weights are the input to Distributed...
|
[+ show more]
[- hide]
| ...TanimotoCoefficientVectorSimilarity.similarity(...). We now only need to count the number of cooccurred ratings which is 2 and can compute the tanimoto coefficient with that: tanimoto(itemA, itemB) = numberOfCooccurredRatings / (weight... |
| ...(itemA) + weight(itemB) - numberOfCooccurredRatings) = 2 / (3 + 3 - 2) = 0.5 And here's how RowSimilarityJob would compute the pearson correlation between both items: In the first step our weight... |
| ... function simply returns NaN as we don't need that for the computation. In the second step we can compute the pearson correlation by only looking at the cooccurred ratings for each item... |
|
|
Author: Sebastian Schelter,
2011-01-18, 15:33
|
|
|
[MAHOUT-418] Computing the pairwise similarities of the rows of a matrix - Mahout - [issue]
|
|
...In response to the wish from MAHOUT-362 and the latest discussion on the mailing list started by Kris Jack about computing a document similarity matrix, I tried to generalize the approach...
|
|
... we're already using to compute the item-item-similarities for collaborative filtering.
The job in the patch computes the pairwise similarity of the rows of a matrix in a distributed manner...
|
|
|
http://issues.apache.org/jira/browse/MAHOUT-418
Author: Sebastian Schelter,
2010-10-31, 15:49
|
|
|
[MAHOUT-609] Add an option to make RecommenderJob write out it's computed item similarities - Mahout - [issue]
|
|
...As RecommenderJob already includes the computation of similar items, we should an add option that makes it write out those similar items in the same format as ItemSimilarityJob does, so...
|
|
|
http://issues.apache.org/jira/browse/MAHOUT-609
Author: Sebastian Schelter,
2013-01-18, 12:12
|
|
|
Re: [jira] Commented: (MAHOUT-418) Computing the pairwise similarities of the rows of a matrix - Mahout - [mail # dev]
|
|
...Hi Kris, Glad to hear that the code works and is useful to you! -sebastian Am 22.06.2010 13:33, schrieb Kris Jack (JIRA):...
|
|
|
Author: Sebastian Schelter,
2010-06-22, 12:28
|
|
|
Algorithm summary table - Apache Mahout - Apache Software Foundation - Mahout - [wiki]
|
|
...-ready? needs Hadoop? input format run command
Itembased Collaborative Filtering compute pairwise item-similarities x x tab-separated text files itemsimilarity
Itembased Collaborative...
|
|
... Filtering compute recommendations as batch x x tab-separated text files recommenditembased
Matrix factorization with Alternating Least Squares decompose a rating matrix x tab...
|
|
|
https://cwiki.apache.org/confluence/display/MAHOUT/Algorithm+summary+table
Author: Sebastian Schelter,
2011-07-16, 00:00
|
|
|
[MAHOUT-883] Add an example that computes PageRank on the wikipedia page link graph - Mahout - [issue]
|
|
...Use the link graph of the english wikipedia (available from http://users.on.net/~henry/home/wikipedia.htm) to demonstrate Mahout's pagerank implementation....
|
|
|
http://issues.apache.org/jira/browse/MAHOUT-883
Author: Sebastian Schelter,
2012-06-22, 06:52
|
|
|
[MAHOUT-739] MapReduce job to compute the degree distribution of an undirected graph - Mahout - [issue]
|
|
...The distribution of node degrees in a graph is an interesting measurement that is easy to compute with MapReduce. As a first step we compute it for undirected graphs....
|
|
|
http://issues.apache.org/jira/browse/MAHOUT-739
Author: Sebastian Schelter,
2012-02-09, 14:00
|
|
|
|
