An Adaptive Subspace Similarity Search Approach
In recent years,such database fields as multimedia information retrieval,similarity join and time series matching,where similarity search has attracted much attention.Existing researches mostly compute nearest neighbor to solve problems about search target set,such as kNN and kNNJ,by metric distance...
Saved in:
Main Authors: | Jianxin Ren, Huahui Chen |
---|---|
Format: | Article |
Language: | zho |
Published: |
Beijing Xintong Media Co., Ltd
2015-07-01
|
Series: | Dianxin kexue |
Subjects: | |
Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015190/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A distributed high efficiency similarity matrix computation method based on users’ mobile network access location
by: Yuan WANG, et al.
Published: (2018-05-01) -
Securely redundant scheduling policy for MapReduce based on dynamic domains partition
by: Qing-ni SHEN, et al.
Published: (2014-01-01) -
A ranking hashing algorithm based on listwise supervision
by: Anbang YANG, et al.
Published: (2019-05-01) -
Diffluent Internet Traffic and Characteristics Computation Based on Hadoop
by: Yong Liu, et al.
Published: (2014-12-01) -
Temperature aware energy-efficient task scheduling strategies for mapreduce
by: Bin LIAO, et al.
Published: (2016-01-01)