Select Representative Samples for Regularized Multiple-Criteria Linear Programming Classification

  • Authors:
  • Peng Zhang;Yingjie Tian;Xingsen Li;Zhiwang Zhang;Yong Shi

  • Affiliations:
  • Research Center on Fictitious Economy & Data Science, Chinese Academy of Sciences, Beijing, China 100080;Research Center on Fictitious Economy & Data Science, Chinese Academy of Sciences, Beijing, China 100080;Research Center on Fictitious Economy & Data Science, Chinese Academy of Sciences, Beijing, China 100080;Research Center on Fictitious Economy & Data Science, Chinese Academy of Sciences, Beijing, China 100080;Research Center on Fictitious Economy & Data Science, Chinese Academy of Sciences, Beijing, China 100080 and College of Information Science & Technology, University of Nebraska at Omaha, Omaha, US ...

  • Venue:
  • ICCS '08 Proceedings of the 8th international conference on Computational Science, Part II
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Regularized multiple-criteria linear programming (RMCLP) model is a new powerful method for classification in data mining. Taking account of every training instance, RMCLP is sensitive to the outliers. In this paper, we propose a sample selection method to seek the representative points for RMCLP model, just as finding the support vectors to support vector machine (SVM). This sample selection method also can exclude the outliers in training set and reduce the quantity of training samples, which can significantly save costs in business world because labeling training samples is usually expensive and sometimes impossible. Experimental results show our method not only reduces the quality of training instances, but also improves the performance of RMCLP.