Search

This paper proposes a new spheres-based support vector machine (SSVM) for binary data classification. The proposed SSVM is formulated by clustering the training points according to the similarity between classes, i.e., it constructs two spheres simultaneously by solving a single optimization programming problem, in which each point is as far as possible away from the sphere center of opposite class and its projection value on the directed line segment between the two centers is as far as possible not larger than the corresponding radius. This SSVM has a perfect geometric interpretation for its dual problem. By considering the characteristics of the dual optimization problem of SSVM, an efficient learning algorithm for SSVM, which can be easily extended to other SVM-type classifiers, based on the gradient descent and the clipping strategy is further presented. Computational results on several synthetic as well as benchmark datasets indicate the significant advantages of the SSVM classifier in the computational cost and test accuracy. [ABSTRACT FROM AUTHOR]

This paper proposes and optimizes a two-term cost function consisting of a sparseness term and a generalized v-fold cross-validation term by a new adaptive particle swarm optimization (APSO). APSO updates its parameters adaptively based on a dynamic feedback from the success rate of the each particle’s personal best. Since the proposed cost function is based on the choosing fewer numbers of support vectors, the complexity of SVM model is decreased while the accuracy remains in an acceptable range. Therefore, the testing time decreases and makes SVM more applicable for practical applications in real data sets. A comparative study on data sets of UCI database is performed between the proposed cost function and conventional cost function to demonstrate the effectiveness of the proposed cost function. [ABSTRACT FROM AUTHOR]

The previous cost-sensitive learning methods assume that the (medical) test cost is measured in the same scale with the misclassification cost while minimizing the expected total cost. This paper proposes a general target-resource framework involving multiple kinds of cost scales, which minimize one kind of cost scale (called target cost scale) through controlling the others (called resource cost scales) in given resource budgets. The proposed cost-sensitive learning model also assists in, such as healthcare data classification and bioinformatics analysis, which are practical and desired application for developing a multiple-scale cost-sensitive learning tool. We experimentally evaluated our approach using the biological and medical datasets, and demonstrated that our proposed method worked well on learning decision tree under a given budget. [ABSTRACT FROM AUTHOR]

Depth functions have many applications in multivariate data analysis, including discriminant analysis and classification. In this paper, we introduce a novel class of data depth: exponential power depth (EPD) functions. Under some conditions, we show that the EPD functions are a statistical depth function, and the sample EPD functions are consistent and asymptotically normal. Based on the proposed EPD functions, we construct a DD-plot (depth-versus-depth plot), which can be applied to the classification problem. Since the EPD functions contain the two tuning parameters, we provide a data-driven approach to select these tuning parameters. The simulation studies and two real data analysis are conducted to assess the finite sample performance of the proposed method. [ABSTRACT FROM AUTHOR]

Pacific Northwest National Laboratory has accumulated years of data with ultra-low-background proportional counters collected in an on-site shallow underground laboratory. This large dataset of events is exploited to study the impact of using neural networks for data analysis compared to simple pulse shape discrimination (PSD). The PSD method can introduce false positives for overlapping event distributions; however, a neural network can separate and correctly classify these events. This paper describes the training, testing, and validation of a neural network, analysis of challenge datasets, and a comparison between the standard PSD approach and a dense, fully-connected neural network. [ABSTRACT FROM AUTHOR]

The assignment of labels to data instances is a fundamental prerequisite for many machine learning tasks. Moreover, labeling is a frequently applied process in visual interactive analysis approaches and visual analytics. However, the strategies for creating labels usually differ between these two fields. This raises the question whether synergies between the different approaches can be attained. In this paper, we study the process of labeling data instances with the user in the loop, from both the machine learning and visual interactive perspective. Based on a review of differences and commonalities, we propose the “visual interactive labeling” (VIAL) process that unifies both approaches. We describe the six major steps of the process and discuss their specific challenges. Additionally, we present two heterogeneous usage scenarios from the novel VIAL perspective, one on metric distance learning and one on object detection in videos. Finally, we discuss general challenges to VIAL and point out necessary work for the realization of future VIAL approaches. [ABSTRACT FROM AUTHOR]

In recent years, sparse coding via dictionary learning has been widely used in many applications for exploiting sparsity patterns of data. For classification, useful sparsity patterns should have discrimination, which cannot be well achieved by standard sparse coding techniques. In this paper, we investigate structured sparse coding for obtaining discriminative class-specific group sparsity patterns in the context of classification. A structured dictionary learning approach for sparse coding is proposed by considering the ℓ2,0 norm on each class of data. An efficient numerical algorithm with global convergence is developed for solving the related challenging ℓ2,0 minimization problem. The learned dictionary is decomposed into class-specific dictionaries for the classification that is done according to the minimum reconstruction error among all the classes. For evaluation, the proposed method was applied to classifying both the synthetic data and real-world data. The experiments show the competitive performance of the proposed method in comparison with several existing discriminative sparse coding methods. [ABSTRACT FROM AUTHOR]

Recent years have seen an increased interest in machine learning-based predictive methods for analyzing quantitative behavioral data in experimental psychology. While these methods can achieve relatively greater sensitivity compared to conventional univariate techniques, they still lack an established and accessible implementation. The aim of current work was to build an open-source R toolbox - “PredPsych” - that could make these methods readily available to all psychologists. PredPsych is a user-friendly, R toolbox based on machine-learning predictive algorithms. In this paper, we present the framework of PredPsych via the analysis of a recently published multiple-subject motion capture dataset. In addition, we discuss examples of possible research questions that can be addressed with the machine-learning algorithms implemented in PredPsych and cannot be easily addressed with univariate statistical analysis. We anticipate that PredPsych will be of use to researchers with limited programming experience not only in the field of psychology, but also in that of clinical neuroscience, enabling computational assessment of putative bio-behavioral markers for both prognosis and diagnosis. [ABSTRACT FROM AUTHOR]

In this paper, we evaluate three learning algorithms based on supervised projections for molecular activity prediction. Using an approach based on supervised projections of the input space to construct ensembles of classifiers, three algorithms were tested. We constructed the projections by considering only instances that were misclassified by a previous classifier using the hidden layer of an Artificial Neural Network. We applied a supervised linear projection of the input space using a Nonparametric Discriminant Analysis method. Finally, we projected onto a subspace that minimizes the weighted error for each step. Using these three methods to construct ensembles of classifiers for the in silico prediction of Ames mutagenicity, we demonstrated the improved behavior of our proposal compared to classical methods. [ABSTRACT FROM AUTHOR]

Preservation of privacy in data mining and machine learning has emerged as an absolute prerequisite in many practical scenarios, especially when the processing of sensitive data is outsourced to an external third party. Currently, privacy preservation methods are mainly based on randomization and/or perturbation, secure multiparty computations and cryptographic methods. In this paper, we take advantage of the partial homomorphic property of some cryptosystems to train simple machine learning models with encrypted data. Our basic scenario has three parties: multiple Data Owners, which provide encrypted training examples; the Algorithm Owner (or Application), which processes them to adjust the parameters of its models; and a semi-trusted third party, which provides privacy and secure computation services to the Application in some operations not supported by the homomorphic cryptosystem. In particular, we focus on two issues: the use of multiple-key cryptosystems, and the impact of the quantization of real-valued input data required before encryption. In addition, we develop primitives based on the outsourcing of a reduced set of operations that allows to implement general machine learning algorithms using efficient dedicated hardware. As applications, we consider the training of classifiers using privacy-protected data and the tracking of a moving target using encrypted distance measurements. [ABSTRACT FROM AUTHOR]

Multi-criteria collaborative filtering (MC-CF) presents a possibility to provide accurate recommendations by considering the user preferences in multiple aspects of items. However, scalability and sparsity are two main problems in MC-CF which this paper attempts to solve them using dimensionality reduction and Neuro-Fuzzy techniques. Considering the user behavior about items' features which is frequently vague, imprecise and subjective, we solve the sparsity problem using Neuro-Fuzzy technique. For the scalability problem, higher order singular value decomposition along with supervised learning (classification) methods is used. Thus, the objective of this paper is to propose a new recommendation model to improve the recommendation quality and predictive accuracy of MC-CF and solve the scalability and alleviate the sparsity problems in the MC-CF. The experimental results of applying these approaches on Yahoo!Movies and TripAdvisor datasets with several comparisons are presented to show the enhancement of MC-CF recommendation quality and predictive accuracy. The experimental results demonstrate that SVM dominates the K-NN and FBNN in improving the MC-CF predictive accuracy evaluated by most broadly popular measurement metrics, F1 and mean absolute error. In addition, the experimental results also demonstrate that the combination of Neuro-Fuzzy and dimensionality reduction techniques remarkably improves the recommendation quality and predictive accuracy of MC-CF in relation to the previous recommendation techniques based on multi-criteria ratings. [ABSTRACT FROM AUTHOR]

Question-answering (QA) platforms such as Stack Overflow, Quora, and Stack Exchange have become favourite places to exchange knowledge with community users. Finding answers to simple or complex questions is easier on QA platforms nowadays. Due to a large number of responses from users all around the world, these CQA systems are currently facing massive problems. Stack Overflow allows users to ask questions and give answers or comments on others’ posts. Consequently, Stack Overflow also rewards those users whose posts are appreciated by the community in the form of reputation points. The accepted answer provides maximum reputation points to the answerer. More reputation points allow getting more website privileges. Hence, each answerer needs to get their answer accepted. Very little research has been done to check whether the user’s answers will be accepted or not. This paper proposes a model that predicts answer acceptability and its reason. The model’s findings help the answerer know about the answer acceptance; if the model predicted the probability of acceptance is less, the answerer might revise their answer immediately. The comparison with the state-of-the-art literature confirmed that the proposed model achieves better performance. [ABSTRACT FROM AUTHOR]

Recently, a novel learning algorithm for single-hidden-layer feedforward neural networks (SLFNs) named extreme learning machine (ELM) was proposed by Huang et al. The essence of ELM is that the learning parameters of hidden nodes, including input weights and biases, are randomly assigned and need not be tuned while the output weights can be analytically determined by the simple generalized inverse operation. The only parameter needed to be defined is the number of hidden nodes. Compared with other traditional learning algorithms for SLFNs, ELM provides extremely faster learning speed, better generalization performance and with least human intervention. This paper firstly introduces a brief review of ELM, describing the principle and algorithm of ELM. Then, we put emphasis on the improved methods or the typical variants of ELM, especially on incremental ELM, pruning ELM, error-minimized ELM, two-stage ELM, online sequential ELM, evolutionary ELM, voting-based ELM, ordinal ELM, fully complex ELM, and symmetric ELM. Next, the paper summarized the applications of ELM on classification, regression, function approximation, pattern recognition, forecasting and diagnosis, and so on. In the last, the paper discussed several open issues of ELM, which may be worthy of exploring in the future. [ABSTRACT FROM AUTHOR]

Natural language processing (NLP) is the technology that enables machine to process human language. Entity recognition is one of the most basic tasks in NLP. It aims to identify and classify the name of each object in the text. Traditional named entity recognition systems can only identify a small set of types such as person, location, organization or miscellaneous. In order to make machine exploit the meaning of the text better, it is necessary to classify the entities appearing in the text to fine-grained types. Previously reported work generally obtained the entity context information through a fixed window, so the external information for classifying the entity is not enough, which may lead to ambiguity. To solve the shortcomings of these methods, this paper presents a fine-grained entity type classification method for unstructured text based on global information and sliding window context. By combining those information with other features, we utilize a bidirectional long-short-term memory network to perform the classification work. With the proposed method, the experiment results of fine-grained entity type classification are optimized. [ABSTRACT FROM AUTHOR]

Deterministic analysis does not provide a comprehensive model for concrete dam response under multi-hazard risk. Thus, the use of probabilistic approach is usually recommended which is problematic due to high computational demand. This paper presents a simplified reliability analysis framework for gravity dams subjected to flooding, earthquakes, and aging. A group of time-variant degradation models are proposed for different random variables. Response of the dam is presented by explicit limit state functions. The probability of failure is directly computed by either classical Monte Carlo simulation or the refined importance sampling technique. Next, three machine learning techniques (i.e., K -nearest neighbor, support vector machine, and naive Bayes classifier) are adopted for binary classification of the structural results. These methods are then demonstrated in terms of accuracy, applicability and computational time for prediction of the failure probability. Results are then generalized for different dam classes (based on the height-to-width ratio), various water levels, earthquake intensity, degradation rate, and cross-correlation between the random variables. Finally, a sigmoid-type function is proposed for analytical calculation of the failure probability for different classes of gravity dams. This function is then specialized for the hydrological hazard and the failure surface is presented as a direct function of the dam's height and width. [ABSTRACT FROM AUTHOR]

At the chromosomal level of evolution, recombination is a major factor for genetic variations. However, recombination does not occur with equal frequency at various regions of genome. The recombination has the tendency to occur at specific region with higher frequency and with low frequency at other regions, and former regions are named as hot recombination regions whereas later are called cold regions for recombination. In this paper, we have developed supervised machine learning-based models using artificial neural network, support vector machine and Naïve Bayes for efficient and effective classification of such hot and cold recombination regions based on the nucleotide composition of sequences. All models were validated and tested using tenfold cross-validation. Furthermore, neural network model was validated using leave one out and random sampling techniques in addition to tenfold cross-validation. Moreover, models were evaluated using receiver-operating curve. Our results indicate that artificial neural network achieves the best result. [ABSTRACT FROM AUTHOR]

K-nearest neighbors (KNN) algorithm is a common algorithm used for classification, and also a sub-routine in various complicated machine learning tasks. In this paper, we presented a quantum algorithm (QKNN) for implementing this algorithm based on the metric of Hamming distance. We put forward a quantum circuit for computing Hamming distance between testing sample and each feature vector in the training set. Taking advantage of this method, we realized a good analog for classical KNN algorithm by setting a distance threshold value t to select k − n e a r e s t neighbors. As a result, QKNN achieves O( n ) performance which is only relevant to the dimension of feature vectors and high classification accuracy, outperforms Llyod's algorithm (Lloyd et al. 2013) and Wiebe's algorithm (Wiebe et al. 2014). [ABSTRACT FROM AUTHOR]

Most existing classification methods are aimed at minimization of empirical risk (through some simple point-based error measured with loss function) with added regularization. We propose to approach the classification problem by applying entropy measures as a model objective function. We focus on quadratic Renyi's entropy and connected Cauchy-Schwarz Divergence which leads to the construction of extreme entropy machines (EEM). The main contribution of this paper is proposing a model based on the information theoretic concepts which on the one hand shows new, entropic perspective on known linear classifiers and on the other leads to a construction of very robust method competitive with the state of the art non-information theoretic ones (including Support Vector Machines and Extreme Learning Machines). Evaluation on numerous problems spanning from small, simple ones from UCI repository to the large (hundreds of thousands of samples) extremely unbalanced (up to 100:1 classes' ratios) datasets shows wide applicability of the EEM in real-life problems. Furthermore, it scales better than all considered competitive methods. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel unsupervised learning approach for spatio-temporal pattern classification. We use a spike timing neural network with axonal conductance delays to learn the structure of spatio-temporal patterns from a small set of training samples and then use this network for classifying unseen patterns. The method also enables early classification of patterns, before they are completely observed. To transform a spatio-temporal pattern into a suitable form for the spiking network, we create a mapping process that transforms it into a spike train that can be used to train the network through spike-timing-dependent plasticity. Based on the trained network, we build models of the training samples as strings of characters in which each character represents a set of neurons that fire at a particular time step, in response to the pattern. For classification, we compute the longest common subsequence between the model strings corresponding to the input and training samples and choose the class of the training sample with highest similarity. This method is evaluated on a handwritten digits dataset with spatio-temporal information. We show that this method is robustly detecting the correct class early on. Comparison with one unsupervised and eight other supervised approaches shows that our proposed approach could compete or has better performance rather than all of them. Further analysis show that even for misclassified samples, our system can detect the correct class among the top three class labels. [ABSTRACT FROM AUTHOR]

In this paper, a quantum based binary neural network algorithm is proposed, named as novel quantum binary neural network algorithm (NQ-BNN). It forms a neural network structure by deciding weights and separability parameter in quantum based manner. Quantum computing concept represents solution probabilistically and gives large search space to find optimal value of required parameters using Gaussian random number generator. The neural network structure forms constructively having three number of layers input layer: hidden layer and output layer. A constructive way of deciding the network eliminates the unnecessary training of neural network. A new parameter that is a quantum separability parameter (QSP) is introduced here, which finds an optimal separability plane to classify input samples. During learning, it searches for an optimal separability plane. This parameter is taken as the threshold of neuron for learning of neural network. This algorithm is tested with three benchmark datasets and produces improved results than existing quantum inspired and other classification approaches. [ABSTRACT FROM AUTHOR]

Background: With the rapid accumulation of biological datasets, machine learning methods designed to automate data analysis are urgently needed. In recent years, so-called topic models that originated from the field of natural language processing have been receiving much attention in bioinformatics because of their interpretability. Our aim was to review the application and development of topic models for bioinformatics. Description: This paper starts with the description of a topic model, with a focus on the understanding of topic modeling. A general outline is provided on how to build an application in a topic model and how to develop a topic model. Meanwhile, the literature on application of topic models to biological data was searched and analyzed in depth. According to the types of models and the analogy between the concept of document-topic-word and a biological object (as well as the tasks of a topic model), we categorized the related studies and provided an outlook on the use of topic models for the development of bioinformatics applications. Conclusion: Topic modeling is a useful method (in contrast to the traditional means of data reduction in bioinformatics) and enhances researchers' ability to interpret biological information. Nevertheless, due to the lack of topic models optimized for specific biological data, the studies on topic modeling in biological data still have a long and challenging road ahead. We believe that topic models are a promising method for various applications in bioinformatics research. [ABSTRACT FROM AUTHOR]

As an advanced local and global learning machine, the existing maxi-min margin machine (M) still has its heavy time-consuming weakness. Inspired from the fact that covariance matrix of a dataset can characterize its data orientation and compactness globally, a novel large margin classifier called the local and global classification machine with collaborative mechanism (CM) is constructed to circumvent this weakness in this paper. This classifier divides the whole global data into two independent models, and the final decision boundary is obtained by collaboratively combining two hyperplanes learned from two independent models. The proposed classifier CM can be individually solved as a quadratic programming problem. The total training time complexity is $$O(2N^3)$$ which is faster than $$O(N^4)$$ of M. CM can be well defined with the clear geometrical interpretation and can also be justified from a theoretical perspective. As an additional contribution, it is shown that CM can robustly leverage the global information from those datasets with overlapping class margins, while M does not use such global information. We also use the kernel trick and exploit CM's kernelized version. Experiments on toy and real-world datasets demonstrate that compared with M, CM is a more time-saving local and global learning machine. [ABSTRACT FROM AUTHOR]

Multi-label classification allows instances to belong to several classes at once. It has received significant attention in machine learning and has found many real-world applications in recent years, such as text categorization, automatic video annotation and functional genomics, resulting in the development of many multi-label classification methods. Based on labeled examples in the training dataset, a multi-labeled method extracts inherent information to output a function that predicts the labels of unlabeled data. Due to several problems, like errors in the input vectors or in their labels, this information may be wrong and might lead the multi-label algorithm to fail. In this paper, we propose a simple algorithm for overcoming these problems by editing the existing training dataset, and adapting the edited set with different multi-label classification methods. Evaluation on benchmark datasets demonstrates the usefulness and effectiveness of our approach. [ABSTRACT FROM AUTHOR]

In order to overcome the disadvantage of the traditional algorithm for SLFN (single-hidden layer feedforward neural network), an improved algorithm for SLFN, called extreme learning machine (ELM), is proposed by Huang et al. However, ELM is sensitive to the neuron number in hidden layer and its selection is a difficult-to-solve problem. In this paper, a self-adaptive mechanism is introduced into the ELM. Herein, a new variant of ELM, called self-adaptive extreme learning machine (SaELM), is proposed. SaELM is a self-adaptive learning algorithm that can always select the best neuron number in hidden layer to form the neural networks. There is no need to adjust any parameters in the training process. In order to prove the performance of the SaELM, it is used to solve the Italian wine and iris classification problems. Through the comparisons between SaELM and the traditional back propagation, basic ELM and general regression neural network, the results have proven that SaELM has a faster learning speed and better generalization performance when solving the classification problem. [ABSTRACT FROM AUTHOR]

