| clear query|facets|time |
Search criteria: decomposition.
Results from 1 to 10 from
13 (0.319s).
|
|
|
Loading phrases to help you
refine your search...
|
|
Re: QR decomposition in ALS-WR code - Mahout - [mail # user]
|
|
...Computing an inverse is more costly than solving a linear system via QR decompostion. On 15.03.2013 11:41, Dominik H�bner wrote:...
|
|
|
Author: Sebastian Schelter,
2013-03-15, 10:55
|
|
|
Re: Input format to the Singular Value Decomposition in Mahout - Mahout - [mail # user]
|
|
...Hi, the sequencefile must consist of pairs, where the key represents the row number and the value holds the row vector. Best, Sebastian On 22.11.2012 15:13, Chui-Hui...
|
|
|
Author: Sebastian Schelter,
2012-11-22, 14:15
|
|
|
Re: is there some place to study Singular Value Decomposition algorithms - Mahout - [mail # user]
|
|
...http://ocw.mit.edu/courses/mathematics/18-06-linear-algebra-spring-2010/video-lectures/ On 29.08.2011 09:15, myn wrote:...
|
|
|
Author: Sebastian Schelter,
2011-08-29, 07:29
|
|
|
Re: Performance of ALS - Mahout - [mail # dev]
|
|
...Hi Sean, I simply used the Solve.solve() method, I guess it uses a QR decomposition internally. I can provide a copy of the code if you want to have a look. Best, Sebastian On 18...
|
|
|
Author: Sebastian Schelter,
2013-04-18, 21:01
|
|
|
Re: Top-N recommendations from SVD - Mahout - [mail # user]
|
|
...Hi Josh, The factorization should be quite a bit faster with the current trunk, as we reworked the QR decomposition used for solving the least squares problems of ALS. I think we can also...
|
|
|
Author: Sebastian Schelter,
2013-03-06, 10:29
|
|
|
Re: LSA in Mahout - Mahout - [mail # user]
|
|
...-document-matrix. After that you can you use one of our two SVD implementations [1,2] to compute the decomposition necessary for LSA. sebastian [1] https://cwiki.apache.org/MAHOUT/stochastic-singular-value-decomposition...
|
|
|
Author: Sebastian Schelter,
2012-12-26, 19:59
|
|
|
Re: alternating least squares - Mahout - [mail # user]
|
|
...Koobas, ALS doesn't apply QR decomposition to the user-item-matrix. It factorizes this matrix into two smaller matrices which contain the user and item features. Each user-feature vector...
|
|
|
Author: Sebastian Schelter,
2013-01-08, 23:10
|
|
|
Re: Some questions about Mahout features as advertised on the wiki - Mahout - [mail # user]
|
|
...It did not mean incremental SVD, it just means that refresh() can be called on an SVDRecommender and it will recompute its decomposition: https://issues.apache.org/jira/browse/MAHOUT-640...
|
|
|
Author: Sebastian Schelter,
2011-09-16, 05:46
|
|
|
[MAHOUT-872] Revisit the parallel ALS matrix factorization - Mahout - [issue]
|
|
...Our current code for computing a decomposition of a rating matrix with Alternating Least Squares (ALS) uses a lot of highly unefficient reduce side joins.
The rating matrix...
|
|
|
http://issues.apache.org/jira/browse/MAHOUT-872
Author: Sebastian Schelter,
2012-02-09, 14:00
|
|
|
Re: Decomposing large graphs - Mahout - [mail # user]
|
|
...On 17.12.2011 17:27, Dmitriy Lyubimov wrote: I tested the decomposition of the wikipedia pagelink graph (130M edges, 5.6M vertices making approx. quarter of a billion non...
|
|
|
Author: Sebastian Schelter,
2011-12-17, 22:58
|
|
|
|
