## Abstract

Due to the development of information technologies, there is a huge amount of text data posted on the Internet. In this study, we focus on distance metric learning, which is one of the models of machine learning. Distance metric learning is a method of estimating the metric matrix of Mahalanobis squared distance from training data under an appropriate constraint. Mochihashi et al. proposed a method which can derive the optimal metric matrix analytically. However, the vector space for document data is normally very high dimensionally and sparse. Therefore, when this method is applied to document data directly, over-fitting may occur because the number of estimated parameters is in proportion to the square of the input data dimensions. To avoid the problem of over-fitting, a regularization term is introduced in this study. The purpose of this study is to formulate the regularized estimation of the metric matrix in which the optimal metric matrix can be derived analytically. To verify the effectiveness of the proposed method, document classification using a Japanese newspaper article is conducted.

Original language | English |
---|---|

Pages (from-to) | 190-203 |

Number of pages | 14 |

Journal | Journal of Japan Industrial Management Association |

Volume | 66 |

Issue number | 2E |

Publication status | Published - 2015 |

## Keywords

- Distance metric learning
- Document classification
- Regularization
- Vector space model

## ASJC Scopus subject areas

- Strategy and Management
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics