Many Data Mining tasks deal with data which are presented in high dimensional spaces, and the 'curse of dimensionality' phenomena is often an obstacle to the use of many methods for solving these tasks. To avoid these phenomena, various Representation learning algorithms are used as a first key step in solutions of these tasks to transform the original high-dimensional data into their lower-dimensional representations so that as much information about the original data required for the considered Data Mining task is preserved as possible. The above Representation learning problems are formulated as various Dimensionality Reduction problems (Sample Embedding, Data Manifold embedding, Manifold Learning and newly proposed Tangent Bundle Manifold Learning) which are motivated by various Data Mining tasks. A new geometrically motivated algorithm that solves the Tangent Bundle Manifold Learning and gives new solutions for all the considered Dimensionality Reduction problems is presented. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Kuleshov, A., & Bernstein, A. (2014). Manifold learning in data mining tasks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8556 LNAI, pp. 119–133). Springer Verlag. https://doi.org/10.1007/978-3-319-08979-9_10
Mendeley helps you to discover research relevant for your work.