作者: Yunjun Gao , Xiaoye Miao , Gang Chen , Baihua Zheng , Deng Cai
DOI: 10.1007/S00778-017-0460-Y
关键词: Theoretical computer science 、 Discrete mathematics 、 Complex network 、 k-nearest neighbors algorithm 、 Computer science 、 Graph 、 Heuristics
摘要: Reverse k-nearest neighbor ( $$\hbox {R}k\hbox {NN}$$ R k NN ) query on graphs returns the data objects that take a specified query object q as one of their k-nearest neighbors. It has …