611 search results - page 115 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
111
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
123
click to vote
AUSDM
2007
Springer
15 years 8 months ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
230
click to vote
VLDB
2008
ACM
16 years 2 months ago
2008
ACM
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...
146
click to vote
IWCIA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
163
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...