Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"MM algorithm"”.
-
Optical Aberrations and their Effect on the Centroid Location of Unresolved Objects
… to quantify the accuracy of various centroiding algorithms in the presence of optical aberrations. The method of PSF simulation leverages Johnson distributions, which is a method of simulating distributions as a function of the desired mean, variance, skewness, and kurtosis. This method is chosen …
-
Integration of MEMS Sensors, WiFi, and Magnetic Features for Indoor Pedestrian Navigation with Consumer Portable Devices
… of dead-reckoning (DR) and magnetic matching (MM), including a threshold-based method and an adaptive Kalman filter based method. The DR/MM results were enhanced by 47.6 % - 67.9 % and 43.9 % - 65.4 % in two environments through the use of quality control. (c) It presents a profile-based WiFi …
-
Novel Computational Techniques for Semiparametric Analysis with Interval-Censored Data
… are considered. I develop two attractive MM algorithms that converge stably for these two scenarios. The first problem is statistical inference for clustered current status data, i.e., the case-I interval-censored data. Current status data abounds in the field of epidemiology and public …
-
Principal Components Analysis for Binary Data
… proposed two stable estimation procedures using MM algorithm and variational method. By considering the regularization technique, the selection of important variables is automatically achieved. We also proposed an efficient algorithm for model selection including the choice of the number of …
-
Quadratic Discriminant Analysis Revisited
… we propose an iterative majorize-minimize (MM) algorithm for classifiers of which conditional distributions are from the exponential family; in each iteration of the MM algorithm, a convex optimization problem needs to be solved. To solve the convex problem specially derived for QDA, we …
-
A Likelihood Based Framework for Data Integration with Application to eQTL Mapping
… correlation analysis (CCA) are interpreted. Algorithmically, a Majorization-Minimization (MM) algorithm with local linear approximation (LLA) to SCAD penalty is developed to effectively and efficiently solve the optimization problem involved, which produces closed-form updating rules. The …
-
Topics In Penalized Estimation
… or penalization, has become increasingly common in highdimensional statistical analysis over the past several years, where a common goal is to simultaneously select important variables and estimate their effects. This goal can be achieved by minimizing some parameter-dependent "goodness of …
-
Rank constrained denoising in magnetic resonance imaging
… We propose a fast novel majorize-minimize (MM) algorithm to solve the resulting optimization problem by majorizing the log-likelihood from the noncentral distribution, leading to a new optimization problem that can be solved eff ciently. Simulations based on numerical phantoms and real ex …
-
Efficient Algorithms for Sparse Statistical Learning
… is challenging and requires innovative algorithms to compute solutions both accurately and efficiently. This thesis presents a suite of algorithms and computational techniques for a range of sparse statistical models designed to address these challenges. These algorithms leverage the …
-
Clustering moving entities in euclidean space
… consider two clustering problems, k-Center and k-MM, where the goal is to minimize the maximum value of the objective function over the duration of motion for the worst-case input X. We show that both problems are NP-hard when k is an arbitrary input parameter, even when the motion is restricted …
-
Sparse Group Lasso for Variable Selection in Finite Gaussian Mixture Regression Models
… procedure through a Majorization-Minimization algorithm. Simulation studies demonstrate our proposed method's effectiveness in retaining relevant covariates and accuracy in clustering observations into subpopulations. We apply our proposed method to a Chiroptera (bat) dataset for identifying …
-
Dimension reduction methods for nonlinear association analysis with applications to omics data
… coordinate descent algorithms to compute the loadings in the CDCA and sCDCA methods. Simulation studies show that the proposed CDCA and sCDCA approaches have better performance than classical CCA and sparse CCA (sCCA) in nonlinear settings and have similar performance …
-
Aerodynamic shape optimization by multi-fidelity modeling and manifold mapping
… work, a computationally efficient optimization algorithm for aerodynamic design is presented. In our approach, direct optimization of a computationally expensive model is replaced by an iterative updating and re-optimization of a fast physics-based replacement model, following the …
-
Decode phenome-genome interactions : a data science approach
… remove the irrelevant latent factors and add immediate interpretability. This means for a single genotype, the observed latent factors will likely reflect the effects of environmental or developmental effects on mechanistic interconnections. Also, these low-dimensional structure/ latent factors …
-
Big Data Algorithms for Visualization and Supervised Learning
… in machine learning and data mining communities are faced with numerous challenges, since the data mining and machine learning tools designed for standard desktop computers are not capable of addressing these problems due to memory and time constraints. As a result, there exists an …
-
Intelligent Reflecting Surface Assisted Communications
… as a transformative technology in wireless communications, providing flexibility and efficiency in reconfiguring wireless propagation environments. This research aims to improve the performance of IRS assisted communication networks, such as the secure transmission in unmanned aerial vehicle …
-
Multi-Sensor Map Matching Techniques for Autonomous Land Vehicle Navigation
… accelerometers and one vertical gyro. The algorithm starts with stereo Visual Odometry to estimate six Degree of Freedom (DoF) ego motion including rotation and translation parameters to register the point clouds from previous epoch to the current epoch. Afterwards, a Generalized Iterative …
-
Transitions in new technology and market structure: applications and new methods for discrete choice model estimation
… method based on the Minorization-Maximization (MM) algorithm to address the prohibitive computational challenge of estimating over one million fixed effects in such a nonlinear model. Results show that over a short horizon (within a quarter), the probability of using card increases with …