Algorithms of Dynkin diagrams in Lie group machine learning

This paper uses the geometric method to describe Lie group Machine Learning （LML） based on the theoretical framework of LML, which gives the geometric algorithms of Dynkin diagrams in LML. It includes the basic conceptions of Dynkin diagrams in LML, the classification theorems of Dynkin diagrams in LML, the classification algorithm of Dynkin diagrams in LML and the verification of the classification algorithm with experimental results.     

ECG quality assessment based on a kernel support vector machine and genetic algorithm with a feature matrix

We propose a systematic ECG quality classification method based on a kernel support vector machine（KSVM） and genetic algorithm（GA） to determine whether ECGs collected via mobile phone are acceptable or not. This method includes mainly three modules, i.e., lead-fall detection, feature extraction, and intelligent classification. First, lead-fall detection is executed to make the initial classification. Then the power spectrum, baseline drifts, amplitude difference, and other time-domain features for ECGs are analyzed and quantified to form the feature matrix. Finally, the feature matrix is assessed using KSVM and GA to determine the ECG quality classification results. A Gaussian radial basis function（GRBF） is employed as the kernel function of KSVM and its performance is compared with that of the Mexican hat wavelet function（MHWF）. GA is used to determine the optimal parameters of the KSVM classifier and its performance is compared with that of the grid search（GS） method. The performance of the proposed method was tested on a database from PhysioNet/Computing in Cardiology Challenge 2011, which includes 1500 12-lead ECG recordings. True positive（TP）, false positive（FP）, and classification accuracy were used as the assessment indices. For training database set A（1000 recordings）, the optimal results were obtained using the combination of lead-fall, GA, and GRBF methods, and the corresponding results were： TP 92.89%, FP 5.68%, and classification accuracy 94.00%. For test database set B（500 recordings）, the optimal results were also obtained using the combination of lead-fall, GA, and GRBF methods, and the classification accuracy was 91.80%.     

A deep learning approach to the classification of 3D CAD models简

Model classification is essential to the management and reuse of 3D CAD models. Manual model classification is laborious and error prone. At the same time, the automatic classification methods are scarce due to the intrinsic complexity of 3D CAD models. In this paper, we propose an automatic 3D CAD model classification approach based on deep neural networks. According to prior knowledge of the CAD domain, features are selected and extracted from 3D CAD models first, and then pre-processed as high dimensional input vectors for category recognition. By analogy with the thinking process of engineers, a deep neural network classifier for 3D CAD models is constructed with the aid of deep learning techniques. To obtain an optimal solution, multiple strategies are appropriately chosen and applied in the training phase, which makes our classifier achieve better per-formance. We demonstrate the efficiency and effectiveness of our approach through experiments on 3D CAD model datasets.     

Fault Diagnosis Based on MultiKernel Classification and Information Fusion Decision

In machine learning and statistics, classification is the a new observation belongs, on the basis of a training set of data problem of identifying to which of a set of categories （sub-populations） containing observations （or instances） whose category membership is known. SVM （support vector machines） are supervised learning models with associated learning algorithms that analyze data and recognize patterns, used for classification and regression analysis. The basic SVM takes a set of input data and predicts, for each given input, which of two possible classes fon~as the output, making it a non-probabilistic binary linear classifier. In pattern recognition problem, the selection of the features used for characterization an object to be classified is importance. Kernel methods are algorithms that, by replacing the inner product with an appropriate positive definite function, impticitly perform a nonlinear mapping 4~ of the input data in Rainto a high-dimensional feature space H. Cover＇s theorem states that if the transformation is nonlinear and the dimensionality of the feature space is high enough, then the input space may be transformed into a new feature space where the patterns are linearly separable with high probability.     

Data classification from the inverse nth power gravitation

