IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/hal-00286065.html
   My bibliography  Save this paper

optimal pruned K-nearest neighbors: op-knn application to financial modeling

Author

Listed:
  • Eric Severin

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, SAMOS - Statistique Appliquée et MOdélisation Stochastique - UP1 - Université Paris 1 Panthéon-Sorbonne, CIS - Laboratory of Computer and Information Science - TKK - TKK Helsinki University of Technology)

  • Yoan Miche

    (CIS - Laboratory of Computer and Information Science - TKK - TKK Helsinki University of Technology)

  • Amaury Lendasse

    (CIS - Laboratory of Computer and Information Science - TKK - TKK Helsinki University of Technology, DICE-MLG - Machine Learning Group - UCL - Université Catholique de Louvain = Catholic University of Louvain)

  • Anti Sorjamaa

    (TKK - TKK Helsinki University of Technology)

  • Qi Yu

    (TKK - TKK Helsinki University of Technology)

Abstract

The paper proposes a methodology called OP-KNN, which builds a one hidden- layer feedforward neural network, using nearest neighbors neurons with extremely small com- putational time. The main strategy is to select the most relevant variables beforehand, then to build the model using KNN kernels. Multiresponse Sparse Regression (MRSR) is used as the second step in order to rank each kth nearest neighbor and finally as a third step Leave-One- Out estimation is used to select the number of neighbors and to estimate the generalization performances. This new methodology is tested on a toy example and is applied to financial modeling

Suggested Citation

  • Eric Severin & Yoan Miche & Amaury Lendasse & Anti Sorjamaa & Qi Yu, 2008. "optimal pruned K-nearest neighbors: op-knn application to financial modeling," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00286065, HAL.
  • Handle: RePEc:hal:cesptp:hal-00286065
    Note: View the original document on HAL open archive server: https://hal.science/hal-00286065
    as

    Download full text from publisher

    File URL: https://hal.science/hal-00286065/document
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:hal-00286065. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.