912 search results - page 150 / 183 » Inductive Databases as Ranking |
SAC
2006
ACM
14 years 2 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
MLDM
2005
Springer
14 years 2 months ago
2005
Springer
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
EDBT
2010
ACM
14 years 3 months ago
2010
ACM
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...