PubMed Health⌕ Search

Biomedical subjects

Aristidis Likas

Publications and source records attributed to Aristidis Likas.

8 recordsLinked to original sources

An incremental training method for the probabilistic RBF network.

The probabilistic radial basis function (PRBF) network constitutes a probabilistic version of the RBF network for classification that extends the typical mixture model approach to classification by allowing the sharing of mixture components among all classes. The typical learning method of PRBF for a classification task employs the expectation-maximization (EM) algorithm and depends strongly on the initial parameter values. In this paper, we propose a technique for incremental training of the PRBF network for classification. The proposed algorithm starts with a single component and incrementally adds more components at appropriate positions in the data space. The addition of a new component is based on criteria for detecting a region in the data space that is crucial for the classification task. After the addition of all components, the algorithm splits every component of the network into subcomponents, each one corresponding to a different class. Experimental results using several well-known classification data sets indicate that the incremental method provides solutions of superior classification performance compared to the hierarchical PRBF training method. We also conducted comparative experiments with the support vector machines method and present the obtained results along with a qualitative comparison of the two approaches.

Algorithms↗

Bayesian feature and model selection for Gaussian mixture models.

We present a Bayesian method for mixture model training that simultaneously treats the feature selection and the model selection problem. The method is based on the integration of a mixture model formulation that takes into account the saliency of the features and a Bayesian approach to mixture learning that can be used to estimate the number of mixture components. The proposed learning algorithm follows the variational framework and can simultaneously optimize over the number of components, the saliency of the features, and the parameters of the mixture model. Experimental results using high-dimensional artificial and real data illustrate the effectiveness of the method.

Algorithms↗

Motif-based protein sequence classification using neural networks.

We present a system for multi-class protein classification based on neural networks. The basic issue concerning the construction of neural network systems for protein classification is the sequence encoding scheme that must be used in order to feed the neural network. To deal with this problem we propose a method that maps a protein sequence into a numerical feature space using the matching scores of the sequence to groups of conserved patterns (called motifs) into protein families. We consider two alternative ways for identifying the motifs to be used for feature generation and provide a comparative evaluation of the two schemes. We also evaluate the impact of the incorporation of background features (2-grams) on the performance of the neural system. Experimental results on real datasets indicate that the proposed method is highly efficient and is superior to other well-known methods for protein classification.

Algorithms↗

Automated ischemic beat classification using genetic algorithms and multicriteria decision analysis.

Cardiac beat classification is a key process in the detection of myocardial ischemic episodes in the electrocardiographic signal. In the present study, we propose a multicriteria sorting method for classifying the cardiac beats as ischemic or not. Through a supervised learning procedure, each beat is compared to preclassified category prototypes under five criteria. These criteria refer to ST segment changes, T wave alterations, and the patient's age. The difficulty in applying the above criteria is the determination of the required method parameters, namely the thresholds and weight values. To overcome this problem, we employed a genetic algorithm, which, after proper training, automatically calculates the optimum values for the above parameters. A task-specific cardiac beat database was developed for training and testing the proposed method using data from the European Society of Cardiology ST-T database. Various experimental tests were carried out in order to adjust each module of the classification system. The obtained performance was 91% in terms of both sensitivity and specificity and compares favorably to other beat classification approaches proposed in the literature.

Age Factors↗

Greedy mixture learning for multiple motif discovery in biological sequences.

MOTIVATION: This paper studies the problem of discovering subsequences, known as motifs, that are common to a given collection of related biosequences, by proposing a greedy algorithm for learning a mixture of motifs model through likelihood maximization. The approach adds sequentially a new motif to a mixture model by performing a combined scheme of global and local search for appropriately initializing its parameters. In addition, a hierarchical partitioning scheme based on kd-trees is presented for partitioning the input dataset in order to speed-up the global searching procedure. The proposed method compares favorably over the well-known MEME approach and treats successfully several drawbacks of MEME. RESULTS: Experimental results indicate that the algorithm is advantageous in identifying larger groups of motifs characteristic of biological families with significant conservation. In addition, it offers better diagnostic capabilities by building more powerful statistical motif-models with improved classification accuracy.

Algorithms↗

An ischemia detection method based on artificial neural networks.

An automated technique was developed for the detection of ischemic episodes in long duration electrocardiographic (ECG) recordings that employs an artificial neural network. In order to train the network for beat classification, a cardiac beat dataset was constructed based on recordings from the European Society of Cardiology (ESC) ST-T database. The network was trained using a Bayesian regularisation method. The raw ECG signal containing the ST segment and the T wave of each beat were the inputs to the beat classification system and the output was the classification of the beat. The input to the network was produced through a principal component analysis (PCA) to achieve dimensionality reduction. The network performance in beat classification was tested on the cardiac beat database providing 90% sensitivity (Se) and 90% specificity (Sp). The neural beat classifier is integrated in a four-stage procedure for ischemic episode detection. The whole system was evaluated on the ESC ST-T database. When aggregate gross statistics was used the Se was 90% and the positive predictive accuracy (PPA) 89%. When aggregate average statistics was used the Se became 86% and the PPA 87%. These results are better than other reported.

Automation↗

Use of a novel rule-based expert system in the detection of changes in the ST segment and the T wave in long duration ECGs.

The development of a new fast and robust computerised system is examined in detecting electrocardiogram (ECG) changes in long duration ECG recordings. The system distinguishes these changes between ST-segment deviation and T-wave alterations and can support the produced diagnosis by providing explanations for the decisions made. The European Society of Cardiology ST-T Database was used for evaluating the performance of the system. Sensitivity and positive predictive accuracy were the performance measures used and the proposed system scored 92.02% and 93.77%, respectively, in detecting ST-segment episodes and 91.09% and 80.09% in detecting T-wave episodes. By using the chi-square test we also compared the performance of the system between ECG recordings with minimal and substantial amount of noise. The sensitivity of the proposed system is higher than of other algorithms reported in the literature and the positive predictive accuracy is comparable to, or better than, most of them.

Algorithms↗

Mixture of experts classification using a hierarchical mixture model.

A three-level hierarchical mixture model for classification is presented that models the following data generation process: (1) the data are generated by a finite number of sources (clusters), and (2) the generation mechanism of each source assumes the existence of individual internal class-labeled sources (subclusters of the external cluster). The model estimates the posterior probability of class membership similar to a mixture of experts classifier. In order to learn the parameters of the model, we have developed a general training approach based on maximum likelihood that results in two efficient training algorithms. Compared to other classification mixture models, the proposed hierarchical model exhibits several advantages and provides improved classification performance as indicated by the experimental results.

Algorithms↗