Constrained clustering with Minkowski Weighted K-Means
The DOI matches its Crossref record.
Abstract
In this paper we introduce the Constrained Minkowski Weighted K-Means. This algorithm calculates cluster specific feature weights that can be interpreted as feature rescaling factors thanks to the use of the Minkowski distance. Here, we use an small amount of labelled data to select a Minkowski exponent and to generate clustering constrains based on pair-wise must-link and cannot-link rules. We validate our new algorithm with a total of 12 datasets, most of which containing features with uniformly distributed noise. We have run the algorithm numerous times in each dataset. These experiments ratify the general superiority of using feature weighting in K-Means, particularly when applying the Minkowski distance. We have also found that the use of constrained clustering rules has little effect on the average proportion of correctly clustered entities. However, constrained clustering does improve considerably the maximum of such proportion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 17
- 10.1016/0031-3203(80)90001-1 · DOI
- 10.1109/ADVCOMP.2008.30 · doi:10.1109/advcomp.2008.30
- frank, 2010, UCI Machine Learning Repository
- 10.1007/978-3-642-34156-4_6 · doi:10.1007/978-3-642-34156-4_6
- wagstaff et al, 2001, Constrained k-means clustering with background knowledge, Machine Learning International Workshop Then Conference, 577
- 10.1007/s00357-010-9049-5 · DOI · Paper page
- 10.1080/01621459.1963.10500845 · DOI · Paper page
- 10.5430/air.v1n1p55 · DOI
- mirkin, 2005, Clustering for data mining a data recovery approach, 3, 10.1201/9781420034912 · DOI
- 10.1016/j.patrec.2009.09.011 · DOI · Paper page
- 10.1016/j.patcog.2011.08.012 · DOI · Paper page
- huang et al, 2005, Automated variable weighting in k-means type clustering, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27, 657, 10.1109/TPAMI.2005.95 · DOI
- 10.1002/bs.3830120210 · DOI · Paper page
- macqueen et al, 1967, Some methods for classification and analysis of multivariate observations, Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, 1, 281
- de amorim, 2012, On partitional clustering of malware, The First International Workshop on Cyber Patterns Unifying Design Patterns with Security Attack and Forensic Patterns (CyberPatterns), 47
- huang et al, 2008, Weighting method for feature selection in K-means, Computational Methods of Feature Selection, 193
- 10.1016/j.patcog.2003.11.003 · DOI · Paper page
Cited by
Machine learning: Algorithms, real-world applications and research directions
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00592-x · Cited by 5,583
“The typical algorithms of this kind of clustering are COP K-means [121], CMWK-Means [27], etc.”
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00765-8 · Cited by 570
Encrypted Network Traffic Analysis and Classification Utilizing Machine Learning
Alwhbi, I. A., Zou, C. C., & Alharbi, R. N. (2024) · Sensors · doi:10.3390/s24113509 · Cited by 81
Metadata
- Authors
- de Amorim, R. C.
- Venue
- 2012 IEEE 13th International Symposium on Computational Intelligence and Informatics (CINTI)
- Publisher
- IEEE
- Published
- 2012-11
- Pages
- 13-17
- OpenAlex
- W1982582425
- Cited by
- 34
- References
- 0
- FWCI
- 1.48
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.