Classification of Sparse and Irregularly Sampled Time Series with Mixtures of Expected Gaussian Kernels and Random Features

被引:0
作者
Li, Steven Cheng-Xian [1 ]
Marlin, Benjamin [1 ]
机构
[1] Univ Massachusetts, Coll Informat & Comp Sci, Amherst, MA 01003 USA
来源
UNCERTAINTY IN ARTIFICIAL INTELLIGENCE | 2015年
基金
美国国家科学基金会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a kernel-based framework for classification of sparse and irregularly sampled time series. The properties of such time series can result in substantial uncertainty about the values of the underlying temporal processes, while making the data difficult to deal with using standard classification methods that assume fixed-dimensional feature spaces. To address these challenges, we propose to first re-represent each time series through the Gaussian process (GP) posterior it induces under a GP regression model. We then define kernels over the space of GP posteriors and apply standard kernel-based classification. Our primary contributions are (i) the development of a kernel between GPs based on the mixture of kernels between their finite marginals, (ii) the development and analysis of extensions of random Fourier features for scaling the proposed kernel to large-scale data, and (iii) an extensive empirical analysis of both the classification performance and scalability of our proposed approach.
引用
收藏
页码:484 / 493
页数:10
相关论文
共 26 条
[1]  
[Anonymous], 2002, NIPS
[2]  
[Anonymous], 1982, ASTROPHYS J
[3]  
[Anonymous], 1971, ICA
[4]  
Bach F., 2004, P 21 INT C MACH LEAR, DOI 10.1145/ 1015330.1015424
[5]  
Berndt D.J., 1994, P 3 INT C KNOWLEDGE, P359, DOI DOI 10.5555/3000850.3000887
[6]   LIBSVM: A Library for Support Vector Machines [J].
Chang, Chih-Chung ;
Lin, Chih-Jen .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)
[7]   Population time series: Process variability, observation errors, missing values, lags, and hidden states [J].
Clark, JS ;
Bjornstad, ON .
ECOLOGY, 2004, 85 (11) :3140-3150
[8]  
CORTES C, 1995, MACH LEARN, V20, P273, DOI 10.1023/A:1022627411411
[9]  
Fan RE, 2008, J MACH LEARN RES, V9, P1871
[10]   Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions [J].
Halko, N. ;
Martinsson, P. G. ;
Tropp, J. A. .
SIAM REVIEW, 2011, 53 (02) :217-288