| clear query|facets|time |
Search criteria: decomposition.
Results from 11 to 20 from
422 (0.427s).
|
|
|
Loading phrases to help you
refine your search...
|
|
SingularValueDecomposition.java - Mahout - [source code]
|
|
....apache.mahout.math;
public class SingularValueDecomposition implements java.io.Serializable {
/** Arrays for internal storage of U and V. */
private final double[][] u;
private final double[][] v...
|
|
... where numRows() SVD(A')'=SVD(A)**/
private boolean transpositionNeeded;
/**
* Constructs and returns a new singular value decomposition object; The
* decomposed matrices can...
|
[+ show more]
[- hide]
| ... be retrieved via instance methods of the returned
* decomposition object.
*
* @param arg
* A rectangular matrix.
*/
public SingularValueDecomposition(Matrix arg... |
| ...
*
*/
@Override
public String toString() {
StringBuilder buf = new StringBuilder();
buf.append("---------------------------------------------------------------------\n");
buf.append("SingularValueDecomposition... |
|
|
|
|
|
SingularValueDecomposition # cond() - Mahout - [javadoc]
- [see source code]
|
|
...Returns the two norm condition number, which is max(S) / min(S)....
|
|
|
http://search-lucene.com/jd/mahout/ma.../SingularValueDecomposition.html#cond()
|
|
|
SingularValueDecomposition # rank() - Mahout - [javadoc]
- [see source code]
|
|
...Returns the effective numerical matrix rank, which is the number ofnonnegligible singular values....
|
|
|
http://search-lucene.com/jd/mahout/ma.../SingularValueDecomposition.html#rank()
|
|
|
[MAHOUT-45] Matrix QR decomposition - Mahout - [issue]
|
|
...Matrix QR decomposition and appropriate determinant calculator...
|
|
|
http://issues.apache.org/jira/browse/MAHOUT-45
Author: Sergey Chickin,
2011-05-21, 04:27
|
|
|
[MAHOUT-309] Implement Stochastic Decomposition - Mahout - [issue]
|
|
... sum on the partial outputs, eventually producing the kernel / gram matrix of your hashed features, which can then be run through a simple eigen-decomposition, the ((1/eigenvalue...
|
|
|
http://issues.apache.org/jira/browse/MAHOUT-309
Author: Jake Mannix,
2011-05-21, 04:18
|
|
|
Re: QR decomposition in ALS-WR code - Mahout - [mail # user]
|
|
...I think you are referring to the same step? QR decomposition is how you solve for u_i which is what I imagine the same step you have in mind. ...
|
|
|
Author: Sean Owen,
2013-03-15, 11:20
|
|
|
QR decomposition in ALS-WR code - Mahout - [mail # user]
|
|
...I was recently having a look at the ALS-WR factorisation code. Why is there a QR decomposition before computing u_i or m_j instead of multiplying the inverse of A_i with V_i straightaway...
|
|
|
Author: Dominik Hübner,
2013-03-15, 10:41
|
|
|
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
|
|
|
[MAHOUT-1148] QR Decomposition is too slow - Mahout - [issue]
|
|
...A user reported that QR decomposition is too slow. I coded up a replacement that can be 10x faster under certain cases and the new version is also tested....
|
|
|
http://issues.apache.org/jira/browse/MAHOUT-1148
Author: Ted Dunning,
2013-02-16, 04:44
|
|
|
SingularValueDecomposition # getS() - Mahout - [javadoc]
- [see source code]
|
|
...@return the diagonal matrix of singular values....
|
|
|
http://search-lucene.com/jd/mahout/ma.../SingularValueDecomposition.html#getS()
|
|
|
|
