The Johnson-Lindenstrauss Lemma and the sphericity of some graphs
Journal of Combinatorial Theory Series A
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Latent semantic indexing: a probabilistic analysis
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Clustering for edge-cost minimization (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Database-friendly random projections
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Learning mixtures of arbitrary gaussians
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
SIAM Journal on Computing
A Random Sampling based Algorithm for Learning the Intersection of Half-spaces
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Learning Mixtures of Gaussians
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Euclidean distortion and the sparsest cut
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Very sparse random projections
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Journal of Biomedical Informatics - Special section: JAMA commentaries
Distributed sparse random projections for refinable approximation
Proceedings of the 6th international conference on Information processing in sensor networks
Dimensionality reduction for long duration and complex spatio-temporal queries
Proceedings of the 2007 ACM symposium on Applied computing
The price of privacy and the limits of LP decoding
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Nearest-neighbor-preserving embeddings
ACM Transactions on Algorithms (TALG)
Very sparse stable random projections for dimension reduction in lα (0
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A Sketch Algorithm for Estimating Two-Way and Multi-Way Associations
Computational Linguistics
Learning intersections of halfspaces with a margin
Journal of Computer and System Sciences
Estimators and tail bounds for dimension reduction in lα (0
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Collaborative data gathering in wireless sensor networks using measurement co-occurrence
Computer Communications
CACS: A Novel Classification Algorithm Based on Concept Similarity
ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Dense Fast Random Projections and Lean Walsh Transforms
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
An Algorithm to Assess the Reliability of Hierarchical Clusters in Gene Expression Data
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
The Mailman algorithm: A note on matrix--vector multiplication
Information Processing Letters
Fuzzy ensemble clustering based on random projections for DNA microarray data analysis
Artificial Intelligence in Medicine
Feature hashing for large scale multitask learning
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Fast Spectral Clustering with Random Projection and Sampling
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
A stability-based algorithm to validate hierarchical clusters of genes
International Journal of Knowledge Engineering and Soft Data Paradigms
Communications of the ACM
Compressive-projection principal component analysis
IEEE Transactions on Image Processing
Sketching techniques for collaborative filtering
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Accelerating Feature Based Registration Using the Johnson-Lindenstrauss Lemma
MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part I
A performance driven methodology for cancelable face templates generation
Pattern Recognition
Hash Kernels for Structured Data
The Journal of Machine Learning Research
Nonlinear estimators and tail bounds for dimension reduction in l1 using Cauchy random projections
COLT'07 Proceedings of the 20th annual conference on Learning theory
A sparse Johnson: Lindenstrauss transform
Proceedings of the forty-second ACM symposium on Theory of computing
Random projections for face detection under resource constraints
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Fully decentralized computation of aggregates over data streams
Proceedings of the First International Workshop on Novel Data Stream Pattern Mining Techniques
Compressed fisher linear discriminant analysis: classification of randomly projected data
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Realtime training on mobile devices for face recognition applications
Pattern Recognition
Clustering with random indexing K-tree and XML structure
INEX'09 Proceedings of the Focused retrieval and evaluation, and 8th international conference on Initiative for the evaluation of XML retrieval
Fingerprinting ratings for collaborative filtering: theoretical and empirical analysis
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Random projections for SVM ensembles
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Two-dimensional random projection
Signal Processing
Fully decentralized computation of aggregates over data streams
ACM SIGKDD Explorations Newsletter
Random projections for linear SVM ensembles
Applied Intelligence
K-means clustering with feature hashing
HLT-SS '11 Proceedings of the ACL 2011 Student Session
Efficient online locality sensitive hashing via reservoir counting
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Almost optimal explicit Johnson-Lindenstrauss families
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Acceleration of randomized Kaczmarz method via the Johnson---Lindenstrauss Lemma
Numerical Algorithms
Sparser Johnson-Lindenstrauss transforms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improving random projections using marginal information
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An almost optimal unrestricted fast Johnson-Lindenstrauss transform
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Knowledge discovery in data using formal concept analysis and random projections
International Journal of Applied Mathematics and Computer Science
A tight bound on the performance of Fisher's linear discriminant in randomly projected data spaces
Pattern Recognition Letters
Novelty detection in projected spaces for structural health monitoring
IDA'10 Proceedings of the 9th international conference on Advances in Intelligent Data Analysis
Phoneme recognition using sparse random projections and ensemble classifiers
NOLISP'09 Proceedings of the 2009 international conference on Advances in Nonlinear Speech Processing
A sublinear-time randomized approximation scheme for the robinson-foulds metric
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Random projection, margins, kernels, and feature-selection
SLSFS'05 Proceedings of the 2005 international conference on Subspace, Latent Structure and Feature Selection
Randomized Algorithms for Matrices and Data
Foundations and Trends® in Machine Learning
Block-Based Compressed Sensing of Images and Video
Foundations and Trends in Signal Processing
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
Graph Sparsification by Effective Resistances
SIAM Journal on Computing
Iterative random projections for high-dimensional data clustering
Pattern Recognition Letters
Approximate privacy-preserving data mining on vertically partitioned data
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
Distributed high dimensional information theoretical image registration via random projections
Digital Signal Processing
LIMSI: learning semantic similarity by selecting random word subsets
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
A survey on unsupervised outlier detection in high-dimensional numerical data
Statistical Analysis and Data Mining
Fast large-scale approximate graph construction for NLP
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Random projection ensemble learning with multiple empirical kernels
Knowledge-Based Systems
Real-time compressive tracking
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III
Optimal lower bound for differentially private multi-party aggregation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Piecewise laplacian-based projection for interactive data exploration and organization
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
A comparative study of dimensionality reduction techniques to enhance trace clustering performances
Expert Systems with Applications: An International Journal
A learning theory approach to noninteractive database privacy
Journal of the ACM (JACM)
An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
A methodology for embedded classification of heartbeats using random projections
Proceedings of the Conference on Design, Automation and Test in Europe
Sparsity lower bounds for dimensionality reducing maps
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Enabling low bitrate mobile visual recognition: a performance versus bandwidth evaluation
Proceedings of the 21st ACM international conference on Multimedia
Linear regression with random projections
The Journal of Machine Learning Research
Fast approximation of matrix coherence and statistical leverage
The Journal of Machine Learning Research
Real-time visual tracking based on an appearance model and a motion mode
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
Sparser Johnson-Lindenstrauss Transforms
Journal of the ACM (JACM)
DocCloud: A document recommender system on cloud computing with plausible deniability
Information Sciences: an International Journal
| Hi-index | 0.02 |
A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space---where k is logarithmic in n and independent of d--so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the n points onto a spherically random k-dimensional hyperplane through the origin. We give two constructions of such embeddings with the property that all elements of the projection matrix belong in {-1, 0, +1 }. Such constructions are particularly well suited for database environments, as the computation of the embedding reduces to evaluating a single aggregate over k random partitions of the attributes.