Search
Skip to Search Results- 1Arango Moreno, Camilo
- 1Behsaz, Babak
- 1Berube, Paul N. J.
- 1Cheng, Hao
- 1Fokaefs, Marios-Eleftherios
- 1Idrissov, Agzam Y.
-
Fall 2012
Recent proliferation of low-cost and lightweight GPS tracking devices led to a large increase in the amounts of collected mobility data. The rapidly emerging field of location-based services requires accurate and informative knowledge mining from these large quantities of data. One such mobility...
-
Fall 2017
Density-based clustering methods extract high density clusters which are separated by regions of lower density. HDBSCAN* is an existing algorithm for producing a density-based cluster hierarchy. To obtain clusters from this hierarchy it includes an instance of FOSC(Framework for Optimal Selection...
-
Fall 2012
In this thesis, we present some approximation algorithms for the following clustering problems: Minimum Sum of Radii (MSR), Minimum Sum of Diameters (MSD), and Unsplittable Capacitated Facility Location. Given a metric (V, d) and an integer k, we consider the problem of partitioning the points...
-
Fall 2015
In this thesis, we consider two closely related clustering problems, Min Sum k-Clustering (MSkC) and Balanced k-Median (BkM). In Min Sum k-clustering, one is given a graph and a parameter k, and has to partition the vertices in the graph into k clusters to minimize the sum of pairwise distances...
-
Spring 2023
In this thesis, we present Approximation Schemes for the Min Sum k Clustering problem on a number of classes of graph metrics. In Min Sum k Clustering problem introduced by Sahni and Gonzalez [22] in 1976, given a graph G(V, E) with metric edge costs and parameter k, we are asked to partition V...
-
Fall 2013
Due to its wide application in various fields, clustering, as a fundamental unsupervised learning problem, has been intensively investigated over the past few decades. Unfortunately, standard clustering formulations are known to be computationally intractable. Although many convex relaxations of...
-
Fall 2018
Identifying the peptide sequence from a mass spectrum is done either by database search or De novo peptide sequencing. This thesis focuses on identification of peptides by using database search, which is a process where an MS/MS spectrum is searched against an entire database of spectra...
-
Fall 2010
The Wireless Sensor Networks (WSNs) have emerged as a new paradigm for collecting and processing data from physical environments, such as wild life sanctuaries, large warehouses, and battlefields. Users can access sensor data by issuing queries over the network, e.g., to find what are the 10...
-
Fall 2010
Software can be considered a live entity, as it undergoes many alterations throughout its lifecycle. Therefore, code can become rather complex and difficult to understand. More specifically in object-oriented systems, classes may become very large and less cohesive. In order to identify such...
-
Fall 2012
This thesis makes improvement to the process of ahead-of-time feedback-directed optimization (FDO) in compiler design. It examines multiple aspects of FDO from profile collection and representation through to the performance evaluation of FDO code transformations. Two guiding principals knit the...