Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Speeding up Memory-based Collaborative Filtering with Landmarks   Recommender systems play an important role in many scenarios where users are
overwhelmed with too many choices to make. In this context, Collaborative
Filtering (CF) arises by providing a simple and widely used approach for
personalized recommendation. Memory-based CF algorithms mostly rely on
similarities between pairs of users or items, which are posteriorly employed in
classifiers like k-Nearest Neighbor (kNN) to generalize for unknown ratings. A
major issue regarding this approach is to build the similarity matrix.
Depending on the dimensionality of the rating matrix, the similarity
computations may become computationally intractable. To overcome this issue, we
propose to represent users by their distances to preselected users, namely
landmarks. This procedure allows to drastically reduce the computational cost
associated with the similarity matrix. We evaluated our proposal on two
distinct distinguishing databases, and the results showed our method has
consistently and considerably outperformed eight CF algorithms (including both
memory-based and model-based) in terms of computational performance.

6
The categories of this paper are: astro-ph
2
The categories of this paper are: math
27
The categories of this paper are: comp-gas
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin
16
The categories of this paper are: stat
29
The categories of this paper are: funct-an
5
The categories of this paper are: gr-qc
28
The categories of this paper are: alg-geom
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
12
The categories of this paper are: nucl-th
24
The categories of this paper are: dg-ga
35
The categories of this paper are: mtrl-th
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex