Ethnologue: Languages of the World

Multivariate LSTM-FCNs for time series classification.

Dataset augmentation, the practice of applying a wide array of domain-specific transformations to synthetically expand a training set, is a standard tool in supervised learning. While effective in tasks such as visual recognition, the set of transformations must be carefully designed, implemented, and tested for every new domain, limiting its re-use and generality. In this paper, we adopt a simpler, domain-agnostic approach to dataset augmentation. We start with existing data points and apply simple transformations such as adding noise, interpolating, or extrapolating between them. Our main insight is to perform the transformation not in input space, but in a learned feature space. A re-kindling of interest in unsupervised representation learning makes this technique timely and more effective. It is a simple proposal, but to-date one that has not been tested empirically. Working in the space of context vectors generated by sequence-to-sequence models, we demonstrate a technique that is effective for both static and sequential data.

Dataset Augmentation in Feature Space

In the last two decades, improvements in materials, sensors and machine learning technologies have led to a rapid extension of electronic nose (EN) related research topics with diverse applications. The food and beverage industry, agriculture and forestry, medicine and health-care, indoor and outdoor monitoring, military and civilian security systems are the leading fields which take great advantage from the rapidity, stability, portability and compactness of ENs. Although the EN technology provides numerous benefits, further enhancements in both hardware and software components are necessary for utilizing ENs in practice. This paper provides an extensive survey of the EN technology and its wide range of application fields, through a comprehensive analysis of algorithms proposed in the literature, while exploiting related domains with possible future suggestions for this research topic.

/pdf/electronic-nose-and-its-applications-a-survey-4p7onvdewl.pdf

Electronic Nose and Its Applications: A Survey

Multivariate time series (MTS) classification has gained importance with the increase in the number of temporal datasets in different domains (such as medicine, finance, multimedia, etc.). Similarity-based approaches, such as nearest-neighbor classifiers, are often used for univariate time series, but MTS are characterized not only by individual attributes, but also by their relationships. Here we provide a classifier based on a new symbolic representation for MTS (denoted as SMTS) with several important elements. SMTS considers all attributes of MTS simultaneously, rather than separately, to extract information contained in the relationships. Symbols are learned from a supervised algorithm that does not require pre-defined intervals, nor features. An elementary representation is used that consists of the time index, and the values (and first differences for numerical attributes) of the individual time series as columns. That is, there is essentially no feature extraction (aside from first differences) and the local series values are fused to time position through the time index. The initial representation of raw data is quite simple conceptually and operationally. Still, a tree-based ensemble can detect interactions in the space of the time index and time values and this is exploited to generate a high-dimensional codebook from the terminal nodes of the trees. Because the time index is included as an attribute, each MTS is learned to be segmented by time, or by the value of one of its attributes. The codebook is processed with a second ensemble where now implicit feature selection is exploited to handle the high-dimensional input. The constituent properties produce a distinctly different algorithm. Moreover, MTS with nominal and missing values are handled efficiently with tree learners. Experiments demonstrate the effectiveness of the proposed approach in terms of accuracy and computation times in a large collection multivariate (and univariate) datasets.

Learning a symbolic representation for multivariate time series classification

Support vector machines (SVMs) are a popular class of supervised learning algorithms, and are particularly applicable to large and high-dimensional classification problems. Like most machine learning methods for data classification and information retrieval, they require manually labeled data samples in the training stage. However, manual labeling is a time consuming and errorprone task. One possible solution to this issue is to exploit the large number of unlabeled samples that are easily accessible via the internet. This paper presents a novel active learning method for text categorization. The main objective of active learning is to reduce the labeling effort, without compromising the accuracy of classification, by intelligently selecting which samples should be labeled. The proposed method selects a batch of informative samples using the posterior probabilities provided by a set of multi-class SVM classifiers, and these samples are then manually labeled by an expert. Experimental results indicate that the proposed active learning method significantly reduces the labeling effort, while simultaneously enhancing the classification accuracy.

A novel active learning method using SVM for text classification

This paper introduces a fast learning method for a graphical probabilistic model for discrete speech recognition based on spoken Arabic digit recognition by means of a new proposed spanning tree structure that takes advantage of the temporal nature of speech signal. The experimental results obtained on a spoken Arabic digit dataset confirmed that for the same rate of recognition the proposed method, in terms of time computation is much faster than the state of art algorithm that use the maximum weight spanning tree (MWST).

Improved tree model for arabic speech recognition

This paper describes new methods for handwritten Arabic character recognition. We propose a novel algorithm for smoothing image and segmentation of the Arabic character using width writing estimated from skeleton character. The moments and Fourier descriptor of profile projection and centroid distance are used as features of each character these feature are invariant in translation , rotation and scale we apply Principal component Analysis (PCA) as data processing algorithm to features vector in order to reduce dimension. The classifier proposed in this work is based on Support Vector Machines (SVM) wich considerd an recent optimal classifier up to now. The results show that these methods are very powerful for isolated handwritten Arabic character.

Handwritten Arabic character recognition based on SVM Classifier

Mel Frequency Cepstral Coefficients (MFCCs) are the most popularly used speech features in many speech and speaker recognition applications. In this paper, we study the effect of the second-order derivatives of MFCC on the recognition of the Spoken Arabic digits. The system was developed using the Hidden Markov Models (HMMs) and Tree distribution approximation model. Experimentally it has been shown that, the second-order derivatives of MFCC parameters compared to the MFCC yield improved rates of 4.60% for CHMM. We were able to reach an overall recognition accuracy of 98.41%, which is satisfactory compared to previous work on spoken Arabic digits speech recognition.

The second-order derivatives of MFCC for improving spoken Arabic digits recognition using Tree distributions approximation model and HMMs

Automatic reading of numeric chains has been attempted in several application areas such as bank cheque processing, postal code recognition and form processing. Such applications have been very popular in handwriting recognition research, due to the possibility to reduce considerably the manual effort involved in these tasks. In this study we propose an off line system for the recognition of the handwritten numeric chains. Firstly, study was based mainly on the evaluation of neural network performances, trained with the gradient back propagation algorithm. Used parameters to form the input vector of the neural network are extracted on the binary images of the digits by several methods: distribution sequence, Barr features and centred moments of different projections and profiles. Secondly, study was extented for the reading of the handwritten numeric chains constituted of a variable number of digits. Vertical projection was used to segment the numeric chain at isolated digits and every digit (or segment) was presented separately to the entry of the system achieved in the first part (recognition system of the isolated handwritten digits). The performances of the proposed system for the used database attain a recognition rate equal to 91.3%.

Mouldi Bedda

Papers

A novel active learning method using SVM for text classification

Improved tree model for arabic speech recognition

Handwritten Arabic character recognition based on SVM Classifier

The second-order derivatives of MFCC for improving spoken Arabic digits recognition using Tree distributions approximation model and HMMs

Segmentation and Recognition of Handwritten Numeric Chains