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 30 for “"constrained clustering"”.
-
EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING
This thesis investigates the following general constrained clustering problem: given a dimension $d$, an $L^p$-norm, a set $X\subset\R^d$, a positive integer $k$ and a finite set $\mathcal M\subset\N$, find the optimal $k$-partition $\{A_1,...,A_k\}$ of $X$ w.r.t. the $L^p$-norm satisfying …
-
Solution of Constrained Clustering Problems through Homotopy Tracking
… fundamental machine learning problem, effective clustering under constraints. The first part of this thesis provides an empirical survey of several popular optimization algorithms, along with one approach that is cutting-edge. These algorithms are tested against deeply challenging real-world …
-
Constrained Clustering for Frequency Hopping Spread Spectrum Signal Separation
… novel source separation with classic clustering algorithms can be performed. Background knowledge derived from the time domain representation of received waveforms can improve these clustering methods with the novel application of cannot-link pairwise constraints to signal separation. …
-
Domain-Constrained Clustering: A Two-Stage Framework for Muscle Fiber Type Identification
This dissertation introduces a novel Two-Stage Clustering Framework for the automated identification of human skeletal muscle fiber types using fluorescence microscopy image intensity data. By integrating two complementary clustering methods, this framework overcomes the subjectivity and …
-
Bio-inspired constrained clustering: A case study on aspect-based sentiment analysis
Clustering is an important problem in the era of big data. Exact algorithmic clustering approaches are not affordable for many real-world applications (RWA), requiring innovative, and approximation algorithms. Among them are bio or nature-inspired techniques such as “ant brood clustering algorithm” …
-
Adaptive constrained clustering with application to dynamic image database categorization and visualization.
… In this dissertation, we introduce a novel clustering technique that is designed to combine multiple forms of information in order to overcome the disadvantages observed while using a single information domain. Our proposed approach, called Adaptive Constrained Clustering (ACC), is a robust, …
-
Globally Optimal Matching of Astronomy Catalogs Using Mixed Integer Quadratically Constrained Programming and Constrained Clustering
… orders of magnitude. Our second method uses constrained k-means clustering to provide approximate solutions for the cross-matching problem. We also provide a method to use the approximate solution to speed up the exact method. We empirically show that our new mixed integer program with …
-
Semi-supervised and Active Image Clustering with Pairwise Constraints from Humans
Clustering images has been an interesting problem for computer vision and machine learning researchers for many years. However as the number of categories increases, image clustering becomes extremely hard and is not possible to use for many practical applications. Researchers have proposed several …
-
A Robust Nonparametric Framework for Repeated Spatial Clustering: Insights from Spatial Omics
In a spatial clustering context, it is often necessary to form contiguous clusters, as observations in proximity tend to exhibit dependency. Another important aspect of the spatial clustering process is identifying repeated spatial clusters that are not necessarily in proximity. Both aspects are …
-
Subspace Clustering and Active Learning with Constraints
… multiple lower dimensional subspaces. Subspace clustering addresses the problem of simultaneously uncovering multiple subspace structures in the data and grouping the data according to their underlying subspace structures. The first contribution of this thesis is the development of a Subspace …
-
Instance Segmentation of Point Clouds via Similarity Learning
… clusters using the eigengap heuristic. Spectral clustering is then performed on the similarity matrix to obtain the final set of instances. We also provide an optional step of constrained clustering where the user can guide the clustering to refine the segmentation results. We show that our …
-
Markets, Elections, and Microbes: Data-driven Algorithms from Theory to Practice
… worst case performance The second area is constrained clustering where we explore classical clustering problems with additional constraints on which data points should be clustered together. Utilizing these constraints is important for many clustering problems because they can be used to …
-
Reducing the effort for data annotation
… learning, positive unlabeled learning, constrained clustering, and transfer learning. First, this thesis introduces the concept of deep semi-supervised learning and provides an overview of recent research on self-training, entropy regularization, consistency regularization, and hybrid …
-
Methods for Characterizing Groundwater Resources with Sparse In-Situ Data
… groundwater table elevation (WTE) by clustering wells with uniform grid and k-means-constrained clustering and creating pseudo wells. Pseudo wells with the WTE values from the cluster-member wells were temporally and spatially interpolated to analyze groundwater changes. We used the …
-
Interactively Guiding Semi-Supervised Clustering via Attribute-based Explanations
Unsupervised image clustering is a challenging and often ill-posed problem. Existing image descriptors fail to capture the clustering criterion well, and more importantly, the criterion itself may depend on (unknown) user preferences. Semi-supervised approaches such as distance metric learning and …
-
Efficient Algorithms for Constrained Graph Clustering with Applications in Epidemic Control and Fairness
Graph clustering is a fundamental problem with many applications in statistics, computer science, biology, and social science. Although classical graph clustering algorithms are well-studied, effective solutions in practice often require incorporating prior knowledge as constraints. For instance, …
-
Advanced Unsupervised Analysis of Spatio-Temporal Pattern Analytics
… transformer-based temporal embeddings, constrained clustering, and Active Learning. The time-series transformer is leveraged to encode vessel movements, enabling clustering to reveal latent behavioural patterns. These patterns are aggregated into bag-of-words features for track-level …
-
Wildfire and mountain pine beetle boundary zones : spatial pattern, boundary creation ans successional consquences
… dynamics are poorly understood. Using spatially constrained clustering, the width of seven wildfire and eleven MPB boundaries was determined to be variable and ranged from Om to 120m (means approximately 30 to 50m). Thus, natural disturbance boundaries varied along a continuum from hard to soft. …
-
Predicting time-since-fire from forest inventory data in Saskatchewan, Canada
… event polygons: simple partitions, hierarchical clustering, and spatially constrained clustering. The predicted fire event polygons were used to generate polygon size distribution wildfire metrics. I found that there was a relationship between time-since-fire and forest inventory variables at …
-
Lagrangian Relaxation Approaches to Cardinality Constrained Portfolio Selection
… dissertation we study two different cardinality constrained portfolio selection problems, known as Index Tracking and Financial Planning. Index Tracking is a typical application of the cardinality constrained portfolio selection process and has attracted much attention from portfolio managers. …
Page 1 of 2