11211 search results - page 1692 / 2243 » Rank-Sensitive Data Structures |
156
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Text classification has matured as a research discipline over the last decade. Independently, business intelligence over structured databases has long been a source of insights fo...
188
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
156
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
307
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Whenever an intrusion occurs, the security and value of a computer system is compromised. Network-based attacks make it difficult for legitimate users to access various network ser...
264
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...