Preprint Article Version 2 Preserved in Portico This version is not peer-reviewed

Kernel Geometric Mean Metric Learning

Version 1 : Received: 24 July 2023 / Approved: 24 July 2023 / Online: 25 July 2023 (07:32:40 CEST)
Version 2 : Received: 29 July 2023 / Approved: 31 July 2023 / Online: 1 August 2023 (11:46:59 CEST)

A peer-reviewed article of this Preprint also exists.

Feng, Z.; Yun, T.; Zhou, Y.; Zheng, R.; He, J. Kernel Geometric Mean Metric Learning. Appl. Sci. 2023, 13, 12047. Feng, Z.; Yun, T.; Zhou, Y.; Zheng, R.; He, J. Kernel Geometric Mean Metric Learning. Appl. Sci. 2023, 13, 12047.

Abstract

This paper propose a kernel geometric mean metric learning (KGMML) algorithm. The basic idea is to obtain the closed-form solution of the geometric mean metric learning (GMML) algorithm in the high-dimensional feature space determined by the kernel function. Then, the solution is generalized as a form of kernel matrix by using the integral representation of the weighted geometric mean and the Woodbury matrix in this new feature space. Experimental results on 15 datasets show that the proposed algorithm can effectively improve the accuracy of the GMML algorithm and other metric algorithms.

Keywords

metric learning; kernel methods; weighted geometric mean

Subject

Computer Science and Mathematics, Artificial Intelligence and Machine Learning

Comments (1)

Comment 1
Received: 1 August 2023
Commenter: Zixin Feng
Commenter's Conflict of Interests: Author
Comment: Changing the author's order of precedence.
+ Respond to this comment

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 1
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.