Nonlinear supervised dimensionality reduction via smooth regular embeddings

Download

index.pdf

Date

2018

Author

Örnek, Cem

Metadata

Show full item record

Item Usage Stats

131
views

89
downloads

The recovery of the intrinsic geometric structures of data collections is an important problem in data analysis. Supervised extensions of several manifold learning approaches have been proposed in the recent years. Meanwhile, existing methods primarily focus on the embedding of the training data, and the generalization of the embedding to initially unseen test data is rather ignored. In this work, we build on recent theoretical results on the generalization performance of supervised manifold learning algorithms. Motivated by these performance bounds, we propose a supervised manifold learning method that computes a nonlinear embedding while constructing a smooth and regular interpolation function that extends the embedding to the whole data space in order to achieve satisfactory generalization. The embedding and the interpolator are jointly learnt such that the Lipschitz regularity of the interpolator is imposed while ensuring the separation between different classes. Experimental results on several image data sets show that the proposed method yields quite satisfactory performance in comparison with other supervised dimensionality reduction algorithms and traditional classiﬁers.

Subject Keywords

Intelligent transportation systems., Electronics in transportation.

URI

http://etd.lib.metu.edu.tr/upload/12621917/index.pdf
https://hdl.handle.net/11511/27197

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Nonlinear supervised dimensionality reduction via smooth regular embeddings Ornek, Cem; Vural, Elif (2019-03-01) The recovery of the intrinsic geometric structures of data collections is an important problem in data analysis. Supervised extensions of several manifold learning approaches have been proposed in the recent years. Meanwhile, existing methods primarily focus on the embedding of the training data, and the generalization of the embedding to initially unseen test data is rather ignored. In this work, we build on recent theoretical results on the generalization performance of supervised manifold learning algori...
Complexity reduction in radial basis function (RBF) networks by using radial B-spline functions Saranlı, Afşar; Baykal, Buyurman (1998-01-01) In this paper, new basis consisting of radial cubic and quadratic B-spline functions are introduced together with the CORDIC algorithm, within the context of RBF networks as a means of reducing computational complexity in real-time signal-processing applications. The new basis are compared with two other existing and popularly used basis families, namely the Gaussian functions and the inverse multiquadratic functions (IVMQ) in terms of approximation performance and computational requirements. The new basis ...
Learning Multi-Modal Nonlinear Embeddings: Performance Bounds and an Algorithm Kaya, Semih; Vural, Elif (2021-01-01) While many approaches exist in the literature to learn low-dimensional representations for data collections in multiple modalities, the generalizability of multi-modal nonlinear embeddings to previously unseen data is a rather overlooked subject. In this work, we first present a theoretical analysis of learning multi-modal nonlinear embeddings in a supervised setting. Our performance bounds indicate that for successful generalization in multi-modal classification and retrieval problems, the regularity of th...
Comparison of feature-based and image registration-based retrieval of image data using multidimensional data access methods Arslan, Serdar; Yazıcı, Adnan; Sacan, Ahmet; Toroslu, İsmail Hakkı; Acar, Esra (Elsevier BV, 2013-07-01) In information retrieval, efficient similarity search in multimedia collections is a critical task In this paper, we present a rigorous comparison of three different approaches to the image retrieval problem, including cluster-based indexing, distance-based indexing, and multidimensional scaling methods. The time and accuracy trade-offs for each of these methods are demonstrated on three different image data sets. Similarity of images is obtained either by a feature-based similarity measure using four MPEG-...
Uncertainty in a nested relational database model Yazıcı, Adnan; Buckles, BP; Petry, FE (1999-07-01) Some database models have already been developed to deal with complex values but they have constrains that data stored is precise and queries are crisp. However, as many researchers have pointed out, there is a need to present, manipulate, and query complex and uncertain data of various non-traditional database applications such as oceanography, multimedia, meteorology, office automation systems, engineering designs, expert database systems and geographic information systems. In this paper, we present a log...

Citation Formats

C. Örnek, “Nonlinear supervised dimensionality reduction via smooth regular embeddings,” M.S. - Master of Science, Middle East Technical University, 2018.