# Admire LVQ—Adaptive Distance Measures in Relevance Learning Vector Quantization

## Authors

- First Online:

DOI: 10.1007/s13218-012-0188-1

- Cite this article as:
- Biehl, M. Künstl Intell (2012) 26: 391. doi:10.1007/s13218-012-0188-1

## Abstract

The extension of Learning Vector Quantization by Matrix Relevance Learning is presented and discussed. The basic concept, essential properties, and several modifications of the scheme are outlined. A particularly successful application in the context of tumor classification highlights the usefulness and interpretability of the method in practical contexts. The development and putting forward of Matrix Relevance Learning Vector Quantization was, to a large extent, pursued in the frame of the project *Adaptive Distance Measures in Relevance Learning Vector Quantization—Admire LVQ*, funded through the *Nederlandse Organisatie voor Wetenschappelijk Onderzoek* (NWO) under project code 612.066.620, from 2007 to 2011.

### Keywords

Machine learning Adaptive distances Prototype-based classification Similarity-based clustering## 1 Introduction

The comparison of observations with a set of reference data in terms of a similarity measure constitutes a natural and very intuitive approach to clustering or classification. The classic K Nearest Neighbor (KNN) scheme, arguably the most popular classifier, applies this concept with respect to previously stored, labeled example data.

Learning Vector Quantization (LVQ) as introduced by Kohonen [14] combines the idea with the representation of the reference data by a few prototypes. Their determination in a training phase is often reminiscent of competitive learning [5]. Most frequently, a Nearest Prototype Classification (NPC) scheme is implemented in the working phase of LVQ classifiers.

Several improved versions of the basic LVQ algorithm have been suggested, including the cost function based Generalized LVQ (GLVQ) [15] and Robust Soft LVQ [20] which is guided by the maximization of likelihood ratios.

LVQ and other prototype-based classifiers share the attractive feature of being very intuitive and plausible, in contrast to many other learning systems. Prototypes are defined in the same space as the observed data and can be understood as typical representatives of their classes. This allows for straightforward interpretations of the classifier and facilitates discussions with application domain experts.

A key step in the design of such systems is the choice of a suitable measure of similarity or, rather, dissimilarity. For problems in which *N*-dimensional feature vectors represent the observations, standard Euclidean distance or other Minkowski metrics are employed most frequently without further justification. While such a choice appears plausible when all features are similar in nature, difficulties arise for feature vectors which comprise quantities of entirely different quality or order of magnitude. Standard distance measures are frequently sensitive to, for instance, rescaling or more general linear transformations of the features. Consequently, their naïve use is very often problematic in practice.

One very successful approach to overcome this difficulty is known as relevance learning in the literature [6, 12]. Its formulation is particularly transparent in the framework of prototype-based classifiers. The basic idea is to fix only the algebraic form of the dissimilarity in *N*-dim. feature space. Its parameters can then be optimized with respect to the available example data in the same training process as the prototypes. The concept is extremely versatile and allows for the consideration of a variety of distances including generalized Euclidean metrics [6, 12] or less conventional choices like statistical divergences or measures tailored for the classification of functional data [13].

The main aim of the project *Adaptive Distance Measures in Relevance Learning Vector Quantization—Admire LVQ* was to develop and put forward an important extension of existing relevance learning schemes [7, 16]. The framework of Matrix Relevance LVQ (MRLVQ) was established which employs generalized Euclidean distances defined by quadratic forms, i.e. matrices of real-valued coefficients [9, 17–19]. In the project, a number of extensions and modifications were formulated and properties of the novel algorithms were studied theoretically and in computer experiments. Moreover, example applications were addressed, mainly in the context of biomedical data analysis.

In the next section, we exemplify the concept of MRLVQ in terms of the cost function based Generalized Matrix Relevance LVQ (GMLVQ) [17]. In Sect. 3 we highlight a recent medical application, which illustrates the usefulness and interpretability of the approach. We conclude with an outlook on current and future research in the context of adaptive distance measures in Sect. 4.

## 2 Matrix Relevance LVQ

An LVQ system for the classification of feature vectors **x**∈ℝ^{
N
} is parameterized in terms of a number *K* of prototypes \(\{\mathbf {w}_{j} \in \mathbb{R}^{N} \}_{j=1}^{K}\) which serve as typical representatives of the classes *c*(**w**
_{
j
})∈{1,2,…*C*}. Note that several prototypes may represent the same class.

*d*

^{Λ}(

**w**,

**x**), the prototypes realize, for instance, an NPC scheme in which any possible input

**x**is assigned to the class of the closest prototype. In general, the superscript Λ may refer to a set of adjustable parameters. In the simplest version of Matrix Relevance LVQ, a global distance measure of the following quadratic form is employed [7, 16, 17]:

*N*×

*N*)-dim. relevance matrix Λ. In order to satisfy the minimal conditions

*d*

^{Λ}(

**x**,

**x**)=0 and

*d*

^{Λ}(

**x**,

**y**)≥0 for

**x**≠

**y**, a parameterization of the form Λ =Ω

^{⊤}Ω is assumed. Hence, Ω defines a linear mapping of data and prototypes to a space in which standard Euclidean distance is applied:

*N*×

*N*)-matrix Ω apart from a normalization \(\sum_{j} \Lambda_{jj}=\sum_{i,j} \Omega_{ij}^{2} =1\) [17]. The resulting NPC scheme implements general, piecewise linear boundaries which separate the classes.

_{ ij }from a given set of example data \(\{ \mathbf {x}^{\mu}, c(\mathbf {x}^{\mu}) \}_{\mu=1}^{P}\) with class labels

*c*(

**x**

^{ μ }) can be done according to iterative, heuristic procedures similar to the original LVQ algorithm [14]. Alternatively, the training process can be guided by suitable cost functions. A prominent example is the objective function of GLVQ suggested by Sato and Yamada [15]: Here, the index

*J*identifies the

*correct winner*, i.e. the closest prototype which carries the correct label,

*d*

^{Λ}(

**w**

_{ J },

**x**)≤

*d*

^{Λ}(

**w**

_{ j },

**x**) for all

**w**

_{ j }with

*c*(

**w**

_{ j })=

*c*(

**x**). Correspondingly the

*wrong winner*

**w**

_{ K }is the closest prototype that carries a label different from

*c*(

**x**). The cost function is further specified by choosing the monotonic function Φ, for instance as a sigmoidal or the identity in the simplest case. Note that the contribution

*e*(

**x**) is negative iff the feature vector

**x**is classified correctly by the given LVQ system. Hence, the minimization of

*E*with respect to prototypes and the matrix Ω can be interpreted as a large margin based training prescription. The actual optimization can be done by stochastic steepest descent as suggested in [17], where the full form of the corresponding gradient terms is given. Alternatively, batch gradient methods or more sophisticated optimization procedures can be applied.

A very important aspect of matrix relevance learning is its inherent tendency to yield low-rank matrices in the course of training: the resulting matrices Λ obtained by GMLVQ or heuristic LVQ updates become singular and are, generically, dominated by one or very few eigenvectors. Note that the distance measure (1) need not be strictly positive definite for the LVQ classifier to be meaningful. The convergence behavior can be understood by means of a mathematical analysis of the procedure under simplifying assumptions, see [2, 3]. As a consequence, the effective number of free parameters grows only linearly with *N*, while, nominally, *N*
^{2} parameters have to be adapted. This explains why the introduction of relevance matrices in GMLVQ training has not led to overfitting effects in most practical applications or benchmark tests.

In the following, a few important variations of matrix relevance learning are mentioned, documenting the flexibility of the approach.

*Cost functions:* Generalized dissimilarities of the form (1) can be inserted in a multitude of distance based machine learning systems. In the context of LVQ, alternative cost functions can be employed, one example being the likelihood based objective of RSLVQ [20], see [18] for the incorporation of matrix relevances and the formulation of a likelihood-scheme replacing the simple NPC.

*Diagonal relevance matrices:* Restricting the measure (1) to diagonal matrices Λ and Ω recovers the simpler and less powerful GRLVQ scheme [12]. Here, single dimensions in feature space are weighted or rescaled by the positive relevance factors \(\Lambda_{jj} = \Omega_{jj}^{2}\).

*Local distance measures:* The flexibility of the matrix relevance approach can be greatly increased by using class-wise or local distance measures [17]. For instance, the assignment of a separate relevance matrix Λ^{(j)}=Ω^{(j)⊤}Ω^{(j)} to each of the prototypes results in piecewise quadratic decision boundaries in the NPC scheme.

