In our research we sought to create implementations of several common clustering algorithms and a relatively new approach called Affinity Propagation. Our objective was to compare the techniques by running tests on one and two dimensional datasets provided by Professor Trono. Dave Kronenberg implemented a standard randomly seeded K-Means clustering program and many related support functions. We...

Terminal propagation is a method developed in the circuit placement community for adding constraints to graph partitioning problems. This paper adapts and expands this idea, and applies it to the problem of partitioning data structures among the processors of a parallel computer. We show how the constmints in terminal propagation can be used to encourage partitions in which messages are communi...

This paper presents a unified framework for intra-view and inter-view constraint propagation on multi-view data. Pairwise constraint propagation has been studied extensively, where each pairwise constraint is defined over a pair of data points from a single view. In contrast, very little attention has been paid to inter-view constraint propagation, which is more challenging since each pairwise ...

Prediction of ground motion triggered by earthquakes is a prime concern for both the seismology community and geotechnical earthquake engineering one. The subfield occupied with such problem termed site response analysis (SRA), its one-dimensional flavor (1D-SRA) being particularly popular given simplicity. Despite simple geometrical setting, paramount challenge remains when it comes to numeric...