Mixture of experts (ME) is a modular neural network architecture for supervised learning. This paper illustrates the use of ME network structure to guide model selection for classification of electroencephalogram (EEG...
详细信息
Mixture of experts (ME) is a modular neural network architecture for supervised learning. This paper illustrates the use of ME network structure to guide model selection for classification of electroencephalogram (EEG) signals. expectation-maximization (EM) algorithm was used for training the ME so that the learning process is decoupled in a manner that fits well with the modular structure. The EEG signals were decomposed into time-frequency representations using discrete wavelet transform and statistical features were calculated to depict their distribution. The ME network structure was implemented for classification of the EEG signals using the statistical features as inputs. To improve classification accuracy, the outputs of expert networks were combined by a gating network simultaneously trained in order to stochastically select the expert that is performing the best at solving the problem. Three types of EEG signals (EEG signals recorded from healthy volunteers with eyes open, epilepsy patients in the epileptogenic zone during a seizure-free interval, and epilepsy patients during epileptic seizures) were classified with the accuracy of 93.17% by the ME network structure. The ME network structure achieved accuracy rates which were higher than that of the stand-alone neural network models. (c) 2007 Elsevier Ltd. All rights reserved.
This paper illustrates the use of modified mixture of experts (MME) network structure to guide model selection for classification of Doppler ultrasound signals with diverse features. The MME is a modular neural networ...
详细信息
This paper illustrates the use of modified mixture of experts (MME) network structure to guide model selection for classification of Doppler ultrasound signals with diverse features. The MME is a modular neural network architecture for supervised learning. expectation-maximization (EM) algorithm was used for training the MME so that the learning process is decoupled in a manner that fits well with the modular structure. In practical applications of pattern recognition, there are often diverse features extracted from raw data which needs recognizing. Decision making was performed in two stages: feature extraction by spectral analysis methods (fast Fourier transform and model-based methods) and classification using the classifiers trained on the extracted features. In order to discriminate the Doppler ultrasound signals, the ability of designed and trained MME network structure combined with spectral analysis methods was explored. The MME achieved accuracy rates which were higher than that of the mixture of experts (ME) and feedforward neural network models (multilayer perceptron neural network-MLPNN). The proposed MME approach can be useful in classifying the Doppler ultrasound signals for early detection of arterial diseases. (C) 2007 Elsevier Inc. All rights reserved.
In this paper, we apply the EM algorithm for mitigation of multi-access interference (MAI) in asynchronous slow frequency-hop spread spectrum (FHSS) systems that employ binary frequency-shift keying (BFSK) modulation....
详细信息
In this paper, we apply the EM algorithm for mitigation of multi-access interference (MAI) in asynchronous slow frequency-hop spread spectrum (FHSS) systems that employ binary frequency-shift keying (BFSK) modulation. MAI occurs if the hopping patterns of the users are not orthogonal. We show that when FSK signals arrive asynchronously, the time offset exposes portions of the desired and interfering signals in a way that can be exploited to improve the decoder performance. We develop an iterative detection, estimation, and decoding scheme to recover the desired signal in the presence of MAI. We compare the performance of this algorithm with that of a conventional noncoherent BFSK transceiver and show that the EM-based algorithm is particularly effective in the presence of strong interfering signals and allows more users in a FHSS system.
We consider the problem of multitask learning (MTL), in which we simultaneously learn classifiers for multiple data sets (tasks), with sharing of intertask data as appropriate. We introduce a set of relevance paramete...
详细信息
We consider the problem of multitask learning (MTL), in which we simultaneously learn classifiers for multiple data sets (tasks), with sharing of intertask data as appropriate. We introduce a set of relevance parameters that control the degree to which data from other tasks are used in estimating the current task's classifier parameters. The set of relevance parameters are learned by maximizing their posterior probability, yielding an expectation-maximization (EM) algorithm. We illustrate the effectiveness of our approach through experimental results on a practical data set.
Given the very large amount of data obtained everyday through population surveys, much of the new research again could use this information instead of collecting new samples. Unfortunately, relevant data are often dis...
详细信息
Given the very large amount of data obtained everyday through population surveys, much of the new research again could use this information instead of collecting new samples. Unfortunately, relevant data are often disseminated into different files obtained through different sampling designs. Data fusion is a set of methods used to combine information from different sources into a single dataset. In this article, we are interested in a specific problem: the fusion of two data files, one of which being quite small. We propose a model-based procedure combining a logistic regression with an expectation-maximization algorithm. Results show that despite the lack of data, this procedure can perform better than standard matching procedures.
One of the most popular frameworks for the adaptive processing of data structures to date, was proposed by Frasconi et al. [Frasconi, P., Gori, M., & Sperduti, A. (1998). A general framework for adaptive processin...
详细信息
One of the most popular frameworks for the adaptive processing of data structures to date, was proposed by Frasconi et al. [Frasconi, P., Gori, M., & Sperduti, A. (1998). A general framework for adaptive processing of data structures. IEEE Transactions oil Neural Networks, 9(September), 768-785], who used a Backpropagation Through Structures (BPTS) algorithm [Goller, C., & Kuchler, A. (1996). Learning task-dependent distributed representations by back-propagation through structures. In Proceedings of IEEE international conference on neural networks (pp. 347-352);Tsoi, A. C. (1998). Adaptive processing of data structure: An expository overview and comments. Technical report in Faculty Informatics. Wollongong, Australia: University of Wollongong] to carry out supervised learning. This supervised model has been successfully applied to a number of learning tasks that involve complex symbolic structural patterns, such as image semantic structures, internet behavior, and chemical compounds. In this paper, we extend this model, using probabilistic estimates to acquire discriminative information from the learning patterns. Using this probabilistic estimation, smooth discriminant boundaries can be obtained through a process of clustering onto the observed input attributes. This approach enhances the ability of class discrimination techniques to recognize structural patterns. The proposed model is represented by a set of Gaussian Mixture Models (GMMs) at the hidden layer and a set of "weighted sum input to sigmoid function" models at the output layer. The proposed model's learning framework is divided into two phases: (a) locally unsupervised learning for estimating the parameters of the GMMs and (b) globally supervised learning for fine-tuning the GMMs' parameters and optimizing weights at the output layer. The unsupervised learning phase is formulated as a maximum likelihood problem that is solved by the expectation-maximization (EM) algorithm. The supervised learning phase
Maximum likelihood estimation of branching point process models via numerical optimization procedures can be unstable and computationally intensive. We explore an alternative estimation method based on the expectation...
详细信息
Maximum likelihood estimation of branching point process models via numerical optimization procedures can be unstable and computationally intensive. We explore an alternative estimation method based on the expectation-maximization algorithm. The method involves viewing the estimation of such branching processes as analogous to incomplete data problems. Using an application from seismology, we show how the epidemic-type aftershock sequence (ETAS) model can, in fact, be estimated this way, and we propose a computationally efficient procedure to maximize the expected complete data log-likelihood function. Using a space-time ETAS model, we demonstrate that this method is extremely robust and accurate and use it to estimate declustered background seismicity rates of geologically distinct regions in Southern California. All regions show similar declustered background intensity estimates except for the one covering the southern section of the San Andreas fault system to the east of San Diego in which a substantially higher intensity is observed.
We formulate likelihood-based ecological inference for 2 x 2 tables with missing cell counts as an incomplete data problem and study Fisher information loss by comparing estimation from complete and incomplete data. I...
详细信息
We formulate likelihood-based ecological inference for 2 x 2 tables with missing cell counts as an incomplete data problem and study Fisher information loss by comparing estimation from complete and incomplete data. In so doing, we consider maximum-likelihood (ML) estimators of probabilities governed by two independent binomial distributions and obtain simplified expressions for their covariance. These expressions reflect well the additional uncertainty arising from the unobserved data compared to complete data tables. We also discuss an approximation to the expected conditional variance of the unobserved entries and ML parameter bias correction. An empirical example is used to demonstrate the results.
Image mosaicing is an effective means of constructing a single panoramic image from a series of snapshots taken in different viewing angles. However, in the case of congested traffic scenes with a cluttered environmen...
详细信息
ISBN:
(纸本)9784907764302
Image mosaicing is an effective means of constructing a single panoramic image from a series of snapshots taken in different viewing angles. However, in the case of congested traffic scenes with a cluttered environment including vehicles or pedestrians, there are severe difficulties in aligning a pair of snapshots. In such cases, some objects would be taken only in one of the image pair, thereby resulting in failure in stitching the pair of images. This paper deals with three types of techniques for performing an image mosaicing: Homography estimation for determining geometrical relationships between the image pair, expectation-maximization algorithm for removing inconsistent overlapping region, and Dijkstra's algorithm to find the boundary for stitching the images together. Experimental results indicate that the proposed technique is effective to synthesize a panoramic image from a series of narrow-field-of-view snapshots.
The recently published Cramer-Rao lower bound for non-data-aided (NDA) estimation of the signal-to-noise ratio (SNR) reveals a considerable gap, when compared to the jitter performance of NDA algorithms available from...
详细信息
ISBN:
(纸本)9781424418756
The recently published Cramer-Rao lower bound for non-data-aided (NDA) estimation of the signal-to-noise ratio (SNR) reveals a considerable gap, when compared to the jitter performance of NDA algorithms available from the open literature. The maximum-likelihood (ML) solution derived in this paper closes this gap. However, the latter provides a set of two nonlinear vector equations, which might be simplified only for modulation schemes with constant envelope like M-ary PSK. For signals with nonconstant envelope, like 16-QAM as most prominent example in this respect, a much less complex approach based on the expectation-maximization (EM) principle is developed in this paper. In the medium SNR range, this bridges part of the performance gap mentioned previously. Over the full SNR range, we propose a hybrid algorithm, where the EM estimate is replaced by a moment-based method as soon as the true SNR drops below a predefined threshold.
暂无评论