Scalable Graph Hashing with Feature Transformation Experiment Training Time (in second) Training time @TINY-1M.Here,t =1438.60 Method 32 bits 64 bits 96 bits 128 bits 256 bits SGH 34.49 52.37 71.53 89.65 164.23 ITQ 31.72 60.62 89.01 149.18 322.06 AGH 18.60+t1 19.40+t1 20.08+t1 22.48+t1 25.09+t1 DGH-I 187.57+t1 296.99+t1 518.57+t1 924.08+t1 1838.30+t1 DGH-R 217.06+t1 360.18+t1 615.74+t1 1089.10+t1 2300.10+t1 PCAH 4.29 4.54 4.75 5.85 6.49 LSH 1.68 1.77 1.84 2.55 3.76 Training time @MIRFLICKR-1M.Here,t2=1564.86 Method 32 bits 64 bits 96 bits 128 bits 256 bits SGH 41.51 59.02 74.86 97.25 168.35 ITQ 36.17 64.61 89.50 132.71 285.10 AGH 17.99+t2 18.80+t2 20.30+t2 19.87+t2 21.60+t2 DGH-I 85.81+t2 143.68+t2 215.41+t2 352.73+t2 739.56+t2 DGH-R 116.25+t2 206.24+t2 308.32+t2 517.97+t2 1199.44+t2 PCAH 7.65 7.90 8.47 9.23 10.42 LSH 2.44 2.43 2.71 3.38 4.21 )Q0 Li (http://cs.nju.edu.cn/lvj) Learning to Hash LAMDA,CS.NJU 36/43Scalable Graph Hashing with Feature Transformation Experiment Training Time (in second) Training time @TINY-1M. Here, t1 = 1438.60 Method 32 bits 64 bits 96 bits 128 bits 256 bits SGH 34.49 52.37 71.53 89.65 164.23 ITQ 31.72 60.62 89.01 149.18 322.06 AGH 18.60 + t1 19.40 + t1 20.08 + t1 22.48 + t1 25.09 + t1 DGH-I 187.57 + t1 296.99 + t1 518.57 + t1 924.08 + t1 1838.30 + t1 DGH-R 217.06 + t1 360.18 + t1 615.74 + t1 1089.10 + t1 2300.10 + t1 PCAH 4.29 4.54 4.75 5.85 6.49 LSH 1.68 1.77 1.84 2.55 3.76 Training time @MIRFLICKR-1M. Here, t2 = 1564.86 Method 32 bits 64 bits 96 bits 128 bits 256 bits SGH 41.51 59.02 74.86 97.25 168.35 ITQ 36.17 64.61 89.50 132.71 285.10 AGH 17.99 + t2 18.80 + t2 20.30 + t2 19.87 + t2 21.60 + t2 DGH-I 85.81 + t2 143.68 + t2 215.41 + t2 352.73 + t2 739.56 + t2 DGH-R 116.25 + t2 206.24 + t2 308.32 + t2 517.97 + t2 1199.44 + t2 PCAH 7.65 7.90 8.47 9.23 10.42 LSH 2.44 2.43 2.71 3.38 4.21 Li (http://cs.nju.edu.cn/lwj) Learning to Hash LAMDA, CS, NJU 36 / 43