Principal Component Analysis for Distributed Data Sets with Updating
Lecture notes in computer sciencePublished 1 January 2005Open access
Zheng‐Jian Bai, Raymond H. Chan, Franklin T. Luk
Citations65
SJR quartileQ4
SJR score0.11
SNIP0.06
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new method to compute the principal component analysis without incurring local approximation errors is introduced and the situation of updating the PCA when new data arrive at the various locations is considered.
Abstract
10.1007/11573937_51
Keywords
Computer SciencePhysics and Astronomy
The London Edinburgh and Dublin Philosophical Magazine and Journal of ScienceLIII. <i>On lines and planes of closest fit to systems of points in space</i>
11,670 Citations1901Karl Pearson
This paper is concerned with the construction of planes of closest fit to systems of points in space and the relationships between these planes and the planes themselves.
TechnometricsA User's Guide to Principal Components
3,347 Citations1993Stefan D. Leigh, J. Edward Jackson
IEEE Transactions on Geoscience and Remote SensingEnhancement of high spectral resolution remote-sensing data by a noise-adjusted principal components transform
417 Citations1990J.B. Lee, A.S. Woodyatt +1 more
Data Mining and Knowledge DiscoveryPrincipal Direction Divisive Partitioning
378 Citations1998Daniel Boley
A new algorithm capable of partitioning a set of documents or other samples based on an embedding in a high dimensional Euclidean space (i.e., in which every document is a vector of real numbers) that operates by repeatedly splitting clusters into smaller clusters.
Journal of Computational BiologyProbabilistic Disease Classification of Expression-Dependent Proteomic Data from Mass Spectrometry of Human Serum
172 Citations2003Ryan Lilien, Hany Farid +1 more
The Q5 method outperforms previous full-spectrum complex sample spectral classification techniques and can provide clues as to the molecular identities of differentially expressed proteins and peptides.
Knowledge and Information SystemsDistributed Clustering Using Collective Principal Component Analysis
163 Citations2001Hillol Kargupta, Weiyun Huang +2 more
A way to integrate the Collective PCA with a given off-the-shelf clustering algorithm in order to develop a distributed clustering technique.
Journal of Computational and Graphical StatisticsHuge Data Sets and the Frontiers of Computational Feasibility
70 Citations1995Edward J. Wegman
SIAM Journal on Scientific ComputingThe Spectral Decomposition of Nonsymmetric Matrices on Distributed Memory Parallel Computers
40 Citations1997Zhaojun Bai, James Demmel +4 more
A graphical user interface is designed to let the user choose the spectral decomposition according to specified regions in the complex plane of a spectral divide-and-conquer algorithm with Newton iteration.
Out-of-Core SVD and QR Decompositions.
29 Citations2001Eran Rabani, Sivan Toledo
The out-of-core singular-value-decomposition algorithm for tall narrow matrices that are too large to fit in main memory and are stored on disks is implemented and combined with a larger eigensolver code to obtain the electronic states of a semiconductor nanocrystal.
