On the public citation graph

Random Projections for Linear Support Vector Machines

0 signed · 64 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.10073openalex-snapshot
An elementary proof of a theorem of Johnson and Lindenstrauss
inferredcites →https://doi.org/10.1007/11752790_3openalex-snapshot
Random Projection, Margins, Kernels, and Feature-Selection
inferredcites →https://doi.org/10.1007/3-540-45583-3_11openalex-snapshot
A Random Sampling Technique for Training Support Vector Machines
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/s00211-010-0331-6openalex-snapshot
Faster least squares approximation
inferredcites →https://doi.org/10.1007/s00454-008-9110-xopenalex-snapshot
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes
inferredcites →https://doi.org/10.1016/s0022-0000(03)00025-4openalex-snapshot
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
inferredcites →https://doi.org/10.1017/cbo9780511801389openalex-snapshot
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
inferredcites →https://doi.org/10.1023/a:1013637720281openalex-snapshot
On the Learnability and Design of Output Codes for Multiclass Problems
inferredcites →https://doi.org/10.1038/73432openalex-snapshot
Systematic variation in gene expression patterns in human cancer cell lines
inferredcites →https://doi.org/10.1080/00401706.1999.10485951openalex-snapshot
Statistical Learning Theory
inferredcites →https://doi.org/10.1109/focs.2013.21openalex-snapshot
OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings
inferredcites →https://doi.org/10.1109/tip.2006.881945openalex-snapshot
Orthogonal Laplacianfaces for Face Recognition
inferredcites →https://doi.org/10.1126/science.1153717openalex-snapshot
Worldwide Human Relationships Inferred from Genome-Wide Patterns of Variation
inferredcites →https://doi.org/10.1136/jmg.2010.078212openalex-snapshot
Ancestry informative markers for fine-scale individual assignment to worldwide populations
inferredcites →https://doi.org/10.1137/060673096openalex-snapshot
The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/1008992.1009036openalex-snapshot
Parameterized generation of labeled datasets for text categorization based on a hierarchical directory
inferredcites →https://doi.org/10.1145/1132516.1132597openalex-snapshot
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
inferredcites →https://doi.org/10.1145/1150402.1150436openalex-snapshot
Very sparse random projections
inferredcites →https://doi.org/10.1145/1961189.1961199openalex-snapshot
LIBSVM
inferredcites →https://doi.org/10.1145/2488608.2488620openalex-snapshot
Low rank approximation and regression in input sparsity time
inferredcites →https://doi.org/10.1145/2488608.2488621openalex-snapshot
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
inferredcites →https://doi.org/10.1145/276698.276876openalex-snapshot
Approximate nearest neighbors
inferredcites →https://doi.org/10.4086/toc.2012.v008a014openalex-snapshot
inferredcites →https://doi.org/10.48550/arxiv.0909.3609openalex-snapshot
Randomized Algorithms for Large scale SVMs
inferredcites →https://doi.org/10.48550/arxiv.1206.4651openalex-snapshot
Is margin preserved after random projection?
inferredcites →https://doi.org/10.48550/arxiv.1211.3046openalex-snapshot
Recovering the Optimal Solution by Dual Random Projection
inferredcites →https://doi.org/10.5555/1005332.1005345openalex-snapshot
RCV1: A New Benchmark Collection for Text Categorization Research
inferredcites →https://doi.org/10.5555/1577069.1755873openalex-snapshot
Hash Kernels for Structured Data

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-46672-9_17openalex-snapshot
Nuclear Norm Regularized Randomized Neural Network
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_73openalex-snapshot
Lower Bounds for Oblivious Subspace Embeddings
inferred← citeshttps://doi.org/10.1007/s10044-018-0697-0openalex-snapshot
Training neural networks on high-dimensional data using random projection
inferred← citeshttps://doi.org/10.1007/s10107-020-01517-xopenalex-snapshot
Random projections for quadratic programs
inferred← citeshttps://doi.org/10.1007/s11222-015-9608-zopenalex-snapshot
Random projections for Bayesian regression
inferred← citeshttps://doi.org/10.1007/s11432-017-9243-7openalex-snapshot
Integrating a weighted-average method into the random walk framework to generate individual friend recommendations
inferred← citeshttps://doi.org/10.1007/s13042-018-00904-3openalex-snapshot
Big data aggregation in the case of heterogeneity: a feasibility study for digital health
inferred← citeshttps://doi.org/10.1007/s40009-018-0771-6openalex-snapshot
A Data-Independent Reusable Projection (DIRP) Technique for Dimension Reduction in Big Data Classification Using k-Nearest Neighbor (k-NN)
inferred← citeshttps://doi.org/10.1016/j.ins.2021.08.003openalex-snapshot
Jointly evolving and compressing fuzzy system for feature reduction and classification
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.105639openalex-snapshot
Stable sparse subspace embedding for dimensionality reduction
inferred← citeshttps://doi.org/10.1016/j.patcog.2016.05.018openalex-snapshot
Feature selection for linear SVM with provable guarantees
inferred← citeshttps://doi.org/10.1016/j.patcog.2016.07.027openalex-snapshot
MREKLM: A fast multiple empirical kernel learning machine
inferred← citeshttps://doi.org/10.1016/j.patcog.2017.06.029openalex-snapshot
Fast Fisher discriminant analysis with randomized algorithms
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.106985openalex-snapshot
Support vector machines resilient against training data integrity attacks
inferred← citeshttps://doi.org/10.1103/physrevresearch.6.013010openalex-snapshot
Random projection using random quantum circuits
inferred← citeshttps://doi.org/10.1109/access.2019.2941986openalex-snapshot
A Fast and Robust Support Vector Machine With Anti-Noise Convex Hull and its Application in Large-Scale ncRNA Data Classification
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798940openalex-snapshot
Large-scale strategic games and adversarial machine learning
inferred← citeshttps://doi.org/10.1109/igarss.2016.7730340openalex-snapshot
Hadamard-Walsh random projection for hyperspectral image classification
inferred← citeshttps://doi.org/10.1109/igarss.2018.8518450openalex-snapshot
Improved Random Projection with $K$ -Means Clustering for Hyperspectral Image Classification
inferred← citeshttps://doi.org/10.1109/lgrs.2016.2581172openalex-snapshot
Fast SVD With Random Hadamard Projection for Hyperspectral Dimensionality Reduction
inferred← citeshttps://doi.org/10.1109/lgrs.2016.2647001openalex-snapshot
Random Hadamard Projections for Hyperspectral Unmixing
inferred← citeshttps://doi.org/10.1109/lgrs.2018.2872111openalex-snapshot
An Efficient Method for NMR Data Compression Based on Fast Singular Value Decomposition
inferred← citeshttps://doi.org/10.1109/tbme.2021.3054248openalex-snapshot
Applying a Random Projection Algorithm to Optimize Machine Learning Model for Breast Lesion Classification
inferred← citeshttps://doi.org/10.1109/whispers.2016.8071796openalex-snapshot
Random-projection-based nonnegative least squares for hyperspectral image unmixing
inferred← citeshttps://doi.org/10.1142/s0218195922500078openalex-snapshot
Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
inferred← citeshttps://doi.org/10.1145/2488608.2488620openalex-snapshot
Low rank approximation and regression in input sparsity time
inferred← citeshttps://doi.org/10.1145/2783258.2783364openalex-snapshot
Improved Bounds on the Dot Product under Random Projection and Random Sign Projection
inferred← citeshttps://doi.org/10.1145/3634813openalex-snapshot
Subsampled Randomized Hadamard Transformation-based Ensemble Extreme Learning Machine for Human Activity Recognition
inferred← citeshttps://doi.org/10.1155/2017/2658707openalex-snapshot
Fast Constrained Spectral Clustering and Cluster Ensemble with Random Projection
inferred← citeshttps://doi.org/10.12783/dtcse/smce2017/12422openalex-snapshot
Dual Random Projection for Linear Support Vector Machine
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6365openalex-snapshot
Low Rank Approximation and Regression in Input Sparsity Time
inferred← citeshttps://doi.org/10.48550/arxiv.1606.05732openalex-snapshot
How to Fake Multiply by a Gaussian Matrix
inferred← citeshttps://doi.org/10.48550/arxiv.2002.11923openalex-snapshot
The Effectiveness of Johnson-Lindenstrauss Transform for High Dimensional Optimization With Adversarial Outliers, and the Recovery
inferred← citeshttps://doi.org/10.48550/arxiv.2011.12046openalex-snapshot
Effective and Sparse Count-Sketch via k-means clustering
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.