Supervised Data Classification Research Articles

Development of Smart 3D Object Detection using LiDAR Cloud-Data Collection

Smart cities are made up of autonomous vehicle and they communicate and interact with their environment and require high precision computer vision to maintain driver and pedestrian safety. This paper presents a cost-efficient, non-intrusive and easy to use method for collecting data traffic counts using LiDAR technology. The proposed method incorporates a LiDAR sensor, a Convolutional Neural Network (CNN) and a Hybrid SVM into a single traffic counting framework. As the technology is economical and readily accessible, LiDAR is adopted. The distance data obtained are translated into the signals. Due to the difficulty of urban scenes, automatic detection of objects from remotely sensed data within urban areas is difficult. While recent advances in computer vision have shown that CNNs are very suitable for this task, the design and training of CNNs of this kind remained demanding and time consuming, given the challenge of collecting a large and well-annotated dataset and the specificity of every task. Hybrid SVM is a supervised data classification and regression machine learning tool. In the methodology the Hybrid SVM is used in detection and non-detection cases of highly complex distance data points obtained from the sensor. In order to examine the performance of the proposed method, the test is carried out in three different locations in Alexandria, Egypt. The results of tests show that the pro-imposed method achieves acceptable results in vehicle collection, which results in a precision of 85–89%. The exactness of the method proposed is determined by the colour of a vehicle’s external surface.

Optimized Performance and Utilization Analysis of Real-Time Multi Spectral Data/Image Categorization Algorithms for Computer Vision Applications

In the field of computer vision , the process of acquiring, processing, analyzing and understanding multispectral data images is a major requisite. The major tool for digital data analysis and object recognition is data categorization. The basic and main stages involved in data categorization are the identification of an appropriate categorization system, an assortment of training and testing samples and the categorization method. Data categorization (or) classification is to recognize and depict the features of any data that can be later used for knowledge discovery. This work aims to compare supervised data classification techniques. This paper illustrates utilization of various techniques viz., Minimum distance (MD), Maximum likelihood (ML) and Mahalanob is distance (Mad). All the procedures are compared and analyzed for finest results and maximum accuracy.

Quantum speedup of Bayes’ classifiers

Data classification is a fundamental problem in machine learning. We study quantum speedup of the supervised data classification algorithms (quadratic, linear and naïve Bayes classifiers) based on Bayes’ theory. The main technique we use to achieve quantum speedup is block-encoding. However, to apply this technique effectively, we propose a general method to construct the block-encoding. As an application, we show that all the three classifiers achieve exponential speedup at the number of samples over their classical counterparts. As for the dimension of the space, quantum quadratic and linear classifiers achieve varying degrees of polynomial speedup, while quantum naïve Bayes’ classifier achieves an exponential speedup. The only assumption we make is the qRAM to prepare quantum states of the input data.

Clustering based polyhedral conic functions algorithm in classification

In this study, a new algorithm based on polyhedral conic functions (PCFs) is developed to solve multi-class supervised data classification problems. The $k$ PCFs are constructed for each class in order to separate it from the rest of the data set. The $k$-means algorithm is applied to find vertices of PCFs and then a linear programming model is solved to calculate the parameters of each PCF. The separating functions for each class are obtained as a pointwise minimum of the PCFs. A class label is assigned to the test point according to its minimum value over all separating functions. In order to demonstrate the performance of the proposed algorithm, it is applied to solve classification problems in publicly available data sets. The comparative results with some mainstream classifiers are presented.

Network-based supervised data classification by using an heuristic of ease of access

We propose a new supervised classification technique which considers the ease of access of unlabeled instances to training classes through an underlying network. The training data set is used to construct a network, in which instances (nodes) represent the states that a random walker visits, and the network link structure is modified by performing a link weight composition between the unlabeled instance bias and the initial network link weights. Different from traditional classification heuristics, which divide the training data set into subspaces, the proposed scheme uses random walk limiting probabilities to measure the limiting state transitions among training nodes. An unlabeled instance receives the label of the class that is most easily reached by the random walker, that is, the limiting transition to that class is large. Simulation results suggest that the proposed technique is comparable to some well-known classification techniques.

