atlas

Research map / Graph learning / Graph algorithms and clustering

Large Graph Hashing with Spectral Rotation

AAAI 2017 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 65 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add spectral rotation to the real-valued solution (ablation)AGH · CIFAR-10 48 bits, m=500MAP: 18.67 -> 21.07Helped
add spectral rotation to the real-valued solution (ablation)AGH · CIFAR-10 96 bits, m=500MAP: 16.46 -> 20.88Helped
add spectral rotation to the real-valued solution (ablation)AGH · CIFAR-10 48 bits, m=100MAP: 17.89 -> 18.12Helped
replace AGH rounding with spectral rotation plus balanced ranking assignment (LGHSR)AGH · CIFAR-10 Hamming ranking 96 bitsMAP: 0.1766 -> 0.1987Helped
replace DGH with LGHSRDGH · YouTube Faces Hamming ranking 128 bitsmean precision (top 2000): 0.7805 -> 0.8428Helped
use LGHSR at long code length (MNIST)LGHSR · MNISTMAP / F-measureMixed
replace AGH rounding with spectral rotation (LGHSR) in training costAGH · CIFAR-10 96 bitstraining time (s): 18.3 -> 29.8Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy