Active learning has been proven to be quite effective in reducing the human labeling efforts by actively selecting the most informative examples to label. In this paper, we present a batch-mode active learning method based on logistic regression. Our key motivation is an out-of-sample bound on the estimation error of class distribution in logistic regression conditioned on any fixed training sa...

This article proposes a general extension of the error correcting output codes framework to the online learning scenario. As a result, the final classifier handles the addition of new classes independently of the base classifier used. In particular, this extension supports the use of both online example incremental and batch classifiers as base learners. The extension of the traditional problem...

In this paper, various Recursive Mixed L2-Linfty (RML) learning algorithms are developed by choosing different forgetting factor matrix function () for Linear-inthe-Parameters (LIP) models, including Projection, Recursive Mixed L2-Linfty, Recursive Mixed Mean L2-Linfty, weighted Mixed L2-Linfty, instantaneous RML, and Batch RML algorithms. A few models are given to apply the proposed RML alg...

Intrusion detection is an active research field in the development of reliable web-based information systems, where many artificial intelligence techniques are exploited to fit the specific application. Although some detection algorithms have been developed, they lack the adaptability to the frequently changing network environments, since they are mostly trained in batch mode. In this paper, we...

Relevance feedback is an effective approach to improve the performance of image retrieval by leveraging the labeling of human. In order to alleviate the burden of labeling, active learning method has been introduced to select the most informative samples for labeling. In this paper, we present a novel batch mode active learning scheme for informative sample selection. Inspired by the method of ...

A number of manifold learning algorithms have been recently proposed, including locally linear embedding (LLE). These algorithms not only merely reduce data dimensionality, but also attempt to discover a true low dimensional structure of the data. The common feature of the most of these algorithms is that they operate in a batch or offline mode. Hence, when new data arrive, one needs to rerun t...

Data labeling is an expensive and time-consuming task. Choosing which labels to use is increasingly becoming important. In the active learning setting, a classifier is trained by asking for labels for only a small fraction of all instances. While many works exist that deal with this issue in non-streaming scenarios, few works exist in the data stream setting. In this paper we propose a new acti...

We propose the Temporal Correlation Net (TCN) as an object recognition system implementing three basic principles: forming temporal groups of features, learning in a hierarchical structure and using feedback for predicting future input. It is an improvement of the Temporal Correlation Graph and shows improved performance on standard datasets like ETH80 and COIL100. In contrast to its predecesso...

Astronomers and telescope operators must make decisions about what to observe given limited telescope time. To optimize this decision-making process, we present a batch, cost-sensitive, active learning approach that exploits structure in the unlabeled dataset, accounts for label uncertainty, and minimizes annotation costs. We first cluster the unlabeled instances in feature space. We next intro...

Background subtraction (BS) is the art of separating moving objects from their background. The Background Modeling (BM) is one of the main steps of the BS process. Several subspace learning (SL) algorithms based on matrix and tensor tools have been used to perform the BM of the scenes. However, several SL algorithms work on a batch process increasing memory consumption when data size is very la...