Sciweavers

1435 search results - page 70 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
IJCAI
2003
14 years 11 months ago
Evaluating Classifiers by Means of Test Data with Noisy Labels
Often the most expensive and time-consuming task in building a pattern recognition system is col­ lecting and accurately labeling training and testing data. In this paper, we exp...
Chuck P. Lam, David G. Stork
HYBRID
2005
Springer
15 years 3 months ago
Existence of Cascade Discrete-Continuous State Estimators for Systems on a Partial Order
In this paper, a cascade discrete-continuous state estimator on a partial order is proposed and its existence investigated. The continuous state estimation error is bounded by a mo...
Domitilla Del Vecchio, Richard M. Murray
JMLR
2010
108views more  JMLR 2010»
14 years 4 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...
SIGMETRICS
1992
ACM
145views Hardware» more  SIGMETRICS 1992»
15 years 1 months ago
Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approximate the performance of the Least Recently Used (LRU) replacement ...
Victor F. Nicola, Asit Dan, Daniel M. Dias
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 18 days ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon