Efficient rough-set-based attribute reduction algorithm with nearest neighbour searching

J. Wang; X. Y. Peng; Y. Peng

doi:10.1049/el:20070523

Efficient rough-set-based attribute reduction algorithm with nearest neighbour searching

J. Wang^*
, X. Y. Peng
, Y. Peng

^*Corresponding author for this work

School of Electronics and Information Engineering

Harbin Institute of Technology

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

Abstract

A fast nearest neighbour searching method with gradually shrinking search space is proposed to reduce the computing complexity of indiscernibility relation in the rough-set-based attribute reduction algorithm. Experimental results show that the proposed algorithm computed attribute reduction more efficiently.

Original language	English
Pages (from-to)	563-565
Number of pages	3
Journal	Electronics Letters
Volume	43
Issue number	10
DOIs	https://doi.org/10.1049/el:20070523
State	Published - 2007

Access to Document

10.1049/el:20070523

Cite this

@article{816ca5a957b946979dae0c73d5cf4848,

title = "Efficient rough-set-based attribute reduction algorithm with nearest neighbour searching",

abstract = "A fast nearest neighbour searching method with gradually shrinking search space is proposed to reduce the computing complexity of indiscernibility relation in the rough-set-based attribute reduction algorithm. Experimental results show that the proposed algorithm computed attribute reduction more efficiently.",

author = "J. Wang and Peng, \{X. Y.\} and Y. Peng",

year = "2007",

doi = "10.1049/el:20070523",

language = "英语",

volume = "43",

pages = "563--565",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley \& Sons Inc.",

number = "10",

}

TY - JOUR

T1 - Efficient rough-set-based attribute reduction algorithm with nearest neighbour searching

AU - Wang, J.

AU - Peng, X. Y.

AU - Peng, Y.

PY - 2007

Y1 - 2007

N2 - A fast nearest neighbour searching method with gradually shrinking search space is proposed to reduce the computing complexity of indiscernibility relation in the rough-set-based attribute reduction algorithm. Experimental results show that the proposed algorithm computed attribute reduction more efficiently.

AB - A fast nearest neighbour searching method with gradually shrinking search space is proposed to reduce the computing complexity of indiscernibility relation in the rough-set-based attribute reduction algorithm. Experimental results show that the proposed algorithm computed attribute reduction more efficiently.

UR - https://www.scopus.com/pages/publications/34248343439

U2 - 10.1049/el:20070523

DO - 10.1049/el:20070523

M3 - 文章

AN - SCOPUS:34248343439

SN - 0013-5194

VL - 43

SP - 563

EP - 565

JO - Electronics Letters

JF - Electronics Letters

IS - 10

ER -

Efficient rough-set-based attribute reduction algorithm with nearest neighbour searching

Abstract

Access to Document

Other files and links

Fingerprint

Cite this