Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithms
Search options not deleted
user 27866
An unambiguous list of computational steps involved in finding a solution to a class of problems.
1
vote
Accepted
Low Rank Matrix Factorization Collaborative Filtering - given a sparse set of feature data
NA is not 0. In the nomenclature from the class, your $R$ matrix would reflect whether it is NA or not. For your $Y$, it doesn't matter what you put there because after multiplying with $R$, it won't …
- 379
3
votes
Accepted
How to deal with giant sparse matrices?
If you want to go bigger, I would suggest http://spark.incubator.apache.org/ which has been developed to solve the problem of iterative algorithms (like alternating least squares). … Redistribution is expensive in Hadoop due to network costs, so such algorithms suffer.
If you do end up trying it, please share your experience. …
- 379