Sciweavers

1435 search results - page 17 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
KDD
2004
ACM
103views Data Mining» more  KDD 2004»
15 years 10 months ago
An objective evaluation criterion for clustering
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
Arindam Banerjee, John Langford
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
15 years 4 months ago
Stream Sequential Pattern Mining with Precise Error Bounds
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
Luiz F. Mendes, Bolin Ding, Jiawei Han
JMLR
2008
117views more  JMLR 2008»
14 years 9 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
IDEAS
2006
IEEE
109views Database» more  IDEAS 2006»
15 years 3 months ago
Multi-dimensional Histograms with Tight Bounds for the Error
Histograms are being used as non-parametric selectivity estimators for one-dimensional data. For highdimensional data it is common to either compute onedimensional histograms for ...
Linas Baltrunas, Arturas Mazeika, Michael H. B&oum...
CDC
2010
IEEE
154views Control Systems» more  CDC 2010»
14 years 4 months ago
A lower bound for controlled Lagrangian particle tracking error
Abstract-- Autonomous underwater vehicles are flexible mobile platforms for ocean sampling and surveillance missions. However, navigation of these vehicles in unstructured, highly ...
Klementyna Szwaykowska, Fumin Zhang