Search Results for author:
Found 4 papers, 1 papers with code
Mixture-Rank Matrix Approximation for Collaborative Filtering
However, our studies show that submatrices with different ranks could coexist in the same user-item rating matrix, so that approximations with fixed ranks cannot perfectly describe the internal structures of the rating matrix, therefore leading to inferior recommendation accuracy.
Ranked #4 on
Recommendation Systems
on MovieLens 10M
A constrained clustering based approach for matching a collection of feature sets
In this paper, we consider the problem of finding the feature correspondences among a collection of feature sets, by using their point-wise unary features.
A Matrix Decomposition Perspective to Multiple Graph Matching
Graph matching has a wide spectrum of real-world applications and in general is known NP-hard.
A General Multi-Graph Matching Approach via Graduated Consistency-regularized Boosting
We propose multi-graph matching methods to incorporate the two aspects by boosting the affinity score, meanwhile gradually infusing the consistency as a regularizer.
