A Fast Logdet Divergence Based Metric Learning Algorithm for Large Data Sets Classification

Jiangyuan Mei, Jian Hou, Jicheng Chen and Hamid Reza Karimi

Abstract and Applied Analysis, 2014, vol. 2014, issue 1

Abstract: Large data sets classification is widely used in many industrial applications. It is a challenging task to classify large data sets efficiently, accurately, and robustly, as large data sets always contain numerous instances with high dimensional feature space. In order to deal with this problem, in this paper we present an online Logdet divergence based metric learning (LDML) model by making use of the powerfulness of metric learning. We firstly generate a Mahalanobis matrix via learning the training data with LDML model. Meanwhile, we propose a compressed representation for high dimensional Mahalanobis matrix to reduce the computation complexity in each iteration. The final Mahalanobis matrix obtained this way measures the distances between instances accurately and serves as the basis of classifiers, for example, the k‐nearest neighbors classifier. Experiments on benchmark data sets demonstrate that the proposed algorithm compares favorably with the state‐of‐the‐art methods.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/463981

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2014:y:2014:i:1:n:463981

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().