The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Sphericalk-Means Clustering
Open accessAbstract
Clustering text documents is a fundamental task in modern data analysis, requiring approaches which perform well both in terms of solution quality and computational efficiency. Spherical k-means clustering is one approach to address both issues, employing cosine dissimilarities to perform prototype-based partitioning of term weight representations of the documents. This paper presents the theory underlying the standard spherical k-means problem and suitable extensions, and introduces the R extension package skmeans which provides a computational environment for spherical k-means clustering featuring several solvers: a fixed-point and genetic algorithm, and interfaces to two external solvers (CLUTO and Gmeans). Performance of these solvers is investigated by means of a large scale benchmark experiment.
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
A vector space model for automatic indexing
Salton, G., Wong, A., & Yang, C. S. (1975) · Communications of the ACM · doi:10.1145/361219.361220 · Cited by 7,521 · cited 1×
“…System and represents documents (and queries) by vectors of term weights, and hence the corpus as a document-term weight matrix, with the so-called tf-idf (term frequency-inverse document frequency) scheme the most popular (Salton, Wong, and Yang 1975; Manning, Raghavan, and Schütze 2008).”
BackgroundConcept Decompositions for Large Sparse Text Data Using Clustering
Dhillon, I. S., & Modha, D. S. (2001) · Machine Learning · doi:10.1023/a:1007612920971 · Cited by 1,293
Text Mining Infrastructure in R
Feinerer, I., Hornik, K., & Meyer, D. (2008) · Journal of Statistical Software · doi:10.18637/jss.v025.i05 · Cited by 1,252
Self-citationTopics in semantic representation
Griffiths, T. L., Steyvers, M., & Tenenbaum, J. B. (2007) · Psychological Review · doi:10.1037/0033-295x.114.2.211 · Cited by 1,122
Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
Zhao, Y., & Karypis, G. (2004) · Machine Learning · doi:10.1023/b:mach.0000027785.44527.d6 · Cited by 611
Karypis, G. (2002) · doi:10.21236/ada439508 · Cited by 546
How does gene expression clustering work?
D'haeseleer, P. (2005) · Nature Biotechnology · doi:10.1038/nbt1205-1499 · Cited by 515
Hornik, K. (2005) · Journal of Statistical Software · doi:10.18637/jss.v014.i12 · Cited by 268
Self-citationA toolbox for -centroids cluster analysis
Leisch, F. (2006) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2005.10.006 · Cited by 253
Iterative clustering of high dimensional text data augmented by local search
Dhillon, I. S., Guan, Y., & Kogan, J. (2003) · Proceedings · doi:10.1109/icdm.2002.1183895 · Cited by 129
Kernel-based machine learning for fast text mining in R
Karatzoglou, A., & Feinerer, I. (2009) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2009.09.023 · Cited by 46
Self-citationAk-mean-directions Algorithm for Fast Clustering of Data on the Sphere
Maitra, R., & Ramler, I. (2010) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2009.08155 · Cited by 37
Cited by
Rehman, T. U., Mahmud, M. S., Chang, Y. K., Jin, J., & Shin, J. (2019) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2018.12.006 · Cited by 415
Editing in Style: Uncovering the Local Semantics of GANs
Collins, E., Bala, R., Price, B., & Susstrunk, S. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00581 · Cited by 268
Metadata
- Authors
- Hornik, K., Feinerer, I., Kober, M., & Buchta, C.
- Venue
- Journal of Statistical Software
- Publisher
- Foundation for Open Access Statistic
- Published
- 2012
- Volume
- 50
- Issue
- 10
- ISSN
- 1548-7660 (ISSN-L)
- OpenAlex
- W2150376021
- Cited by
- 275
- References
- 15
- FWCI
- 7.28
- Type
- journal article
- Language
- en
- Open access
- diamond
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.