Incomplete Pivoted QR-based Dimensionality Reduction

نویسندگان

  • Amit Bermanis
  • Aviv Rotbart
  • Moshe Salhov
  • Amir Averbuch
چکیده

High-dimensional big data appears in many research fields such as image recognition, biology and collaborative filtering. Often, the exploration of such data by classic algorithms is encountered with difficulties due to ‘curse of dimensionality’ phenomenon. Therefore, dimensionality reduction methods are applied to the data prior to its analysis. Many of these methods are based on principal components analysis, which is statistically driven, namely they map the data into a low-dimension subspace that preserves significant statistical properties of the high-dimensional data. As a consequence, such methods do not directly address the geometry of the data, reflected by the mutual distances between multidimensional data point. Thus, operations such as classification, anomaly detection or other machine learning tasks may be affected. This work provides a dictionary-based framework for geometrically driven data analysis that includes dimensionality reduction, out-of-sample extension and anomaly detection. It embeds high-dimensional data in a low-dimensional subspace. This embedding preserves the original high-dimensional geometry of the data up to a user-defined distortion rate. In addition, it identifies a subset of landmark data points that constitute a dictionary for the analyzed dataset. The dictionary enables to have a natural extension of the lowdimensional embedding to out-of-sample data points, which gives rise to a distortion-based criterion for anomaly detection. The suggested method is demonstrated on synthetic and real-world datasets and achieves good results for classification, anomaly detection and out-of-sample tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Text Summarization via Hidden Markov Models and Pivoted QR Matrix Decomposition

A sentence extract summary of a document is a subset of the doc-ument's sentences that contains the main ideas in the document. We present two approaches to generating such summaries. The rst uses a pivoted QR decomposition of the term-sentence matrix in order to identify sentences that have ideas that are distinct from those in other sentences. The second is based on a hidden Markov model that...

متن کامل

LAPACK-Style Codes for Pivoted Cholesky and QR Updating

Routines exist in LAPACK for computing the Cholesky factorization of a symmetric positive definite matrix and in LINPACK there is a pivoted routine for positive semidefinite matrices. We present new higher level BLAS LAPACK-style codes for computing this pivoted factorization. We show that these can be many times faster than the LINPACK code. Also, with a new stopping criterion, there is more r...

متن کامل

A CUR Factorization Algorithm based on the Interpolative Decomposition

An algorithm for the efficient computation of the CUR decomposition is presented. The method is based on simple modifications to the classical truncated pivoted QR decomposition, which means that highly optimized library codes can be utilized for its implementation. Numerical experiments demonstrate advantageous performance compared to existing techniques for computing CUR factorizations.

متن کامل

A Whole Genome Phylogeny Using Truncated Pivoted QR Decomposition

The increasing availability of whole genome sequences in public databases has stimulated the development of new methods to automatically compare and categorize genes and species. Recently developed methods based on the singular value decomposition (SVD) allow for the simultaneous identification and definition of well concerved motifs and gene families using very large whole genome datasets. In ...

متن کامل

A Whole Genome Phylogeny Using Truncated Pivoted QR Decomposition

The increasing availability of whole genome sequences in public databases has stimulated the development of new methods to automatically compare and categorize genes and species. Recently developed methods based on the singular value decomposition (SVD) allow for the simultaneous identification and definition of well concerved motifs and gene families using very large whole genome datasets. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1607.03456  شماره 

صفحات  -

تاریخ انتشار 2015