|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| A. Wetjen, "Comments on "A Branch and Bound Clustering Algorithm"," IEEE Transactions on Computers, vol. 27, no. 2, pp. 189, February, 1978. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1978.1675059, author = {A. Wetjen}, title = {Comments on "A Branch and Bound Clustering Algorithm"}, journal ={IEEE Transactions on Computers}, volume = {27}, number = {2}, issn = {0018-9340}, year = {1978}, pages = {189}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1978.1675059}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Comments on "A Branch and Bound Clustering Algorithm" IS - 2 SN - 0018-9340 SP EP EPD - 189 A1 - A. Wetjen, PY - 1978 KW - null VL - 27 JA - IEEE Transactions on Computers ER - | |||
Clustering may be viewed as a combinatorial optimization problem. In the above paper1, the number of ways in which N objects may be assigned to M distinct classes is given by One can easily see that this can be true if and only if M! is a divisor of MN and this is true if and only if M = 1 or M = 2.
Citation:
A. Wetjen, "Comments on "A Branch and Bound Clustering Algorithm"," IEEE Transactions on Computers, vol. 27, no. 2, pp. 189, Feb. 1978, doi:10.1109/TC.1978.1675059
Usage of this product signifies your acceptance of the Terms of Use.