2001
DOI: 10.1006/anbe.2000.1608
|View full text |Cite
|
Sign up to set email alerts
|

Cluster analysis and the identification of aggregations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 54 publications
0
8
0
Order By: Relevance
“…A second problem is that the minimization of this criterion has the tendency to yield equally sized clusters, even when the actual classes in the data contain different numbers of objects. The tendency of the K-means cluster analysis to produce spherical and equally sized clusters has been documented by many authors (Eldershaw & Hegland, 1997;Everitt, 1993;Gordon, 1999;Jain & Dubes, 1988;Scott & Symons, 1971;Strauss, 2001). However, the authors do not describe the magnitude of these effects on the recovery of clusters.…”
mentioning
confidence: 88%
“…A second problem is that the minimization of this criterion has the tendency to yield equally sized clusters, even when the actual classes in the data contain different numbers of objects. The tendency of the K-means cluster analysis to produce spherical and equally sized clusters has been documented by many authors (Eldershaw & Hegland, 1997;Everitt, 1993;Gordon, 1999;Jain & Dubes, 1988;Scott & Symons, 1971;Strauss, 2001). However, the authors do not describe the magnitude of these effects on the recovery of clusters.…”
mentioning
confidence: 88%
“…To estimate the number and compositions of groups of species in the MDS coordinate space, we used a "k nearest-neighbor" (kNN) classification procedure (Strauss, 2001). We modified the nearest-neighbor algorithm described by Knorr et al (2000) to identify and omit outliers from the recognized groups based on k rather than all nearest neighbors.…”
Section: Animal Burrow or Hole (Abh)mentioning
confidence: 99%
“…There exist a wide variety of clustering and classification techniques, such as hierarchical cluster analysis, nearest neighbor classification, and techniques based on swarm intelligence algorithms (e.g., [15,16]). An iterative, kth nearest neighbor, hierarchical cluster analysis for detecting shoals was been proposed in [6]. However, results from hierarchical cluster analysis require a cutoff criteria in order to determine the actual clusters.…”
Section: Affinity Propagationmentioning
confidence: 99%
“…According to [6], objectivity of the clustering results can be ensured by comparing them with how human observers partition the same data. Thus, by comparing to human observers, we obtain a type of relative validation in which human performance is considered as if it were an alternative clustering method.…”
Section: Comparing Affinity Propagation Clustering With Human Clusteringmentioning
confidence: 99%
See 1 more Smart Citation