[
https://issues.apache.org/jira/browse/MAHOUT-836?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13123795#comment-13123795
]
Ted Dunning commented on MAHOUT-836:
------------------------------------
I imagine that there is interest. Can you say a bit about the scaling of the
algorithm? Is it iterative? Parallel? Parallelizable?
Is there a way to leverage a scalable non-robust SVD?
Is this essentially a regularized SVD?
> On donating my Robust PCA Java code to Mahout
> ---------------------------------------------
>
> Key: MAHOUT-836
> URL: https://issues.apache.org/jira/browse/MAHOUT-836
> Project: Mahout
> Issue Type: New JIRA Project
> Components: Classification
> Environment: Platform independent
> Reporter: Sujit Nair
> Labels: newbie
> Original Estimate: 672h
> Remaining Estimate: 672h
>
> Hi All,
> I have an implementation of Robust PCA (a.k.a low rank and sparse
> decomposition) in Java which I would like to donate to Mahout. I am a MATLAB
> expert, comfortable with C++ and have just started with Java. I am completely
> new to Mahout but am very excited to participate and contribute.
> I have tested my code exhaustively and there does not seem to be any issues.
> The results are very good but the code definitely needs some optimization.
> Please let me know if there is interest.
> Thanks,
> Sujit
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
