Nabin Chapagain

Document Type

Honors Thesis


In Monte-Carlo simulation, we often need an estimate of the domain of the target objective function of the sample. We want to constrain the domain within a specific shape to sample more points from it, efficiently. That is why it is good to bind the domain of the objective function that we are trying to sample from. This research aims to develop an unsupervised clustering algorithm that works on a multidimensional dataset and gives considerable output using far less time than other similar algorithms, decreasing computational expenses by a significant amount. The algorithm gives us the predicted number of ellipsoids, their covariance matrices, and centers. Benchmarking of the algorithm uses the Dynesty package for Python. There is a discussion of the benefits and shortcomings of the algorithm and a discussion of future steps to make the algorithm more universal at the end.

Publication Date






To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.