A New Method for Solving Supervised Data Classification Problems

Supervised data classification is one of the techniques used to extract nontrivial information from data. Classification is a widely used technique in various fields, including data mining, industry, medicine, science, and law. This paper considers a new algorithm for supervised data classification problems associated with the cluster analysis. The mathematical formulations for this algorithm are based on nonsmooth, nonconvex optimization. A new algorithm for solving this optimization problem is utilized. The new algorithm uses a derivative-free technique, with robustness and efficiency. To improve classification performance and efficiency in generating classification model, a new feature selection algorithm based on techniques of convex programming is suggested. Proposed methods are tested on real-world datasets. Results of numerical experiments have been presented which demonstrate the effectiveness of the proposed algorithms.

Performance analysis of rough set ensemble of learning classifier systems with differential evolution based rule discovery

Data mining, and specifically supervised data classification, is a key application area for Learning Classifier Systems (LCS). Scaling to larger classification problems, especially to higher dimensional problems, is a key challenge. Ensemble based approaches can be applied to LCS to address scalability issues. To this end a rough set based ensemble of LCS is proposed, which relies on a pre-processed feature partitioning step to train multiple LCS on feature subspaces. Each base classifier in the ensemble is a Michigan style supervised LCS. The traditional genetic algorithm based rule evolution is replaced by a differential evolution based rule discovery, to improve generalisation capabilities of LCS. A voting mechanism is then used to generate output for test instances. This paper describes the proposed ensemble algorithm in detail, and compares its performance with different versions of base LCS on a number of benchmark classification tasks. Analysis of computational time and model accuracy show the relative merits of the ensemble algorithm and base classifiers on the tested data sets. The rough set based ensemble learning approach and differential evolution based rule searching out-perform the base LCS on classification accuracy over the data sets considered. Results also show that small ensemble size is sufficient to obtain good performance.

Network-based high level data classification.

Traditional supervised data classification considers only physical features (e.g., distance or similarity) of the input data. Here, this type of learning is called low level classification. On the other hand, the human (animal) brain performs both low and high orders of learning and it has facility in identifying patterns according to the semantic meaning of the input data. Data classification that considers not only physical attributes but also the pattern formation is, here, referred to as high level classification. In this paper, we propose a hybrid classification technique that combines both types of learning. The low level term can be implemented by any classification technique, while the high level term is realized by the extraction of features of the underlying network constructed from the input data. Thus, the former classifies the test instances by their physical features or class topologies, while the latter measures the compliance of the test instances to the pattern formation of the data. Our study shows that the proposed technique not only can realize classification according to the pattern formation, but also is able to improve the performance of traditional classification techniques. Furthermore, as the class configuration's complexity increases, such as the mixture among different classes, a larger portion of the high level term is required to get correct classification. This feature confirms that the high level classification has a special importance in complex situations of classification. Finally, we show how the proposed technique can be employed in a real-world application, where it is capable of identifying variations and distortions of handwritten digit images. As a result, it supplies an improvement in the overall pattern recognition rate.

An efficient algorithm for the incremental construction of a piecewise linear classifier

In this paper the problem of finding piecewise linear boundaries between sets is considered and is applied for solving supervised data classification problems. An algorithm for the computation of piecewise linear boundaries, consisting of two main steps, is proposed. In the first step sets are approximated by hyperboxes to find so-called “indeterminate” regions between sets. In the second step sets are separated inside these “indeterminate” regions by piecewise linear functions. These functions are computed incrementally starting with a linear function. Results of numerical experiments are reported. These results demonstrate that the new algorithm requires a reasonable training time and it produces consistently good test set accuracy on most data sets comparing with mainstream classifiers.

