A classification point-of-view about conditional Kendall's tau

Alexis Derumigny, Jean-David Fermanian

Research output: Contribution to journalArticleAcademicpeer-review

2 Downloads (Pure)

Abstract

It is shown how the problem of estimating conditional Kendall’s tau can be rewritten as a classification task. Conditional Kendall’s tau is a conditional dependence parameter that is a characteristic of a given pair of random variables. The goal is to predict whether the pair is concordant (value of 1) or discordant (value of ) conditionally on some covariates. The consistency and the asymptotic normality of a family of penalized approximate maximum likelihood estimators is proven, including the equivalent of the logit and probit regressions in our framework. Specific algorithms are detailed, adapting usual machine learning techniques, including nearest neighbors, decision trees, random forests and neural networks, to the setting of the estimation of conditional Kendall’s tau. Finite sample properties of these estimators and their sensitivities to each component of the data-generating process are assessed in a simulation study. Finally, all these estimators are applied to a dataset of European stock indices.
Original languageEnglish
Pages (from-to)70-94
Number of pages25
JournalComputational statistics & data analysis
Volume135
Early online date5 Feb 2019
DOIs
Publication statusPublished - 1 Jul 2019
Externally publishedYes

Keywords

  • Conditional Kendall's tau
  • Conditional dependence measure
  • Machine learning
  • Classification task
  • Stock indices

Cite this

@article{e8c4eee4d8b74642b6e46c502c85dc76,
title = "A classification point-of-view about conditional Kendall's tau",
abstract = "It is shown how the problem of estimating conditional Kendall’s tau can be rewritten as a classification task. Conditional Kendall’s tau is a conditional dependence parameter that is a characteristic of a given pair of random variables. The goal is to predict whether the pair is concordant (value of 1) or discordant (value of ) conditionally on some covariates. The consistency and the asymptotic normality of a family of penalized approximate maximum likelihood estimators is proven, including the equivalent of the logit and probit regressions in our framework. Specific algorithms are detailed, adapting usual machine learning techniques, including nearest neighbors, decision trees, random forests and neural networks, to the setting of the estimation of conditional Kendall’s tau. Finite sample properties of these estimators and their sensitivities to each component of the data-generating process are assessed in a simulation study. Finally, all these estimators are applied to a dataset of European stock indices.",
keywords = "Conditional Kendall's tau, Conditional dependence measure, Machine learning, Classification task, Stock indices",
author = "Alexis Derumigny and Jean-David Fermanian",
year = "2019",
month = "7",
day = "1",
doi = "10.1016/j.csda.2019.01.013",
language = "English",
volume = "135",
pages = "70--94",
journal = "Computational statistics & data analysis",
issn = "0167-9473",
publisher = "Elsevier",

}

A classification point-of-view about conditional Kendall's tau. / Derumigny, Alexis; Fermanian, Jean-David.

In: Computational statistics & data analysis, Vol. 135, 01.07.2019, p. 70-94.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - A classification point-of-view about conditional Kendall's tau

AU - Derumigny, Alexis

AU - Fermanian, Jean-David

PY - 2019/7/1

Y1 - 2019/7/1

N2 - It is shown how the problem of estimating conditional Kendall’s tau can be rewritten as a classification task. Conditional Kendall’s tau is a conditional dependence parameter that is a characteristic of a given pair of random variables. The goal is to predict whether the pair is concordant (value of 1) or discordant (value of ) conditionally on some covariates. The consistency and the asymptotic normality of a family of penalized approximate maximum likelihood estimators is proven, including the equivalent of the logit and probit regressions in our framework. Specific algorithms are detailed, adapting usual machine learning techniques, including nearest neighbors, decision trees, random forests and neural networks, to the setting of the estimation of conditional Kendall’s tau. Finite sample properties of these estimators and their sensitivities to each component of the data-generating process are assessed in a simulation study. Finally, all these estimators are applied to a dataset of European stock indices.

AB - It is shown how the problem of estimating conditional Kendall’s tau can be rewritten as a classification task. Conditional Kendall’s tau is a conditional dependence parameter that is a characteristic of a given pair of random variables. The goal is to predict whether the pair is concordant (value of 1) or discordant (value of ) conditionally on some covariates. The consistency and the asymptotic normality of a family of penalized approximate maximum likelihood estimators is proven, including the equivalent of the logit and probit regressions in our framework. Specific algorithms are detailed, adapting usual machine learning techniques, including nearest neighbors, decision trees, random forests and neural networks, to the setting of the estimation of conditional Kendall’s tau. Finite sample properties of these estimators and their sensitivities to each component of the data-generating process are assessed in a simulation study. Finally, all these estimators are applied to a dataset of European stock indices.

KW - Conditional Kendall's tau

KW - Conditional dependence measure

KW - Machine learning

KW - Classification task

KW - Stock indices

U2 - 10.1016/j.csda.2019.01.013

DO - 10.1016/j.csda.2019.01.013

M3 - Article

VL - 135

SP - 70

EP - 94

JO - Computational statistics & data analysis

JF - Computational statistics & data analysis

SN - 0167-9473

ER -