Search

Protein sequence similarity analysis (PSSA) is a significant task in bioinformatics, which can obtain information about unknown sequences such as protein structures and homology relationships. Protein sequence refers to the series of amino acids with rich physical and chemical properties, namely the basic structure of proteins. However, sequence similarity analysis and phylogenetic analysis between different species which have complex amino acid sequences is a challenging problem. In this paper, nine properties of amino acids were considered and the sequence was converted into numerical values by principal component analysis (PCA); with Haar Wavelet Transform, and Higuchi fractal dimension (HFD), a new feature vector is constructed to represent the sequence; Spearman distance was selected to calculate the distance matrix and the phylogenetic tree was constructed. In this paper, two representative protein sequences (9 ND5 (NADH dehydrogenase 5) and 8 ND6 (NADH dehydrogenase 6)) were selected for similarity analysis and phylogenetic analysis, and compared with MEGA software and other existing methods. The extensive results show that our method is outperforming and results consistent with the known facts. [ABSTRACT FROM AUTHOR]

Along with the growth of the Internet comes a competitive environment among Internet service providers. In this regard, quality of service (QoS) and customer's quality of experience (QoE) are introduced as the two main criteria of satisfaction for network users/regulators. In this paper, we evaluate these two criteria for one of the largest Internet service communication networks in Iran. By providing a predictive model, we propose a solution to improve the quality of the communication. Our model predicts the quality of experience from the quality-of-service parameters with an accuracy of roughly 90%. Next, we reverse-engineer the relationship between the quality of experience and quality of service to develop a service level agreement (SLA) contract. The relationship between quality of experience and quality of service is then compiled into a set of if-then rules. By using a decision tree classifier, we were able to set the quality-of-service parameter thresholds for the gold, silver, and bronze SLAs. [ABSTRACT FROM AUTHOR]

Identifying the significant, or dominant, features is important to reveal the cause-and-effect relations in many pattern recognition applications, such as medical diagnosis, gene analysis, cyber security, finance and insurance fraud detection, etc. Samples that are sparsely populated and binary-valued in highly imbalanced datasets pose a challenge to the identification of these features. This paper explores an approach based on the confusion matrix measurement of the feature values with respect to their potential classification outcomes. The approach is able to compute the Discriminative Significances of the features and rank the features unbiasedly with respect to the imbalance ratios of the datasets. Experiment results on real-world and experimental datasets show that the approach made consistent evaluations of the features and identified the most significant ones accordingly on the sparse and binary-valued samples of the class-imbalanced datasets. [ABSTRACT FROM AUTHOR]

This paper proposes a research on cross-media intelligent perception and retrieval analysis technology based on deep learning education in view of the complex learning knowledge environment of artificial intelligence of traditional cross-media retrieval technology, which is unable to obtain retrieval information timely and accurately. Based on the cross-media theory, this paper analyzes the pre-processing of cross-media data, transforms from a single media form such as text, voice, image, and video to a cross-media integration covering network space and physical space, and designs a cross-media intelligent perception platform system. With multi-core method of typical correlation analysis algorithm, this paper develops a new joint learning framework based on the joint feature selection and subspace learning cross-modal retrieval. What's more, the algorithm is tested experimentally. The results show that the retrieval analysis technology is significantly better than the traditional media retrieval technology, which can effectively identify text semantics and visual image classification, and can better maintains the relevance of data content and the consistency of semantic information, which has important reference value for cross-media applications. [ABSTRACT FROM AUTHOR]

Microscopic images of bovine milk somatic cells are used to classify neutrophils, epithelial cells, macrophages and lymphocytes. Using pattern recognition technology, the problem of classification and recognition is solved from different nature, levels and spaces. The proposed RKSGA-SVM algorithm is used to realize somatic cell image recognition. First, color, morphological and texture features of four types of cells are extracted separately, including geometric and moment invariant features. Second, ReliefF algorithm is used to calculate the weights of all features. According to preset cumulative contribution rate, the preliminary feature set is obtained. Third, redundant features are eliminated by Kolmogorov–Smirnov (KS) test, and the high-level optimization is obtained. The selected feature sets have remarkable distinguishing ability. Finally, the weighted optimal feature sets are obtained by weighted coefficient method on the advanced optimal feature sets. The overall accuracy of RKSGA-SVM algorithm is 99.00%, and Kappa coefficient is 0.987. The proposed algorithm has the advantages of balancing classification accuracy, eliminating redundancy and reducing feature dimension. On the premise of ensuring high classification accuracy, the feature set can reduce feature dimension and the amount of data calculation, improve operation efficiency and save storage space. Experiments show that the feature selection method proposed in this paper is feasible and more suitable for extracting feature sets in the process of somatic cell classification. [ABSTRACT FROM AUTHOR]

As an art image, Thangka images have rich themes, various forms of expression, complex picture content and many layers of color representation. This paper mainly constructs a multi-core support vector machine (SVM) based on the information entropy feature-weighted radial basis kernel function. In this paper, the kernel function is optimized, and the feature reduction is performed by using the random forest feature selection algorithm with average accuracy degradation. Finally, the effective classification of the icon image and the mandala image in Thangka is realized. The research results provide support for the follow-up study of Thangka image annotation and retrieval. [ABSTRACT FROM AUTHOR]

