Detection of abrupt changes: theory and application
Detection of abrupt changes: theory and application
On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Unsupervised Profiling for Identifying Superimposed Fraud
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
A unifying framework for detecting outliers and change points from non-stationary time series data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
On the influence of the kernel on the consistency of support vector machines
The Journal of Machine Learning Research
Detecting change in data streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A Least-squares Approach to Direct Importance Estimation
The Journal of Machine Learning Research
Unsupervised change analysis using supervised learning
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Estimating divergence functionals and the likelihood ratio by convex risk minimization
IEEE Transactions on Information Theory
LIBSVM: A library for support vector machines
ACM Transactions on Intelligent Systems and Technology (TIST)
Unsupervised Activity Recognition with User's Physical Characteristics Data
ISWC '11 Proceedings of the 2011 15th Annual International Symposium on Wearable Computers
Super-Linear Convergence of Dual Augmented Lagrangian Algorithm for Sparsity Regularized Estimation
The Journal of Machine Learning Research
Measuring statistical dependence with hilbert-schmidt norms
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
An online kernel change detection algorithm
IEEE Transactions on Signal Processing - Part II
Hi-index | 0.00 |
Change-point detection is the problem of finding abrupt changes in time-series, and it is attracting a lot of attention in the artificial intelligence and data mining communities. In this paper, we present a supervised learning based change-point detection approach in which we use the separability of past and future data at time t (they are labeled as +1 and -1) as plausibility of change-points. Based on this framework, we propose a detection measure called the additive Hilbert-Schmidt Independence Criterion (aHSIC), which is defined as the weighted sum of the HSIC scores between features and its corresponding binary labels. Here, the HSIC is a kernel-based independence measure. A novel aspect of the aHSIC score is that it can incorporate feature selection during its detection measure estimation. More specifically, we first select features that are responsible for an abrupt change by using a supervised approach, and then compute the aHSIC score by employing the selected features. Thus, compared with traditional detection measures, our approach tends to be robust as regards noise features, and so the aHSIC is suitable for a use with high-dimensional time-series change-point detection problems. We demonstrate that the proposed change-point detection method is promising through extensive experiments on synthetic data sets and a real-world human activity data set.