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 57 for “"clustering quality"”.
-
A Theoretical Study of Clusterability and Clustering Quality
Clustering is a widely used technique, with applications ranging from data mining, bioinformatics and image analysis to marketing, psychology, and city planning. Despite the practical importance of clustering, there is very limited theoretical analysis of the topic. We make a step towards building …
-
Evaluating Clusterings by Estimating Clarity
In this thesis I examine clustering evaluation, with a subfocus on text clusterings specifically. The principal work of this thesis is the development, analysis, and testing of a new internal clustering quality measure called informativeness. I begin by reviewing clustering in general. I then …
-
Fast clustering of big data through successive bi-partitioning
… phenomena and discovering useful information. Clustering, one of the most used data mining techniques, is an unsupervised, iterative machine learning method used for statistical data analysis. A clustering process groups data into clusters with high similarity for data within each cluster but …
-
Distributed Document Clustering and Cluster Summarization in Peer-to-Peer Environments
… difficult challenges in distributed document clustering and cluster summarization. Mining large document collections poses many challenges, one of which is the extraction of topics or summaries from documents for the purpose of interpretation of clustering results. Another important challenge, …
-
Significant Feature Clustering
In this thesis, we present a new clustering algorithm we call <em>Significance Feature Clustering</em>, which is designed to cluster text documents. Its central premise is the mapping of raw frequency count vectors to discrete-valued significance vectors which contain values of -1, 0, or 1. These …
-
Subgraph Density and Graph Clustering
Graph clustering, also often referred to as network community detection, is an unsupervised learning task. It is the process of grouping vertices into sets of vertices that share common relations. Graph clustering is a pivotal topic in the field of network science. It has applications in various …
-
Quality analyses and improvement for fuzzy clustering and web personalization
… of web sites. In this thesis we first focus on clustering to obtain usage model from weblog data and investigate ways to improve the clustering quality. We also consider applications and focus on generating predictions through collaborative filtering which matches behavior of a current user with …
-
Modern aspects of unsupervised learning
… important due to the recent explosion of data. Clustering, a key topic in unsupervised learning, is a well-studied task arising in many applications ranging from computer vision to computational biology to the social sciences. This thesis is a collection of work exploring two modern aspects of …
-
Fuzzy Feature Interaction and Weighting in Subspace Cluster Analysis
… of feature weighting has been considered in clustering approach to address redundant and irrelevant features, feature interaction has recently become a new topic to be investigated to overcome feature dependencies in order to enhance the clustering quality. This thesis focuses on such …
-
Machine learning methods for pattern analysis and clustering
… is subsequently applied to the real-life clustering problems on the gene expression domain and the text document domain. The algorithm has shown significantly higher efficiency over other algorithms in the same family. A set of evaluation paradigms are studied and applied to evaluate the …
-
Nonnegative matrix factorization for clustering
… (NMF) can be extended to a general and efficient clustering method. Clustering is one of the fundamental tasks in machine learning. It is useful for unsupervised knowledge discovery in a variety of applications such as text mining and genomic analysis. NMF is a dimension reduction method that …
-
Mapreduce-Enabled Scalable Nature-Inspired Approaches for Clustering
… methodologies. Traditional data mining such as clustering methods do not scale well with larger data sizes and are computationally expensive in terms of memory and time. Clustering large data sets has received attention in the last few years in several application areas such as document …
-
Convolutional neural network architectures and training improvements: visual emotion recognition case /
… analysis based on dimensionality reduction and clustering quality evaluations. The dissertation also proposes a top-2 cross-sentiment measure for assessing prediction consistency without requiring ground-truth labels. The proposed model, training strategy, and consistency measure contribute to …
-
Gene expression pattern analysis
… Components Analysis (PCA), Hierarchical Clustering, Self Organizing Mapping (SOM) and Adaptive Resonance Theory 2 (ART-2). The four statistical methods are also applied to maize chloroplast protein expression data in greening process. PCA can reduce the dimensionality of data set. The …
-
Algorithmic approaches for efficiency and explainability in learning problems
… hardness is formally established, and efficient clustering-based algorithms are introduced, achieving improved trade-offs across the competing criteria compared to existing approaches. (3) In the time series clustering problem, a two-phase algorithm is proposed that first applies Sparse Gaussian …
-
Toward generalized and scalable relation extraction
… margin-based loss. This approach improves clustering quality and enables more accurate unsupervised relation discovery. Finally, we address Open-world Relation Extraction with MixORE, a two-phase framework designed for corpora containing a mixture of known and novel relations. MixORE …
-
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, …
-
Agglomerative clustering for community detection in dynamic graphs
Agglomerative Clustering techniques work by recursively merging graph vertices into communities, to maximize a clustering quality metric. The metric of Modularity coined by Newman and Girvan, measures the cluster quality based on the premise that, a cluster has collections of vertices more strongly …
-
Incremental clustering for trajectories
Trajectory clustering has played a crucial role in data analysis since it reveals underlying trends of moving objects. Due to their sequential nature, trajectory data are often received incrementally, e.g., continuous new points reported by GPS system. However, since existing trajectory clustering …
-
Scalable algorithms for correlation clustering on large graphs
Correlation clustering (CC) is a widely-used clustering paradigm, where objects are represented as graph nodes and clustering is performed based on relationships between objects (positive or negative edges between pairs of nodes). The CC objective is to obtain a graph clustering that minimizes the …
Page 1 of 3