Extending twin support vector machine classifier for multi-category classification problems

© 2013 – IOS Press and the authors. All rights reservedTwin support vector machine classifier (TWSVM) was proposed by Jayadeva et al., which was used for binary classification problems. TWSVM not only overcomes the difficulties in handling the problem of exemplar unbalance in binary classification problems, but also it is four times faster in training a classifier than classical support vector machines. This paper proposes one-versus-all twin support vector machine classifiers (OVA-TWSVM) for multi-category classification problems by utilizing the strengths of TWSVM. OVA-TWSVM extends TWSVM to solve k-category classification problems by developing k TWSVM where in the ith TWSVM, we only solve the Quadratic Programming Problems (QPPs) for the ith class, and get the ith nonparallel hyperplane corresponding to the ith class data. OVA-TWSVM uses the well known one-versus-all (OVA) approach to construct a corresponding twin support vector machine classifier. We analyze the efficiency of the OVA-TWSVM theoretically, and perform experiments to test its efficiency on both synthetic data sets and several benchmark data sets from the UCI machine learning repository. Both the theoretical analysis and experimental results demonstrate that OVA-TWSVM can outperform the traditional OVA-SVMs classifier. Further experimental comparisons with other multiclass classifiers demonstrated that comparable performance could be achieved.This work is supported in part by the grant of the Fundamental Research Funds for the Central Universities of GK201102007 in PR China, and is also supported by Natural Science Basis Research Plan in Shaanxi Province of China (Program No.2010JM3004), and is at the same time supported by Chinese Academy of Sciences under the Innovative Group Overseas Partnership Grant as well as Natural Science Foundation of China Major International Joint Research Project (NO.71110107026)

Study on support vector machine as a classifier

SVM [1], [2] is a learning method which learns by considering data points to be in space. We studied different types of Support Vector Machine (SVM). We also observed their classification process. We conducted10-fold testing experiments on LSSVM [7], [8] (Least square Support Vector Machine) and PSVM [9] (Proximal Support Vector Machine) using standard sets of data. Finally we proposed a new algorithm NPSVM (Non-Parallel Support Vector Machine) which is reformulated from NPPC [12], [13] (Non-Parallel Plane Classifier). We have observed that the cost function of NPPC is affected by the additional constraint for Euclidean distance classification. So we implicitly normalized the weight vectors instead of the additional constraint. As a result we could generate a very good cost function. The computational complexity of NPSVM for both linear and non-linear kernel is evaluated. The results of 10-fold test using standard data sets of NPSVM are compared with the LSSVM and PSVM

Study on proximal support vector machine as a classifier

Proximal Support Vector machine based on Least Mean Square Algorithm classi-fiers (LMS-SVM) are tools for classification of binary data. Proximal Support Vector based on Least Mean Square Algorithm classifiers is completely based on the theory of Proximal Support Vector Machine classifiers (PSVM). PSVM classifies binary pat- terns by assigning them to the closest of two parallel planes that are pushed apart as far as possible. The training time for the classifier is found to be faster compared to their previous versions of Support Vector Machines. But due to the presence of slack variable or error vector the classification accuracy of the Proximal Support Vector Machine is less. So we have come with an idea to update the adjustable weight vectors at the training phase such that all the data points fall out-side the region of separation and falls on the correct side of the hyperplane and to enlarge the width of the separable region.To implement this idea, Least Mean Square (LMS) algorithm is used to modify the adjustable weight vectors. Here, the error is represented by the minimum distance of data points from the margin of the region of separation of the data points that falls inside the region of separation or makes a misclassification and distance of data points from the separating hyperplane for the data points that falls on the wrong side of the hyperplane. This error is minimized using a modification of adjustable weight vectors. Therefore, as the number of iterations of the LMS algorithm increases, weight vector performs a random walk (Brownian motion) about the solution of optimal hy-perplane having a maximal margin that minimizes the error. Experimental results show that the proposed method classifies the binary pattern more accurately than classical Proximal Support Vector Machine classifiers

Identifying Lung Cancer Using CT Scan Images Based On Artificial Intelligence

