Physical Sciences and Mathematics Commons^™

Efficient Algorithms For Clustering Polygonal Obstacles, Sabbir Kumar Manandhar

UNLV Theses, Dissertations, Professional Papers, and Capstones

Clustering a set of points in Euclidean space is a well-known problem having applications in pattern recognition, document image analysis, big-data analytics, and robotics. While there are a lot of research publications for clustering point objects, only a few articles have been reported for clustering a given distribution of obstacles. In this thesis we examine the development of efficient algorithms for clustering a given set of convex obstacles in the 2D plane. One of the methods presented in this work uses a Voronoi diagram to extract obstacle clusters. We also consider the implementation issues of point/obstacle clustering algorithms.

Efficient Estimation Of Cluster Population, Sanjeev K C

UNLV Theses, Dissertations, Professional Papers, and Capstones

Partitioning a given set of points into clusters is a well known problem in pattern recognition, data mining, and knowledge discovery. One of the well known methods for identifying clusters in Euclidean space is the K-mean algorithm. In using the K-mean clustering algorithm it is necessary to know the value of k (the number of clusters) in advance. We propose to develop algorithms for good estimation of k for points distributed in two dimensions. The techniques we pursue include a bucketing method, g-hop neighbors, and Voronoi diagrams. We also present experimental results for examining the performances of the bucketing method …

Efficient Clustering Techniques For Managing Large Datasets, Vasanth Nemala

UNLV Theses, Dissertations, Professional Papers, and Capstones

The result set produced by a search engine in response to the user query is very large. It is typically the responsibility of the user to browse the result set to identify relevant documents. Many tools have been developed to assist the user to identify the most relevant documents. One such a tool is clustering technique. In this method, the closely related documents are grouped based on their contents. Hence if a document turns out to be relevant, so are the rest of the documents in the cluster. So it would be easy for a user to sift through the …

Hierarchical Routing In Manets Using Simple Clustering, Adam Carnine

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis presents both a review of current MANET routing protocols and a new MANET routing algorithm. The routing protocols reviewed include representative samples from the three primary forms of routing found in MANETS: proactive routing, reactive routing and hybrid routing. Secure algorithms are given special treatment in the review. In addition several protocol enhancements are discussed.

The proposed routing protocol is designed to support networks of a medium size, containing over 200 nodes but less than 3,000 nodes. The design is intentionally simple to allow ease of implementation in comparison with other MANET protocols that provide similar functionality.