1 |
Lian X , Chen L . Subspace similarity search under Lp-Norm. IEEE Transactions on Knowledge and Data Engineering, 2012,24(2): 365~382
|
2 |
Hinneburg A , Aggarwal C , Keim D A ,et al. What is the nearest neighbor in high dimensional spaces. Proceedings of the 26th VLDB Conference, Cairo,Egypt, 2000: 506~515
|
3 |
张慧, 郑吉平, 韩秋廷 . BTreeU-Topk:基于二叉树的不确定数据上的Top-k查询算法. 计算机研究与发展, 2012(1): 2095~2105 Zhang H , Zheng J P , Han Q T . BTreeU-Topk:binary-tree based Top-k query algorithms on uncertain data. Journal of Computer Research and Development, 2012(1): 2095~2105
|
4 |
Shi Y , Graham B . Similarity search problem research on multi-dimensional data sets. Proceedings of Tenth International Conference on Information Technology:New Generations(ITNG), Washington DC,USA, 2013: 573~577
|
5 |
张彪, 李川, 徐洪宇 等. 基于特征子图的异构信息网络节点相似性度量. 电信科学, 2014,30(11): 66~72 Zhang B , Li C , Xu H Y ,et al. Heterogeneous information networks node similarity measurement based on feature sub-graph. Telecommunications Science, 2014,30(11): 66~72
|
6 |
Watanabe S , Sawada H , Minami Y ,et al. Fast similarity search on a large speech data set with neighborhood graph indexing. Proceedings of 2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), Dallas,USA, 2010: 5358~5361
|
7 |
Marios , Yannis . R-trees:a dynamic index structure for spatial searching. Boston,MA,USA, 1984: 993~1002
|
8 |
Kriegel H P , Kroger P , Schubert M ,et al. Efficient query processing in arbitrary subspaces using vector approximations. Proceedings of the 18th International Conference on Scientific and Statistical Database Management, Washington DC,USA, 2006: 184~190
|
9 |
Zhang D X , Agrawal D , Chen G ,et al. HashFile:an efficient index structure for multimedia data. Proceedings of the IEEE 27th International Conference on Data Engineering(ICDE), Washington DC,USA, 2011: 1103~1114
|
10 |
Datar M , Immorlica N , Indyk P ,et al. Locality-sensitive hashing scheme based on p-stable distributions. Proceedings of the 20th Annual Symposium on Computational Geometry, New York,USA, 2004: 253~262
|
11 |
Lv Q , Josephson W , Wang Z ,et al. Multi-probe LSH:efficient indexing for high-dimensional similarity search. Proceedings of the 33rd International Conference on Very Large Data Bases, Vienna,Austria, 2007: 950~961
|
12 |
林悦 . 基于散列算法的高维数据的最近邻检索(硕士学位论文). 浙江大学, 2013 Lin Y . Hashing based algorithms for nearest neighbor search in high dimensions(master dissertation). Zhejiang University, 2013
|
13 |
Zhang Z J , Ooi B C , Parthasarathy S ,et al. Similarity search on bregman divergence:towards non-metric indexing. Proceedings of the VLDB Endowment, Springer,Geimany, 2009: 13~24
|
14 |
Thomas B . Subspace similarity search using the ideas of ranking and top-k retrieval. Proceedings of the IEEE 26th International Conference on Data Engineering Workshops (ICDEW), California,USA, 2010: 4~9
|
15 |
Thomas B . Subspace similarity search using the ideas of ranking and top-k retrieval. Proceedings of Scientific and Statistical Database Management Springer Berlin Heidelberg, Germany, 2010: 555~564
|
16 |
He X F . Incremental semi-supervised subspace learning for image retrieval. Proceedings of the 12th Annual ACM International Conference on Multimedia, New York,USA, 2004: 2~8
|
17 |
Stupar A , Michel S , Schenkel R . Rankreduce-processing k-nearest neighbor queries on top of MapReduce. Proceedings of the 8th Workshop on Large-Scale Distributed Systems for Information Retrieval, Geneva,Switzerland, 2010: 13~18
|
18 |
Zhang C , Li F F , Jestes J . Efficient parallel kNN joins for large data in MapReduce. Proceedings of the 15th International Conference on Extending Database Technology, New York,NY,USA, 2012: 38~49
|
19 |
Kong W H , Wu J L , Guo M Y . Manhattan hashing for large-scale image retrieval. Proceedings of the 35th International ACMSIGIR Conference on Research and Development in Information Retrieval, Portland,Oregon,USA, 2012: 45~54
|