《大数据 Big Data》课程教学资源（参考文献）Learning to Hash for Big Data Retrieval and Mining（南京大学：李武军）

Introduction Problem Definition Reduce Dimensionality and Storage Cost Gist vector Binary reduction 1 million images 2 GB 16 MB 口卡+得二4元互)Q0 Li (http://www.cs.sjtu.edu.cn/-livujun Learning to Hash CSE.SJTU 6/49

Introduction Problem Definition Reduce Dimensionality and Storage Cost Li (http://www.cs.sjtu.edu.cn/~liwujun) Learning to Hash CSE, SJTU 6 / 49

Introduction Problem Definition Querying Hamming distance: 。101101110,00101101la=3 。l11011,01011lg=1 Query Image Dataset ，30Q0 Li (http://www.cs.sjtu.edu.cn/-livujun Learning to Hash CsE,S」TU7/49

Introduction Problem Definition Querying Hamming distance: ||01101110, 00101101||H = 3 ||11011, 01011||H = 1 Li (http://www.cs.sjtu.edu.cn/~liwujun) Learning to Hash CSE, SJTU 7 / 49

Introduction Problem Definition Querying 是 口卡得三4元互Q0 Li (http://www.cs.sjtu.edu.cn/-livujun Learning to Hash CSE,SJTU 8/49

Introduction Problem Definition Querying Li (http://www.cs.sjtu.edu.cn/~liwujun) Learning to Hash CSE, SJTU 8 / 49

Introduction Problem Definition Querying 口卡得三4元互Q0 Li (http://www.cs.sjtu.edu.cn/-livujun Learning to Hash CSE,SJTU 9/49

Introduction Problem Definition Querying Li (http://www.cs.sjtu.edu.cn/~liwujun) Learning to Hash CSE, SJTU 9 / 49

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://www.cs.sjtu.edu.cn/-livujun Learning to Hash CSE.SJTU 10/49

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://www.cs.sjtu.edu.cn/~liwujun) Learning to Hash CSE, SJTU 10 / 49