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 20 of 33 for “"Robust clustering"”.

  1. Robust clustering algorithms

    One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across any different fields ranging from computational biology to social sciences to computer vision in part because they are simple and their output is easy to interpret. …

    gatech Repository record for Robust clustering algorithms (opens in a new tab)

  2. Modelling Inference Strategies and Robust Clustering Topologies

    … limited to) mixture models which can be used for clustering, and linear Gaussian models which can be used for dimensionality reduction. Clustering aims to find some underlying groups within a data set, where data points that belong to the same group (also called a cluster) are more ‘similar’ to …

    aston Download PDF for Modelling Inference Strategies and Robust Clustering Topologies (opens in a new tab)

  3. Robust Clustering Algorithm by Inner Product Scaling

    本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである

    kyoto Repository record for Robust Clustering Algorithm by Inner Product Scaling (opens in a new tab)

  4. An Efficient Implementation of a Robust Clustering Algorithm

    Clustering and classification are fundamental problems in statistical and machine learning, with a broad range of applications. A common approach is the Gaussian mixture model, which assumes that each cluster or class arises from a distinct Gaussian distribution. This thesis studies a robust, …

    mcmaster Repository record for An Efficient Implementation of a Robust Clustering Algorithm (opens in a new tab)

  5. Harnessing Sparse and Low-Dimensional Structures for Robust Clustering of Imagery Data

    We propose a robust framework for clustering data. In practice, data obtained from real measurement devices can be incomplete, corrupted by gross errors, or not correspond to any assumed model. We show that, by properly harnessing the intrinsic low-dimensional structure of the data, these kinds of …

    uiuc Repository record for Harnessing Sparse and Low-Dimensional Structures for Robust Clustering of Imagery Data (opens in a new tab)

  6. Analyzing complex relationships in time series: clustering, causal discovery, and root cause analysis

    … areas of analysis: classification through robust clustering of noisy data, forecasting by discovering causality in non-linear systems, and root cause analysis by leveraging causal models. Firstly, we present a \textbf{robust clustering} to identify and group similar patterns within noisy …

    iastate Repository record for Analyzing complex relationships in time series: clustering, causal discovery, and root cause analysis (opens in a new tab)

  7. An Evaluation of Clustering Algorithms for Modeling Game-Based Assessment Work Processes

    … well k-means, self-organizing maps (SOM), and robust clustering using links (ROCK) clustering algorithms group response patterns in prototypical GBA response data. Results from a simulation study are discussed, and a tutorial is provided with recommendations of general considerations and best …

    maryland Repository record for An Evaluation of Clustering Algorithms for Modeling Game-Based Assessment Work Processes (opens in a new tab)

  8. Robust approach to object recognition through fuzzy clustering and hough transform based methods

    … images is considered. The emphasis is on the robust detection of shapes such as cylinders, spheres, cones, and planar surfaces, typically found in mechanical and manufacturing engineering applications. Based on the analyses of different HT methods, a novel method, called the Fast Randomized …

    njit Repository record for Robust approach to object recognition through fuzzy clustering and hough transform based methods (opens in a new tab)

  9. Impact of Quality Performance on Financial Risk and Cost of Capital in Hospitals

    … average cost of debt using OLS and the Stata 11 robust clustering function to adjust for repeated occurrences of hospitals across years. The data base consisted of acute care hospitals with interest expense observed over the three year period 2008 - 2010 (n=3420). Control variables included a …

    uab Repository record for Impact of Quality Performance on Financial Risk and Cost of Capital in Hospitals (opens in a new tab)

  10. Robust Inference via Lq-Likelihood

    Robust inference is of great importance in modern statistics. In this dissertation, we introduce a series of robust statistical procedures based on the concept of Lq-likelihood. The Lq-likelihood function partially preserves the desired properties of the log-likelihood function. Moreover, it …

    jhu Repository record for Robust Inference via Lq-Likelihood (opens in a new tab)

  11. An application of machine learning to statistical physics: from the phases of quantum control to satisfiability problems

    … phases described. We end by presenting a novel clustering framework, termed HAL for hierarchical agglomerative learning, which exploits out-of-sample accuracy estimates of machine learning classifiers to perform robust clustering of high-dimensional data. We show applications of HAL to various …

    bu Repository record for An application of machine learning to statistical physics: from the phases of quantum control to satisfiability problems (opens in a new tab)

  12. Robustification of the sparse K-means clustering algorithm

    Searching a dataset for the ‘‘natural grouping / clustering’’ is an important explanatory technique for understanding complex multivariate datasets. One might expect that the true underlying clusters present in a dataset differ only with respect to a small fraction of the features. Furthermore, one …

    ubc Repository record for Robustification of the sparse K-means clustering algorithm (opens in a new tab) Download PDF for Robustification of the sparse K-means clustering algorithm (opens in a new tab)

  13. Efficient Suspicious Region Segmentation Algorithm for Computer Aided Diagnosis of Breast Cancer based on Tomosynthesis Imaging

    … from the breast volume using efficient and robust clustering algorithms.A partial differential equation based non-linear diffusion method was modified to include the anisotropic nature of tomosynthesis data in order to filter out the out-of-plane artifacts, which are termed "tomosynthetic …

    usf Repository record for Efficient Suspicious Region Segmentation Algorithm for Computer Aided Diagnosis of Breast Cancer based on Tomosynthesis Imaging (opens in a new tab)

  14. Robust methods for analyzing multivariate responses with application to time-course data

    … We use Huber's loss function in developing robust methods for time-course multivariate responses. We use spline basis expansion of the time-varying regression coefficients to reduce dimensionality, and downweight the influence of outliers with Huber's loss function on vectors of residuals. …

    uiuc Repository record for Robust methods for analyzing multivariate responses with application to time-course data (opens in a new tab)

  15. Multi-Center Federated Learning to Cluster Clients with non-IID data

    … to solve non-IID challenges using a client clustering method in the FL context. However, even adopts a client clustering FL method still facing minor problems such as unstable against client-wise outliers and the drop of model performance with model poisoning attack. To face the …

    uts Repository record for Multi-Center Federated Learning to Cluster Clients with non-IID data (opens in a new tab)

  16. Scalable Learning in Latent State Sequence Models

    … latent variables of many time series when clustering. Existing Bayesian methods for learning clusters of time series either mix slowly (naive Gibbs) or scale cubically in the number of dimensions (collapsed Gibbs). We propose an approximate collapsed Gibbs sampling scheme that improves …

    washington Repository record for Scalable Learning in Latent State Sequence Models (opens in a new tab)

  17. Algorithms for recovery in the presence of outliers

    … data consists of arbitrary outliers. Classical robust statistics had considered this problem before and focused on finding estimators that minimize the sample complexity until very recently. Even simple problems such as Gaussian mean estimation were thought to be potentially computationally …

    texas Repository record for Algorithms for recovery in the presence of outliers (opens in a new tab)

  18. Leveraging Natural Language Processing Methods for Next Generation Customer Service in Telecommunications Industry

    … the same word embedding methods applied to text clustering: we compare Self-Organising Map (SOM), K-means, K-medoids, BIRCH, and Gaussian Mixture models on different embeddings, and study the effect of various feature engineering approaches on clustering results. Also, we propose new effective …

    plymouth Repository record for Leveraging Natural Language Processing Methods for Next Generation Customer Service in Telecommunications Industry (opens in a new tab)

  19. Scalable Frameworks and Algorithms for Cluster Ensembles and Clustering Data Streams

    Clustering algorithms are an important tool for data mining and data analysis purposes. Clustering algorithms fall under the category of unsupervised learning algorithms, which can group patterns without an external teacher or labels using some kind of similarity metric. Clustering algorithms are …

    usf Repository record for Scalable Frameworks and Algorithms for Cluster Ensembles and Clustering Data Streams (opens in a new tab)

  20. Signal Processing for Time Series of Functional Magnetic Resonance Imaging

    … gray and white matter. To this end, we propose a robust clustering method for automatic classification of perfusion compartments. The method is first to apply a robust principal component analysis to reduce dimension and then to use a mixture model of multivariate T distribution for clustering. …

    duke Repository record for Signal Processing for Time Series of Functional Magnetic Resonance Imaging (opens in a new tab)

Page 1 of 2