Penalized optimal scoring for the classification of multi-dimensional functional data

Tomohiro Ando

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

Many fields of research need to classify individual systems based on one or more data series, which are obtained by sampling an unknown continuous curve with noise. In other words, the underlying process is an unknown function which the observed variables represent only imperfectly. Although functional logistic regression has many attractive features for this classification problem, this method is applicable only when the number of individuals to be classified (or available to estimate the model) is large compared to the number of curves sampled per individual. To overcome this limitation, we use penalized optimal scoring to construct a new method for the classification of multi-dimensional functional data. The proposed method consists of two stages. First, the series of observed discrete values available for each individual are expressed as a set of continuous curves. Next, the penalized optimal scoring model is estimated on the basis of these curves. A similar penalized optimal scoring method was described in my previous work, but this model is not suitable for the analysis of continuous functions. In this paper we adopt a Gaussian kernel approach to extend the previous model. The high accuracy of the new method is demonstrated on Monte Carlo simulations, and used to predict defaulting firms on the Japanese Stock Exchange.

Original languageEnglish
Pages (from-to)565-576
Number of pages12
JournalStatistical Methodology
Volume6
Issue number6
DOIs
Publication statusPublished - 2009 Nov 1

Keywords

  • Functional data analysis
  • Kernel methods
  • Optimal scoring
  • Penalized least squares

ASJC Scopus subject areas

  • Statistics and Probability

Fingerprint Dive into the research topics of 'Penalized optimal scoring for the classification of multi-dimensional functional data'. Together they form a unique fingerprint.

Cite this