B. Duran and P. Odell, Cluster Analysis, Springer-Verlag, Berlin, 1974 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Heuristic Method for Multifacility Location Problems - Levin, Ben-Israel (2001) (Correct)
....are points in the plane) but clustering problems are d dimensional, where d, the number of attributes, can be any positive integer. We therefore state our results for general dimension d, although d = 2 would suffice for MFLP. The clustering literature is rich, we mention in particular [9], 15] 10] and [14] for surveys and references. Methods for solving MFLP s are surveyed by Drezner [7] Ghosh and Rushton [12] and Love, Morris and Wesolowsky [20] Approaches for solving the MFLP include dynamic programming (for one dimensional problems) Drezner s Algorithm for 2facility ....
B. Duran and P. Odell, Cluster Analysis, Springer-Verlag, Berlin, 1974
High Performance Subspace Clustering for Massive Data Sets - Nagesh (1999) (Correct)
....etc. Traditionally clustering has been studied as a problem of grouping a given set S of n objects into several groups of objects such that objects within the same group are more similar as compared to objects in the other clusters. One of the earliest survey in this field is by Duran and Odell [DO74] Clustering is covered more as a geometric problem and solutions based on enumeration are discussed. An excellent survey of geometric clustering algorithms has been compiled by Procopiuc [Pro96] Applications of clustering algorithms in the field of graph theory and physical circuit design tend ....
B.S. Duran and P.L. Odell. Cluster Analysis, A Survey. Springer-Verlag, 1974.
Self-Organizing Maps Combined with Eigenmode Analysis.. - Galliat, Huisinga.. (1999) (Correct)
....[7] nor generates too much di erent suggestions for clustering the codebook vectors. We do not demand an algorithm that always gives a unique solution 1 , but an algorithm that generates only the important clustering possibilities, e.g. in contrast to a hierarchical cluster algorithm [3]. Both requirements on the cluster algorithm are necessary for a really automatic cluster identi cation. Even if we suppose that we have such an algorithm, there is another problem: We have not used the two dimensional structure of the SOM at all. But if we neglect the structure, it makes no ....
B.S.Duran and P.L.Odell. Cluster Analysis. Springer, Berlin, 1974.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC