Kernel ellipsoidal trimming

Dolia, A.N., Harris, C.J., Shawe-Taylor, J.S. and Titterington, D.M. (2007) Kernel ellipsoidal trimming Computational Statistics and Data Analysis, 52, (1), pp. 309-324. (doi:10.1016/j.csda.2007.03.020).


Full text not available from this repository.


Ellipsoid estimation is important in many practical areas such as control, system identification, visual/audio tracking, experimental design, data mining, robust statistics and statistical outlier or novelty detection. A new method, called kernel minimum volume covering ellipsoid (KMVCE) estimation, that finds an ellipsoid in a kernel-defined feature space is presented. Although the method is very general and can be applied to many of the aforementioned problems, the main focus is on the problem of statistical novelty/outlier detection. A simple iterative algorithm based on Mahalanobis-type distances in the kernel-defined feature space is proposed for practical implementation. The probability that a non-outlier is misidentified by our algorithms is analyzed using bounds based on Rademacher complexity. The KMVCE method performs very well on a set of real-life and simulated datasets, when compared with standard kernel-based novelty detection methods.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/j.csda.2007.03.020
ISSNs: 0167-9473 (print)
Keywords: minimum volume covering ellipsoid, rademacher complexity, kernel methods, outlier detection, novelty detection
ePrint ID: 48104
Date :
Date Event
Date Deposited: 28 Aug 2007
Last Modified: 16 Apr 2017 18:25
Further Information:Google Scholar

Actions (login required)

View Item View Item