Lung cancer appears to be the common reason behind the death of human beings at some stage on the planet. Early detection of lung cancers can growth the possibility of survival amongst human beings. The preferred 5-years survival rate for lung most cancers sufferers will increase from 16% to 50% if the disease is detected in time. Although computerized tomography (CT) is frequently more efficient than X-ray. However, the problem regarded to merge way to time constraints in detecting this lung cancer concerning the numerous diagnosing strategies used. Hence, a lung cancer detection system that usage of image processing is hired to categorize lung cancer in CT images. In image processing procedures, procedures like image pre-processing, segmentation, and have extraction are mentioned intimately. This paper is pointing to set off the extra precise comes approximately through making use of distinctive improve and department procedures. In this proposal paper, the proposed method is built in some filter and segmentation that pre-process the data and classify the trained data. After the classification and trained WONN-MLB method is used to reduce the time complexity of finding result. Therefore, our research goal is to get the maximum result of lung cancer detection

Supplier selection with support vector regression and twin support vector regression

Tedarikçi seçimi sorunu son zamanlarda literatürde oldukça ilgi görmektedir. Güncel literatür, yapay zeka tekniklerinin geleneksel istatistiksel yöntemlerle karşılaştırıldığında daha iyi bir performans sağladığını göstermektedir. Son zamanlarda, destek vektör makinesi, araştırmacılar tarafından çok daha fazla ilgi görse de, buna dayalı tedarikçi seçimi çalışmalarına pek sık rastlanmamaktadır. Bu çalışmada, tedarikçi kredi endeksini tahmin etmek amacıyla, destek vektör regresyon (DVR) ve ikiz destek vektör regresyon (İDVR) teknikleri kullanılmıştır. Pratikte, tedarikçi verisini içeren örneklemler sayıca oldukça yetersizdir. DVR ve İDVR daha küçük örneklemlerle analiz yapmaya uyarlanabilir. Tedarikçilerin belirlenmesinde DVR ve İDVR yöntemlerinin tahmin kesinlikleri karşılaştırılmıştır. Gerçek örnekler İDVR yönteminin DVR yöntemine kıyasla üstün olduğunu göstermektedir.Suppliers’ selection problem has attracted considerable research interest in recent years. Recent literature show that artificial intelligence techniques achieve better performance than traditional statistical methods. Recently, support vector machine has received much more attention from researchers, while studies on supplier selection based on it are few. In this paper, we applied the support vector regression (SVR) and twin support vector regression (TSVR) techniques to predict the supplier credit index. In practice, the suppliers’ samples are very insufficient. SVR and TSVR are adaptive to deal with small samples. The prediction accuracies for SVR and TSVR methods are compared to choose appropriate suppliers. The actual examples illustrate that TSVR methods are superior to SVR

Destek Vektör Regresyon ve İkiz Destek Vektör Regresyon Yöntemi ile Tedarikçi Seçimi

Suppliers’ selection problem has attracted considerable research interest in recent years. Recent literature show that artificial intelligence techniques achieve better performance than traditional statistical methods. Recently, support vector machine has received much more attention from researchers, while studies on supplier selection based on it are few. In this paper, we applied the support vector regression (SVR) and twin support vector regression (TSVR) techniques to predict the supplier credit index. In practice, the suppliers’ samples are very insufficient. SVR and TSVR are adaptive to deal with small samples. The prediction accuracies for SVR and TSVR methods are compared to choose appropriate suppliers. The actual examples illustrate that TSVR methods are superior to SVR.Tedarikçi seçimi sorunu son zamanlarda literatürde oldukça ilgi görmektedir. Güncel literatür, yapay zeka tekniklerinin geleneksel istatistiksel yöntemlerle karşılaştırıldığında daha iyi bir performans sağladığını göstermektedir. Son zamanlarda, destek vektör makinesi, araştırmacılar tarafından çok daha fazla ilgi görse de, buna dayalı tedarikçi seçimi çalışmalarına pek sık rastlanmamaktadır. Bu çalışmada, tedarikçi kredi endeksini tahmin etmek amacıyla, destek vektör regresyon (DVR) ve ikiz destek vektör regresyon (İDVR) teknikleri kullanılmıştır. Pratikte, tedarikçi verisini içeren örneklemler sayıca oldukça yetersizdir. DVR ve İDVR daha küçük örneklemlerle analiz yapmaya uyarlanabilir. Tedarikçilerin belirlenmesinde DVR ve İDVR yöntemlerinin tahmin kesinlikleri karşılaştırılmıştır. Gerçek örnekler İDVR yönteminin DVR yöntemine kıyasla üstün olduğunu göstermektedir

