• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Xiong Bingyan, Wang Guoyin, Deng Weibin. Under-Sampling Method Based on Sample Weight for Imbalanced Data[J]. Journal of Computer Research and Development, 2016, 53(11): 2613-2622. DOI: 10.7544/issn1000-1239.2016.20150593
Citation: Xiong Bingyan, Wang Guoyin, Deng Weibin. Under-Sampling Method Based on Sample Weight for Imbalanced Data[J]. Journal of Computer Research and Development, 2016, 53(11): 2613-2622. DOI: 10.7544/issn1000-1239.2016.20150593

Under-Sampling Method Based on Sample Weight for Imbalanced Data

More Information
  • Published Date: October 31, 2016
  • Imbalanced data exists widely in the real world, and its classification is a hot topic in data mining and machine learning. Under-sampling is a widely used method in dealing imbalanced data set and its main idea is choosing a subset of majority class to make the data set balanced. However, some useful majority class information may be lost. In order to solve the problem, an under-sampling method based on sample weight for imbalance problem is proposed, named as KAcBag (K-means AdaCost bagging). In this method, sample weight is introduced to reveal the area where the sample is located. Firstly, according to the sample scale, a weight is made for each sample and is modified after clustering the data set. The samples which have less weight in the center of majority class. Then some samples are drawn from majority class in accordance with the sample weight. In the procedure, the samples in the center of majority class can be selected easily. The sampled majority class samples and all the minority class samples are combined as the training data set for a component classifier. After that, we can get several decision tree sub-classifiers. Finally, the prediction model is constructed based on the accuracy of each sub-classifiers. Experimental tests on nineteen UCI data sets and telecom user data show that KAcBag can make the selected samples have more representativeness. Based on that, this method can improve the the classification performance of minority class and reduce the scale of the problem.
  • Related Articles

    [1]Wang Jindi, Tong Xiangrong. Agent Negotiation Model Based on Round Limit Change of Non-Sparse Trust Networks[J]. Journal of Computer Research and Development, 2019, 56(12): 2612-2622. DOI: 10.7544/issn1000-1239.2019.20190163
    [2]Fan Yanfang, Cai Ying. Collaboration Supported Mandatory Access Control Model[J]. Journal of Computer Research and Development, 2015, 52(10): 2411-2421. DOI: 10.7544/issn1000-1239.2015.20150574
    [3]Ge Xin, Zhao Hai, Zhang Jun. Degree Correlation and Its Features of Spreading on Networks[J]. Journal of Computer Research and Development, 2013, 50(4): 741-749.
    [4]Zhang Zhancheng, Wang Shitong, Fu-Lai Chung. Collaborative Classification Mechanism for Privacy-Preserving[J]. Journal of Computer Research and Development, 2011, 48(6): 1018-1028.
    [5]Tong Xiangrong, Huang Houkuan, Zhang Wei. A Case Based Agent Multi-Issue Negotiation Model[J]. Journal of Computer Research and Development, 2009, 46(9): 1508-1514.
    [6]Bian Zheng'ai, Liu Bo, and Luo Junzhou. A Cooperative-Game-Based Mobile Agent Task Collaboration Model in Network Management[J]. Journal of Computer Research and Development, 2007, 44(2): 193-200.
    [7]Tao Haijun, Wang Yadong, Guo Maozu, and Wang Hanlun. A Multi-Agent Negotiation Model Based on Acquaintance Coalition and Extended Contract Net Protocol[J]. Journal of Computer Research and Development, 2006, 43(7): 1155-1160.
    [8]Yang Pei, Gao Yang, Chen Zhaoqian. Persuasive Multi-Agent Multi-Issue Negotiation[J]. Journal of Computer Research and Development, 2006, 43(7): 1149-1154.
    [9]Gao Jian and Zhang Wei. An Accelerating Chaos Evolution Algorithm of Bilateral Multi-Issue Automated Negotiation in MAS[J]. Journal of Computer Research and Development, 2006, 43(6): 1104-1108.
    [10]Zhao Xinpei, Li Mingshu, Chan Keith, Wang Qing. A Negotiation-Based Approach for Software Process Collaboration[J]. Journal of Computer Research and Development, 2006, 43(2): 314-320.
  • Cited by

    Periodical cited type(2)

    1. 刘梦君,蒋新宇,石斯瑾,江南,吴笛. 人工智能教育融合安全警示:来自机器学习算法功能的原生风险分析. 江南大学学报(人文社会科学版). 2022(05): 89-101 .
    2. 刘波涛,彭长根,吴睿雪,丁红发,谢明明. 面向数字型的轻量级保形加密算法研究. 计算机研究与发展. 2019(07): 1488-1497 . 本站查看

    Other cited types(3)

Catalog

    Article views (1731) PDF downloads (950) Cited by(5)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return