In the last years, endowing the machine with emotional and behavioral intelligence has been one of the most challenging issues in the human–computer interaction area. In this context, this paper investigates the detection of simultaneous fear emotion and deception behavior in speech. To do so, a set of 72 pitch-based features has been investigated first to recognize fear and deception separately. Then, different feature selection techniques have been used in order to select the most relevant ones that best discriminate between fear/nonfear and deception/nondeception classes. Next, a decision-level fusion approach based on the belief theory has been proposed to infer whether fear and deception are detected simultaneously. Simulation results carried on databases dealing with fear/nonfear emotions and deception/truth behaviors have shown classification results reaching 83.33% and 72.45% as accuracy rates for fear and deception classifiers, respectively. The proposed fusion approach has revealed a correspondence between fear emotion and deception behavior in speech modality. [ABSTRACT FROM AUTHOR]

Many current multivariate filter feature selection approaches consider redundancy and relevance between features and class vectors simultaneously. However, these multivariate filter algorithms calculate the suitability of features by only the intrinsic characteristics of the data. In this paper, we suggest a new distributed framework to offset the multivariate feature selection problem. We propose the interaction with classifiers in multivariate filter feature selection. Our proposed framework calculates the relevance of each feature to class labels by embedded algorithms. Then, this technique examines redundancy among features through multivariate filter algorithms. In addition, in the proposed framework, we use horizontal distribution of data instead of using all them once. This approach reduces the runtime of the process in datasets with many samples and environments without centralized data. The results of the evaluation show that the proposed framework can improve classification accuracy compared with the methods just based on multivariate filters. In addition, the experimental results demonstrate that our algorithm outperforms compared approaches in precision, recall, and runtime. [ABSTRACT FROM AUTHOR]

This paper presents a novel model for ultrasonic defect identification relying on multi-feature fusion and multi-criteria feature evaluation (MFF-MCFE). Based on feature extraction, feature selection, pattern recognition and data fusion algorithm, this model analyzes ultrasonic echo signal data from single-probe ultrasonic inspection, and based on wavelet packet transform (WPT), empirical mode decomposition (EMD) and discrete wavelet transform (DWT), the main features from the collected ultrasonic echo signals are also extracted. These features are also evaluated by means of Representation Entropy (RE), Fisher's ratio (FR) and Mahalanobis distance (MD), and the results are fused with Dempster–Shafer (D-S) evidence theory and the corresponding feature subsets are formed according to the fusion result. The support vector machine (SVM) is used as the classifier to recognize the defect signal, and the subsequent classification results are integrated by D-S evidence theory, which leads to the final recognition results. On this basis, a series of experiments were carried out to compare the performance of the developed model with that of the models using single feature sets and single feature evaluation criterion. Meanwhile, the principal component analysis (PCA) was also involved in the corresponding comparative analysis. The experimental results showed that this model is suitable for the identification and diagnosis of pipeline defects, and its classification accuracy could be reached up to 96.29% with stronger robustness and stability. [ABSTRACT FROM AUTHOR]

Facial emotion recognition (FER) is an interesting area of research. It has a wide range of applications, but there is still a deficiency of an accurate approach to provide better results. A novel FER system to maximize classification accuracy has been introduced in this paper. The proposed approach constitutes the following phases: pre-processing, feature extraction, feature selection, and classification. Initially, the images are pre-processed using the extended cascaded filter (ECF) and then the geometric and appearance-based features are extracted. An enhanced battle royale optimization (EBRO) for feature selection has been proposed to select the relevant features and to reduce the dimensionality problem. Then, the classification is carried out using a novel bidirectional Elman neural network (Bi-ENN) that offers high classification results. The proposed Bi-ENN-based emotion classification can accurately discriminate the input features. It enabled the model to predict the labels for classification accurately. The proposed model on evaluations attained an accuracy rate of 98.57% on JAFFE and 98.75% on CK+ datasets. [ABSTRACT FROM AUTHOR]

With an increasing number of new summarization systems proposed in recent years, an automatic text evaluation metric that can accurately and reliably rate the performance of summarization systems has been a pressing need. However, current automatic text evaluation metrics can only measure one or certain aspects of the quality between two summary texts and do not agree with human judgments consistently. In this paper, we show that combining multiple well-chosen evaluation metrics and training predictive models using human annotated datasets can lead to more reliable evaluation scores than using any individual automatic metric. Our predictive models trained on a human annotated subset of the CNN/DailyMail corpus demonstrate significant improvements (e.g. approximately 25% along coherence dimension) over selected individual metrics. Furthermore, a concise meta-evaluation on automatic metrics is provided along with an analysis of the performance of 12 predictive models. We also investigate the sensitivity of automatic metrics when mixed together for training these models. We have made the code, the instructions for experiment setup, and the trained models available as a tool for comparing and evaluating text summarization systems. a https://github.com/bzhao2718/ReliableSummEvalReg. [ABSTRACT FROM AUTHOR]

Nowadays, heart diseases are becoming a major problem, with which a significant part of the world population is affected. The field of medicine may significantly benefit from prediction systems using artificial intelligence techniques by making the disease prediction more accurate and faster. This paper aims to improve the predictive performance of cardiac disease diagnosis through the use of the case-based reasoning (CBR) approach, specifically focusing on its two phases: retrieval and reuse. Additionally, we aim to optimize the selection of attributes in cardiac dataset by using the Boruta method. Our approach uses various models including machine learning and deep learning models, in addition to hybrid models in the retrieval phase to accurately predict the presence or absence of a cardiac disease among patients. A robust reuse measure is used to verify the validity of the retrieved solutions and determine the necessity of applying the reuse algorithm. The results showed a significant improvement in predictive precision, with the highest accuracy achieved by the hybrid 1D CNN–SVM model on cardiac datasets. The effectiveness of the suggested approach is discussed by comparing the results with different search methods. [ABSTRACT FROM AUTHOR]

