Sciweavers

1940 search results - page 70 / 388
» Optimizing search engines using clickthrough data
Sort
View
PODS
1997
ACM
182views Database» more  PODS 1997»
14 years 1 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
13 years 10 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
13 years 10 months ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...
WWW
2010
ACM
14 years 3 months ago
Sampling high-quality clicks from noisy click data
Click data captures many users’ document preferences for a query and has been shown to help significantly improve search engine ranking. However, most click data is noisy and of...
Adish Singla, Ryen W. White
BMCBI
2004
185views more  BMCBI 2004»
13 years 8 months ago
Linear fuzzy gene network models obtained from microarray data by exhaustive search
Background: Recent technological advances in high-throughput data collection allow for experimental study of increasingly complex systems on the scale of the whole cellular genome...
Bahrad A. Sokhansanj, J. Patrick Fitch, Judy N. Qu...