The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
On weighting clustering
Abstract
Recent papers and patents in iterative unsupervised learning have emphasized a new trend in clustering. It basically consists of penalizing solutions via weights on the instance points, somehow making clustering move toward the hardest points to cluster. The motivations come principally from an analogy with powerful supervised classification methods known as boosting algorithms. However, interest in this analogy has so far been mainly borne out from experimental studies only. This paper is, to the best of our knowledge, the first attempt at its formalization. More precisely, we handle clustering as a constrained minimization of a Bregman divergence. Weight modifications rely on the local variations of the expected complete log-likelihoods. Theoretical results show benefits resembling those of boosting algorithms and bring modified (weighted) versions of clustering algorithms such as k-means, fuzzy c-means, Expectation Maximization (EM), and k-harmonic means. Experiments are provided for all these algorithms, with a readily available code. They display the advantages that subtle data reweighting may bring to clustering.
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
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Beal, M. J., & Ghahramani, Z. (2003) · Bayesian Statistics 7 · doi:10.1093/oso/9780198526155.003.0025 · Cited by 458
Cited by
Xing, F., & Yang, L. (2016) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2016.2515127 · Cited by 519
A new insight into land use classification based on aggregated mobile phone data
Pei, T., Sobolevsky, S., Ratti, C., Shaw, S.-L., Li, T., & Zhou, C. (2014) · International Journal of Geographical Information Science · doi:10.1080/13658816.2014.913794 · Cited by 397
A review of moving object trajectory clustering algorithms
Yuan, G., Sun, P., Zhao, J., Li, D., & Wang, C. (2017) · Artificial Intelligence Review · doi:10.1007/s10462-016-9477-7 · Cited by 323
Multi-Criteria Analysis Framework for Potential Flood Prone Areas Mapping
Papaioannou, G., Vasiliades, L., & Loukas, A. (2015) · Water Resources Management · doi:10.1007/s11269-014-0817-6 · Cited by 315
Metadata
- Authors
- Nock, R., & Nielsen, F.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2006-08
- Volume
- 28
- Issue
- 8
- Pages
- 1223-1235
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2147434872
- Cited by
- 241
- References
- 3
- FWCI
- 8.80
- Type
- journal article
- 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.