%A ZHANG Wei, MIAO Duo-qian, GAO Can and LI Feng %T Rough Set Attribute Reduction Algorithm for Partially Labeled Data %0 Journal Article %D 2017 %J Computer Science %R 10.11896/j.issn.1002-137X.2017.01.005 %P 25-31 %V 44 %N 1 %U {https://www.jsjkx.com/CN/abstract/article_1038.shtml} %8 2018-11-13 %X Attribute reduction,as an important preprocessing step for knowledge acquiring in data mining,is one of the key issues in rough set theory.Rough set theory is an effective supervised learning model for labeled data.However,attribute reduction for partially labeled data is outside the realm of traditional rough set theory.In this paper,a rough set attribute reduction algorithm for partially labeled data was proposed based on co-training which capitalizes on the unlabeled data to improve the quality of attribute reducts from few labeled data.It gets two diverse reducts of the labeled data,employs them to train its base classifiers,and then co-trains the two base classifiers iteratively.In every round,the base classifiers learn from each other on the unlabeled data and enlarge the labeled data,so better quality reducts could be computed from the enlarged labeled data and employed to construct base classifiers of higher performance.The theoretical analysis and experimental results with UCI data sets show that the proposed algorithm can select a few attributes but keep classification power.