In this paper, we proposed a tunnel morph model for bio-signal waveform in measuring their similarity. Firstly, the formal specifications of bio-signal waveforms are given. And then, a series of model establishing rel...
详细信息
In this paper, we proposed a tunnel morph model for bio-signal waveform in measuring their similarity. Firstly, the formal specifications of bio-signal waveforms are given. And then, a series of model establishing related definitions are presented. These definitions contain waveform segmentation; waveforms distance measurement, and tunnel width computation. Moreover, on the base of the model, a similarity measuring strategy which takes the curve feature of bio-signal into account was presented. In the end, the strategy was compared with other similarity measurement methods by AECG (Ambulatory Electrocardiogram) waveform data. The data are adopted from MIT/BIH arrhythmia database. Experiment results show that the sensitivity and the positive predictivity of the strategy based on tunnel morph model are prior to other strategies.
Support Vector Machine (SVM) is a classification technique of machine learning based on statistical learning theory. A quadratic optimization problem needs to be solved in the algorithm, and with the increase of the s...
详细信息
Support Vector Machine (SVM) is a classification technique of machine learning based on statistical learning theory. A quadratic optimization problem needs to be solved in the algorithm, and with the increase of the samples, the time complexity will also increase. So it is necessary to shrink training sets to reduce the time complexity. A sample selection method for SVM is proposed in this paper. It is inspired from the Hyper surface classification (HSC), which is a universal classification method based on Jordan Curve Theorem, and there is no need for mapping from lower-dimensional space to higher-dimensional space. The experiments show that the algorithm shrinks training sets keeping the accuracy for unseen vectors high.
The Interval Approach (IA) [4] is a method for synthesizing an interval type-2 fuzzy set (IT2 FS) model for a word from data that are collected from a group of subjects. A key assumption made by the IA is: each person...
详细信息
The Interval Approach (IA) [4] is a method for synthesizing an interval type-2 fuzzy set (IT2 FS) model for a word from data that are collected from a group of subjects. A key assumption made by the IA is: each person's data interval is random and uniformly distributed. This means, of course, that the IT2 FS model for the word is random. Consequently, one can question whether or not the IT2 FS model for the word converges in a stochastic sense. This paper focuses on this question. As a part of our study, we have had to modify some steps of the IA, the resulting being an Enhanced IA (EIA). The paper shows by means of some simulations, that the IT2 FS word models that are obtained from the EIA are converging in a mean-square sense. This provides substantial credence for using the EIA to obtain T2 FS word models.
For tree XML, constraints that specify structural relationships among nodes or paths are very natural. In this paper, we introduce the concept of structural integrity constraints for XML (XSICs), which specify path im...
详细信息
For tree XML, constraints that specify structural relationships among nodes or paths are very natural. In this paper, we introduce the concept of structural integrity constraints for XML (XSICs), which specify path implication, path cooccurrence, path mutual-exclusion, element obligatory inclusion and exclusive inclusion, and define the syntax and semantics of XSICs. For reasoning about XSICs, we rewrite all the other constraints into path implication constraints, and develop a sound and complete set of inference rules for path implication constraints. Meanwhile, we propose the concept of path implication closure. By using the path implication closure, we prove the completeness of inference rules, and determine the implication decision about XSICs.
This paper proposes a novel method for facial expression recognition based on neural network ensemble. The facial expression features are extracted firstly through multi-expression eigenspace analysis, and then severa...
详细信息
Granular computing which imitates the manner of human thinking is the foundation of artificial intelligence. This paper discusses some operations of granules including quotient intersection, quotient union, quotient c...
详细信息
ISBN:
(纸本)9781615676583
Granular computing which imitates the manner of human thinking is the foundation of artificial intelligence. This paper discusses some operations of granules including quotient intersection, quotient union, quotient complement and quotient difference. Then defines a knowledge space and presents it by a group of basis. Besides we introduce granule spaces and their main properties.
This paper proposes a novel method for facial expression recognition based on neural network ensemble. The facial expression features are extracted firstly through multi-expression eigenspace analysis, and then severa...
详细信息
This paper proposes a novel method for facial expression recognition based on neural network ensemble. The facial expression features are extracted firstly through multi-expression eigenspace analysis, and then several neural networks are trained each with an eigenspace of different expressions respectively. At last their training results are aggregated as inputs of the ensemble classifier, which will provide not only the final recognition results but also the estimated expression information. Simulation results on JAFEE dataset show that the recognition accuracy of the proposed approach is better than that of the best individual neural network.
In practical issues, categorical data and numerical data usually coexist, and a unified data reduction technique for hybrid data is desirable. In this paper, an information measure is proposed for computing the discer...
详细信息
In practical issues, categorical data and numerical data usually coexist, and a unified data reduction technique for hybrid data is desirable. In this paper, an information measure is proposed for computing the discernibility power of a categorical or numeric attribute. Based on the measure, a uniform definition of significance of attributes with categorical values and numerical values is proposed. Furthermore, an algorithm to obtain an attribute reduct from hybrid data is presented, and one of its accelerated version is also constructed. Experiments show that these two algorithms can get the same reducts, and the classification accuracies of reduced datasets are similar with the ones using Hu's algorithm. However, the accelerated version consumes much less time than the original one and Hu's algorithm do.
This paper presents a novel machine learning model-Kernel Granular Support Vector Machine (KGSVM), which combines traditional support vector machine (SVM) with granular computing theory. By dividing granules and repla...
详细信息
This paper presents a novel machine learning model-Kernel Granular Support Vector Machine (KGSVM), which combines traditional support vector machine (SVM) with granular computing theory. By dividing granules and replacing with them in kernel space, the datasets can be reduced effectively without changing data distribution. And then the generalization performance and training efficiency of SVM can be improved. Simulation results on UCI datasets demonstrate that KGSVM is highly scalable for large datasets and very effective in terms of classification.
Feature selection from incomplete data aims to retain the discriminatory power of original features in rough set theory. Many feature selection algorithms are computationally time-consuming. To overcome this drawback,...
详细信息
Feature selection from incomplete data aims to retain the discriminatory power of original features in rough set theory. Many feature selection algorithms are computationally time-consuming. To overcome this drawback, we introduce a theoretic framework based on rough set theory, called positive approximation, which can be used to accelerate a heuristic process of feature selection from incomplete data. Based on the proposed accelerator, a general feature selection algorithm is designed. Through the use of the accelerator, several representative heuristic feature selection algorithms in rough set theory have been enhanced. Experiments show that these modified algorithms outperform their original counterparts.
暂无评论