Sciweavers

1473 search results - page 126 / 295
» Permutation Tests for Classification
Sort
View
TNN
2008
132views more  TNN 2008»
14 years 9 months ago
Just-in-Time Adaptive Classifiers - Part I: Detecting Nonstationary Changes
Abstract--The stationarity requirement for the process generating the data is a common assumption in classifiers' design. When such hypothesis does not hold, e.g., in applicat...
Cesare Alippi, Manuel Roveri
ICML
2001
IEEE
15 years 10 months ago
An Improved Predictive Accuracy Bound for Averaging Classifiers
We present an improved bound on the difference between training and test errors for voting classifiers. This improved averaging bound provides a theoretical justification for popu...
John Langford, Matthias Seeger, Nimrod Megiddo
FLAIRS
2010
15 years 8 days ago
Mining Actionable Patterns
We propose a generic framework that uses utility in decision making to drive the data mining process. We use concepts from meta-learning and build on earlier work by Elovici and B...
Prabakararaj Swapna Raj, Ravindran Balaraman
COLING
2008
14 years 11 months ago
Rank Distance as a Stylistic Similarity
In this paper we propose a new distance function (rank distance) designed to reflect stylistic similarity between texts. To assess the ability of this distance measure to capture ...
Marius Popescu, Liviu Petrisor Dinu
ICPR
2006
IEEE
15 years 11 months ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...