| 51 |
restricting the number of clusters and by bounding the size of each cluster
...Rather than give a detailed account of all the heuristic algorithms,I shall instead discuss some of the main types and refer the reader to further developments by citing the appropriate authors
...The most important concept is that of cluster representative variously called cluster profile,classification vector,or centroid
...1 the number of clusters desired;2 a minimum and maximum size for each cluster;3 a threshold value on the matching function,below which an object will not be included in a cluster;4 the control of overlap between clusters;5 an arbitrarily chosen objective function which is optimised
...Almost all of the algorithms are iterative,i
...Probably the most important of this kind of algorithm is Rocchio s clustering algorithm [36]which was developed on the SMART project
...Most of these algorithms aim at reducing the number of passes that |
