The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Practical solutions to the problem of diagonal dominance in kernel document clustering
Open accessAbstract
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to the off-diagonal entries. This problem, referred to as diagonal dominance, often occurs when certain kernel functions are applied to sparse high-dimensional data, such as text corpora. In this paper we investigate the implications of diagonal dominance for unsupervised kernel methods, specifically in the task of document clustering. We propose a selection of strategies for addressing this issue, and evaluate their effectiveness in producing more accurate and stable clusterings.
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
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
Advances in Large-Margin Classifiers
(2000) · The MIT Press eBooks · doi:10.7551/mitpress/1113.001.0001 · Cited by 1,869
Input space versus feature space in kernel-based methods
Scholkopf, B., Mika, S., Burges, C. J. C., Knirsch, P., Muller, K.-R., Ratsch, G., & Smola, A. J. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.788641 · Cited by 1,164
Protein homology detection using string alignment kernels
Saigo, H., Vert, J.-P., Ueda, N., & Akutsu, T. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth141 · Cited by 379
Cancedda, N., Gaussier, É., Goutte, C., & Renders, J.-M. (2003) · doi:10.5555/944919.944963 · Cited by 189
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
A Kernel Approach for Learning from almost Orthogonal Patterns
Schölkopf, B., Weston, J., Eskin, E., Leslie, C. S., & Noble, W. S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36755-1_44 · Cited by 69
Cited by
Deep Learning--based Text Classification: A Comprehensive Review
Minaee, S., Kalchbrenner, N., Cambria, E., Nikzad, N., Chenaghlu, M., & Gao, J. (2022) · ACM Computing Surveys · doi:10.1145/3439726 · Cited by 1,538
Using the Output Embedding to Improve Language Models
Press, O., & Wolf, L. (2017) · Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 2, Short Papers · doi:10.18653/v1/e17-2025 · Cited by 596
Incomplete Multiview Spectral Clustering With Adaptive Graph Learning
Wen, J., Xu, Y., & Liu, H. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2884715 · Cited by 390
Deep Learning Based Text Classification: A Comprehensive Review
Minaee, S., Kalchbrenner, N., Cambria, E., Nikzad, N., Asgari-Chenaghlu, M., & Gao, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.03705 · Cited by 381
Essential Tensor Learning for Multi-View Spectral Clustering
Wu, J., Lin, Z., & Zha, H. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2916740 · Cited by 362
Metadata
- Authors
- Greene, D., & Cunningham, P.
- Venue
- Proceedings of the 23rd international conference on Machine learning - ICML '06
- Publisher
- ACM Press
- Published
- 2006
- Pages
- 377-384
- OpenAlex
- W2129250947
- Cited by
- 616
- References
- 8
- FWCI
- 2.40
- Type
- conference paper
- Language
- en
- Open access
- green
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.