Localized multiple kernel learning using graph modularity

doi:10.1016/j.patrec.2022.01.018

Localized multiple kernel learning using graph modularity

2022-03-01

7

PRE

AI

DOI：10.1016/j.patrec.2022.01.018

Original

Original request for help

Save

Abstract

En 中文

Multiple kernel learning (MKL) algorithms exploit information from multiple feature representations by assigning weights to each representation in the kernel space, and later combining them. However, this ignores the fact that data points exhibit locally varying characteristics. To address this problem, localized MKL algorithms learn locality-specific kernel weights which determine each base kernel's influence in the locality under consideration. Here, we relate the problem of determining the relevance of base kernels for classification to that of quantifying community structure in graphs. Next, we derive sample-specific kernel weights using graph modularity. Through experiments on publicly available datasets, we show that the proposed approach offers a viable alternative to state-of-the-art MKL approaches while being computationally inexpensive. (C) 2022 Elsevier B.V. All rights reserved.

Keywords:

Multiple kernel combining

Multi-view data

SVM

Heuristic approach

Graph modularity

Localized multiple kernel learning using graph modularity

Abstract

Journal

Organization