We study an uplink multiuser multiple-input multiple-output (MU-MIMO) system with one-bit analog-to-digital converters (ADCs). In this system, we recently proposed a supervised-learning (SL) detector by modeling a non...
详细信息
ISBN:
(纸本)9781728123738
We study an uplink multiuser multiple-input multiple-output (MU-MIMO) system with one-bit analog-to-digital converters (ADCs). In this system, we recently proposed a supervised-learning (SL) detector by modeling a non-linear end-to-end system function into a parameterized Bernoulli-like model. Despite its attractive performance, the SL detector requires a large amount of labeled data (i.e., pilot signals) to accurately estimate the parameters of the underlying model, since the amount of the parameters grow exponentially with the number of users. In this paper, we address this problem by presenting a semi-supervised learning (SSL) detector where both pilot signals (i.e., labeled data) and some part of data signals (i.e., unlabeled data) are exploited to estimate the parameters via expectation-maximization (em) algorithm. Simulation results demonstrate that the proposed SSL detector can achieve the performance of the existing SL detector with significantly lower pilot-overhead.
The development of satellites with the strong temporal repetitiveness and development of remote sensing techniques resulted in the advancement of change detection techniques from geospatial imagery. The natural events...
详细信息
ISBN:
(纸本)9781728140643
The development of satellites with the strong temporal repetitiveness and development of remote sensing techniques resulted in the advancement of change detection techniques from geospatial imagery. The natural events cause many modifications in the control process of the ecosystems. There is a necessity of using a method capable to map, categorize and monitor areas affected by natural events along time. In this article, a novel methodology of change detection is proposed in order to improve the change detection from multi-date satellite image using the source separation. The results obtained by our methodology are efficient and effective.
We address the issue of selecting automatically the number of components in mixture models with non-Gaussian components. As a more efficient alternative to the traditional comparison of several model scores in a range...
详细信息
ISBN:
(纸本)9789811519604;9789811519598
We address the issue of selecting automatically the number of components in mixture models with non-Gaussian components. As a more efficient alternative to the traditional comparison of several model scores in a range, we consider procedures based on a single run of the inference scheme. Starting from an overfitting mixture in a Bayesian setting, we investigate two strategies to eliminate superfluous components. We implement these strategies for mixtures of multiple scale distributions which exhibit a variety of shapes not necessarily elliptical while remaining analytical and tractable in multiple dimensions. A Bayesian formulation and a tractable inference procedure based on variational approximation are proposed. Preliminary results on simulated and real data show promising performance in terms of model selection and computational time.
In software defined networking (SDN) data centers, collecting real-time routing information of different traffic flows for tomography of data centers requires an up-to-date knowledge of every link. However, traditiona...
详细信息
ISBN:
(纸本)9781538679630
In software defined networking (SDN) data centers, collecting real-time routing information of different traffic flows for tomography of data centers requires an up-to-date knowledge of every link. However, traditional techniques are mostly not covering traffic matrix (TM) estimation for specific traffic types. This paper proposes an approach to construct a tomography agent to estimate and manage traffic flows through the data center network. For this aim, we regenerated the traffic matrix according to three different traffic types (bandwidth-sensitive, delay-sensitive, best-effort) and taking into account delay information obtained from the Markov chain M/G/1 priority queuing method both for link count and traffic matrix. Consequently, after regeneration step, we use Expectation Maximization approach for iteratively estimate the traffic matrix. In addition, regarding to estimated traffic matrix, by using Max-Min fairness method and definition of flow utility function, our simulation results in reduction in end-to-end routing delay and also flow utility enhancement.
Despite its long history of success, the em algorithm has been vulnerable to local entrapment when the posterior/likelihood is multi-modal. This is particularly pronounced in spike-and-slab posterior distributions for...
详细信息
Despite its long history of success, the em algorithm has been vulnerable to local entrapment when the posterior/likelihood is multi-modal. This is particularly pronounced in spike-and-slab posterior distributions for Bayesian variable selection. The main thrust of this article is to introduce the particle em algorithm, a new population-based optimization strategy that harvests multiple modes in search spaces that present many local maxima. Motivated by nonparametric variational Bayes strategies, particle em achieves this goal by deploying an ensemble of interactive repulsive particles. These particles are geared toward uncharted areas of the posterior, providing a more comprehensive summary of its topography than simple parallel em deployments. A sequential Monte Carlo variant of particle em is also proposed that explores a sequence of annealed posteriors by sampling from a set of mutually avoiding particles. Particle em outputs a deterministic reconstruction of the posterior distribution for approximate fully Bayes inference by capturing its essential modes and mode weights. This reconstruction reflects model selection uncertainty and is supported by asymptotic considerations, which indicate that the requisite number of particles need not be large in the presence of sparsity (when p > n). Supplementary materials for this article are available online.
We propose here a robust multivariate extension of the bivariate Birnbaum-Saunders (BS) distribution derived by Kundu et al. [Bivariate Birnbaum-Saunders distribution and associated inference. J Multivariate Anal. 201...
详细信息
We propose here a robust multivariate extension of the bivariate Birnbaum-Saunders (BS) distribution derived by Kundu et al. [Bivariate Birnbaum-Saunders distribution and associated inference. J Multivariate Anal. 2010;101:113-125], based on scale mixtures of normal (SMN) distributions that are used for modelling symmetric data. This resulting multivariate BS-type distribution is an absolutely continuous distribution whose marginal and conditional distributions are of BS-type distribution of Balakrishnan et al. [Estimation in the Birnbaum-Saunders distribution based on scalemixture of normals and the em algorithm. Stat Oper Res Trans. 2009;33:171-192]. Due to the complexity of the likelihood function, parameter estimation by direct maximization is very difficult to achieve. For this reason, we exploit the nice hierarchical representation of the proposed distribution to propose a fast and accurate em algorithm for computing the maximum likelihood (ML) estimates of the model parameters. We then evaluate the finite-sample performance of the developed em algorithm and the asymptotic properties of the ML estimates through empirical experiments. Finally, we illustrate the obtained results with a real data and display the robustness feature of the estimation procedure developed here.
The Connectionist Temporal Classification (CTC) technique can be used to train a neural-network based speech recognizer. When the technique is used to train a phoneme recognizer, it is required that training data shou...
详细信息
ISBN:
(纸本)9781450376570
The Connectionist Temporal Classification (CTC) technique can be used to train a neural-network based speech recognizer. When the technique is used to train a phoneme recognizer, it is required that training data should be annotated with phoneme-level labels. This is not feasible if large speech databases are used. One approach to make use of such speech data is to convert the word-level transcriptions into phoneme-level labels, followed by a CTC training. The problem of this approach is that the converted phonemelevel labels may mismatch the audio content of the speech data. This paper uses a probabilistic model to describe the probability of observing the noisy phoneme-level labels given an utterance. The model consists of a neural network which predicts the probability of any phoneme sequence, and another so-called mismatch model to describe the probability of disturbing a phoneme sequence to another. Based on the Expectation-Maximization (em) framework, we propose a training algorithm which can simultaneously learn parameters of the neural-network and the mismatch model. Effectiveness of our method is verified by comparing recognition performance of our method with a conventional training method on TIMIT corpus.
A practical problem often encountered with observed count data is the presence of ex- cess zeros. Zero-inflation in count data can easily be handled by zero-inflated models, which is a two-component mixture of a point...
详细信息
A practical problem often encountered with observed count data is the presence of ex- cess zeros. Zero-inflation in count data can easily be handled by zero-inflated models, which is a two-component mixture of a point mass at zero and a discrete distribu- tion for the count data. In the presence of predictors, zero-inflated Poisson (ZIP) regression models are, perhaps, the most commonly used. However, the fully para- metric ZIP regression model could sometimes be restrictive, especially with respect to the mixing proportions. Taking inspiration from some of the recent literature on semiparametric mixtures of regressions models for flexible mixture modeling, we pro- pose a semiparametric ZIP regression model. We present an "em-like" algorithm for estimation and a summary of asymptotic properties of the estimators. The pro- posed semiparametric models are then applied to a data set involving clandestine methamphetamine laboratories and Alzheimer's disease.
Network entity landmark is the key foundation of IP geolocaiton which plays an important role in network security. Integrating multi-source landmarks to generate a landmark database with high IP coverage and high loca...
详细信息
ISBN:
(纸本)9781450376624
Network entity landmark is the key foundation of IP geolocaiton which plays an important role in network security. Integrating multi-source landmarks to generate a landmark database with high IP coverage and high location accuracy is an important solution for improving the IP geolocation effect. However, the city-level landmarks provide the city name while street-level landmarks provide the latitude and longitude where they located. Owning to their inconsistent format, the state-of-art fusion algorithm cannot effectively integrate the two types of data. Hence, this paper proposes Lusion, a multi-source landmark fusion algorithm. We first extend the IP addresses in the landmark data sources, then model the location data of the two types of landmarks using the landmark location mixture model, and finally use the expectation -maximization algorithm to estimate the location of the landmarks. The simulation experiments on 25 landmark data sources show that the algorithm can effectively integrate the city-level and street-level landmarks from different data sources, and have a significantly better performance than the original data sources in the location accuracy. Furthermore, we evaluate Lusion on real-world datasets, which consists of 7 city-level and 3 street-level landmark data sources, by locating 100 IP addresses in Hong Kong and Zhengzhou respectively. The geolocation results show that Lusion increased the city-level accuracy by at least 8 percentage points compared with the original data sources, and reduces the geolocation error from 3.42 km to 2.92 km based on the best original landmark data set.
This paper applies a new expectation maximization(em) based identification method to estimate a generic Fitz Hugh-Nagumo(FHN) model under unknown Gaussian measurement *** is well noted that such FHN model is an el...
详细信息
This paper applies a new expectation maximization(em) based identification method to estimate a generic Fitz Hugh-Nagumo(FHN) model under unknown Gaussian measurement *** is well noted that such FHN model is an elementary neuronal dynamics description and plays a significant role in deep understanding and basic analysis for complicated mechanisms of some neural *** from the most existing relevant identification methods,the applied new method is additionally capable of supplying users with variance estimation for the unknown measurement noise corrupting on the membrane potential apart from model parameter *** unknown parameters can be iteratively estimated by a particle smoothing based em algorithm,which consists of an expectation(E) step and a maximization(M) *** joint-state particles are produced by a new particle smoothing algorithm to evaluate an expectation of a log-likelihood function in the E step,and the model parameters and noise variance can then be efficiently optimized by the gradient based methods in the M *** resulting estimations own global convergence for a relatively wide range of parameter ***,good convergence behaviors of the estimated model parameters and noise variance are demonstrated by a numerical simulation for a classic FHN model by using 10 simulation realizations with random initializations varying within ±100% of their respective true values.
暂无评论