Sciweavers

860 search results - page 151 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
FOCS
2004
IEEE
13 years 11 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
VLDB
1998
ACM
120views Database» more  VLDB 1998»
13 years 12 months ago
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
Rajeev Rastogi, Kyuseok Shim
ICANNGA
2007
Springer
149views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Using Real-Valued Meta Classifiers to Integrate and Contextualize Binding Site Predictions
Currently the best algorithms for transcription factor binding site predictions are severely limited in accuracy. However, a non-linear combination of these algorithms could improv...
Mark Robinson, Offer Sharabi, Yi Sun, Rod Adams, R...
AAAI
2006
13 years 9 months ago
Large Scale Knowledge Base Systems: An Empirical Evaluation Perspective
In this paper, we discuss how our work on evaluating Semantic Web knowledge base systems (KBSs) contributes to address some broader AI problems. First, we show how our approach pr...
Yuanbo Guo, Abir Qasem, Jeff Heflin
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich