The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Dimensionality reduction by random mapping: fast similarity computation for clustering
Abstract
When the data vectors are high-dimensional it is computationally infeasible to use data analysis or pattern recognition algorithms which repeatedly compute similarities or distances in the original data space. It is therefore necessary to reduce the dimensionality before, for example, clustering the data. If the dimensionality is very high, like in the WEBSOM method which organizes textual document collections on a self-organizing map, then even the commonly used dimensionality reduction methods like the principal component analysis may be too costly. It is demonstrated that the document classification accuracy obtained after the dimensionality has been reduced using a random mapping method will be almost as good as the original accuracy if the final dimensionality is sufficiently large (about 100 out of 6000). In fact, it can be shown that the inner product (similarity) between the mapped vectors follows closely the inner product of the original vectors.
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
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Introduction to modern information retrieval
Dillon, M. (1983) · Information Processing & Management · doi:10.1016/0306-4573(83)90062-6 · Cited by 5,909
Ritter, H., & Kohonen, T. (1989) · Biological Cybernetics · doi:10.1007/bf00203171 · Cited by 621
Computational Intelligence: Imitating Life
Marks, R. J., Żurada, J. M., & Robinson, C. J. (1994) · IEEE Press eBooks · Cited by 537
Self-organizing maps of document collections: A new approach to interactive exploration
Lagus, K., Honkela, T., Samuel Kaski, A., & Kohonen, T. (1996) · Cited by 168
Newsgroup Exploration with WEBSOM Method and Browsing Interface
Honkela, T., Samuel Kaski, A., Lagus, K., & Kohonen, T. (1996) · Cited by 124
Very large two-level SOM for the browsing of newsgroups
Kohonen, T., Kaski, S., Lagus, K., & Honkela, T. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61510-5_48 · Cited by 83
Self-citationCreating an Order in Digital Libraries with Self-Organizing Maps
Samuel Kaski, A., Honkela, T., Lagus, K., et al. (1996) · Cited by 62
Acta polytechnica Scandinavica. Mathematics and computing series
Akatemia, T. T. (1999) · Medical Entomology and Zoology · Cited by 6
Cited by
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
(2010) · Cited by 1,906
Random projection in dimensionality reduction: applications to image and text data
Bingham, E., & Mannila, H. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502546 · Cited by 1,274
A Survey of Dimension Reduction Techniques
Fodor, I. K. (2002) · doi:10.2172/15002155 · Cited by 1,116
Kanerva, P. (2009) · Cognitive Computation · doi:10.1007/s12559-009-9009-8 · Cited by 970
Metadata
- Authors
- Kaski, S.
- Venue
- 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227)
- Publisher
- IEEE
- Published
- 2002-11-27
- Volume
- 1
- Pages
- 413-418
- OpenAlex
- W2135508918
- Cited by
- 388
- References
- 10
- FWCI
- 13.67
- 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.