K Important Neighbors: A Novel Approach to Binary Classification in High Dimensional Data.

K nearest neighbors (KNN) are known as one of the simplest nonparametric classifiers but in high dimensional setting accuracy of KNN are affected by nuisance features. In this study, we proposed the K important neighbors (KIN) as a novel approach for binary classification in high dimensional problem...

Descripción completa

Detalles Bibliográficos
Publicado en:BioMed Research International Vol. 2017; pp. 1 - 10
Autores principales: Raeisi Shahraki, Hadi, Pourahmad, Saeedeh, Zare, Najaf
Formato: equations & formulas research tables/charts Journal Article
Publicado: Wiley-Blackwell 12/11/2017
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=126688694&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 126688694
    longDbName: CINAHL Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    dissinfo:
    jinfo:
      jid:
        23146133
        FT2T
      jtl: BioMed Research International
      issn: 23146133
      maglogo: N
    pubinfo:
      dt: 12/11/2017
      vid: 2017
      pid: 480
      pub: Wiley-Blackwell
      place: Malden, Massachusetts
    artinfo:
      ui:
        126688694
        126688694
        126688694
        10.1155/2017/7560807
        126688694
      ppf: 1
      ppct: 9
      formats:
        fmt:
          @attributes:
            type: P
      tig:
        atl: K Important Neighbors: A Novel Approach to Binary Classification in High Dimensional Data.
      aug:
        au:
          Raeisi Shahraki, Hadi
          Pourahmad, Saeedeh
          Zare, Najaf
        affil: Department of Biostatistics, School of Medicine, Shiraz University of Medical Sciences, Shiraz, Iran
      sug:
        subj:
          Statistics
          Classification Methods
          Data Analysis
          Human
          Data Analysis Software
          Logistic Regression
      ab: K nearest neighbors (KNN) are known as one of the simplest nonparametric classifiers but in high dimensional setting accuracy of KNN are affected by nuisance features. In this study, we proposed the K important neighbors (KIN) as a novel approach for binary classification in high dimensional problems. To avoid the curse of dimensionality, we implemented smoothly clipped absolute deviation (SCAD) logistic regression at the initial stage and considered the importance of each feature in construction of dissimilarity measure with imposing features contribution as a function of SCAD coefficients on Euclidean distance. The nature of this hybrid dissimilarity measure, which combines information of both features and distances, enjoys all good properties of SCAD penalized regression and KNN simultaneously. In comparison to KNN, simulation studies showed that KIN has a good performance in terms of both accuracy and dimension reduction. The proposed approach was found to be capable of eliminating nearly all of the noninformative features because of utilizing oracle property of SCAD penalized regression in the construction of dissimilarity measure. In very sparse settings, KIN also outperforms support vector machine (SVM) and random forest (RF) as the best classifiers.
      pubtype: Academic Journal
      doctype:
        equations & formulas
        research
        tables/charts
        Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N