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 415 for “"Number of clusters"”.

  1. PG-means : learning the number of clusters in data.

    … thesis. This algorithm is able to determine the number of clusters in a classical Gaussian mixture model automatically. PG-means uses efficient statistical hypothesis tests on one-dimensional projections of the data and model to determine if the examples are well represented by the model. In so …

    baylor Repository record for PG-means : learning the number of clusters in data. (opens in a new tab)

  2. DETERMINING THE OPTIMAL NUMBER OF CLUSTERS IN DATA ANALYSIS

    … all potential candidates for the optimal cluster number. A thorough analysis of the foundational principles of the proposed methodology develops the framework to yield diverse methodologies, all applicable to determining the optimal number of clusters. The ultimate objective of this section …

    nus Repository record for DETERMINING THE OPTIMAL NUMBER OF CLUSTERS IN DATA ANALYSIS (opens in a new tab) Download file for DETERMINING THE OPTIMAL NUMBER OF CLUSTERS IN DATA ANALYSIS (opens in a new tab)

  3. Bicriterion Clustering and Selecting the Optimal Number of Clusters via Agreement Measure

    … been important tools to address a broad range of problems in fields such as image analysis, genomics, and many other areas. Basically, these clustering problems can be simplified as two aspects. The first is to estimate the number of clusters. The second one is to allocate each observation to …

    uiuc Repository record for Bicriterion Clustering and Selecting the Optimal Number of Clusters via Agreement Measure (opens in a new tab)

  4. OptCluster : an R package for determining the optimal clustering algorithm and optimal number of clusters.

    … the best clustering algorithm and ideal number of clusters for a particular dataset is a fundamental difficulty in unsupervised clustering analysis. In biological research, data generated from Next Generation Sequencing technology and microarray gene expression data are becoming more and …

    louisville Repository record for OptCluster : an R package for determining the optimal clustering algorithm and optimal number of clusters. (opens in a new tab)

  5. Methods of Determining the Number of Clusters in a Data Set and a New Clustering Criterion

    … problem is to determine the best estimate of the number of clusters, which has a deterministic effect on the clustering results. However, a limitation in current applications is that no convincingly acceptable solution to the best-number-of-clusters problem is available due to high …

    vt Repository record for Methods of Determining the Number of Clusters in a Data Set and a New Clustering Criterion (opens in a new tab)

  6. An in depth evaluation of internal criteria for determining the number of clusters in a data set

    [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] Clustering procedures partition data sets into groups, minimizing the distance within clusters while maximizing the distance between clusters. Clustering can be a powerful tool for data reduction or hypothesis generation, …

    missouri Repository record for An in depth evaluation of internal criteria for determining the number of clusters in a data set (opens in a new tab)

  7. A Monte Carlo Study of the Effects of Number of Clusters and Level-2 Residual Distributions on Multilevel Models

    … common in educational research. But the accuracy of estimators and precision of statistical inference of HLM rely heavily on sufficiently large numbers of clusters, as well as the normality assumption of the residual distributions. The current study had two purposes. First, to synthesize the …

    umn Repository record for A Monte Carlo Study of the Effects of Number of Clusters and Level-2 Residual Distributions on Multilevel Models (opens in a new tab)

  8. Clustering Analysis of Zernike Coefficients From High Order Aberration Patients

    … fifteen Zernike coefficients using the method of clustering of linear regression models (CLM). EM algorithm is used to infer the maximum likelihood estimate of parameters for each cluster. Bayesian information criterion (BIC) combined with Bootstrapped maximum volume (BMV) criterion are used to …

    south-carolina Repository record for Clustering Analysis of Zernike Coefficients From High Order Aberration Patients (opens in a new tab)

  9. Graph-based estimation and inference for high-dimensional data

    … are becoming increasingly influential and are of considerable interest within the statistical community. Existing tools may be inadequate when confronted with high-dimensional data or lack theoretical support when the dimension increases. The graph-based approach is a framework that uses the …

    iastate Repository record for Graph-based estimation and inference for high-dimensional data (opens in a new tab)

  10. Skin Detection in Image and Video Founded in Clustering and Region Growing

    … have been involved for decades in search of an efficient skin detection method. Yet current methods have not overcome the major limitations. To overcome these limitations, in this dissertation, a clustering and region growing based skin detection method is proposed. These methods together …

    unt Repository record for Skin Detection in Image and Video Founded in Clustering and Region Growing (opens in a new tab)

  11. Bayesian Estimation of Correlation Matrices of Longitudinal Date and Variable Clustering

    Estimation of correlation matrices is a challenging problem due to the notorious positive-definiteness constraint and high-dimensionality. Reparameterising Cholesky factors of correlation matrices in terms of angles or hyperspherical coordinates where the angles vary freely in the range [0, π) has …

    tamu Repository record for Bayesian Estimation of Correlation Matrices of Longitudinal Date and Variable Clustering (opens in a new tab)

  12. Acoustic Emission Signal Classification for Gearbox Failure Detection

    The purpose of this research is to develop a methodology and technique to determine the optimal number of clusters in acoustic emission (AE) data obtained from a ground test stand of a rotating H-60 helicopter tail gearbox by using mathematical algorithms and visual inspection. Signs of fatigue …

    embry-riddle Repository record for Acoustic Emission Signal Classification for Gearbox Failure Detection (opens in a new tab)

  13. Attention based contrastive learning with non-Siamese architecture

    Learning compressed representations of higher-dimensional data for exploratory analysis and discovery of semantically meaningful information is a long-standing problem in computer vision. Self-supervised methods such as contrastive learning have been employed for model pre-training with good …

    iastate Repository record for Attention based contrastive learning with non-Siamese architecture (opens in a new tab)

  14. Generalized Clusterwise Regression for Simultaneous Estimation of Optimal Pavement Clusters and Performance Models

    The existing state-of-the-art approach of Clusterwise Regression (CR) to estimate pavement performance models (PPMs) pre-specifies explanatory variables without testing their significance; as an input, this approach requires the number of clusters for a given data set. Time-consuming ‘trial and …

    unlv Repository record for Generalized Clusterwise Regression for Simultaneous Estimation of Optimal Pavement Clusters and Performance Models (opens in a new tab) Download PDF for Generalized Clusterwise Regression for Simultaneous Estimation of Optimal Pavement Clusters and Performance Models (opens in a new tab)

  15. Clustering prediction for the ID-based clustering algorithm

    The field of clustering offers a very promising benefit to the field of multi-agent sensor networks. Within sensor networks, clustering is essential in creating a hierarchical structure to ad-hoc systems. Furthermore, in order to determine the necessary performance capabilities for the …

    texas Repository record for Clustering prediction for the ID-based clustering algorithm (opens in a new tab) Restricted access

  16. Information theoretic methods for clustering with applications to microarray data

    This thesis addresses selected aspects of cluster analysis, mainly for microarray data, that include: distance measures for clustering, measures for clustering comparison, estimation of the number of clusters and generation of multiple clustering solutions for a given data set. The primary …

    unsw Repository record for Information theoretic methods for clustering with applications to microarray data (opens in a new tab)

  17. Robust methods for inferring cluster structure in single cell RNA sequencing data

    … algorithms, are critical to the analysis of scRNA-seq datasets, enabling investigators to systematically define cell types based on similarities in global gene expression profiles. However, in robustly applying a clustering algorithm to identify and define cell types, two critical open …

    ubc Repository record for Robust methods for inferring cluster structure in single cell RNA sequencing data (opens in a new tab) Download file for Robust methods for inferring cluster structure in single cell RNA sequencing data (opens in a new tab)

  18. Separation index, variable selection and sequential algorithm for cluster analysis

    … cluster analysis: cluster validation, estimation of the number of clusters, variable weighting/selection, and generation of random clusters. Any clustering method can partition data into several subclusters. Hence it is important to have a method to validate obtained partitions. We propose a …

    ubc Repository record for Separation index, variable selection and sequential algorithm for cluster analysis (opens in a new tab) Download PDF for Separation index, variable selection and sequential algorithm for cluster analysis (opens in a new tab)

Page 1 of 21