A Multi-criteria Convex Quadratic Programming model for credit data analysis

Speed and scalability are two essential issues in data mining and knowledge discovery. This paper proposed a mathematical programming model that addresses these two issues and applied the model to Credit Classification Problems. The proposed Multi-criteria Convex Quadric Programming (MCQP) model is...

Full description

Saved in:
Bibliographic Details
Published inDecision Support Systems Vol. 44; no. 4; pp. 1016 - 1030
Main Authors Peng, Yi, Kou, Gang, Shi, Yong, Chen, Zhengxin
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.03.2008
Elsevier Science
Elsevier Sequoia S.A
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Speed and scalability are two essential issues in data mining and knowledge discovery. This paper proposed a mathematical programming model that addresses these two issues and applied the model to Credit Classification Problems. The proposed Multi-criteria Convex Quadric Programming (MCQP) model is highly efficient (computing time complexity O( n 1.5–2)) and scalable to massive problems (size of O(10 9)) because it only needs to solve linear equations to find the global optimal solution. Kernel functions were introduced to the model to solve nonlinear problems. In addition, the theoretical relationship between the proposed MCQP model and SVM was discussed.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-9236
1873-5797
DOI:10.1016/j.dss.2007.12.001