Abstract and Applied Analysis

A New Method for Solving Supervised Data Classification Problems

Parvaneh Shabanzadeh and Rubiyah Yusof

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


Supervised data classification is one of the techniques used to extract nontrivial information from data. Classification is a widely used technique in various fields, including data mining, industry, medicine, science, and law. This paper considers a new algorithm for supervised data classification problems associated with the cluster analysis. The mathematical formulations for this algorithm are based on nonsmooth, nonconvex optimization. A new algorithm for solving this optimization problem is utilized. The new algorithm uses a derivative-free technique, with robustness and efficiency. To improve classification performance and efficiency in generating classification model, a new feature selection algorithm based on techniques of convex programming is suggested. Proposed methods are tested on real-world datasets. Results of numerical experiments have been presented which demonstrate the effectiveness of the proposed algorithms.

Article information

Abstr. Appl. Anal., Volume 2014 (2014), Article ID 318478, 9 pages.

First available in Project Euclid: 27 February 2015

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Shabanzadeh, Parvaneh; Yusof, Rubiyah. A New Method for Solving Supervised Data Classification Problems. Abstr. Appl. Anal. 2014 (2014), Article ID 318478, 9 pages. doi:10.1155/2014/318478. https://projecteuclid.org/euclid.aaa/1425049889

Export citation