Real-time transient stability status prediction (RTSSP) is very important to maintain the safety and stability of electrical power systems, where any unstable contingency will be likely to cause large-scale blackout. Most of machine learning methods used for RTSSP attempt to attain a low classification error, which implies that the misclassification costs of different categories are the same. However, misclassifying an unstable case as stable one usually leads to much higher costs than misclassifying a stable case as unstable one. In this paper, a new RTSSP method based on cost-sensitive extreme learning machine (CELM) is proposed, which recognizes the RTSSP as a cost-sensitive classification problem. The CELM is constructed pursuing the minimum misclassification costs, and its detailed implementation procedures for RSSTP are also researched in this work. The proposed method is implemented on the New England 39-bus electrical power system. Compared with three cost-blind methods (ELM, SVM and DT) and two cost-sensitive methods (cost-sensitive DT, cost-sensitive SVM), the simulation results have proved that the lower total misclassification costs and false dismissal rate with low computational complexity can be achieved by the proposed method, which meets the demands for the computation speed and the reliability of RTSSP. [ABSTRACT FROM AUTHOR]

Due to the significant efficiency and simple implementation, extreme learning machine (ELM) algorithms enjoy much attention in regression and classification applications recently. Many efforts have been paid to enhance the performance of ELM from both methodology (ELM training strategies) and structure (incremental or pruned ELMs) perspectives. In this paper, a local coupled extreme learning machine (LC-ELM) algorithm is presented. By assigning an address to each hidden node in the input space, LC-ELM introduces a decoupler framework to ELM in order to reduce the complexity of the weight searching space. The activated degree of a hidden node is measured by the membership degree of the similarity between the associated address and the given input. Experimental results confirm that the proposed approach works effectively and generally outperforms the original ELM in both regression and classification applications. [ABSTRACT FROM AUTHOR]

In this paper, we focus on the problem of extreme learning machine (ELM)-based microarray data classification. Different from the traditional classification problem, the goal in this case is not just to predict the class labels for the unseen samples, but to make clear what lead to the results, i.e., the genes involving with a specific disease. This is especially significant for biologists, since they need to decipher the causes of disease. As a black-box method, ELM could not measure up to the task by itself. In this work, we propose a diversified sequence feature selection-based framework to address the problem. In this framework, (1) a sequence model, EWave, is introduced to ensure the structural ordering information among genes exploitable; (2) a concept of irreducible sequence is proposed, where the genes work as an orderly whole to keep high confidence with a specific class and any reduction in the genes decreases the confidence much. An efficient sequence mining algorithm together with some effective pruning rules is developed to mine such sequences; and (3) we study how to extract a set of diversified sequence features as the representative of all mined results. The problem is proved to be NP-hard. A greedy algorithm is presented to approximate the optimal solution. Experimental results show that the proposed approach significantly improves the efficiency and the effectiveness of ELM w.r.t some widely used feature selection techniques. [ABSTRACT FROM AUTHOR]

For multi-camera human action recognition methods, there is often a trade-off between classification accuracy and computational efficiency. Methods that generate 3D models or query all of the cameras in the network for each target are often computationally expensive. In this paper, we present an action recognition method that operates in a multi-camera environment, but dynamically selects a single camera at a time. We learn the relative utility of a particular viewpoint compared with switching to a different available camera in the network for future classification. We cast this learning problem as a Markov Decision Process, and incorporate reinforcement learning to estimate the value of the possible view-shifts. On two benchmark multi-camera action recognition datasets, our method outperforms approaches that incorporate all available cameras in both speed and classification accuracy. [ABSTRACT FROM AUTHOR]

The issue of adaptability in the design of automated visual inspection (AVI) systems has been a major road block in the application of AVI technology to manufacturing industry. The objective of an adaptable AVI system is to reduce system tuning time while maintaining the quality of inspection. In the authors' previous work (Int J Adv Manuf Technol 59:655-667, 2012), we have proposed a novel adaptable AVI scheme, with which an AVI system can be trained online to accommodate new patterns. As such, the system can be deployed to undertake new inspection tasks or adapt to new operation conditions without excessive offline training efforts. The research presented in this two-part article is our further development of the adaptable AVI scheme, namely AVIS. In this research, we focus on elaborating the concept, designing the structure, implementing the functions, and evaluating the performance of AVIS in a systemic perspective. In part I, the proposed AVIS is presented as a generic scheme at the conceptual level, with respect to the system components and structure, operating procedure, and performance measures. The key element in the design of the AVIS is an adaptable inspection model that integrates subject localization, feature extraction, and classification functions as trainable submodels. In part I of this paper, we developed a generic tool for an adaptable AVI system without specifying the use of particular machine vision and machine learning techniques. Interested readers may choose techniques for implementing the proposed scheme according to their own preferences. In part II of this article, we focus on the system implementation and evaluation of AVIS using such techniques as template matching, principal component analysis (PCA), and support vector machine (SVM). [ABSTRACT FROM AUTHOR]

Machine Learning techniques have been useful in almost every field of concern. Data Mining, a branch of Machine Learning is one of the most extensively used techniques. The ever-increasing demands in the field of medicine are being addressed by computational approaches in which Big Data analysis, image processing and data mining are on top priority. These techniques have been exploited in the domain of ophthalmology for better retinal fundus image analysis. Blood vessels, one of the most significant retinal anatomical structures are analysed for diagnosis of many diseases like retinopathy, occlusion and many other vision threatening diseases. Vessel segmentation can also be a pre-processing step for segmentation of other retinal structures like optic disc, fovea, microneurysms, etc. In this paper, blood vessel segmentation is attempted through image processing and data mining techniques. The retinal blood vessels were segmented through color space conversion and color channel extraction, image pre-processing, Gabor filtering, image postprocessing, feature construction through application of principal component analysis, k-means clustering and first level classification using Naïve-Bayes classification algorithm and second level classification using C4.5 enhanced with bagging techniques. Association of every pixel against the feature vector necessitates Big Data analysis. The proposed methodology was evaluated on a publicly available database, STARE. The results reported 95.05% accuracy on entire dataset; however the accuracy was 95.20% on normal images and 94.89% on pathological images. A comparison of these results with the existing methodologies is also reported. This methodology can help ophthalmologists in better and faster analysis and hence early treatment to the patients. [ABSTRACT FROM AUTHOR]

Most of the existing classification techniques concentrate on learning the datasets as a single similar unit, in spite of so many differentiating attributes and complexities involved. However, traditional classification techniques are required to analyze the datasets prior to learning, and if not doing so, they loss their performance in terms of accuracy and AUC. To this end, many of the machine learning problems can be very easily solved just by carefully observing human learning and training nature and then mimicking the same in the machine learning. In response to these issues, we present a comprehensive suite of experiments carefully designed to provide conclusive, reliable, and significant results to the problem of efficient learning. This paper proposes a novel, simple, and effective machine learning paradigm that explicitly exploits this important similar-to-different (S2D) human learning strategy and implements it based on two algorithms (C4.5 and CART) efficiently. The framework not only analyzes the data sets prior to implementation, but also carefully allows classifier to have a systematic study so as to mimic the human training technique designed for efficient learning. Experimental results show that the method outperforms the state-of-the-art methods in terms of learning capability and breaks through the gap between human and machine learning. In fact, the proposed similar-to-different (S2D) strategy may also be useful in efficient learning of real-world complex and high-dimensional data sets, especially which are very typical to learn with traditional classifiers. [ABSTRACT FROM AUTHOR]

Peer-to-peer (P2P) classifications based on flow statistics have been proven accurate in detecting P2P traffic. A machine learning classification is affected by the quality and recency of the training dataset used. Hence, to classify P2P traffic on-line requires the removal of these limitations. In this paper, an automated training dataset generation for an on-line P2P traffic classification is proposed to allow frequent classifier retraining. A two-stage training dataset generator (TSTDG) is proposed by combining a 3-class heuristic and a 3-class statistical classification to automatically generate a training dataset. In the heuristic stage, traffic is classified as P2P, non-P2P, or unknown. In the statistical stage, a dual Decision Tree is built based on a dataset generated in the heuristic stage to reduce the amount of classified unknown traffic. The final training dataset is generated based on all flows that are classified in these two stages. The proposed system has been evaluated on traces captured from a campus network. The overall results show that the TSTDG can generate an accurate training dataset by classifying around 94 % of total flows with high accuracy (98.59 %) and a low false positive rate (1.27 %). [ABSTRACT FROM AUTHOR]

PU classification problem ('P' stands for positive, 'U' stands for unlabeled), which is defined as the training set consists of a collection of positive and unlabeled examples, has become a research hot spot recently. In this paper, we design a new classification algorithm to solve the PU problem: biased twin support vector machine (B-TWSVM). In B-TWSVM, two nonparallel hyperplanes are constructed such that the positive examples can be classified correctly, and the number of unlabeled examples classified as positive is minimized. Moreover, considering that the unlabeled set also contains positive data, different penalty parameters for positive and negative data are allowed in B-TWSVM. Experimental results demonstrate that our method outperforms the state-of-the-art methods in most cases. [ABSTRACT FROM AUTHOR]

Extreme learning machine (ELM) has been introduced as a simple and efficient learning approach for regression and classification applications. From the optimization point of view, optimized ELM is equivalent to SVM, but with less constraints in the optimization formulation and random ELM kernel. This paper introduces an active set based optimized ELM approach to solve bound constrained optimization problem in a straightforward way, which operates on a small working set of variables at each iteration. Thus, the constrained problem can be eventually solved by an unconstrained algorithm, and this enables us to establish a global convergence theory. The approach requires less time for quadratic programming solving and provides better generalization performance. In addition, the proposed approach with much smaller number of non-bound support values is significantly faster than SVM with active set strategy for large training data set. [ABSTRACT FROM AUTHOR]

