Computer Science ›› 2017, Vol. 44 ›› Issue (9): 234-238.doi: 10.11896/j.issn.1002-137X.2017.09.044

Previous Articles     Next Articles

Neighborhood Collaborative Representation Based Classification Method

XU Su-ping, YANG Xi-bei, YU Hua-long and YU Dong-jun   

  • Online:2018-11-13 Published:2018-11-13

Abstract: In the neighborhood rough set model,with the increasing of the size of information granules,the majority vo-ting rule based neighborhood classifier (NC) is easy to misjudge the classes of unknown samples.To remedy this deficiency,based on the idea of collaborative representation based classification (CRC),we proposed a neighborhood colla-borative representation based classification method,namely,the neighborhood collaborative classifier (NCC).NCC firstly performs feature selection in the classification learning task with neighborhood rough set model,and then finds the neighborhood space of unknown sample under selected features.Finally,instead of the majority voting rule in the neighborhood space,NCC judges the class of unknown sample with the collaborative representation,which considers the class with the minimal reconstruction error for unknown sample as the predicted category.Experimental results on 4 UCI data sets show that compared with NC,the proposed NCC achieves satisfactory performance in larger information granules and compared with CRC,and the proposed NCC greatly reduces the size of the dictionary while maintaining good classification accuracy,and improves the efficiency of classification.

Key words: Classification,Collaborative representation,Feature selection,Neighborhood,Rough set

[1] PAWLAK Z.Rough sets:Theoretical aspects of reasoning about data [M].Kluwer Academic Publishers,1991.
[2] PAWLAK Z,SKOWRON A.Rudiments of rough sets [J].Information Sciences,2007,177(1):3-27.
[3] KANEIWA K,KUDO Y.A sequential pattern mining algorithm using rough set theory[J].International Journal of Approximate Reasoning,2011,52(6):881-893.
[4] MARTINEZ I G,PEREZ R E B.Making decision in case-based systems using probabilities and rough sets[J].Knowledge-Based Systems,2003,16(4):205-213.
[5] YANG X B,YAN X,XU S P,et al.New heuristic attribute reduction algorithm based on sample selection[J].Computer Scien-ce,2016,43(1):40-43.(in Chinese) 杨习贝,颜旭,徐苏平,等.基于样本选择的启发式属性约简方法研究[J].计算机科学,2016,43(1):40-43.
[6] YANG X B,QI Y S,SONG X N,et al.Test cost sensitive multigranulation rough set:Model and minimal cost selection [J].Information Sciences,2013,250(11):184-199.
[7] HU Q H,PEDRYCZ W,YU D R,et al.Selecting discrete and continuous features based on neighborhood decision error minimization [J].IEEE Transactions on Systems Man & Cyberneti-cs-Part B,2010,40(1):137-150.
[8] HU Q H,YU D R,XIE Z X.Neighborhood classifiers [J].Expert Systems with Applications,2008,34(2):866-876.
[9] HU Q H,YU D R,XIE Z X.Numerical attribute reductionbased on neighborhood granulation and rough approximation[J].Journal of Software,2008,19(3):640-649.(in Chinese) 胡清华,于达仁,谢宗霞.基于邻域粒化和粗糙逼近的数值属性约简[J].软件学报,2008,19(3):640-649.
[10] WRIGHT J,YANGA Y,GANESH A,et al.Robust face recognition via adaptive sparse representation [J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2009,31(2):210-227.
[11] ZHANG L,YANG M,FENG X C.Sparse representation or collaborative representation:Which helps face recognition? [C]∥Proceedings of the 2011 International Conference on Computer Vision.IEEE Computer Society,2011:471-478.
[12] WILSON D R,MARTINEZ T R.Improved heterogeneous distance functions [J].Journal of Artificial Intelligence Research,1997,6(5):1-34.
[13] XU S P,YANG X B,SONG X N,et al.Prediction of proteinstructural classes by decreasing nearest neighbor error rate [C]∥Proceedings of the 2015 International Conference on Machine Learning and Cybernetics.IEEE Computer Society,2015:7-13.
[14] XU S P,YANG X B,YU H L,et al.Multi-label learning with label-specific feature reduction[J].Knowledge-Based Systems,2016,104:52-61.

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .