File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0031-3203(99)00057-6
- Scopus: eid_2-s2.0-0033909225
- WOS: WOS:000084841900011
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A note on constrained k-means algorithms
| Title | A note on constrained k-means algorithms |
|---|---|
| Authors | |
| Keywords | Clustering PCB insertion k-means algorithm Constraints |
| Issue Date | 2000 |
| Citation | Pattern Recognition, 2000, v. 33, n. 3, p. 515-519 How to Cite? |
| Abstract | This paper describes extensions to the k-means algorithm for clustering data sets. By adding suitable constraints into the mathematical program formulation, an approach is developed, which allows the use of the k-means paradigm to efficiently cluster data sets with the fixed number of objects in each cluster. The new algorithm is presented and the effectiveness of the algorithm is demonstrated with experimental results. © 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved. |
| Persistent Identifier | http://hdl.handle.net/10722/276540 |
| ISSN | 2021 Impact Factor: 8.518 2020 SCImago Journal Rankings: 1.492 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ng, Michael K. | - |
| dc.date.accessioned | 2019-09-18T08:33:55Z | - |
| dc.date.available | 2019-09-18T08:33:55Z | - |
| dc.date.issued | 2000 | - |
| dc.identifier.citation | Pattern Recognition, 2000, v. 33, n. 3, p. 515-519 | - |
| dc.identifier.issn | 0031-3203 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/276540 | - |
| dc.description.abstract | This paper describes extensions to the k-means algorithm for clustering data sets. By adding suitable constraints into the mathematical program formulation, an approach is developed, which allows the use of the k-means paradigm to efficiently cluster data sets with the fixed number of objects in each cluster. The new algorithm is presented and the effectiveness of the algorithm is demonstrated with experimental results. © 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved. | - |
| dc.language | eng | - |
| dc.relation.ispartof | Pattern Recognition | - |
| dc.subject | Clustering | - |
| dc.subject | PCB insertion | - |
| dc.subject | k-means algorithm | - |
| dc.subject | Constraints | - |
| dc.title | A note on constrained k-means algorithms | - |
| dc.type | Article | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1016/S0031-3203(99)00057-6 | - |
| dc.identifier.scopus | eid_2-s2.0-0033909225 | - |
| dc.identifier.volume | 33 | - |
| dc.identifier.issue | 3 | - |
| dc.identifier.spage | 515 | - |
| dc.identifier.epage | 519 | - |
| dc.identifier.isi | WOS:000084841900011 | - |
| dc.identifier.issnl | 0031-3203 | - |