Sciweavers

2889 search results - page 497 / 578
» Querying Structured Hyperdocuments
Sort
View
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 8 months ago
Mining reference tables for automatic text segmentation
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
Eugene Agichtein, Venkatesh Ganti
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 8 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
CHI
2008
ACM
14 years 8 months ago
Large scale analysis of web revisitation patterns
Our work examines Web revisitation patterns. Everybody revisits Web pages, but their reasons for doing so can differ depending on the particular Web page, their topic of interest,...
Eytan Adar, Jaime Teevan, Susan T. Dumais
POPL
2007
ACM
14 years 8 months ago
PADS/ML: a functional data description language
Massive amounts of useful data are stored and processed in ad hoc formats for which common tools like parsers, printers, query engines and format converters are not readily availa...
Artem Gleyzer, David Walker, Kathleen Fisher, Mary...
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