Mastitis is the major cause of loss in dairy farming. Somatic cells are one of most important standards to detect this infection. This paper proposes a novel image processing algorithm to recognize four types of somatic cells in bovine milk automatically. First, cloud model uses to segment cell images. Second, a variety of features are extracted from regions of interest. Finally, most differential features are selected using ReliefF algorithm and performances of two classifiers, Back propagation networks (BPN) and support vector machine (SVM), are compared. The experimental results are obtained using a large set of images from different sources. The results of our proposed method is not only efficient in accuracy and speed, but also robust to illumination in bovine mastitis via optical microscopy. [ABSTRACT FROM AUTHOR]

RGB-D-based object recognition has been enthusiastically investigated in the past few years. RGB and depth images provide useful and complementary information. Fusing RGB and depth features can significantly increase the accuracy of object recognition. However, previous works just simply take the depth image as the fourth channel of the RGB image and concatenate the RGB and depth features, ignoring the different power of RGB and depth information for different objects. In this paper, a new method which contains three different classifiers is proposed to fuse features extracted from RGB image and depth image for RGB-D-based object recognition. Firstly, a RGB classifier and a depth classifier are trained by cross-validation to get the accuracy difference between RGB and depth features for each object. Then a variant RGB-D classifier is trained with different initialization parameters for each class according to the accuracy difference. The variant RGB-D-classifier can result in a more robust classification performance. The proposed method is evaluated on two benchmark RGB-D datasets. Compared with previous methods, ours achieves comparable performance with the state-of-the-art method. [ABSTRACT FROM AUTHOR]

How to timely and precisely identify attack behaviors in network without dealing with a large number of traffic features and historical data, such as training data, is an important research work in the field of network security. In this paper, firstly, the differences between Renyi entropy and Shannon entropy are analyzed and compared. In order to capture network traffic changes exactly, Renyi entropy instead of Shannon entropy is proposed to measure selected traffic features. Then EWMA control chart theory is used to check Renyi entropy time series for detecting and screening anomalies. And three kinds of network attacks are also analyzed and characterized by behavior feature vector for attack identification. Finally a feature similarity-based method is used to identify attacks. The experimental results of real traffic traces show that the proposed method has good capability to detect and identify these attacks with less computation cost. To evaluate attack identification method conveniently, an approach is proposed to generate simulated attack traffics. Compared with Shannon entropy-based method, the experiments on simulation traffics show that Renyi entropy-based method has much higher overall accuracy, average precision and average true positive rate. Further comparison indicates the proposed method has more powerful performance to detect attacks than PCA-based method. [ABSTRACT FROM AUTHOR]

In this paper, we describe feature selection experiments for online handwriting recognition. We investigated a set of 25 online and pseudo-offline features to find out which features are important and which features may be redundant. To analyze the saliency of the features, we applied a sequential forward and a sequential backward search on the feature set. A hidden Markov model and a neural network based recognizer have been used as recognition engines. In our experiments, we obtained interesting results. Using a set of only five features, we achieved a performance similar to that of the reference system that uses all 25 features. The five selected features have a low correlation and have been the top choices during the first iterations of the forward search with both recognizers. Furthermore, for both recognizers, subsets have been identified that outperform the reference system with statistical significance. In order to assess the results more rigorously, we have compared our recognizer with the widely used commercial recognizer from Microsoft. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel ensemble gene selection method to obtain a gene subset. Then we provide a reverse construction method of gene network derived from expression profile data of the gene subset. The uncertainty coefficient based on information entropy are used to define the existence of logical relations among these genes. If the uncertainty coefficient between some genes exceeds predefined thresholds, the gene nodes will be connected by directed edges. Thus, a gene network is generated, which we define as gene logical network. This method is applied to the breast cancer data including control group and experimental group, with comparisons of the 2nd-order logic type distribution, average degree as well as average path length of the networks. It is found that these structures with different networks are quite distinct. By the comparison of the degree difference between control group and experimental group, the key genes are picked up. By defining the dynamics evolution rules of state transition based on the logical regulation among the key genes in the network, the dynamic behaviors for normal breast cells and cells with cancer of different stages are simulated numerically. Some of them are highly related to the development of breast cancer through literature inquiry. The study may provide a useful revelation to the biological mechanism in the formation and development of cancer. [ABSTRACT FROM AUTHOR]

Early and accurate Alzheimer's disease (AD) diagnosis remains a challenge. Recently, increasing efforts have been focused towards utilization of metabolomics data for the discovery of biomarkers for screening and diagnosis of AD. Several machine learning approaches were explored for classifying the blood metabolomics profiles of cognitively healthy and AD patients. Differentiation between AD, mild cognitive impairment (MCI) and cognitively healthy subjects remains difficult. In this paper, we propose a new machine learning approach for the selection of a subset of features that provide an improvement in classification rates between these three levels of cognitive disorders. Our experimental results demonstrate that utilization of these selected metabolic markers improves the performance of several classifiers in comparison to the classification accuracy obtained for the complete metabolomics dataset. The obtained results indicate that our algorithms are effective in discovering a panel of biomarkers of AD and MCI from metabolomics data suggesting the possibility to develop a noninvasive blood diagnostic technique of AD and MCI. [ABSTRACT FROM AUTHOR]

