The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract)
Open accessAbstract
In this paper we consider thek-clustering problem for a set S of n points i=(xi) in thed-dimensional space with variance-based errors as clustering criteria, motivated from the color quantization problem of computing a color lookup table for frame buffer display. As the inter-cluster criterion to minimize, the sum on intra-cluster errors over every cluster is used, and as the intra-cluster criterion of a cluster Sj,
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Color image quantization for frame buffer display
Heckbert, P. (1982) · Proceedings of the 9th annual conference on Computer graphics and interactive techniques · doi:10.1145/800064.801294 · Cited by 656
Color image quantization for frame buffer display
Heckbert, P. (1982) · ACM SIGGRAPH Computer Graphics · doi:10.1145/965145.801294 · Cited by 549
Optimal algorithms for approximate clustering
Feder, T., & Greene, D. (1988) · doi:10.1145/62212.62255 · Cited by 437
Clustering algorithms based on minimum and maximum spanning trees
Asano, T., Bhattacharya, B. K., Keil, M., et al. (1988) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73393.73419 · Cited by 135
An algorithm for multidimensional data clustering
Wan, S. J., Wong, S. K. M., & Prusinkiewicz, P. (1988) · ACM Transactions on Mathematical Software · doi:10.1145/45054.45056 · Cited by 101
Capoyleas, V., Rote, G., & Woeginger, G. J. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90007-l · Cited by 98
Cited by
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
Centroidal Voronoi Tessellations: Applications and Algorithms
Du, Q., Faber, V., & Gunzburger, M. (1999) · SIAM Review · doi:10.1137/s0036144599352836 · Cited by 2,244
Chen, M., Mozaffari, M., Saad, W., Yin, C., Debbah, M., & Hong, C. S. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2680898 · Cited by 742
A local search approximation algorithm for k-means clustering
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · Proceedings of the eighteenth annual symposium on Computational geometry · doi:10.1145/513400.513402 · Cited by 474
Metadata
- Authors
- Inaba, M., Katoh, N., & Imai, H.
- Venue
- Proceedings of the tenth annual symposium on Computational geometry - SCG '94
- Publisher
- ACM Press
- Published
- 1994
- Pages
- 332-339
- OpenAlex
- W2091283109
- Cited by
- 321
- References
- 7
- FWCI
- 1.67
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract). https://app.cochat.ai/papers/10.1145/177424.178042
- The paper
- Inaba, M., Katoh, N., & Imai, H. (1994). Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract). Proceedings of the tenth annual symposium on Computational geometry - SCG '94. https://doi.org/10.1145/177424.178042
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.