| 48 |
The second criterion for choice is the efficiency of the clustering process in terms of speed and storage requirements
...Efficiency is really a property of the algorithm implementing the cluster method
...In the main,two distinct approaches to clustering can be identified:1 the clustering is based on a measure of similarity between the objects to be clustered;2 the cluster method proceeds directly from the object descriptions
...The most obvious examples of the first approach are the graph theoretic methods which define clusters in terms of a graph derived from the measure of similarity
...A string is a connected sequence of objects from some starting point
...A connected component is a set of objects such that each object is connected to at least one other member of the set and the set is maximal with respect to this property
...A maximal complete subgraph is a subgraph such that each node is connected to every other node in the subgraph and the set is maximal with respect to this property,i
...node were included anywhere the completeness condition would be violated
...A large class of hierarchic cluster methods is based on the initial measurement of similarity
... |
