《大数据 Big Data》课程教学资源（参考文献）Learning to Hash for Big Data

Introduction Problem Definition Reduce Dimensionality and Storage Cost Gist vector Binary reduction 10 million images 20 GB 160MB 口卡+得二4元互)Q0 Li (http://cs.nju.edu.cn/lwj) Learning to Hash CS.NJU 6/50

Introduction Problem Definition Reduce Dimensionality and Storage Cost Li (http://cs.nju.edu.cn/lwj) Learning to Hash CS, NJU 6 / 50

Introduction Problem Definition Querying Hamming distance: 。101101110,00101101la=3 。l11011,01011lg=1 Query Image Dataset ，王○Q0 Li (http://cs.nju.edu.cn/lvj) Learning to Hash CS.NJU 7/50

Introduction Problem Definition Querying Hamming distance: ||01101110, 00101101||H = 3 ||11011, 01011||H = 1 Li (http://cs.nju.edu.cn/lwj) Learning to Hash CS, NJU 7 / 50

Introduction Problem Definition Querying 是 口卡得三4元互Q0 Li (http://cs.nju.edu.cn/lvj) Learning to Hash CS.NJU 8/50

Introduction Problem Definition Querying Li (http://cs.nju.edu.cn/lwj) Learning to Hash CS, NJU 8 / 50

Introduction Problem Definition Querying 口卡得三4元互Q0 Li (http://cs.nju.edu.cn/lwj) Learning to Hash CS.NJU 9 /50

Introduction Problem Definition Querying Li (http://cs.nju.edu.cn/lwj) Learning to Hash CS, NJU 9 / 50

Introduction Problem Definition Fast Query Speed o By using hashing scheme,we can achieve constant or sub-linear search time complexity. Exhaustive search is also acceptable because the distance calculation cost is cheap now. 日卡三4元，互Q0 Li (http://cs.nju.edu.cn/lwj) Learning to Hash CS.NJU 10/50

Introduction Problem Definition Fast Query Speed By using hashing scheme, we can achieve constant or sub-linear search time complexity. Exhaustive search is also acceptable because the distance calculation cost is cheap now. Li (http://cs.nju.edu.cn/lwj) Learning to Hash CS, NJU 10 / 50