206597617
Binary Tree Support Vector Machine Based on Kernel Fisher Discriminant for Multi-classification
In order to improve the accuracy of the conventional algorithms for multi-classifications, we propose a binary tree support vector machine based on Kernel Fisher Discriminant in this paper. To examine the training accuracy and the generalization performance of the proposed algorithm, One-against-All, One-against-One and the proposed algorithms are applied to five UCI data sets. The experimental results show that in general, the training and the testing accuracy of the proposed algorithm is the best one, and there exist no unclassifiable regions in the proposed algorithm.
1930626
Multi-agent System for Custom Relationship Management with SVMs Tool
Distributed data mining in the CRM is to learn available knowledge from the customer relationship so as to instruct the strategic behavior. In order to resolve the CRM in distributed data mining, this paper proposes the architecture of distributed data mining for CRM, and then utilizes the support vector machine tool to separate the customs into several classes and manage them. In the end, the practical experiments about one Chinese company are conducted to show the good performance of the proposed approach.
8341217
Multi-Space-Mapped SVMs for Multi-class Classification
In SVMs-based multiple classification, it is not always possible to find an appropriate kernel function to map all the classes from different distribution functions into a feature space where they are linearly separable from each other. This is even worse if the number of classes is very large. As a result, the classification accuracy is not as good as expected. In order to improve the performance of SVMs-based multi-classifiers, this paper proposes a method, named multi-space-mapped SVMs, to map the classes into different feature spaces and then classify them. The proposed method reduces the requirements for the kernel function. Substantial experiments have been conducted on one-against-all, one-against-one, FSVM, DDAG algorithms and our algorithm using six UCI data sets. The statistical results show that the proposed method has a higher probability of finding appropriate kernel functions than traditional methods and outperforms others.
18666865
Multi-sphere Support Vector Data Description for Outliers Detection on Multi-distribution Data
SVDD has been proved a powerful tool for outlier detection. However, in detecting outliers on multi-distribution data, namely there are distinctive distributions in the data, it is very challenging for SVDD to generate a hyper-sphere for distinguishing outliers from normal data. Even if such a hyper-sphere can be identified, its performance is usually not good enough. This paper proposes an multi-sphere SVDD approach, named MS-SVDD, for outlier detection on multi-distribution data. First, an adaptive sphere detection method is proposed to detect data distributions in the dataset. The data is partitioned in terms of the identified data distributions, and the corresponding SVDD classifiers are constructed separately. Substantial experiments on both artificial and real-world datasets have demonstrated that the proposed approach outperforms original SVDD.
207412473
A Chinese question classification using one-vs-one method as a learning tool
Question classification plays an important role in the question answering system and the errors of question classification will probably result in the failure of question answering. Thus, how to enhance the accuracy is an open question. In order to enhance the accuracies of the Chinese question classification, this paper extends one-against-one method based on SVMs to resolve the problems. The results show the good performance of the algorithm for Chinese question classification problems.
44873280
Twi-Map Support Vector Machine for Multi-classification Problems
In this paper, a novel method called Twi-Map Support Vector Machines (TMSVM) for multi-classification problems is presented. Our ideas are as follows: Firstly, the training data set is mapped into a high-dimensional feature space. Secondly, we calculate the distances between the training data points and hyperplanes. Thirdly, we view the new vector consisting of the distances as new training data point. Finally, we map the new training data points into another high-dimensional feature space with the same kernel function and construct the optimal hyperplanes. In order to examine the training accuracy and the generalization performance of the proposed algorithm, One-against-One algorithm, Fuzzy Least Square Support Vector Machine (FLS-SVM) and the proposed algorithm are applied to five UCI data sets. Comparison results obtained by using three algorithms are given. The results show that the training accuracy and the testing one of the proposed algorithm are higher than those of One-against-One and FLS-SVM.
44358158
Proceedings of the Seventh SIAM International Conference on Data Mining, April 26-28, 2007, Minneapolis, Minnesota, USA
17455976
Support Vector Machines for Text Categorization in Chinese Question Classification
Question classification plays a crucial important role in the question answering system because categorizing a given question is beneficial to identify an answer in the documents. The goal of question classification is to accurately assign labels to question based on expected answer type. Recently, many machine learning algorithms are used for question classification. However many research results show that SVM perform best in this task, because it is well known to work well for nonlinear, sparse, high dimensional problems. In this experiment, we perform the One-against-One SVM algorithm and a feature extraction method of Chinese questions to get high classification accuracy
12104280
Classification using support vector machines with graded resolution
A method which we call support vector machine with graded resolution (SVM-GR) is proposed in this paper. During the training of the SVM-GR, we first form data granules to train the SVM-GR and remove those data granules that are not support vectors. We then use the remaining training samples to train the SVM-GR. Compared with the traditional SVM, our SVM-GR algorithm requires fewer training samples and support vectors, hence the computational time and memory requirements for the SVM-GR are much smaller than those of a conventional SVM that use the entire dataset. Experiments on benchmark data sets show that the generalization performance of the SVM-GR is comparable to the traditional SVM.
13947604
Towards the SocioScope: an information system for the study of social dynamics through digital traces
Over the past decade there has been an explosion in the deployment of pervasive systems like cell phone networks and content aggregators on the Internet that produce massive amounts of data as by-products of their interaction with users. This data is related to the actions and opinions of people and thereby to the overall dynamics of cities, how they function and evolve over time.
 Here we propose the implementation of a new information system, the SocioScope, that streamlines the operations of data gathering and data storage and that supports the diverse needs of the research community, local authorities, enterprises, and citizens. Our SocioScope allows for the collection, integration, and study of different types of spatiotemporal data.
 We present two use cases and an analysis of the requirements for the system. We introduce the multi-tier architecture that supports data gathering, storage, integration, analysis, and visualization. We describe the technical implementation of each module of the system and of the security mechanism for data access control. We conclude with a discussion on the opportunities and challenges of the study of digital traces and with an brief illustration of future directions of work.
5925833
Mixed Monte Carlo Parallel Algorithms for Matrix Computation
In this paper we consider mixed (fast stochastic approximation and deterministic refinement) algorithms for Matrix Inversion (MI) and Solving Systems of Linear Equations (SLAE). Monte Carlo methods are used for the stochastic approximation, since it is known that they are very efficient in finding a quick rough approximation of the element or a row of the inverse matrix or finding a component of the solution vector. In this paper we show how the stochastic approximation of the MI can be combined with a deterministic refinement procedure to obtain MI with the required precision and further solve the SLAE using MI. We employ a splitting A = D - C of a given non-singular matrix A, where D is a diagonal dominant matrix and matrix C is a diagonal matrix. In our algorithm for solving SLAE and MI different choices of D can be considered in order to control the norm of matrix T = D-1C; of the resulting SLAE and to minimize the number of the Markov Chains required to reach given precision. Experimental results with dense and sparse matrices are presented.