Sciweavers

4560 search results - page 67 / 912
» Finding Data in the Neighborhood
Sort
View
WSDM
2010
ACM
251views Data Mining» more  WSDM 2010»
14 years 5 months ago
Large Scale Query Log Analysis of Re-Finding
Although Web search engines are targeted towards helping people find new information, people regularly use them to re-find Web pages they have seen before. Researchers have noted ...
Jaime Teevan, Sarah K. Tyler
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 8 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
DCC
2005
IEEE
14 years 7 months ago
The Markov Expert for Finding Episodes in Time Series
We describe a domain-independent, unsupervised algorithm for refined segmentation of time series data into meaningful episodes, focusing on the problem of text segmentation. The V...
Jimming Cheng, Michael Mitzenmacher
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
14 years 5 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila
WSDM
2009
ACM
112views Data Mining» more  WSDM 2009»
14 years 2 months ago
Finding text reuse on the web
With the overwhelming number of reports on similar events originating from different sources on the web, it is often hard, using existing web search paradigms, to find the origi...
Michael Bendersky, W. Bruce Croft