Feature selection is the process of identifying relevant features in the dataset and discarding everything else as irrelevant and redundant. Since feature selection reduces the dimensionality of the data, it enables the learning algorithms to operate more effectively and rapidly. In some cases, classification performance can be improved; in other instances, the obtained classifier is more compact and can be easily interpreted. There is much work done on feature selection methods for creating ensemble of classifiers. Thus, these works examine how feature selection can help ensemble of classifiers to gain diversity. This paper examines a different direction, i.e. whether ensemble methodology can be used for improving feature selection performance. In this paper we present a general framework for creating several feature subsets and then combine them into a single subset. Theoretical and empirical results presented in this paper validate the hypothesis that this approach can help to find a better feature subset. [ABSTRACT FROM AUTHOR]

Sign language recognition (SLR) has got wide applicability. SLR system is considered to be a challenging one. This paper presents empirical analysis of different mathematical models for Pakistan SLR (PSLR). The proposed method is using the parameterization of sign signature. Each sign is represented with a mathematical function and then coefficients of these functions are used as the feature vector. This approach is based on exhaustive experimentation and analysis for getting the best suitable mathematical representation for each sign. This extensive empirical analysis, results in a very small feature vector and hence to a very efficient system. The robust proposed method has got general applicability as it just need a new training set and it can work equally good for any other dataset. Sign set used is quite complex in the sense that intersign similarity distance is very small but even then proposed methodology has given quite promising results. [ABSTRACT FROM AUTHOR]

Intrusion detection is a kind of security mechanism which is used to detect attacks and intrusion behaviors. Due to the low accuracy and the high false positive rate of the existing clonal selection algorithms applied to intrusion detection, in this paper, we proposed a feature selection method for improved clonal algorithm. The improved method detects the intrusion behavior by selecting the best individual overall and clones them. Experimental results show that the feature selection algorithm is better than the traditional feature selection algorithm on the different classifiers, and it is shown that the final detection results are better than traditional clonal algorithm with 99.6% accuracy and 0.1% false positive rate. [ABSTRACT FROM AUTHOR]

High-dimensional data is ubiquitous in scientific research and industrial production fields. It brings a lot of information to people, at the same time, because of its sparse and redundancy, it also brings great challenges to data mining and pattern recognition. Dimensionality reduction can reduce redundancy and noise, reduce the complexity of learning algorithms, and improve the accuracy of classification, it is an important and key step in pattern recognition system. In this paper, we overview the classical techniques for dimensionality reduction and review their properties, and categorize these techniques according to their implementation process. We deduce each algorithm in detail and intuitively show their underlying mathematical principles. Thereby, the focus is to uncover the optimization process for each technique. We compare the characteristics and limitations of each technique and summarize the scope of application, discussing a number of open problems and a perspective of research trend in future. [ABSTRACT FROM AUTHOR]

A vision-based method for detecting the cracks in the concrete sleepers of the railway tracks will be introduced in this paper. The method is able to detect and partially classify the cracks of the concrete sleepers in two successive steps based on the image processing and pattern recognition techniques. The method has been implemented on the acquired image data frames followed by the analysis, experimental, comparison results and evaluation. The presented results are reasonable which indicates the goodness of the introduced method. The preliminary results of this work have been presented in [A. Delforouzi, A. H. Tabatabaei, M. H. Khan and M. Grzegorzek, A vision-based method for automatic crack detection in railway sleepers, in Kurzynski, M., Wozniak, M., Burduk, R. (eds.), Proceedings of the 10th International Conference on Computer Recognition Systems CORES 2017, Polanica Zdroj, Poland. CORES 2017. Advances in Intelligent Systems and Computing, Vol. 578 (Springer, Cham, 2018), pp. 130–139, doi: 10.1007/978-3-319-59162-9_14]. [ABSTRACT FROM AUTHOR]

A Bayesian classifier for sparsity-promoting feature selection is developed in this paper, where a set of nonlinear mappings for the original data is performed as a pre-processing step. The linear classification model with such mappings from the original input space to a nonlinear transformation space can not only construct the nonlinear classification boundary, but also realize the feature selection for the original data. A zero-mean Gaussian prior with Gamma precision and a finite approximation of Beta process prior are used to promote sparsity in the utilization of features and nonlinear mappings in our model, respectively. We derive the Variational Bayesian (VB) inference algorithm for the proposed linear classifier. Experimental results based on the synthetic data set, measured radar data set, high-dimensional gene expression data set, and several benchmark data sets demonstrate the aggressive and robust feature selection capability and comparable classification accuracy of our method comparing with some other existing classifiers. [ABSTRACT FROM AUTHOR]

The crucial problem that has to be solved when designing an effective brain-computer interface (BCI) is: how to reduce the huge space of features extracted from raw electroencephalography (EEG) signals. One of the strategies for feature selection that is often applied by BCI researchers is based on genetic algorithms (GAs). The two types of GAs that are most commonly used in BCI research are the classic algorithm and the Culling algorithm. This paper presents both algorithms and their application for selecting features crucial for the correct classification of EEG signals recorded during imagery movements of the left and right hand. The results returned by both algorithms are compared to those returned by an algorithm with aggressive mutation and an algorithm with melting individuals, both of which have been proposed by the author of this paper. While the aggressive mutation algorithm has been published previously, the melting individuals algorithm is presented here for the first time. [ABSTRACT FROM AUTHOR]

