Abstract
This paper introduces a temporal version of Probabilistic Kernel Principal Component Analysis by using a hidden Markov model in order to obtain optimized representations of observed data through time. Recently introduced, Probabilistic Kernel Principal Component Analysis overcomes the two main disadvantages of standard Principal Component Analysis, namely, absence of probability density model and lack of high-order statistical information due to its linear structure. We extend this probabilistic approach of KPCA to mixture models in time, to enhance the capabilities of transformation and reduction of time series vectors. Results over voice disorder databases show improvements in classification accuracies even with highly reduced representations.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science : Neural Information Processing |
| Volume | 4232 |
| Place of Publication | Berlin |
| Publisher | Springer |
| Publication date | 2006 |
| Pages | 747-754 |
| ISBN (Print) | 978-3-540-46479-2 |
| DOIs | |
| Publication status | Published - 2006 |
| Externally published | Yes |
| Event | 13th International Conference on Neural Information Processes - Hong Kong, China Duration: 3 Oct 2006 → 6 Oct 2006 Conference number: 13 http://www.informatik.uni-trier.de/~ley/db/conf/iconip/iconip2006-3.htmlc |
Conference
| Conference | 13th International Conference on Neural Information Processes |
|---|---|
| Number | 13 |
| Country/Territory | China |
| City | Hong Kong |
| Period | 03/10/2006 → 06/10/2006 |
| Internet address |
| Series | Lecture Notes in Computer Science |
|---|---|
| Number | 4232 |
| ISSN | 0302-9743 |