Name
Abstract | ||
|---|---|---|
This paper describes the solution method taken by LeBuSiShu team for track1 in ACM KDD CUP 2011 contest (resulting in the 5th place). We identified two main challenges: the unique item taxonomy characteristics as well as the large data set size.To handle the item taxonomy, we present a novel method called Matrix Factorization Item Taxonomy Regularization (MFITR). MFITR obtained the 2nd best prediction result out of more then ten implemented algorithms. For rapidly computing multiple solutions of various algorithms, we have implemented an open source parallel collaborative filtering library on top of the GraphLab machine learning framework. We report some preliminary performance results obtained using the BlackLight supercomputer. |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | machine learning,cluster computing,matrix factorization,collaborative filtering |
Field | DocType | Volume |
Data mining,Collaborative filtering,Supercomputer,Computer science,Matrix decomposition,Regularization (mathematics),Artificial intelligence,Multi-core processor,Machine learning | Journal | abs/1108.2580 |
Citations | PageRank | References |
7 | 0.47 | 11 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yao Wu | 1 | 284 | 8.68 |
| Qiang Yan | 2 | 7 | 0.47 |
| Danny Bickson | 3 | 1105 | 46.91 |
| Yucheng Low | 4 | 1078 | 39.38 |
| Qing Yang | 5 | 391 | 21.97 |