Sciweavers

272 search results - page 53 / 55
» SQL Queries Over Unstructured Text Databases
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 7 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
EDBT
2009
ACM
116views Database» more  EDBT 2009»
13 years 12 months ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...
WEBDB
2007
Springer
79views Database» more  WEBDB 2007»
14 years 1 months ago
Navigating Extracted Data with Schema Discovery
Open Information Extraction (OIE) is a recently-introduced type of information extraction that extracts small individual pieces of data from input text without any domainspecific...
Michael J. Cafarella, Dan Suciu, Oren Etzioni
JCDL
2009
ACM
127views Education» more  JCDL 2009»
14 years 1 months ago
Finding topic trends in digital libraries
We propose a generative model based on latent Dirichlet allocation for mining distinct topics in document collections by integrating the temporal ordering of documents into the ge...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
PPDP
2007
Springer
14 years 1 months ago
Interactive, scalable, declarative program analysis: from prototype to implementation
Static analyses provide the semantic foundation for tools ranging from optimizing compilers to refactoring browsers and advanced debuggers. Unfortunately, developing new analysis ...
William C. Benton, Charles N. Fischer