By the inverse nth power gravitation in physics,a novel classifier for data classification,called the I-n-PG classifier,is introduced.In the I-n-PG model,training samples from each class are regarded as a system of particles and an I-n-PG field is defined for each class.A test sample belongs to the class whose particle system has the maximum I-n-PG to this test sample.Experiments on large numbers of real data show that the I-n-PG classifier can provide a good classification performance.Compared with the nearest neighbor classifier and SVM,performances of the I-n-PG classifier are always superior/close to the better one of them,and thus the I-n-PG classifier has also a wide range of adaptability to data sets.     

A Multiscale Approach to Automatic Medical Image Segmentation Using Self-Organizing Map

In this paper,a new medical image classification scheme is proposed using selforganizing map(SOM)combined with multiscale technique.It addresses the problem of the handling of edge pixels in the traditional multiscale SOM classifiers.First,to solve the difficulty in manual selection of edge pixels,a multiscale edge detection algorithm based on wavelet transform is proposed.Edge pixels detected are then selected into the training set as a new class and a multiscale SOM classifier is trained using this training set.In this new scheme,the SOM classifier can perform both the classification on the entire image and the edge detection simultaneously.On the other hand,the misclassification of the traditional multiscale SOM classifier in regions near edges is graeatly reduced and the correct classification is improved at the same time.     

Optimizing widths with PSO for center selection of Gaussian radial basis function networks

The radial basis function （RBF） centers play different roles in determining the classification capa- bility of a Gaussian radial basis function neural network （GRBFNN） and should hold different width values. However, it is very hard and time-consuming to optimize the centers and widths at the same time. In this paper, we introduce a new insight into this problem. We explore the impact of the definition of widths on the selection of the centers, propose an optimization algorithm of the RBF widths in order to select proper centers from the center candidate pool, and improve the classification performance of the GRBFNN. The design of the objective function of the optimization algorithm is based on the local mapping capability of each Gaussian RBF. Further, in the design of the objective function, we also handle the imbalanced problem which may occur even when different local regions have the same number of examples. Finally, the recursive orthogonal least square （ROLS） and genetic algorithm （GA）, which are usually adopted to optimize the RBF centers, are separately used to select the centers from the center candidates with the initialized widths, in order to testify the validity of our proposed width initialization strategy on the selection of centers. Our experimental results show that, compared with the heuristic width setting method, the width optimization strategy makes the selected cen- ters more appropriate, and improves the classification performance of the GRBFNN. Moreover, the GRBFNN constructed by our method can attain better classification performance than the RBF LS-SVM, which is a state-of-the-art classifier.     

Study on fractal features of modulation signals

Based on fractal theory, the note presents a novel method of modulation signals classification that adopts box dimension and information dimension extracted from received signals as features of classification. These features contain the characteristics of magnitude, frequency and phase of signals, and collect discriminatory information among various modulation modes. They are effective features in classification sense, and are insensitive to noises interfering. The theoretical analysis also proves the above conclusion. The classifier design is very simple based on such features. The simulation results show that the performances of signal classification are superior.     

Misleading classification

In this paper,we investigate a new problem–misleading classification in which each test instance is associated with an original class and a misleading class.Its goal for the data owner is to form the training set out of candidate instances such that the data miner will be misled to classify those test instances to their misleading classes rather than original classes.We discuss two cases of misleading classification.For the case where the classification algorithm is unknown to the data owner,a KNN based Ranking Algorithm(KRA)is proposed to rank all candidate instances based on the similarities between candidate instances and test instances.For the case where the classification algorithm is known,we propose a Greedy Ranking Algorithm(GRA)which evaluates each candidate instance by building up a classifier to predict the test set.In addition,we also show how to accelerate GRA in an incremental way when naive Bayes is employed as the classification algorithm.Experiments on 16 UCI data sets indicated that the ranked candidate instances by KRA can achieve promising leaking and misleading rates.When the classification algorithm is known,GRA can dramatically outperform KRA in terms of leaking and misleading rates though more running time is required.     

Double-layer bayesian classifier ensembles based on frequent itemsets

