• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Yao Sheng, Xu Feng, Zhao Peng, Ji Xia. Intuitionistic Fuzzy Entropy Feature Selection Algorithm Based on Adaptive Neighborhood Space Rough Set Model[J]. Journal of Computer Research and Development, 2018, 55(4): 802-814. DOI: 10.7544/issn1000-1239.2018.20160919
Citation: Yao Sheng, Xu Feng, Zhao Peng, Ji Xia. Intuitionistic Fuzzy Entropy Feature Selection Algorithm Based on Adaptive Neighborhood Space Rough Set Model[J]. Journal of Computer Research and Development, 2018, 55(4): 802-814. DOI: 10.7544/issn1000-1239.2018.20160919

Intuitionistic Fuzzy Entropy Feature Selection Algorithm Based on Adaptive Neighborhood Space Rough Set Model

More Information
  • Published Date: March 31, 2018
  • Feature selection is a very vital technology in data preprocessing.In this method, some most effective features are mainly selected from the features of original data sets, which is aimed to reduce the dimension of data sets.Accordingly, the performance of the learning algorithm can be improved.In the feature selection algorithms based on the neighborhood rough set model, without considering data uneven distribution, there currently exist some defects in the neighborhood of object.To solve this problem of data uneven distribution, variance is adapted to measure the distribution of the data, and the binary neighborhood space is redefined, then the rough set model of the adaptive binary neighborhood space is proposed according to this binary neighborhood space.As well as, the new rough set model of the adaptive binary neighborhood space is combined with the neighborhood intuitionistic fuzzy entropy as the method of the evaluation of features, and then the corresponding feature selection algorithm is also constructed.The experimental results of UCI show that the proposed intuitionistic fuzzy entropy feature selection algorithm can select smaller feature subsets which have higher accuracy of classification, at the same time, the intuitionistic fuzzy entropy feature selection algorithm based on adaptive neighborhood space rough set model also has less time consumption.Therefore, the proposed feature selection algorithm has stronger superiority in this paper.
  • Related Articles

    [1]Bai Ting, Liu Xuanning, Wu Bin, Zhang Zibin, Xu Zhiyuan, Lin Kangyi. Multi-Granularity Based Feature Interaction Pruning Model for CTR Prediction[J]. Journal of Computer Research and Development, 2024, 61(5): 1290-1298. DOI: 10.7544/issn1000-1239.202220943
    [2]Wang Rongquan, Ouyang Dantong, Wang Yiyuan, Liu Siguang, Zhang Liming. Solving Minimal Hitting Sets Method with SAT Based on DOEC Minimization[J]. Journal of Computer Research and Development, 2018, 55(6): 1273-1281. DOI: 10.7544/issn1000-1239.2018.20160809
    [3]Li Qi, Zhong Jiang, Li Xue. DyBGP: A Dynamic-Balanced Algorithm for Graph Partitioning Based on Heuristic Strategies[J]. Journal of Computer Research and Development, 2017, 54(12): 2851-2857. DOI: 10.7544/issn1000-1239.2017.20160690
    [4]Sun Li, Li Jing, Liu Guohua. Join Strategy Optimization in Column Storage Based Query[J]. Journal of Computer Research and Development, 2013, 50(8): 1647-1656.
    [5]Bi Xiaojun, Liu Guo'an, Xiao Jing. Dynamic Adaptive Differential Evolution Based on Novel Mutation Strategy[J]. Journal of Computer Research and Development, 2012, 49(6): 1288-1297.
    [6]Gu Wenxiang, Wang Jinyan, Yin Minghao. Knowledge Compilation Using Extension Rule Based on MCN and MO Heuristic Strategies[J]. Journal of Computer Research and Development, 2011, 48(11): 2064-2073.
    [7]Zhou Anfu, Liu Min, and Li Zhongcheng. Study on Optimal Packet Dispersion Strategy[J]. Journal of Computer Research and Development, 2009, 46(4): 541-548.
    [8]Chen Mao, Huang Wenqi. A Heuristic Algorithm for the Unequal Circle Packing Problem[J]. Journal of Computer Research and Development, 2007, 44(12): 2092-2097.
    [9]Ding Ding, Luo Siwei, and Gao Zhan. An Object-Adjustable Heuristic Scheduling Strategy in Grid Environments[J]. Journal of Computer Research and Development, 2007, 44(9): 1572-1578.
    [10]Yang Xiaowei, Lu Jie, Zhang Guangquan. An Effective Pruning Algorithm for Least Squares Support Vector Machine Classifier[J]. Journal of Computer Research and Development, 2007, 44(7): 1128-1136.
  • Cited by

    Periodical cited type(8)

    1. 唐旭,张多利,王杰,宋宇鲲. 异构多核处理器多发射动态调度技术研究. 合肥工业大学学报(自然科学版). 2023(05): 632-640 .
    2. 纪元,郑卫波,王梓. 基于容器的安全接入虚拟化. 计算机与现代化. 2022(09): 106-110+118 .
    3. 阳勇,孟相如,康巧燕,韩晓阳. 拓扑与资源感知的虚拟网络功能迁移方法. 计算机科学与探索. 2021(11): 2161-2170 .
    4. 曾理,叶晓舟,王玲芳. DPDK技术应用研究综述. 网络新媒体技术. 2020(02): 1-8 .
    5. 邓理,吴伟楠,朱正一,陈鸣. DiffSec:一种差别性的智能网络安全服务模型. 计算机研究与发展. 2019(05): 955-966 . 本站查看
    6. 房一泉,姚俊,万浩,徐鹏. 教育信息化大平台的构建. 化工高等教育. 2019(03): 38-42+89 .
    7. 李佑文,褚红健,王志心. 基于网络负载均衡的综合监控系统网关设计. 江苏科技信息. 2019(32): 57-59 .
    8. 胡洪云,符小周. 基于网络功能虚拟化的高性能负载均衡研究. 佳木斯职业学院学报. 2018(11): 393-394 .

    Other cited types(4)

Catalog

    Article views (1440) PDF downloads (695) Cited by(12)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return