Sciweavers

2553 search results - page 198 / 511
» Evaluating machine creativity
Sort
View
163
Voted
ICML
2001
IEEE
16 years 5 months ago
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
Accurate, well-calibrated estimates of class membership probabilities are needed in many supervised learning applications, in particular when a cost-sensitive decision must be mad...
Bianca Zadrozny, Charles Elkan
166
Voted
ICML
1999
IEEE
16 years 5 months ago
AdaCost: Misclassification Cost-Sensitive Boosting
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang, Philip...
133
Voted
WWW
2005
ACM
16 years 5 months ago
Boosting SVM classifiers by ensemble
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...
Yan-Shi Dong, Ke-Song Han
VLDB
2002
ACM
84views Database» more  VLDB 2002»
16 years 4 months ago
Views in a large-scale XML repository
We are interested in de ning and querying views in a huge and highly heterogeneous XML repository Web scale. In this context, view de nitions are very large and there is no appare...
Vincent Aguilera, Sophie Cluet, Tova Milo, Pierang...
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
16 years 4 months ago
Stream Processing of XPath Queries with Predicates
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
Ashish Kumar Gupta, Dan Suciu