The development of new services by composition of existing ones has gained considerable momentum as a means of integrating heterogeneous applications and realizing business collaborations. More and more Web services with similar function attributes but different QoS are available. The performance of the composed service is determined by the involved Web services. Therefore, QoS properties are crucial for selecting the Web services to take part in the composition, which can identify the best candidate Web services from a set of functionally-equivalent services. Web service composition enables seamless and dynamic integration of business applications on the web. Due to the inherent autonomy and heterogeneity of component Web services, it is difficult to predict the behavior of the overall composite service. Conformance checking identifies failure and conflict of execution of composite Web service that ensures reliable execution. In this paper we use skyline computation to select services for composition efficiently, reducing the number of candidate services to be considered. Then a novel color Petri net model of Web service composition is presented that combines QoS-based optimal service selection and consistence verification. In the model we define aggregation functions, and use a Multiple Attribute Decision Making approach for the utility function to achieve optimal services selection of QoS properties. We also propose a consistence verification approach to identify potential logical inconsistence of the semantic Web service process before the deployment. Proofs are also presented. We evaluate our approach experimentally using both real and synthetically generated datasets. [ABSTRACT FROM AUTHOR]

Handwritten signatures are a common behavioral biometric. They are widely accepted for identification purposes, such as approbating and authenticating legal documents and financial contracts. The main challenge of signature verification is the high dimensionality of the signature features dataset that makes the corroboration procedure computationally costly. In this paper, we reduced the dimension of the input data with almost no loss of information. To this end, wavelet transform and fusion techniques were used to propose a new set of features. In addition, we introduced an effective feature selection technique, which was based on applying a filter box to find the most informative parts of the data and eliminate redundancies. These methods improved operating speeds and reduced memory usage, as shown by our empirical studies using the Signature Verification Competition 2004 (SVC04) database. We obtained a competitive Equal Error Ratio (EER) of 2.5%, with considerably fewer features. These results suggest that the proposed package is comparable with the state-of-the-art methods while using a significantly smaller number of features. [ABSTRACT FROM AUTHOR]

License plate recognition (LPR) is one of the most important elements affecting intelligent transportation systems. A number of LPR techniques have been proposed. Humans are good target recognition systems. In other words, humans easily recognize common objects. In this paper, the researchers present a novel method of recognizing Chinese license plates. The method is based on the Human Vision Attention Mechanism (HVAM) and uses Chinese license plates as the targets. The research consists of three stages. The first stage involved finding and identifying license plates in videos of moving vehicles. The second stage separated each license plate into the seven characters. In the third stage, the character recognizer extracted some salient features of Chinese characters and used a multi-stage classifier to recognize each character on the license plate. In the experiment locating license plates, 1176 images taken from various scenes and conditions were employed. The method failed to identify the license plates in only 27 of the images; resulting in a license plate location rate of success of 97.7%. In the experiment for identifying license characters, 1149 images were used, from which license plates had been successfully located. The method failed to identify the characters in 45 of these images giving a success rate of 96.1%. Combining the above two rates, the overall rate of success for our LPR is 93.9%. [ABSTRACT FROM AUTHOR]

In pattern recognition, irreducible testors have been used for feature selection. A number of exhaustive algorithms that find irreducible testors have been reported in the literature. One of the latest and more efficient algorithms reported is YYC, an incremental algorithm that finds all the irreducible testors from a training matrix. Its efficiency relies on building a smaller number of feature combinations by finding compatible sets from the top of the matrix to the current row. Nevertheless, as the number of sets currently found grows, YYC execution becomes too slow. This work proposes two improvements of YYC algorithm, incorporated in a pre-processing phase; additionally, a parallel version is implemented. The paper presents some experimental results using synthetic and real data. [ABSTRACT FROM AUTHOR]

This paper presents main paradigms of research for feature extraction methods to further augment the state of art in speaker recognition (SR) which has been recognized extensively in person identification for security and protection applications. Speaker recognition system (SRS) has become a widely researched topic for the last many decades. The basic concept of feature extraction methods is derived from the biological model of human auditory/vocal tract system. This work provides a classification-oriented review of feature extraction methods for SR over the last 55 years that are proven to be successful and have become the new stone to further research. Broadly, the review work is dichotomized into feature extraction methods with and without noise compensation techniques. Feature extraction methods without noise compensation techniques are divided into following categories: On the basis of high/low level of feature extraction; type of transform; speech production/auditory system; type of feature extraction technique; time variability; speech processing techniques. Further, feature extraction methods with noise compensation techniques are classified into noise-screened features, feature normalization methods, feature compensation methods. This classification-oriented review would endow the clear vision of readers to choose among different techniques and will be helpful in future research in this field. [ABSTRACT FROM AUTHOR]

Multi-string matching (MSM) is a core technique searching a text string for all occurrences of some string patterns. It is widely used in many applications. However, as the number of string patterns increases, most of the existing algorithms suffer from two issues: the long matching time, and the high memory consumption. To address these issues, in this paper, a fast matching engine is proposed for large-scale string matching problems. Our engine includes a filter module and a verification module. The filter module is based on several bitmaps which are responsible for quickly filtering out the invalid positions in the text, while for each potential matched position, the verification module confirms true pattern occurrence. In particular, we design a compact data structure called Adaptive Matching Tree (AMT) for the verification module, in which each tree node only saves some pattern fragments of the whole pattern set and the inner structure of each tree node is chosen adaptively according to the features of the corresponding pattern fragments. This makes the engine time and space efficient. The experiments indicate that, our matching engine performs better than the compared algorithms, especially for large pattern sets. [ABSTRACT FROM AUTHOR]

