Kernel ellipsoidal trimming

DOI10.1016/J.CSDA.2007.03.020zbMath1452.62054OpenAlexW2103850956MaRDI QIDQ1020817

J. Martínez

Publication date: 2 June 2009

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/263345/1/Report_kernel_ellipsoidal_trimming.pdf

zbMATH Keywords

kernel methodsRademacher complexityoutlier detectionnovelty detectionminimum volume covering ellipsoid

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Related Items (2)

Editorial: Machine learning and robust data mining ⋮ Outlier detection in non-elliptical data by kernel MRCD

Uses Software

• R
• MASS (R)

Cites Work

• Testing for outliers from a mixture distribution when some data are missing
• Outlier detection in the multiple cluster setting using the minimum covariance determinant estimator
• Statistical Analysis of Financial Data in S-Plus
• The Equivalence of Two Extremum Problems
• Estimation of Correlation Coefficients by Ellipsoidal Trimming
• Asymptotics for and against cross-validation
• 10.1162/153244303321897690
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kernel ellipsoidal trimming