Abstract
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ellipsoid (MVE) covering its neighborhood which characterizes the correlations and variances of its neighborhood variables. Algebraically, the algorithm maximizes the determinant of the local covariance matrix which amounts to a convex optimization problem. The final matrix parameterizes a Mahalanobis metric yielding the MVE metric (MVEM). The proposed metric was tested in a supervised learning task and showed promising and competitive results when compared with state of the art metrics in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Newman, D., Hettich, S., Blake, C., Merz, C.: UCI Repository of Machine Learning Databases University of California, Irvine, Dept. of Information and Computer Sciences (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge Univ. Press (2004)
Sun, P., Freund, R.: Computation of Minimum Volume Covering Ellipsoids. Journal of Operations Research 52, 690–706 (2004)
Atkenson, C., Moore, A., Schaal, S.: Local Weighted Learning. AI Review, 11–73 (1997)
Xing, E., Ng, A., Jordan, M., Russell, S.: Distance Metric Learning with Application to Clustering with Side-Information. In: NIPS 15, MIT Press, Cambridge (2003)
Globerson, A., Roweis, S.: Metric Learning by Collapsing Classes. In: NIPS 18, MIT Press, Cambridge (2006)
Weinberger, K., Blitzer, J., Saul, L.: Distance Metric Learning for Large Margin Nearest Neighbor Classification. In: NIPS 18, MIT Press, Cambridge (2006)
Schultz, M., Joachims, T.: Learning a Distance Metric from Relative Comparisons. In: NIPS 16, MIT Press, Cambridge (2004)
Bar-Hillel, A., Hertz, T., Shental, N., Weinshall, D.: Learning a Mahalanobis Metric from Equivalence Constraints. JMLR 6, 937–965 (2005)
Grant, M., Boyd, S., Ye, Y.: Matlab Software for Disciplined Convex Programming (2005), http://www.stanford.edu/~boyd/cvx
Brand, M.: Charting a Manifold. In: NIPS 15, MIT Press, Cambridge (2003)
Vincent, P., Bengio, Y.: Manifold Parzen Windows. In: NIPS 15, MIT Press, Cambridge (2003)
Dolia, A., De–Bie, T., Harris, C., Shawe–Taylor, J., Titterington, D.: The Minimum Volume Covering Ellipsoid Estimation in Kernel–Defined Feature Spaces. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, Springer, Heidelberg (2006)
Rousseeuw, P., Van Driessen, K.: Algorithm for the Minimum Covariance Determinant Estimator. Technometrics 41(3), 212–223 (1999)
Rousseeuw, P.: Least Median of Squares Regression. Journal of American Statistical Association 79(388), 871–880 (1984)
Rousseeuw, P.: Multivariate Estimation with High Breakdown Point. In: Proceedings of the fourth Pannonian Symposium on Mathematical Statistics, vol. 3, pp. 283–297 (1983)
Huber, P.: Robust Statistics. John Wiley Press, Chichester (1981)
Hampel, F.: Robust Statistics, ETH–Zurich, Tech. Report No. 94 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abou-Moustafa, K.T., Ferrie, F.P. (2007). The Minimum Volume Ellipsoid Metric. In: Hamprecht, F.A., Schnörr, C., Jähne, B. (eds) Pattern Recognition. DAGM 2007. Lecture Notes in Computer Science, vol 4713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74936-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-74936-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74933-2
Online ISBN: 978-3-540-74936-3
eBook Packages: Computer ScienceComputer Science (R0)