Feature selection has attracted a huge amount of interest in both research and application communities of hyperspectral image (HSI) classification. Generally, supervised feature selection methods are superior to unsupervised ones without label information. However, in classification of HSI, the labeled samples are often difficult, expensive or time-consuming to obtain. In this paper, we proposed a novel semi-supervised feature selection method, called Locality and Globality Discriminant Feature (LGDF), for HSI classification. This method combines Fisher's criteria and Graph Laplacian, which makes full use of both labeled and unlabeled data points to discover both manifold and discriminant structure in HSI data. In the proposed method, an optimal subset of features is identified if at this subset neighbor points or points sharing the same label are close to each other, while non-neighbor points or points with different labels are far away from each other. Experimental results on Washington DC Mall and AVIRIS Indian Pines hyperspectral datasets demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Word spotting is the process of retrieving all instances of a queried keyword from a digital library of document images. In this paper we evaluate the performance of different word descriptors to assess the advantages and disadvantages of statistical and structural models in a framework of query-by-example word spotting in historical documents. We compare four word representation models, namely sequence alignment using DTW as a baseline reference, a bag of visual words approach as statistical model, a pseudo-structural model based on a Loci features representation, and a structural approach where words are represented by graphs. The four approaches have been tested with two collections of historical data: the George Washington database and the marriage records from the Barcelona Cathedral. We experimentally demonstrate that statistical representations generally give a better performance, however it cannot be neglected that large descriptors are difficult to be implemented in a retrieval scenario where word spotting requires the indexation of data with million word images. [ABSTRACT FROM AUTHOR]

This paper deals with the problem of feature subset selection in classification-oriented datasets with a (very) large number of attributes. In such datasets complex classical wrapper approaches become intractable due to the high number of wrapper evaluations to be carried out. One way to alleviate this problem is to use the so-called filter-wrapper approach or Incremental Wrapper-based Subset Selection (IWSS), which consists of the construction of a ranking among the predictive attributes by using a filter measure, and then a wrapper approach is used by following the rank. In this way the number of wrapper evaluations is linear on the number of predictive attributes. In this paper we present two contributions to the IWSS approach. The first one is related with obtaining more compact subsets, and enables not only the addition of new attributes but also their interchange with some of those already included in the selected subset. Our second contribution, termed early stopping, sets an adaptive threshold on the number of attributes in the ranking to be considered. The advantages of these new approaches are analyzed both theoretically and experimentally. The results over a set of 12 high-dimensional datasets corroborate the success of our proposals. [ABSTRACT FROM AUTHOR]

For decades, published works on Automatic Signature Verification (ASV) that use threshold-based decision, depended on using one feature set for verification. Some researchers selected this feature set based on their experience, and others selected it using some feature selection algorithms that can select the best feature set (gives the highest performance). In practical systems, the signature data could be noisy, and recognition of the check writer in multi-signatory accounts is required. Due to the error caused by such requirements and data quality, improving the performance becomes a necessity. In this paper, a new technique for ASV decision making use of Multi-Sets of Features (MSF) is introduced. The new technique and its motivation are explained, and a precise evaluation of its efficiency is made. The experimental results have shown that the new technique gives important improvement in forgery detection and in the overall performance. This technique which was developed within an integrated plan of building a commercial offline ASV system to work in the actual USA banks environment was tested during the prototyping period with about 1000 signature samples, and has already been in use for years as a component of a cooperative decision making ASV system that tests over a million check signature every day without any false acceptance (False Acceptance = 0). [ABSTRACT FROM AUTHOR]

The paper describes an integrated recognition-by-parts architecture for reliable and robust face recognition. Reliability and robustness are characteristic of the ability to deploy full-fledged and operational biometric engines, and handling adverse image conditions that include among others uncooperative subjects, occlusion, and temporal variability, respectively. The architecture proposed is model-free and non-parametric. The conceptual framework draws support from discriminative methods using likelihood ratios. At the conceptual level it links forensics and biometrics, while at the implementation level it links the Bayesian framework and statistical learning theory (SLT). Layered categorization starts with face detection using implicit rather than explicit segmentation. It proceeds with face authentication that involves feature selection of local patch instances including dimensionality reduction, exemplar-based clustering of patches into parts, and data fusion for matching using boosting driven by parts that play the role of weak-learners. Face authentication shares the same implementation with face detection. The implementation, driven by transduction, employs proximity and typicality (ranking) realized using strangeness and p-values, respectively. The feasibility and reliability of the proposed architecture are illustrated using FRGC data. The paper concludes with suggestions for augmenting and enhancing the scope and utility of the proposed architecture. [ABSTRACT FROM AUTHOR]

Feature selection is an important task in pattern recognition. Support Vector Machine (SVM) and Minimax Probability Machine (MPM) have been successfully used as the classification framework for feature selection. However, these paradigms cannot automatically control the balance between prediction accuracy and the number of selected features. In addition, the selected feature subsets are also not stable in different data partitions. Minimum Error Minimax Probability Machine (MEMPM) has been proposed for classification recently. In this paper, we outline MEMPM to select the optimal feature subset with good stability and automatic balance between prediction accuracy and the size of feature subset. The experiments against feature selection with SVM and MPM show the advantages of the proposed MEMPM formulation in stability and automatic balance between the feature subset size and the prediction accuracy. [ABSTRACT FROM AUTHOR]

