Neighborhood rough set based ECG signal classification for diagnosis of cardiac diseases

A new neighborhood variable precision rough set modal is presented in this paper. The modal possesses the characteristics of neighborhood rough set and variable precision rough set, so it can overcome shortcomings of classic rough set which only be fit for discrete variables and sensitive to noise. Based on giving the definitions of approximate reduction, lower and upper approximate reduction, lower and upper distribution reduction, two kinds of algorithms to confirm lower and upper distribution reduction were advanced. The modal was applied to diagnose one frequency modulated water pump vibration faults. The result shows the modal is more suitable to engineering problems, because it can not only deal with continues variables but also be robust to noise.

Download Full-text

A neighborhood rough set model for attribute reduction without distance metric

10.1117/12.2624145 ◽

2021 ◽

Author(s):

Xingxin Chen ◽

Shuyin Xia ◽

Feng Hu

Keyword(s):

Rough Set ◽

Attribute Reduction ◽

Distance Metric ◽

Neighborhood Rough Set

Download Full-text

A new trained ECG signal Classification method using Modified Spline Activated Neural Network

2018 Second International Conference on Computing Methodologies and Communication (ICCMC) ◽

10.1109/iccmc.2018.8487640 ◽

2018 ◽

Author(s):

Ganesh Kumar R

Keyword(s):

Neural Network ◽

Signal Classification ◽

Classification Method ◽

Ecg Signal

Download Full-text

Attribute Reduction of Boolean Matrix in Neighborhood Rough Set Model

International Journal of Computational Intelligence Systems ◽

10.2991/ijcis.d.200915.004 ◽

2020 ◽

Author(s):

Yan Gao ◽

Changwei Lv ◽

Zhengjiang Wu

Keyword(s):

Rough Set ◽

Attribute Reduction ◽

Boolean Matrix ◽

Neighborhood Rough Set

Download Full-text

Inconsistent Neighborhoods and Relevant Properties in Neighborhood Rough Set Models

Proceedings of the 2016 International Conference on Computer Engineering and Information Systems ◽

10.2991/ceis-16.2016.29 ◽

2016 ◽

Author(s):

Shu-Jiao Liao ◽

Qing-Xin Zhu ◽

Rui Liang ◽

Xin-Zheng Niu

Keyword(s):

Rough Set ◽

Neighborhood Rough Set

Download Full-text

An Ensemble Classification Method for High-Dimensional Data Using Neighborhood Rough Set

Complexity ◽

10.1155/2021/8358921 ◽

2021 ◽

Vol 2021 ◽

pp. 1-12

Author(s):

Jing Zhang ◽

Guang Lu ◽

Jiaquan Li ◽

Chuanwen Li

Keyword(s):

Feature Selection ◽

Rough Set ◽

Small Sample Size ◽

High Dimensional Data ◽

Classification Performance ◽

Small Sample ◽

Ensemble Classification ◽

High Dimensional ◽

Sample Classification ◽

Neighborhood Rough Set

Mining useful knowledge from high-dimensional data is a hot research topic. Efficient and effective sample classification and feature selection are challenging tasks due to high dimensionality and small sample size of microarray data. Feature selection is necessary in the process of constructing the model to reduce time and space consumption. Therefore, a feature selection model based on prior knowledge and rough set is proposed. Pathway knowledge is used to select feature subsets, and rough set based on intersection neighborhood is then used to select important feature in each subset, since it can select features without redundancy and deals with numerical features directly. In order to improve the diversity among base classifiers and the efficiency of classification, it is necessary to select part of base classifiers. Classifiers are grouped into several clusters by k-means clustering using the proposed combination distance of Kappa-based diversity and accuracy. The base classifier with the best classification performance in each cluster will be selected to generate the final ensemble model. Experimental results on three Arabidopsis thaliana stress response datasets showed that the proposed method achieved better classification performance than existing ensemble models.

Download Full-text

Preference Mining Using Neighborhood Rough Set Model on Two Universes

Computational Intelligence and Neuroscience ◽

10.1155/2016/6975458 ◽

2016 ◽

Vol 2016 ◽

pp. 1-13 ◽

Cited By ~ 5

Author(s):

Kai Zeng

Keyword(s):

Rough Set ◽

User Satisfaction ◽

Traditional Method ◽

Cold Start ◽

Effective Solution ◽

Neighborhood Rough Set ◽

Recommendation Accuracy ◽

Item Data ◽

Two Universes ◽

Cold Start Problem

Preference mining plays an important role in e-commerce and video websites for enhancing user satisfaction and loyalty. Some classical methods are not available for the cold-start problem when the user or the item is new. In this paper, we propose a new model, called parametric neighborhood rough set on two universes (NRSTU), to describe the user and item data structures. Furthermore, the neighborhood lower approximation operator is used for defining the preference rules. Then, we provide the means for recommending items to users by using these rules. Finally, we give an experimental example to show the details of NRSTU-based preference mining for cold-start problem. The parameters of the model are also discussed. The experimental results show that the proposed method presents an effective solution for preference mining. In particular, NRSTU improves the recommendation accuracy by about 19% compared to the traditional method.

Download Full-text