Learning high-dimensional data

Verleysen, Michel
(2001) NATO Advanced Research Workshop on Limitations and Future Trends in Neural Computing (LFTNC 2001) — Location: Siena (Italy) (22.October.2001)

Files

Learninghigh-dimensionaldata.pdf
  • Restricted Access
  • Adobe PDF
  • 400.24 KB
Request a copy

Details

Authors
Abstract
Observations from real-world problems are often high-dimensional vectors, i.e. made up of many variables. Learning methods, including artificial neural networks, often have difficulties to handle a relatively small number of high-dimensional data. In this paper, we show how concepts gained from our intuition on 2- and 3-dimensional data can be misleading when used in high-dimensional settings. When then show how the "curse of dimensionality" and the "empty space phenomenon" can be taken into account in the design of neural network algorithms, and how non-linear dimension reduction techniques can be used to circumvent the problem. We conclude by an illustrative example of this last method on the forecasting of financial time series.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Verleysen, M. (2001). Learning high-dimensional data. Proceedings of LFTNC 2001, p. 22. https://hdl.handle.net/2078.5/253880