The reported work aims to objectively and accurately assess the post-stroke clinical condition of visuo-spatial neglect using a series of standardized geometric shape drawing tasks. We present a method implementing existing pencil-and-paper diagnostic methods and define a set of static and dynamic features that can be extracted from drawing responses captured online using a graphics tablet. We also present a method for automatically assessing the constructional sequence of the drawing using Hidden Markov Models. The method enables the automated extraction, position identification and drawing order of individual sides of a shape within a drawing. Discrimination between two populations (a neglect population and stroke subjects without neglect as determined by existing standard assessment methods) using a combination of performance features and constructional sequence is examined across three separate drawing tasks. Results from experimentation show how a combination of sequence and performance features is able to generalize across a wide variety of input samples and obtain a diagnostic classification which can be used alongside other forms of conventional assessment. Furthermore, the application of a multi-classifier combination strategy leads to a significant increase in recognition ability. [ABSTRACT FROM AUTHOR]

Learning with incomplete data remains challenging in many real-world applications especially when the data is high-dimensional and dynamic. Many imputation-based algorithms have been proposed to handle with incomplete data, where these algorithms use statistics of the historical information to remedy the missing parts. However, these methods merely use the structural information existing in the data, which are very helpful for sharing between the complete entries and the missing ones. For example, in traffic system, some group information and temporal smoothness exist in the data structure. In this paper, we propose to incorporate these structural information and develop structural feature leaning method for learning with incomplete data (SFLIC). The SFLIC model adopt a fused Lasso based regularizer and a group Lasso style regularizer to enlarge the data sharing along both the temporal smoothness level and the feature group level to fill the gap where the data entries are missing. The proposed SFLIC model is a nonsmooth function according to the model parameters, and we adopt the smoothing proximal gradient (SPG) method to seek for an efficient solution. We evaluate our model on both synthetic and real-world highway traffic datasets. Experimental results show that our method outperforms the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Mining agricultural data with artificial immune system (AIS) algorithms, particularly the clonal selection algorithm (CLONALG) and artificial immune recognition system (AIRS), form the bedrock of this paper. The fuzzy-rough feature selection (FRFS) and vaguely quantified rough set (VQRS) feature selection are coupled with CLONALG and AIRS for improved detection and computational efficiencies. Comparative simulations with sequential minimal optimization and multi-layer perceptron reveal that the CLONALG and AIRS produced significant results. Their respective FRFS and VQRS upgrades namely, FRFS-CLONALG, FRFS-AIRS, VQRS-CLONALG, and VQRS-AIRS, are able to generate the highest detection rates and lowest false alarm rates. Thus, gathering useful information with the AIS models can help to enhance productivity related to agriculture. [ABSTRACT FROM AUTHOR]

In this paper, two novel approaches for unsupervised feature selection are proposed based on the spectral clustering. In the first proposed method, spectral clustering is employed over the features and the center of clusters is selected as well as their nearest-neighbors. These features have a minimum similarity (redundancy) between themselves since they belong to different clusters. Next, samples of data sets are clustered employing spectral clustering so that to the samples of each cluster a specific pseudo-label is assigned. After that according to the obtained pseudo-labels, the information gain of the features is computed that secures the maximum relevancy. Finally, the intersection of the selected features in the two previous steps is determined that simultaneously guarantees both the maximum relevancy and minimum redundancy. Our second proposed approach is very similar to the first one whose only but significant difference with the first method is that it selects one feature from each cluster and sorts all the features in terms of their relevancy. Then, by appending the selected features to a sorted list and ignoring them for the next step, the algorithm continues with the remaining features until all the features to be appended into the sorted list. Both of our proposed methods are compared with state-of-the-art methods and the obtained results confirm the performance of our proposed approaches especially the second one. [ABSTRACT FROM AUTHOR]

A feature selection method based on mutual information and support vector machine (SVM) is proposed in order to eliminate redundant feature and improve classification accuracy. First, local correlation between features and overall correlation is calculated by mutual information. The correlation reflects the information inclusion relationship between features, so the features are evaluated and redundant features are eliminated with analyzing the correlation. Subsequently, the concept of mean impact value (MIV) is defined and the influence degree of input variables on output variables for SVM network based on MIV is calculated. The importance weights of the features described with MIV are sorted by descending order. Finally, the SVM classifier is used to implement feature selection according to the classification accuracy of feature combination which takes MIV order of feature as a reference. The simulation experiments are carried out with three standard data sets of UCI, and the results show that this method can not only effectively reduce the feature dimension and high classification accuracy, but also ensure good robustness. [ABSTRACT FROM AUTHOR]

This paper proposes a method for remote sensing based land cover/land use classification of urban areas. The method consists of the following four main stages: feature extraction, feature coding, feature selection and classification. In the feature extraction stage, statistical, textural and Gabor features are computed within local image windows of different sizes and orientations to provide a wide variety of potential features for the classification. Then the features are encoded and normalized by means of the Self-Organizing Map algorithm. For feature selection a CART (Classification and Regression Trees) based algorithm was developed to select a subset of features for each class within the classification scheme at hand. The selected subset of features is not attached to any specific classifier. Any classifier capable of representing possible skewed and multi-modal feature distributions can be employed, such as multi-layer perceptron (MLP) or k-nearest neighbor (k-NN). The paper reports experiments in land cover/land use classification with the Landsat TM and ERS-1 SAR images gathered over the city of Lisbon to show the potentials of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the notion of incorporating feature computation time (CT) measures during feature selection in a boosted cascade people detector utilizing heterogeneous pool of features. We present various approaches based on pareto-front analysis, CT weighted adaboost, and Binary Integer Programming (BIP) with comparative evaluations. The novel feature selection method proposed based on BIP - the main contribution - mines heterogeneous features taking both detection performance and CT explicitly into consideration. The results demonstrate that the detector using this feature selection scheme exhibits low miss rates (MRs) with significant boost in frame rate. For example, it achieves a less MR at FPPW compared to Dalal and Triggs HOG detector with a x speed improvement. The presented extensive experimental results clearly highlight the improvements the proposed framework brings to the table. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel method for cross-view action recognition via multiple continuous virtual paths which connect the source view and the target view. Each point on one virtual path is a virtual view which is obtained by a linear transformation of an action descriptor. All the virtual views are concatenated into an infinite-dimensional feature to characterize continuous changes from the source to the target view. To utilize these infinite-dimensional features directly, we propose a virtual view kernel (VVK) to compute the similarity between two infinite-dimensional features, which can be readily used to construct any kernelized classifiers. In addition, a constraint term is introduced to fully utilize the information contained in the unlabeled samples which are easier to obtain from the target view. The rationality behind the constraint is that any action video belongs to only one class. To further explore complementary visual information, we utilize multiple continuous virtual paths. The original source and target views are projected to different auxiliary source and target views using the random projection technique. Then we fuse all the VVKs generated from all pairs of auxiliary views. Our method is verified on the IXMAS and MuHAVi datasets, and the experimental results demonstrate that our method achieves better performance than the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