It is always wise to keep the frequently used information by various users in the cache memory. This makes the users feel that their needed information is available almost immediately. Apart from experiencing less access delay, caching process also helps in better bandwidth utilization and load reduction in the origin server. Pre-fetching is the process of fetching few of the Web pages in advance by assuming that those pages will be needed by the user in the near future. Combining pre-fetching and caching techniques results in experiencing much less access delay and much better bandwidth utilization. Many works have been reported in the literature, separately for Web caching techniques and pre-fetching of Web pages. In this paper, pre-fetching technique that uses clustering is combined with SVM (support vector machine)-LRU algorithm, a machine learning method for Web proxy caching. By using real-time data, it is demonstrated that the latter approach will be advantageous than clustering-based pre-fetching technique using traditional LRU-based caching policy. The efficiency of our proposed method is also compared with caching using Bayesian networks and neuro-fuzzy system. [ABSTRACT FROM AUTHOR]

This paper aims to assist the administration departments of medical organisations in making the right decision on selecting a suitable multiclass classification model for acute leukaemia. In this paper, we proposed a framework that will aid these departments in evaluating, benchmarking and ranking available multiclass classification models for the selection of the best one. Medical organisations have continuously faced evaluation and benchmarking challenges in such endeavour, especially when no single model is superior. Moreover, the improper selection of multiclass classification for acute leukaemia model may be costly for medical organisations. For example, when a patient dies, one such organisation will be legally or financially sued for incidents in which the model fails to fulfil its desired outcome. With regard to evaluation and benchmarking, multiclass classification models are challenging processes due to multiple evaluation and conflicting criteria. This study structured a decision matrix (DM) based on the crossover of 2 groups of multi-evaluation criteria and 22 multiclass classification models. The matrix was then evaluated with datasets comprising 72 samples of acute leukaemia, which include 5327 gens. Subsequently, multi-criteria decision-making (MCDM) techniques are used in the benchmarking and ranking of multiclass classification models. The MCDM used techniques that include the integrated BWM and VIKOR. BWM has been applied for the weight calculations of evaluation criteria, whereas VIKOR has been used to benchmark and rank classification models. VIKOR has also been employed in two decision-making contexts: individual and group decision making and internal and external group aggregation. Results showed the following: (1) the integration of BWM and VIKOR is effective at solving the benchmarking/selection problems of multiclass classification models. (2) The ranks of classification models obtained from internal and external VIKOR group decision making were almost the same, and the best multiclass classification model based on the two was 'Bayes. Naive Byes Updateable' and the worst one was 'Trees.LMT'. (3) Among the scores of groups in the objective validation, significant differences were identified, which indicated that the ranking results of internal and external VIKOR group decision making were valid. [ABSTRACT FROM AUTHOR]

Pulsed eddy current (PEC) technique has been applied as a viable method to detect hidden discontinuities in metallic structures. Conventionally, selected time-domain features are employed to characterize the PEC data, such as peak value, lift-off point of intersection, rising point, crossing time, and differential time to peak. The research presented in this paper continues the effort in a previous study on detecting the radial cracks starting from the fastener hole in second layer of a two-layer mock-up aircraft structure. A large diameter excitation coil with ferrite core is used to induce a strong pulse, and the magnetic field generated by eddy current is detected by Hall sensors. Instead of analyzing the limited time-domain features, we propose using machine learning methods to interpret the raw data without feature extraction. Thus, the second-layer discontinuities can be characterized presumably with all the information contained in a waveform. An automated detection framework is proposed in this paper and the experimental results demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Understanding the data and reaching accurate conclusions are of paramount importance in the present era of big data. Machine learning and probability theory methods have been widely used for this purpose in various fields. One critically important yet less explored aspect is capturing and analyzing uncertainties in the data and model. Proper quantification of uncertainty helps to provide valuable information to obtain accurate diagnosis. This paper reviewed related studies conducted in the last 30 years (from 1991 to 2020) in handling uncertainties in medical data using probability theory and machine learning techniques. Medical data is more prone to uncertainty due to the presence of noise in the data. So, it is very important to have clean medical data without any noise to get accurate diagnosis. The sources of noise in the medical data need to be known to address this issue. Based on the medical data obtained by the physician, diagnosis of disease, and treatment plan are prescribed. Hence, the uncertainty is growing in healthcare and there is limited knowledge to address these problems. Our findings indicate that there are few challenges to be addressed in handling the uncertainty in medical raw data and new models. In this work, we have summarized various methods employed to overcome this problem. Nowadays, various novel deep learning techniques have been proposed to deal with such uncertainties and improve the performance in decision making. [ABSTRACT FROM AUTHOR]

In a smart healthcare system, the sensor-embedded wearable devices have the ability to track various vital signs of a patient.However, such devices need to be worn by the patients all the time. These devices have limitations such as their battery lifetime, charging mechanism, and hardware-related cost. Moreover, these devices transmit a huge amount of redundant and inconsistent data. The transmitted data need to be fused to remove any outlier so that only highly- refined data are available for decision-making. In this paper, we use channel state information (CSI) to track the vital signs of a patient and remove any outliers from the gathered data. We monitor the respiration rate of a patient during sleep with minimal hardware-related cost. Our CSI-based approach no longer requires the patients to wear any wearables and can monitor even the minute fluctuations in a WiFi signal.For extracting useful features from the respiratory data, three types of feature extraction techniques are used. In order to select important features from the extracted feature space, three feature selection algorithms, i.e., Relief, mRMR, and Lasso, have been investigated. In addition, for predicting the health conditions of a patient, four machine learning classification algorithms, i.e., KNN, SVM, DT, and RF, are utilized. The use of CSI ensures that highly refined and fused data are available for feature selection, and the selected features are presented to the ML classification algorithms for predicting the health condition of the patient. [ABSTRACT FROM AUTHOR]

