Iterative Optimization and Simplification of Hierarchical Clusterings (1995)
Cached
Download Links
- [ftp.mrg.dist.unige.it]
- [www.cs.cmu.edu]
- [cswww.vuse.vanderbilt.edu]
- [www.ece.northwestern.edu]
- [www.cs.cmu.edu]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Artificial Intelligence Research |
| Citations: | 96 - 1 self |
BibTeX
@ARTICLE{Fisher95iterativeoptimization,
author = {Doug Fisher},
title = {Iterative Optimization and Simplification of Hierarchical Clusterings},
journal = {Journal of Artificial Intelligence Research},
year = {1995},
volume = {4},
pages = {118--123}
}
Years of Citing Articles
OpenURL
Abstract
Clustering is often used for discovering structure in data. Clustering systems differ in the objective function used to evaluate clustering quality and the control strategy used to search the space of clusterings. Ideally, the search strategy should consistently construct clusterings of high quality, but be computationally inexpensive as well. In general, we cannot have it both ways, but we can partition the search so that a system inexpensively constructs a `tentative' clustering for initial examination, followed by iterative optimization, which continues to search in background for improved clusterings. Given this motivation, we evaluate an inexpensive strategy for creating initial clusterings, coupled with several control strategies for iterative optimization, each of which repeatedly modifies an initial clustering in search of a better one. One of these methods appears novel as an iterative optimization strategy in clustering contexts. Once a clustering has been construct...







