An Efficient, Sparsity-Preserving Online Algorithm for Data Approximation: Supplementary Material
ثبت نشده
چکیده
001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050 051 052 053 054 055 056 057 058 059 060 061 062 063 064 065 066 067 068 069 070 071 072 073 074 075 076 077 078 079 080 081 082 083 084 085 086 087 088 089 090 091 092 093 094 095 096 097 098 099 100 101 102 103 104 105 106 107 108 109 An Efficient, Sparsity-Preserving Online Algorithm for Data Approximation: Supplementary Material
منابع مشابه
An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation
Low-rank matrix approximation is a fundamental tool in data analysis for processing large datasets, reducing noise, and finding important signals. In this work, we present a novel truncated LU factorization called Spectrum-Revealing LU (SRLU) for effective low-rank matrix approximation, and develop a fast algorithm to compute an SRLU factorization. We provide both matrix and singular value appr...
متن کاملAn Efficient, Sparsity-Preserving, Online Algorithm for Data Approximation
The Singular Value Decomposition (SVD) is a longstanding standard for data approximation because it is optimal in the 2 and Frobenius norms. The SVD, nevertheless, suffers from many setbacks, including computational cost, loss of sparsity in the decomposition, and the inability to be updated easily when new information arrives. Additionally, the SVD provides limited information on data features...
متن کاملSemi-supervised Sparsity Pairwise Constraint Preserving Projections based on GA
The deficiency of the ability for preserving global geometric structure information of data is the main problem of existing semi-supervised dimensionality reduction with pairwise constraints. A dimensionality reduction algorithm called Semi-supervised Sparsity Pairwise Constraint Preserving Projections based on Genetic Algorithm (SSPCPPGA) is proposed. On the one hand, the algorithm fuses unsup...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملCoresets for k-Segmentation of Streaming Data Supplementary Material
In this supplementary material we detail the construction, properties, and proofs for a k-segment mean coreset that allows efficient segmentation of high-dimensional signals. We define the ksegment mean problem in Section 2. We describe a coreset for the 1-segment mean in Section 3. We show why a similar construction is not possible for the k-segment mean problem in Section 4. In Sections 5,6,7...
متن کامل