Subspace detection: A robust statistics formulation

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2777, Issue , 2003, Pages 734-

  Dasgupta, Sanjoy ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GAUSSIAN NOISE (ELECTRONIC); LINEAR EQUATIONS; PERTURBATION TECHNIQUES; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; VECTORS;

APPROXIMATION BOUNDS; LINEAR SUBSPACE; ROBUST STATISTICS; SUBSPACE DETECTION;

PRINCIPAL COMPONENT ANALYSIS;

EID: 9444294513     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45167-9_55     Document Type: Conference Paper

References (2)

1. J. Dunagan and S. Vempala. Optimal outlier removal in high-dimensional spaces. Proceedings of the 32nd ACM Symposium on the Theory of Computing, 2000.
2. P.J. Huber. Robust statistics. Wiley, 1984.