In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Matrix factorization (MF) has been demonstrated to be one of the most competitive techniques for collaborative filtering. However, state-of-the-art MFs do not consider contextual...
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
In this paper, we address a ranking problem in web image retrieval. Due to the growing availability of web images, comprehensive retrieval of web images has been expected. Conventi...
1 The techniques for image analysis and classi cation generally consider the image sample labels xed and without uncertainties. The rank regression problem is studied in this pape...