This paper describes our submission to the eighth annual mlsp competition organized by Amazon during the 2012ieeemlspworkshop. Our approach is based on a nearest-neighbor-like classifier with a distance metric lear...
ISBN:
(纸本)9781467310260
This paper describes our submission to the eighth annual mlsp competition organized by Amazon during the 2012ieeemlspworkshop. Our approach is based on a nearest-neighbor-like classifier with a distance metric learned from samples. The method was second in the final standings with prediction accuracy of 81 %, while the winning submission was 87 % accurate.
Importance weighting is widely applicable in machinelearning in general and in techniques dealing with data co-variate shift problems in particular. A novel, direct approach to determine such importance weighting is ...
详细信息
ISBN:
(纸本)9781467310260
Importance weighting is widely applicable in machinelearning in general and in techniques dealing with data co-variate shift problems in particular. A novel, direct approach to determine such importance weighting is presented. It relies on a nearest neighbor classification scheme and is relatively straightforward to implement. Comparative experiments on various classification tasks demonstrate the effectiveness of our so-called nearest neighbor weighting (NNeW) scheme. Considering its performance, our procedure can act as a simple and effective baseline method for importance weighting.
This paper presents the foundations of a novel method for chirplet signal decomposition. In contrast to basis-pursuit techniques on over-complete dictionaries, the proposed method uses a reduced set of adaptive parame...
详细信息
ISBN:
(纸本)9781467310260
This paper presents the foundations of a novel method for chirplet signal decomposition. In contrast to basis-pursuit techniques on over-complete dictionaries, the proposed method uses a reduced set of adaptive parametric chirplets. The estimation criterion corresponds to the maximization of the likelihood of the chirplet parameters from redundant time-frequency marginals. The optimization algorithm that results from this scenario combines Gaussian mixture models and Huber's robust regression in an iterative fashion. Simulation results support the proposed avenue.
The aim of this paper is two-fold. First, we show that the newly developed spectral method known as kernel entropy component analysis (kernel ECA) captures cluster structure, which is very important in semi-supervised...
详细信息
ISBN:
(纸本)9781467310260
The aim of this paper is two-fold. First, we show that the newly developed spectral method known as kernel entropy component analysis (kernel ECA) captures cluster structure, which is very important in semi-supervised learning, and we provide an analysis showing how mixture weights influence kernel ECA in a mixture of cluster components setting. Second, we develop a semi-supervised kernel ECA classifier based on the Lasso framework, and report promising results compared to the state-of-the art.
This work deals with the elimination of sensitivity to sensor orientation in the task of human daily activity recognition using a single miniature inertial sensor. The proposed method detects time intervals of walking...
详细信息
ISBN:
(纸本)9781467310260
This work deals with the elimination of sensitivity to sensor orientation in the task of human daily activity recognition using a single miniature inertial sensor. The proposed method detects time intervals of walking, automatically estimating the orientation in these intervals and transforming the observed signals to a "virtual" sensor orientation. Classification results show that excellent performance, in terms of both precision and recall (up to 100%), is achieved, for long-term recordings in real-life settings.
A classification algorithm based on a linear subspace model has been developed and is presented in this paper. To further improve the classification results, the full linear subspace of each class is split into subspa...
详细信息
ISBN:
(纸本)9781467310260
A classification algorithm based on a linear subspace model has been developed and is presented in this paper. To further improve the classification results, the full linear subspace of each class is split into subspaces with lower dimensions and characterized by local coordinates constructed from automatically selected training data. The training data selection is implemented by optimizations with least squares constraints or L1 regularization. The working application is to determine the quality in wooden logs using microwave signals [1]. The experimental results are shown and compared with classical methods.
We focus on the task of clustering sets of vectors. This can be seen as a special case of sequence clustering when the dynamics are not taken into account. We propose to use the error probability of binary classifiers...
详细信息
ISBN:
(纸本)9781467310260
We focus on the task of clustering sets of vectors. This can be seen as a special case of sequence clustering when the dynamics are not taken into account. We propose to use the error probability of binary classifiers to obtain a measure of the affinity between two sets so that a standard similarity-based clustering algorithm can be applied.
This paper presents the application of the kernel signal to noise ratio (KSNR) in the context of feature extraction to general machinelearning andsignalprocessing domains. The proposed approach maximizes the signal...
详细信息
ISBN:
(纸本)9781467310260
This paper presents the application of the kernel signal to noise ratio (KSNR) in the context of feature extraction to general machinelearning andsignalprocessing domains. The proposed approach maximizes the signal variance while minimizes the estimated noise variance in a reproducing kernel Hilbert space (RKHS). The KSNR can be used in any kernel method to deal with correlated (possibly non-Gaussian) noise. We illustrate the method in nonlinear regression examples, dependence estimation and causal inference, nonlinear channel equalization, and nonlinear feature extraction from high-dimensional satellite images. Results show that the proposed KSNR yields more fitted solutions and extracts more noise-free features when confronted with standard approaches.
In semi-supervised multi-view learning, the input vector is partitioned into two views and a classifier based on each view is sought after. In such settings, often examples which include the two views and a label are ...
详细信息
ISBN:
(纸本)9781467310260
In semi-supervised multi-view learning, the input vector is partitioned into two views and a classifier based on each view is sought after. In such settings, often examples which include the two views and a label are available [1]. In this paper, we are interested in the setting where a classifier for examples from one view is sought after although no labeled examples are provided for that view. Specifically, we consider the setting where labeled examples are provided only for the other view along with additional unlabeled examples of the two views jointly. To solve this problem, we present the Classification-Constrained Canonical Correlation Analysis (C(4)A) algorithm. We apply our algorithm to an audiovisual classification task. In comparison to two alternatives, the proposed method demonstrates superior performance.
This paper proposes a learning framework and a set of algorithms for nonsmooth regression, i.e., for learning piecewise smooth target functions with discontinuities in the function itself or the derivatives at unknown...
详细信息
ISBN:
(纸本)9781467310260
This paper proposes a learning framework and a set of algorithms for nonsmooth regression, i.e., for learning piecewise smooth target functions with discontinuities in the function itself or the derivatives at unknown locations. In the proposed approach, the model belongs to a class of smooth functions. Though constrained to be globally smooth, the trained model can have very large derivatives at particular locations to approximate the nonsmoothness of the target function. This is obtained through the definition of new regularization terms which penalize the derivatives in a location-dependent manner and training algorithms in the form of convex optimization problems. Examples of application to hybrid dynamical system identification and image reconstruction are provided.
暂无评论