*Limited rank relevance matrices:* The basic formalism also allows to parameterize Λ in terms of a rectangular (*N*×*M*)-matrix Ω with *M*<*N*, where *M* explicitly limits the rank of Λ. Together with an appropriate penalty term added to the cost function, the system can be forced to exploit the maximum rank *M*. Therefore, explicit control of rank(Λ) can be achieved [7, 9, 19]. One motivation for imposing this restriction is to reduce the number of adaptive parameters explicitly. Despite the above discussed tendency of Λ to approach low rank, the optimization of (*N*×*N*) matrices may become infeasible and costly in the presence of very high-dimensional data. Furthermore, the projections obtained by *Limited Rank Matrix LVQ* (LiRaM LVQ) facilitate the discriminative visualization of labeled data sets for *M*=2 or 3 [2, 7, 9].

## 3 Classification of Adrenal Tumors

Matrix relevance learning has proven useful in a number of benchmark problems and relevant practical applications from various contexts, including computer vision [10], bioinformatics [21], or content-based image retrieval [8]. In the following, a recent medical application is highlighted. Here, it is not the primary goal to report the results or technical aspects, which has been done in detail elsewhere [1, 4], but to emphasize the usefulness of the approach, in particular with respect to the interaction with domain experts.

The analysis of so-called *omics* data plays a role of increasing importance with respect to biomarker based diagnoses and personalized medicine. This comprises a multitude of methods based on genomics, proteomics, metabolomics or other patient specific data.

In collaboration with medical researchers from the *European Network for the Study of Adrenal Tumors* (www.ensat.org) and, in particular, from the Medical School of the University of Birmingham, UK, a diagnosis tool was developed for the detection of malignancy in adrenal tumors [1]. Matrix relevance learning was applied in the analysis of steroid metabolomics data, representing the 24 h excretion of 32 steroid biomarkers in patients with adrenal tumors. In a first retrospective study the target was to assign each steroid profile to the class of benign adrenocortical adenoma, ACA for short, or malignant adrenocortical carcinoma (ACC).

Moreover, GMLVQ facilitated novel insights into the problem and provided an excellent basis for discussions in this interdisciplinary project. Besides interpretable prototypes for ACA and ACC steroid profiles, the method delivered the corresponding global relevance matrix which quantifies the significance of single steroid markers and combinations thereof. A number of markers were identified as highly relevant for the GMLVQ-based classification, while considerations on the level of univariate statistics showed no significant correlation with the class memberships [1]. This reflects the strength of matrix relevance learning as a truly multivariate, interpretable approach.

Based on the obtained matrix relevances, a panel of nine particularly relevant steroid markers was selected. Clearly, the achievable classification is limited compared to the use of the full panel of 32 markers. However, our analysis showed that the performance in terms of the ROC is only slightly inferior [1, 4]. Limiting the analysis to a smaller number of markers facilitates an efficient technical realization of the test as a promising, non-invasive diagnosis tool [1]. Prospective studies concerning novel patient data will be required to substantiate this claim. Further aims of this ongoing line of research include the consideration of larger pools of potential markers, the incorporation of additional clinical data, and the monitoring of patients during and after treatment. Moreover, the potential identification of subtypes of ACA and ACC tumors should become feasible as larger amounts of patient data become available.

## 4 Summary and Outlook

Within the NWO funded project *Admire LVQ*, Matrix Relevance LVQ has been established as a versatile and powerful framework for the classification of multidimensional data [7, 16]. The basic concept was developed and properties of various MRLVQ based algorithms were studied systematically. Benchmark tests and practical applications, mainly from the biomedical domain, showed that MRLVQ constitutes a competitive classification tool. Moreover, the emerging plausible systems provide valuable insights into the problems at hand and facilitate fruitful interdisciplinary collaboration.

Forthcoming studies will address important modifications of the basic MRLVQ scheme. For instance, block or triangular matrices could be used to reflect prior domain knowledge about the dependence or interaction of features. Along the same lines, specific forms of matrix relevance learning can be designed for the classification of functional data where *neighboring* features may be highly correlated, see [13] for first ideas concerning diagonal relevance matrices. Heterogeneous data sets comprising features from various sources and of different nature, for instance combinations of numerical and categorical data, require the design of modified adaptive distance measures and improved prototype schemes. Imposing suitable sparsity constraints on the relevance matrices opens new routes to feature selection which are currently under investigation. Moreover, the many attractive features of MRLVQ will be taken advantage of in further relevant and up to date practical applications.

## Acknowledgements

This project would have been impossible without the groundbreaking ideas and contributions of numerous colleagues. Special thanks go to Wiebke Arlt, Kerstin Bunte, Barbara Hammer, and Petra Schneider.

This work was supported by the *Nederlandse Organisatie voor Wetenschappelijk Onderzoek* (NWO) under project code 612.066.620.

### Open Access

This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.