Numerous models have been proposed to reduce the classification error of Na¨ ve Bayes by weakening its attribute independence assumption and some have demonstrated remarkable error performance. Considering that ensemble learning is an effective method of reducing the classification error of the classifier, this paper proposes a double-layer Bayesian classifier ensembles (DLBCE) algorithm based on frequent itemsets. DLBCE constructs a double-layer Bayesian classifier (DLBC) for each frequent itemset the new instance contained and finally ensembles all the classifiers by assigning different weight to different classifier according to the conditional mutual information. The experimental results show that the proposed algorithm outperforms other outstanding algorithms.     

Unordered rule discovery using Ant Colony Optimization

In this article,a novel unordered classification rule list discovery algorithm is presented based on Ant Colony Optimization（ACO）. The proposed classifier is compared empirically with two other ACO-based classification techniques on 26 data sets,selected from miscellaneous domains,based on several performance measures. As opposed to its ancestors,our technique has the flexibility of generating a list of IF-THEN rules with unrestricted order. It makes the generated classification model more comprehensible and easily interpretable.The results indicate that the performance of the proposed method is statistically significantly better as compared with previous versions of AntMiner based on predictive accuracy and comprehensibility of the classification model.     

Multi-Domain Sentiment Classification with Classifier Combination

State-of-the-arts studies on sentiment classification are typically domain-dependent and domain-restricted.In this paper,we aim to reduce domain dependency and improve overall performance simultaneously by proposing an efficient multi-domain sentiment classification algorithm.Our method employs the approach of multiple classifier combination.In this approach,we first train single domain classifiers separately with domain specific data,and then combine the classifiers for the final decision.Our experiments show that this approach performs much better than both single domain classification approach(using the training data individually) and mixed domain classification approach(simply combining all the training data).In particular,classifier combination with weighted sum rule obtains an average error reduction of 27.6%over single domain classification.     

A Semi-Random Multiple Decision-Tree Algorithm for Mining Data Streams

Mining with streaming data is a hot topic in data mining. When performing classification on data streams, traditional classification algorithms based on decision trees, such as ID3 and C4.5, have a relatively poor efficiency in both time and space due to the characteristics of streaming data. There are some advantages in time and space when using random decision trees. An incremental algorithm for mining data streams, SRMTDS （Semi-Random Multiple decision Trees for Data Streams）, based on random decision trees is proposed in this paper. SRMTDS uses the inequality of Hoeffding bounds to choose the minimum number of split-examples, a heuristic method to compute the information gain for obtaining the split thresholds of numerical attributes, and a Naive Bayes classifier to estimate the class labels of tree leaves. Our extensive experimental study shows that SRMTDS has an improved performance in time, space, accuracy and the anti-noise capability in comparison with VFDTc, a state-of-the-art decision-tree algorithm for classifying data streams.     

Network traffic classification based on ensemble learning and co-training

Classification of network traffic is the essential step for many network researches. However,with the rapid evolution of Internet applications the effectiveness of the port-based or payload-based identifi-cation approaches has been greatly diminished in recent years. And many researchers begin to turn their attentions to an alternative machine learning based method. This paper presents a novel machine learning-based classification model,which combines ensemble learning paradigm with co-training tech-niques. Compared to previous approaches,most of which only employed single classifier,multiple clas-sifiers and semi-supervised learning are applied in our method and it mainly helps to overcome three shortcomings:limited flow accuracy rate,weak adaptability and huge demand of labeled training set. In this paper,statistical characteristics of IP flows are extracted from the packet level traces to establish the feature set,then the classification model is created and tested and the empirical results prove its feasibility and effectiveness.     

Cluster-Based Nearest-Neighbour Classifier and Its Application on the Lightning Classification

