4 citations · 16 across the 27 of their papers we have counts for
4 papers · 1 filter
Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search
Qiang Huang, Anthony K. H. Tung
Finding the nearest neighbor to a hyperplane (or Point-to-Hyperplane Nearest Neighbor Search, simply P2HNNS) is a new and challenging problem with applications in many research dom…
DIOT: Detecting Implicit Obstacles from Trajectories
Yifan Lei, Qiang Huang, Mohan Kankanhalli +1
In this paper, we study a new data mining problem of obstacle detection from trajectory data. Intuitively, given two kinds of trajectories, i.e., reference and query trajectories,…
A Generic Distributed Clustering Framework for Massive Data
Pingyi Luo, Qiang Huang, Anthony K. H. Tung
In this paper, we introduce a novel Generic distributEd clustEring frameworK (GEEK) beyond -means clustering to process massive amounts of data. To deal with different data type…
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
Yifan Lei, Qiang Huang, Mohan Kankanhalli +1
Locality-Sensitive Hashing (LSH) is one of the most popular methods for -Approximate Nearest Neighbor Search (-ANNS) in high-dimensional spaces. In this paper, we propose a n…