In a learning process, features play a fundamental role. In this paper, we propose a Boosting-based feature selection algorithm called BoostFS. It extends AdaBoost which is designed for classification problems to feature selection. BoostFS maintains a distribution over training samples which is initialized from the uniform distribution. In each iteration, a decision stump is trained under the sample distribution and then the sample distribution is adjusted so that it is orthogonal to the classification results of all the generated stumps. Because a decision stump can also be regarded as one selected feature, BoostFS is capable to select a subset of features that are irrelevant to each other as much as possible. Experimental results on synthetic datasets, five UCI datasets and a real malware detection dataset all show that the features selected by BoostFS help to improve learning algorithms in classification problems, especially when the original feature set contains redundant features. [ABSTRACT FROM AUTHOR]

An improved feature extraction method is proposed aiming at the recognition of motor imagined electroencephalogram (EEG) signals. Using local mean decomposition, the algorithm decomposes the original signal into a series of product function (PF) components, and meaningless PF components are removed from EEG signals in the range of mu rhythm and beta rhythm. According to the principle of feature time selection, 4 s to 6 s motor imagery EEG signals are selected as classification data, and the sum of fuzzy entropies of second-and third-order PF components of C 3 , C 4 lead signals is calculated, respectively. Mean value of fuzzy entropy MFE (C 3 , C 4) is used as input element to construct EEG feature vector, and support vector machine (SVM) is used to classify and predict EEG signals for recognition. The test results show that this feature extraction method has higher classification accuracy than the empirical mode decomposition method and the total empirical mode decomposition method. [ABSTRACT FROM AUTHOR]

The paper presents a novel approach for classification of faults in Extra High Voltage (EHV) transmission line with series compensation. The proposed algorithm utilizes single end currents extracted from three phases of a transmission line given to a fault detection and classification system. A detailed model is constructed to analyze fault patterns occurring on a dual feed system with multiple series compensation provided on EHV transmission line. The algorithm uses a full cycle of post-fault currents. A Multiresolution Analysis Wavelet-based decomposition technique is used to provide a joint time frequency analysis. Extensive study is done by designing different fault classifiers using Support Vector Machine (SVM) with different feature vector groups. The SVMs with different parameters are compared to show performance of SVMs in given feature space of faults. A new algorithm is proposed with Ensemble method having group of different classifiers, namely, Artificial Neural Network (ANN), K-Nearest Neighborhood (KNN) and SVM. A combination of feature selection with Ensemble Classifiers is trained and tested on a wide range of fault patterns. A significant improvement in performance is obtained with different combination of features in Ensemble Classifier using subspace partition method.The proposed Ensemble Classifier provides an accuracy of 99.5%. [ABSTRACT FROM AUTHOR]

As thousands of features are available in many pattern recognition and machine learning applications, feature selection remains an important task to find the most compact representation of the original data. In the literature, although a number of feature selection methods have been developed, most of them focus on optimizing specific objective functions. In this paper, we first propose a general graph-preserving feature selection framework where graphs to be preserved vary in specific definitions, and show that a number of existing filter-type feature selection algorithms can be unified within this framework. Then, based on the proposed framework, a new filter-type feature selection method called sparsity score (SS) is proposed. This method aims to preserve the structure of a pre-defined l1 graph that is proven robust to data noise. Here, the modified sparse representation based on an l1-norm minimization problem is used to determine the graph adjacency structure and corresponding affinity weight matrix simultaneously. Furthermore, a variant of SS called supervised SS (SuSS) is also proposed, where the l1 graph to be preserved is constructed by using only data points from the same class. Experimental results of clustering and classification tasks on a series of benchmark data sets show that the proposed methods can achieve better performance than conventional filter-type feature selection methods. [ABSTRACT FROM AUTHOR]

Typical testors are useful tools for feature selection and for determining feature relevance in supervised classification problems. Nowadays, computing all typical testors of a training matrix is very expensive; all reported algorithms have exponential complexity depending on the number of columns in the matrix. In this paper, we introduce the faster algorithm BR (Boolean Recursive), called fast-BR algorithm, that is based on elimination of gaps and reduction of columns. Fast-BR algorithm is designed to generate all typical testors from a training matrix, requiring a reduced number of operations. Experimental results using this fast implementation and the comparison with other state-of-the-art related algorithms that generate typical testors are presented. [ABSTRACT FROM AUTHOR]