Most common and deadly type of cancer is Skin cancer. The destructive kind of cancers in skin is Melanoma as well as it can be identified at the initial stage and can be cured completely. For the diagnosis of melanoma, the identification of the melanocytes in the area of epidermis is an essential stage. In this paper the watershed segmentation method is implemented for segmentation. The extracted segments are subjected to feature extraction. The features extracted are shape, ABCD rule and GLCM. The extracted features are then used for classification. The classifiers are kNN (k Nearest Neighbor), Random Forest and SVM (Support Vector Machine). Among different classifiers, the SVM classifier provided better results for the skin lesions classification. [ABSTRACT FROM AUTHOR]

Detection of masses and micro calcifications are a stimulating task for radiologists in digital mammogram images. Radiologists using Computer Aided Detection (CAD) frameworks to find the breast lesion. Micro calcification may be the early sign of breast cancer. There are different kinds of methods used to detect and recognize micro calcification from mammogram images. This paper presents an ELM (Extreme Learning Machine) algorithm for micro calcification detection in digital mammogram images. The interference of mammographic image is removed at the pre-processing stages. A multi-scale features are extracted by a feature generation model. The performance did not improve by all extracted feature, therefore feature selection is performed by nature-inspired optimization algorithm. At last, the hybridized ELM classifier taken the selected optimal features to classify malignant from benign micro calcifications. The proposed work is compared with various classifiers and it shown better performance in training time, sensitivity, specificity and accuracy. The existing approaches considered here are SVM (Support Vector Machine) and NB (Naïve Bayes classifier). The proposed detection system provides 99.04% accuracy which is the better performance than the existing approaches. The optimal selection of feature vectors and the efficient classifier improves the performance of proposed system. Results illustrate the classification performance is better when compared with several other classification approaches. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new Internet of Things (IoT) based predictive modelling by using fuzzy cluster based augmentation and classification for predicting the lung cancer disease through continuous monitoring and also to improve the healthcare by providing medical instructions. Here, the fuzzy clustering method is used and which is based on transition region extraction for effective image segmentation. Moreover, Fuzzy C-Means Clustering algorithm is used to categorize the transitional region features from the feature of lung cancer image. In this work, Otsu thresholding method is used for extracting the transition region from lung cancer image. Moreover, the right edge image and the morphological thinning operation are used for enhancing the performance of segmentation. In addition, the morphological cleaning and the image region filling operations are performed over an edge lung cancer image for getting the object regions. In addition, we also propose a new incremental classification algorithm which combines the existing Association Rule Mining (ARM), the standard Decision Tree (DT) with temporal features and the CNN. The experiments have been conducted by using the standard images that are collected from database and the current health data which are collected from patient through IoT devices. The results proved that the performance of the proposed prediction model which is able to achieve the better accuracy when it is compared with other existing prediction model. [ABSTRACT FROM AUTHOR]

Meningioma is the one of the most common type of brain tumor, it as arises from the meninges and encloses the spine and the brain inside the skull. It accounts for 30% of all types of brain tumor. Meningioma's can occur in many parts of the brain and accordingly it is named. In this paper, a mixture model based classification of meningioma brain tumor using MRI image is developed. The proposed method consists of four stages. In the first stage, with respect to the cells' boundary, it is necessary to further processing, which ensures the boundary of some cells is a discrete region. Mathematical Morphology brings a fancy result during the discrete processing. Accurate cancer cell nucleus segmentation is necessary for automated cytological image analysis. Thresholding is a crucial step in segmentation..An adaptive binarization technique is an important step for medical image analysis.Finally, a novel hybrid Fuzzy SVM is designed in the classification stage meningioma brain tumor. The tumor classification results of proposed feature extraction with SVM is 74.24%, MM with FSVM is 82.67% and MM with RBF is 62.71% and our proposed method MM with Hybrid SVM is 91.64%. [ABSTRACT FROM AUTHOR]

Machine learning and data mining approaches are being successfully applied to different fields of life sciences for the past 20 years. Medicine is one of the most suitable application domains for these techniques since they help model diagnostic information based on causal and/or statistical data and therefore reveal hidden dependencies between symptoms and illnesses. In this paper we give a detailed overview of the recent machine learning research and its applications for predicting cognitive diseases, especially the Alzheimer's disease, mild cognitive impairment and the Parkinson's disease. We survey different state-of-the-art methodological approaches, data sources and public data, and provide their comparative analysis. We conclude by identifying the open problems within the field that include an early detection of the cognitive diseases and inclusion of machine learning tools into diagnostic practice and therapy planning. [ABSTRACT FROM AUTHOR]