Destek Vektör Regresyon ve İkiz Destek Vektör Regresyon Yöntemi ile Tedarikçi Seçimi

Suppliers’ selection problem has attracted considerable research interest in recent years. Recent literature show that artificial intelligence techniques achieve better performance than traditional statistical methods. Recently, support vector machine has received much more attention from researchers, while studies on supplier selection based on it are few. In this paper, we applied the support vector regression (SVR) and twin support vector regression (TSVR) techniques to predict the supplier credit index. In practice, the suppliers’ samples are very insufficient. SVR and TSVR are adaptive to deal with small samples. The prediction accuracies for SVR and TSVR methods are compared to choose appropriate suppliers. The actual examples illustrate that TSVR methods are superior to SVR.Tedarikçi seçimi sorunu son zamanlarda literatürde oldukça ilgi görmektedir. Güncel literatür, yapay zeka tekniklerinin geleneksel istatistiksel yöntemlerle karşılaştırıldığında daha iyi bir performans sağladığını göstermektedir. Son zamanlarda, destek vektör makinesi, araştırmacılar tarafından çok daha fazla ilgi görse de, buna dayalı tedarikçi seçimi çalışmalarına pek sık rastlanmamaktadır. Bu çalışmada, tedarikçi kredi endeksini tahmin etmek amacıyla, destek vektör regresyon (DVR) ve ikiz destek vektör regresyon (İDVR) teknikleri kullanılmıştır. Pratikte, tedarikçi verisini içeren örneklemler sayıca oldukça yetersizdir. DVR ve İDVR daha küçük örneklemlerle analiz yapmaya uyarlanabilir. Tedarikçilerin belirlenmesinde DVR ve İDVR yöntemlerinin tahmin kesinlikleri karşılaştırılmıştır. Gerçek örnekler İDVR yönteminin DVR yöntemine kıyasla üstün olduğunu göstermektedir

Aplicação de Métodos Computacionais de Mineração de Dados na Classificação e Seleção de Oncogenes Medidos por Microarray

Introdução: Nas últimas décadas, o câncer ganhou uma dimensão maior, convertendo-se em um evidente problema de saúde pública mundial. A Organização Mundial da Saúde estimou que, no ano 2030, podem-se esperar 27 milhões de casos incidentes de câncer e 17 milhões de mortes por câncer. Frente a esse cenário alarmante, a mineração de dados traz métodos e ferramentas capazes de auxiliar na construção de conhecimentos mais incisivos sobre o câncer. Objetivo: Este trabalho tem por objetivo aplicar cinco métodos tradicionais da mineração de dados à base de dados NCI60, construída com dados oriundos de experimentos de microarray, com níveis de expressão de 1.000 genes agrupados em nove classes de câncer. Método: Foram utilizados neste trabalho os métodos J48, Random Forest, PART , IBK e Naive Bayes, pertencentes ao ambiente Weka, bem tradicionais na mineração de dados. Devido ao baixo número de registros para determinadas classes, utilizou-se, na validação dos resultados obtidos pelos classificadores, o 3-fold cross validation. Resultados: O classificador que obteve a melhor precisão foi o IBK, enquanto os classificadores J48 e PART conseguiram diminuir o conjunto de genes drasticamente, construindo conhecimento de alto nível na forma de árvores ou regras. Conclusão: Os resultados obtidos neste trabalho podem ser utilizados como ferramentas que visam a auxiliar no enfrentamento do câncer, podendo ser utilizadas na classificação de novos casos ou para se conhecer, cada vez mais, as relações gene/gene e gene/câncer