Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

You searched for +publisher:"Rutgers University" +contributor:("Iyigun, Cem"). One record found.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Rutgers University

1. Iyigun, Cem. Probabilistic distance clustering.

Degree: PhD, Operations Research, 2008, Rutgers University

We present a new iterative method for probabilistic clustering of data. Given clusters, their centers, and the distances of data points from these centers, the probability of cluster membership at any point is assumed inversely proportional to the distance from (the center of) the cluster in question. This assumption is our working principle. The method is a generalization, to several centers, of the Weiszfeld method for solving the Fermat-Weber location problem. At each iteration, the distances (Euclidean, Mahalanobis, etc.) from the cluster centers are computed for all data points, and the centers are updated as convex combinations of these points, with weights determined by the above principle. Computations stop when the centers stop moving. Progress is monitored by the joint distance function (JDF), a measure of distance from all cluster centers, that evolves during the iterations, and captures the data in its low contours. There are problems where the cluster sizes are given (as in capacitated facility location problems) and there are problems where the cluster sizes are unknowns to be estimated. The probabilistic distance clustering approach works well in both cases. The probabilistic distance clustering method adjusted for cluster size (called PDQ method) method is described, and applied to location problems, and mixtures of distributions, where it is a viable alternative to the EM method. The method is simple, fast (requiring a small number of cheap iterations) and insensitive to outliers. An important issue in clustering is the "right"number of clusters that best fits a data set. The JDF is used successfully to settle this issue and determine the correct number of clusters for a given data set.

Advisors/Committee Members: Iyigun, Cem (author), Prekopa, Andras (chair), Boros, Endre (internal member), Ben-Israel, Adi (dissertation committee member), CHAOVALITWONGSE, W. ART (internal member), ARAV, MARINA (outside member).

Subjects/Keywords: Cluster analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Iyigun, C. (2008). Probabilistic distance clustering. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17142

Chicago Manual of Style (16th Edition):

Iyigun, Cem. “Probabilistic distance clustering.” 2008. Doctoral Dissertation, Rutgers University. Accessed January 24, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17142.

MLA Handbook (7th Edition):

Iyigun, Cem. “Probabilistic distance clustering.” 2008. Web. 24 Jan 2020.

Vancouver:

Iyigun C. Probabilistic distance clustering. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2020 Jan 24]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17142.

Council of Science Editors:

Iyigun C. Probabilistic distance clustering. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17142

.