Classification through incremental max–min separability

Piecewise linear functions can be used to approximate non-linear decision boundaries between pattern classes. Piecewise linear boundaries are known to provide efficient real-time classifiers. However, they require a long training time. Finding piecewise linear boundaries between sets is a difficult optimization problem. Most approaches use heuristics to avoid solving this problem, which may lead to suboptimal piecewise linear boundaries. In this paper, we propose an algorithm for globally training hyperplanes using an incremental approach. Such an approach allows one to find a near global minimizer of the classification error function and to compute as few hyperplanes as needed for separating sets. We apply this algorithm for solving supervised data classification problems and report the results of numerical experiments on real-world data sets. These results demonstrate that the new algorithm requires a reasonable training time and its test set accuracy is consistently good on most data sets compared with mainstream classifiers.

Prediction of daily rainfall state in a river basin using statistical downscaling from GCM output

Conventional statistical downscaling techniques for prediction of multi-site rainfall in a river basin fail to capture the correlation between multiple sites and thus are inadequate to model the variability of rainfall. The present study addresses this problem through representation of the pattern of multi-site rainfall using rainfall state in a river basin. A model based on K-means clustering technique coupled with a supervised data classification technique, namely Classification And Regression Tree (CART), is used for generation of rainfall states from large-scale atmospheric variables in a river basin. The K-means clustering is used to derive the daily rainfall state from the historical daily multi-site rainfall data. The optimum number of clusters in the observed rainfall data is obtained after application of various cluster validity measures to the clustered data. The CART model is then trained to establish relationship between the daily rainfall state of the river basin and the standardized, dimensionally-reduced National Centers for Environmental Prediction/National Center for Atmospheric Research (NCEP/NCAR) reanalysis climatic data set. The relationship thus developed is applied to the General Circulation Model (GCM)-simulated, standardized, bias free large-scale climate variables for prediction of rainfall states in future. Comparisons of the number of days falling under different rainfall states for the observed period and the future give the change expected in the river basin due to global warming. The methodology is tested for the Mahanadi river basin in India.

Metabolite fingerprinting of urine suggests breed-specific dietary metabolism differences in domestic dogs

Selective breeding of dogs has culminated in a large number of modern breeds distinctive in terms of size, shape and behaviour. Inadvertently, a range of breed-specific genetic disorders have become fixed in some pure-bred populations. Several inherited conditions confer chronic metabolic defects that are influenced strongly by diet, but it is likely that many less obvious breed-specific differences in physiology exist. Using Labrador retrievers and miniature Schnauzers maintained in a simulated domestic setting on a controlled diet, an experimental design was validated in relation to husbandry, sampling and sample processing for metabolomics. Metabolite fingerprints were generated from 'spot' urine samples using flow injection electrospray MS (FIE-MS). With class based on breed, urine chemical fingerprints were modelled using Random Forest (a supervised data classification technique), and metabolite features (m/z) explanatory of breed-specific differences were putatively annotated using the ARMeC database (http://www.armec.org). GC-MS profiling to confirm FIE-MS predictions indicated major breed-specific differences centred on the metabolism of diet-related polyphenols. Metabolism of further diet components, including potentially prebiotic oligosaccharides, animal-derived fats and glycerol, appeared significantly different between the two breeds. Analysis of the urinary metabolome of young male dogs representative of a wider range of breeds from animals maintained under domestic conditions on unknown diets provided preliminary evidence that many breeds may indeed have distinctive metabolic differences, with significant differences particularly apparent in comparisons between large and smaller breeds.

Unsupervised and supervised data classification via nonsmooth and global optimization

We examine various methods for data clustering and data classification that are based on the minimization of the so-called cluster function and its modications. These functions are nonsmooth and nonconvex. We use Discrete Gradient methods for their local minimization. We consider also a combination of this method with the cutting angle method for global minimization. We present and discuss results of numerical experiments.