.png){kind=icon}
.png){kind=icon}
Return
Graph-based predictable feature analysis
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-017-5632-x.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose graph-based predictable feature analysis (GPFA), a new method for unsupervised learning of predictable features from high-dimensional time series, where high predictability is understood very generically as low variance in the distribution of the next data point given the previous ones. We show how this measure of predictability can be understood in terms of graph embedding as well as how it relates to the information-theoretic measure of predictive information in special cases. We confirm the effectiveness of GPFA on different datasets, comparing it to three existing algorithms with similar objectives-namely slow feature analysis, forecastable component analysis, and predictable feature analysis-to which GPFA shows very competitive results.
Keywords:
Unsupervised learning
Dimensionality reduction
Feature learning
Representation learning
Graph embedding
Predictability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
2.6K
Citations:
3.4W