Advanced search
Add to list

The complete linkage clustering algorithm revisited

Peter Dawyndt (UGent) , Hans De Meyer (UGent) and Bernard De Baets (UGent)
(2005) SOFT COMPUTING. 9(5). p.385-392
Author
Organization

Citation

Please use this url to cite or link to this publication:

MLA
Dawyndt, Peter, Hans De Meyer, and Bernard De Baets. “The Complete Linkage Clustering Algorithm Revisited.” SOFT COMPUTING 9.5 (2005): 385–392. Print.
APA
Dawyndt, Peter, De Meyer, H., & De Baets, B. (2005). The complete linkage clustering algorithm revisited. SOFT COMPUTING, 9(5), 385–392.
Chicago author-date
Dawyndt, Peter, Hans De Meyer, and Bernard De Baets. 2005. “The Complete Linkage Clustering Algorithm Revisited.” Soft Computing 9 (5): 385–392.
Chicago author-date (all authors)
Dawyndt, Peter, Hans De Meyer, and Bernard De Baets. 2005. “The Complete Linkage Clustering Algorithm Revisited.” Soft Computing 9 (5): 385–392.
Vancouver
1.
Dawyndt P, De Meyer H, De Baets B. The complete linkage clustering algorithm revisited. SOFT COMPUTING. Springer; 2005;9(5):385–92.
IEEE
[1]
P. Dawyndt, H. De Meyer, and B. De Baets, “The complete linkage clustering algorithm revisited,” SOFT COMPUTING, vol. 9, no. 5, pp. 385–392, 2005.
@article{316370,
  author       = {{Dawyndt, Peter and De Meyer, Hans and De Baets, Bernard}},
  issn         = {{1432-7643}},
  journal      = {{SOFT COMPUTING}},
  language     = {{eng}},
  number       = {{5}},
  pages        = {{385--392}},
  publisher    = {{Springer}},
  title        = {{The complete linkage clustering algorithm revisited}},
  volume       = {{9}},
  year         = {{2005}},
}

Web of Science
Times cited: