Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform
Vladimir BravermanRafail OstrovskyYuval RabaniPublished in: CoRR (2010)
Keyphrases
- johnson lindenstrauss
- high dimensional
- data dependent
- gaussian graphical models
- graph matching
- directed acyclic
- sparse data
- graph theory
- particle swarm optimization
- linear transform
- graph theoretic
- graph mining
- weighted graph
- graph structure
- densely connected
- sparse representation
- machine learning
- level set method
- heavy tailed
- risk bounds
- directed graph
- graphical models