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 702 for “"Clustering algorithms"”.

  1. Scalable clustering algorithms

    Scalable clustering algorithms that can work with a wide variety of distance measures and also incorporate application specific requirements are critically important for modern day data analysis and predictive modeling. In this thesis, we propose and analyze a large class of such algorithms, …

    texas Repository record for Scalable clustering algorithms (opens in a new tab)

  2. 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)

  3. Neuroengineering of Clustering Algorithms

    … divided into multivariate data visualization, clustering algorithms, and cluster validation. This dissertation contributes neural network-based techniques to perform all three unsupervised learning tasks. Particularly, the first paper provides a comprehensive review on adaptive resonance theory …

    must-thes Repository record for Neuroengineering of Clustering Algorithms (opens in a new tab)

  4. Co-clustering algorithms : extensions and applications

    Co-clustering is rather a recent paradigm for unsupervised data analysis, but it has become increasingly popular because of its potential to discover latent local patterns, otherwise unapparent by usual unsupervised algorithms such as k-means. Wide deployment of co-clustering, however, requires …

    texas Repository record for Co-clustering algorithms : extensions and applications (opens in a new tab)

  5. Large-scale clustering: algorithms and applications

    Clustering is a central problem in unsupervised learning for discovering interesting patterns in the underlying data. Though there have been numerous studies on clustering methods, the focus of this dissertation is on developing efficient clustering algorithms for large-scale applications such as …

    texas Repository record for Large-scale clustering: algorithms and applications (opens in a new tab)

  6. Alternative Clustering Algorithms in Sensor Networks

    … the shortest path. In this paper, we study two clustering techniques, namely kmedian clustering and k-center clustering for a wireless sensor network. All the sensor nodes are static and homogeneous (having the same specifications) and SHs are assumed to be heterogeneous with respect to other …

    ndsu Repository record for Alternative Clustering Algorithms in Sensor Networks (opens in a new tab)

  7. Model Based Clustering Algorithms with Applications

    … Wutao, et al. ”A Non-parametric Hidden Markov Clustering Model with Applications to Time Varying User Activity Analysis.” ICMLA2015 (1) Wei,Wutao, et al. ”Dynamic Bayesian predictive model for box office forecasting.” IEEE Big Data 2017. (2) Wei, Wutao, Bowei Xi, and Murat Kantarcioglu. …

    purdue-thes Repository record for Model Based Clustering Algorithms with Applications (opens in a new tab)

  8. Spatial clustering algorithms for areal data

    … aim of this thesis is to develop new spatial clustering approaches which can simultaneously identify different areal clusters and guarantee their geographical contiguity. The second aim is to adjust the finite mixture model in order to cope with the issues caused by outliers or singletons …

    glasgow Download PDF for Spatial clustering algorithms for areal data (opens in a new tab)

  9. Clustering Algorithms for Identifying Favourite Places

    … which need to be processed and analysed. Cluster algorithms group objects in such a way that objects in the same cluster are more similar to each other than to those in other groups. They are essential for processing data and become especially useful when looking to identify important places from …

    chalmers Repository record for Clustering Algorithms for Identifying Favourite Places (opens in a new tab)

  10. Hybrid and adaptive genetic fuzzy clustering algorithms

    This thesis proposes several effective clustering algorithms mainly based on genetic algorithms (GAs). A genetically guided clustering approach using an adaptive GA is proposed. The dynamic population size and varying crossover and mutation probabilities during the evolutionary process improve the …

    nus Repository record for Hybrid and adaptive genetic fuzzy clustering algorithms (opens in a new tab) Download file for Hybrid and adaptive genetic fuzzy clustering algorithms (opens in a new tab)

  11. Relational data clustering algorithms with biomedical applications

    … three main issued related to relational data clustering and analysis: (i) adapting the Kohonen Self-Organizing Maps (SOM) to relational data and incorporating a fuzzy membership function, which results in a new algorithm called Relational Fuzzy SOM (RFSOM); (ii) proposing a new technique to …

    missouri Repository record for Relational data clustering algorithms with biomedical applications (opens in a new tab)

  12. Model-based clustering algorithms, performance and application

    … of this thesis are the development of new clustering algorithms (with cluster validation) both off-line and on-line, the performance analysis of the new algorithms and their applications to intrapulse analysis. Bayesian inference and minimum encoding inference including Wallace's minimum …

    mcmaster Repository record for Model-based clustering algorithms, performance and application (opens in a new tab)

  13. Non-Redundant Overlapping Clustering: Algorithms and Applications

    Given a dataset, traditional clustering algorithms often only provide a single partitioning or a single view of the dataset. On complex tasks, many different clusterings of a dataset exist, thus alternative clusterings which are of high quality and different from given trivial clusterings are asked …

    trento Repository record for Non-Redundant Overlapping Clustering: Algorithms and Applications (opens in a new tab)

  14. Hierarchical stability based model selection for clustering algorithms.

    … model based on the hierarchical analysis of clustering stability. Our method extends the concept of clustering stability to a concept of hierarchical stability. The method estimates a stable model for the data based on analysis of stability; it then analyzes the stability of each component in …

    baylor Repository record for Hierarchical stability based model selection for clustering algorithms. (opens in a new tab)

  15. Modified K-means clustering algorithms for feature selection

    … in relation to the effectiveness of kmeans-based clustering methods. This research project aims to reduce the number of different features by clustering the D features into k (k < D) clusters, determining the cluster center to represent its members by finding the closest feature to the cluster …

    manitoba Repository record for Modified K-means clustering algorithms for feature selection (opens in a new tab)

  16. Asynchronous distributed clustering algorithms for wireless mesh network

    … data to the centre allows strong data analytics algorithms to be applied, but consumes battery power for the nodes, and may cause data overload. To avoid this, distributed methods try to learn within the network, allowing each agent to learn a global picture and take appropriate actions. For …

    cork Repository record for Asynchronous distributed clustering algorithms for wireless mesh network (opens in a new tab)

  17. Parallel implementation proposal of clustering algorithms in hardware

    Este trabalho apresenta um estudo sob algoritmos de clusterização de dados implementados em hardware dedicado para aplicações em geral, objetivando aumentar a velocidade de processamento. Algoritmos de clusterização têm sido amplamente adotados para encontrar a padrões entre dados, em diferentes …

    brazil-ufrn Repository record for Parallel implementation proposal of clustering algorithms in hardware (opens in a new tab)

  18. Monte Carlo validation of two genetic clustering algorithms

    … two newly developed genetic cluster analysis algorithms, GENCLUS and GENCLUS+, were validated by comparing their performance against that of three popular clustering techniques (Ward's method, K-means w/ random seeds, K-means w/Ward's centroids) and in an elaborate Monte Carlo study. …

    vt Repository record for Monte Carlo validation of two genetic clustering algorithms (opens in a new tab)

Page 1 of 36