The problem addressed in this paper concerns the prototype generation for a cluster-based nearest-neighbour classifier.It considers,to classify a test pattern,the lines that link the patterns of the training set and a set of prototypes. An efficient method based on clustering is here used for finding subgroups of similar patterns with centroid being used as prototype.A learning method is used for iteratively adjusting both position and local-metric of the prototypes.Finally, we show that a simple adaptive distance measure improves the performance of our nearest-neighbour-based classifier.The performance improvement with respect to other nearest-neighbour-based classifiers is validated by testing our method on a lightning classification task using data acquired from the Fast On-orbit Recording of Transient Events (FORTE) satellite, moreover the performance improvement is validated through experiments with several benchmark datasets.The performance of the proposed methods are also validated using the Wilcoxon Signed-Rank test.     

Text Classification Using Sentential Frequent Itemsets

Text classification techniques mostly rely on single term analysis of the document data set, while more concepts, especially the specific ones, are usually conveyed by set of terms. To achieve more accurate text classifier, more informative feature including frequent co-occurring words in the same sentence and their weights are particularly important in such scenarios. In this paper, we propose a novel approach using sentential frequent itemset, a concept comes from association rule mining, for text classification, which views a sentence rather than a document as a transaction, and uses a variable precision rough set based method to evaluate each sentential frequent itemset＇s contribution to the classification. Experiments over the Reuters and newsgroup corpus are carried out, which validate the practicability of the proposed system.     

An Improvement of Herbrand＇s Theorem and Its Application to Model Generation Theorem Proving

This paper presents an improvement of Herbrand＇s theorem. We propose a method for specifying a subuniverse of the Herbrand universe of a clause set S for each argument of predicate symbols and function symbols in S. We prove that a clause set S is unsatisfiable if and only if there is a finite unsatisfiable set of ground instances of clauses of S that are derived by only instantiating each variable, which appears as an argument of predicate symbols or function symbols, in S over its corresponding argument＇s sub-universe of the Herbrand universe of S. Because such sub-universes are usually smaller （sometimes considerably） than the Herbrand universe of S, the number of ground instances may decrease considerably in many cases. We present an algorithm for automatically deriving the sub-universes for arguments in a given clause set, and show the correctness of our improvement. Moreover, we introduce an application of our approach to model generation theorem proving for non-range-restricted problems, show the range-restriction transformation algorithm based on our improvement and provide examples on benchmark problems to demonstrate the power of our approach.     

Robust fault detection in linear systems based on full-order state observers

A parametric approach to robust fault detection in linear systems with unknown disturbances is presented. The residual is generated using full-order state observers （FSO）. Based on an analytical solution to a type of Sylvester matrix equations, the parameterization of the observer gain matrix is given. In terms of the design degrees of freedom provided by the parametric observer design and a group of introduced parameter vectors, a sufficient and necessary condition for fullorder state observer design with disturbance decoupling is then established. By properly constraining the design parameters according to this proposed condition, the effect of the disturbance on the residual signal is also decoupled, and a simple algorithm is developed. The presented approach offers all the degrees of design freedom. Finally, a numerical example illustrates the effect of the proposed approach.     

The location of singular and inflection points for planar cubicB-spline curve

Using vectors between control points(ai=Pi 1-Pi),parameters λ and μ（such that aj 1=λai μai 2)ae used to study the shape classification of planar parametric cubic B-spline curves.The regiosn of λμ space corresponding to different geometric features on the curves are investigated.These results are useful for curve design.     

Using DragPushing to Refine Concept Index for Text Categorization

Concept index （CI） is a very fast and efficient feature extraction （FE） algorithm for text classification. The key approach in CI scheme is to express each document as a function of various concepts （centroids） present in the collection. However,the representative ability of centroids for categorizing corpus is often influenced by so-called model misfit caused by a number of factors in the FE process including feature selection to similarity measure. In order to address this issue, this work employs the ＂DragPushing＂ Strategy to refine the centroids that are used for concept index. We present an extensive experimental evaluation of refined concept index （RCI） on two English collections and one Chinese corpus using state-of-the-art Support Vector Machine （SVM） classifier. The results indicate that in each case, RCI-based SVM yields a much better performance than the normal CI-based SVM but lower computation cost during training and classification phases.