Distance metric learning by knowledge embedding
نویسندگان
چکیده
This paper presents an algorithm which learns a distance metric from a data set by knowledge embedding and uses the new distance metric to solve nonlinear pattern recognition problems such a clustering. ? 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
منابع مشابه
Constrained Spectral Clustering with Distance Metric Learning
Spectral clustering is a flexible clustering technique that finds data clusters in the spectral embedding space of the data. It doesn’t assume convexity of the shape of clusters, and is able to find non-linear cluster boundaries. Constrained spectral clustering aims at incorporating user-defined pairwise constraints in to spectral clustering. Typically, there are two kinds of pairwise constrain...
متن کاملThe Connection Between Manifold Learning and Distance Metric Learning
Manifold Learning learns a low-dimensional embedding of the latent manifold. In this report, we give the definition of distance metric learning, provide the categorization of manifold learning, and describe the essential connection between manifold learning and distance metric learning, with special emphasis on nonlinear manifold learning, including ISOMAP, Laplacian Eigenamp (LE), and Locally ...
متن کاملیادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیک‌های یادگیری معیار فاصله
Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...
متن کاملAn Overview of Distance Metric Learning
In our previous comprehensive survey [41], we have categorized the disparate issues in distance metric learning. Within each of the four categories, we have summarized existing work, disclosed their essential connections, strengths and weaknesses. The first category is supervised distance metric learning, which contains supervised global distance metric learning, local adaptive supervised dista...
متن کاملInterpolated Discretized Embedding of Single Vectors and Vector Pairs for Classification, Metric Learning and Distance Approximation
We propose a new embedding method for a single vector and for a pair of vectors. This embedding method enables: a) efficient classification and regression of functions of single vectors; b) efficient approximation of distance functions; and c) general, non-Euclidean, semimetric learning. To the best of our knowledge, this is the first work that enables learning any general, non-Euclidean, semim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 37 شماره
صفحات -
تاریخ انتشار 2004