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 278 for “"Data Clustering"”.

  1. Density Based Data Clustering

    <p>Data clustering is a data analysis technique that groups data based on a measure of similarity. When data is well clustered the similarities between the objects in the same group are high, while the similarities between objects in different groups are low. The data clustering technique is widely …

    csusb Repository record for Density Based Data Clustering (opens in a new tab)

  2. Feedback-Driven Data Clustering

    The acquisition of data and its analysis has become a common yet critical task in many areas of modern economy and research. Unfortunately, the ever-increasing scale of datasets has long outgrown the capacities and abilities humans can muster to extract information from them and gain new knowledge. …

    qucosa-diss

  3. Data clustering with pairwise constraints

    The classical unsupervised clustering is an ill-posed problem due to the absence of a unique clustering criteria. This issue can be addressed by introducing additional supervised information, usually casts in the form of pairwise constraints, to the clustering procedure. Depending on the sources, …

    msu

  4. Multiple Cooperative Swarms for Data Clustering

    Exploring a set of unlabeled data to extract the similar clusters, known as data clustering, is an appealing problem in machine learning. In other words, data clustering organizes the underlying data into different groups using a notion of similarity between patterns. A new approach to solve the …

    waterloo Repository record for Multiple Cooperative Swarms for Data Clustering (opens in a new tab)

  5. A hybrid methodology for data clustering

    … hybrid method for the searching for groups in data - a process referred to as cluster analysis. The Agglomerative - Partitional Clustering methodology (APC) proposed in this work is a novel solution to the clustering problem intended for use with large, noisy data sets and capable of recovering …

    city-london Download PDF for A hybrid methodology for data clustering (opens in a new tab)

  6. Big Data Clustering: Models and Applications

    This thesis presents frameworks for data clustering on big datasets that can arise in different real-world applications. The main contributions of this thesis can be divided into the following four areas of data clustering. Correlation clustering is a well-known problem that appears in different …

    mcmaster Repository record for Big Data Clustering: Models and Applications (opens in a new tab)

  7. Novel data clustering methods and applications

    … possible inferences from high-dimensional data sets has led over the past decades to the development of dimensionality reduction and data clustering techniques. Scientific and technological applications of clustering methodologies include among others bioinformatics, biomedical image …

    iastate Repository record for Novel data clustering methods and applications (opens in a new tab)

  8. On Parallelization of Categorical Data Clustering

    We study parallelization of categorical data clustering algorithms in an MPI platform. Clustering such data has been a daunting task even for sequential algorithms, mainly due to the challenges in finding suitable similarity/distance measures. We propose a parallel version of the k-modes algorithm, …

    concordia Download PDF for On Parallelization of Categorical Data Clustering (opens in a new tab)

  9. Data Clustering And Visualization Through Matrix Factorization

    <p>Clustering is traditionally an unsupervised task which is to find natural groupings or clusters in multidimensional data based on perceived similarities among the patterns. The purpose of clustering is to extract useful information</p> <p>from unlabeled data.</p> <p>In order to present the …

    wayne-thes Repository record for Data Clustering And Visualization Through Matrix Factorization (opens in a new tab)

  10. Relational data clustering algorithms with biomedical applications

    In real world problems some datasets can only be represented in a relational data matrix because either the underlying objects are unknown or objects cannot be represented as feature vectors. Unlike object-based datasets where we have a well defined set of features, relational data describes the …

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

  11. Multi-objective evolutionary algorithms for data clustering

    … use of Multi-Objective metaheuristics for the data-mining task of clustering. We �first investigate methods of evaluating the quality of clustering solutions, we then propose a new Multi-Objective clustering algorithm driven by multiple measures of cluster quality and then perform …

    east-anglia Download PDF for Multi-objective evolutionary algorithms for data clustering (opens in a new tab)

  12. APPLY DATA CLUSTERING TO GENE EXPRESSION DATA

    <p>Data clustering plays an important role in effective analysis of gene expression. Although DNA microarray technology facilitates expression monitoring, several challenges arise when dealing with gene expression datasets. Some of these challenges are the enormous number of genes, the …

    csusb Repository record for APPLY DATA CLUSTERING TO GENE EXPRESSION DATA (opens in a new tab)

  13. Data clustering and cleansing for bibliography analysis

    … in the research community. Several bibliography databases have been established, which automatically extract bibliography information and cited references from digital repositories. Maintaining, updating and correcting citation data in bibliography databases is an important and ever-increasing …

    unsw Repository record for Data clustering and cleansing for bibliography analysis (opens in a new tab)

  14. Isotropy criteria and algorithms for data clustering

    Given a set of points, the goal of data clustering is to group them into clusters, such that the internal homogeneity of points within each cluster contrasts to inter-cluster heterogeneity. Over the last fifty years, many methods for data clustering have been developed in diverse scientific …

    uiuc Repository record for Isotropy criteria and algorithms for data clustering (opens in a new tab)

  15. Longitudinal Data Clustering Via Kernel Mixture Models

    … and dependent bivariate longitudinal data. The Gaussian distribution in finite mixture models is replaced by the Gaussian and gamma kernel functions, and the expectation-maximization algorithm is used to estimate bandwidths and compute log-likelihood scores. For dependent bivariate …

    mcmaster Repository record for Longitudinal Data Clustering Via Kernel Mixture Models (opens in a new tab)

  16. Spectral Descriptors for Data Clustering and Classification

    … either local or global geometric information of data. While the overwhelming majority of work on spectral descriptors has concentrated primarily on image/shape retrieval and object recognition, the goal of this work is to introduce efficient algorithms for data classification and clustering in …

    concordia Download PDF for Spectral Descriptors for Data Clustering and Classification (opens in a new tab)

  17. Functional Mixed Data Clustering with Fourier Basis Smoothing

    Clustering is an important analytical technique that has proven to affect human life positively through its application in cancer research, market segmentation, city planning etc. In this time of growing technological systems, mixed data has seen another face of longitudinal, directional and …

    etsu Repository record for Functional Mixed Data Clustering with Fourier Basis Smoothing (opens in a new tab) Download PDF for Functional Mixed Data Clustering with Fourier Basis Smoothing (opens in a new tab)

  18. Optimization under uncertainty with application to data clustering

    … also suggests the methods to be applied to a data clustering problem. This is a very hard problem with two of the main difficulties being lack of scalability with respect to amount of data and problems with high dimensionality. The new algorithms are found to be effective for solving this …

    iastate Repository record for Optimization under uncertainty with application to data clustering (opens in a new tab)

  19. Data Clustering and Graph-Based Image Matching Methods

    This thesis describes our novel methods for data clustering, graph characterizing and image matching. In Chapter 3, our main contribution is the M1NN agglomerative clustering method with a new parallel merging algorithm. A cluster characterizing quantity is derived from the path-based dissimilarity …

    whiterose Download PDF for Data Clustering and Graph-Based Image Matching Methods (opens in a new tab)

  20. Dynamic Online Data Clustering for Object -Oriented Databases

    … the benefits and the penalties of dynamic online clustering, and database system parameters. The shortcomings of the existing implementations are discovered by qualitatively analyzing the resource consumption of each dynamic online clustering component, and then improvements are developed based on …

    uiuc Repository record for Dynamic Online Data Clustering for Object -Oriented Databases (opens in a new tab)

Page 1 of 14