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 92 for “"Clusterings"”.
-
Evaluating Clusterings by Estimating Clarity
… 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 review current clustering …
-
Bayesian nonparametric clusterings in relational and high-dimensional settings with applications in bioinformatics.
Recent advances in high throughput methodologies offer researchers the ability to understand complex systems via high dimensional and multi-relational data. One example is the realm of molecular biology where disparate data (such as gene sequence, gene expression, and interaction information) are …
-
Sample Size Evaluation and Comparison of K-Means Clusterings of RNA-Seq Gene Expression Data
… an existing area dedicated to comparing multiple clusterings from one or more clustering algorithms. However, there has been limited application of cluster comparisons to clusterings of RNA-Seq gene expression data. In particular, cluster comparisons are useful in order to test the differences …
-
INCREMENT - Interactive Cluster Refinement
… algorithm which utilizes user feedback to refine clusterings. INCREMENT is capable of improving clusterings produced by arbitrary clustering algorithms. The initial clustering provided is first sub-clustered to improve query efficiency. A small set of select instances from each of these …
-
Soft cluster ensembles
… focused on devising approaches that aceept hard clusterings as input. Also, there has been no comparison of combining accuracy on soft vs hard cluster ensembles. In this thesis we will show experimentally as well as intuitively that using soft clusterings as input does offer signficant …
-
Non-Redundant Overlapping Clustering: Algorithms and Applications
… 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 to have complementary views. The task is therefore a clear multi-objective optimization problem. However, …
-
Analysis of Removing Weak Associations During Consensus Clustering
Given multiple base clusterings of a dataset, e.g., as created by multiple clustering algorithms on the same data, consensus clustering aims to generate a single robust aggregated clustering. Consensus methods measure the strength of an association between two data objects based on how often the …
-
Evolutionary framework for DNA Microarry Cluster Analysis
… de datos y una herramienta de visualización de clusterings. El objetivo es crear un marco apropiado para la extracción de conocimiento a partir de datos provenientes de DNA-microarrays. Por una parte, el modelo evolutivo de clustering de nuestro framework es una alternativa novedosa que intenta …
-
Supervised Clustering With Structural Svms
… training clustering methods to produce desirable clusterings. Given sets of items and complete clusterings over these sets, a supervised clustering algorithm learns how to cluster future sets of items in a similar fashion, typically by changing the underlying similarity measure between item pairs. …
-
A cohesion-based clustering technique for categorical data
… high quality clusters which conform better to clusterings by human experts. For some well-known real datasets, CLUC even discovers clusterings identical to those provided by experts. Our results also indicate that CLUC is order insensitive in general and is scalable when the dataset grows in …
-
Learning from SOM Voronoi Tessellations: Applications to Density Estimation and Clustering
… CADJ guides the most sophisticated SOM-based clusterings. DMPrune offers intelligent graph pruning by assigning a score to each CADJ edge and, consulting their likelihood, monitors the impacts of edge removal to maximize edge sparsity while minimizing loss of cohesion in the most important …
-
Redundancy-aware learning of protein structure-function relationships
… learning approach for identifying substructure clusterings. The substructure clusterings identified by FASST allow for the automatic evaluation of substructure variability, the identification of distinct structural conformations and the selection of anomalous outlier structures within large …
-
Comparing crime hotspots at different areal resolutions in Strathclyde
… Rand index (a measure of similarity between clusterings) was calculated for each cluster method at the output area and data zone level. The results showed that there was not much similarity in the clusterings produced at the two different areal levels. At the output area level, the methods, …
-
The Role of Visual Clustering in Approximate Numerosity Perception
… solutions were remarkably consistent with their clusterings, with 52% of TSP solutions being perfectly congruent with their clusterings. Even when their solutions weren't perfectly congruent, they displayed high amounts of congruency, providing further support to the theory that people use the …
-
Megacity analysis: A clustering approach to classification
… values by generating an ensemble of 5,000 clusterings based on randomly imputed missing values. We compare these to clustering without imputation, the ensemble consensus or average clustering, and clusterings from previous studies in addition to identifying which cities are sensitive to …
-
The Shape Seeker Algorithm
… to the other algorithms by examining the clusterings it produces on several data sets.
-
Contributions to Unsupervised and Semi-Supervised Learning
… setting of its parameters. If the two resulting clusterings turn out to be close in some metric, it is concluded that the clustering algorithm and the setting of its parameters match the data set, and that clusterings obtained are meaningful. We study asymptotic properties of this method for …
-
Biological Networks: Modeling and Structural Analysis
… We discuss the various requirements that clusterings of biological networks are required to satisfy, design an algorithm for computing a clustering, and show that our clustering approach is robust and scalable. Moreover, we design a new algorithm to compute overlapping clustering rather …
-
Bayesian Inference for Discrete Structures
… obtaining distinct but statistically dependent clusterings in a common set of entities for different data types. The complexities of the partition space make standard methods for modeling dependence, such as correlation, infeasible. In this work, we show how statistically dependent partitions …
Page 1 of 5