1 citations · 4 across the 8 of their papers we have counts for
23 papers
Sublinear Time Nearest Neighbor Search over Generalized Weighted Manhattan Distance
Huan Hu, Jianzhong Li
Nearest Neighbor Search (NNS) over generalized weighted distances is fundamental to a wide range of applications. The problem of NNS over the generalized weighted square Euclidean…
Efficient Approximate Nearest Neighbor Search for Multiple Weighted Distance Functions
Huan Hu, Jianzhong Li
Nearest neighbor search is fundamental to a wide range of applications. Since the exact nearest neighbor search suffers from the "curse of dimensionality", approximate approaches,…
A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee
Hengzhao Ma, Jianzhong Li
In this paper we propose an algorithm for the approximate k-Nearest-Neighbors problem. According to the existing researches, there are two kinds of approximation criterion. One is…
Sampling Based Approximate Skyline Calculation on Big Data
Xingxing Xiao, Jianzhong Li
The existing algorithms for processing skyline queries cannot adapt to big data. This paper proposes two approximate skyline algorithms based on sampling. The first algorithm obtai…
Complexity and Efficient Algorithms for Data Inconsistency Evaluating and Repairing
Dongjing Miao, Zhipeng Cai, Jianzhong Li +2
Data inconsistency evaluating and repairing are major concerns in data quality management. As the basic computing task, optimal subset repair is not only applied for cost estimatio…
Auto-Model: Utilizing Research Papers and HPO Techniques to Deal with the CASH problem
Chunnan Wang, Hongzhi Wang, Tianyu Mu +2
In many fields, a mass of algorithms with completely different hyperparameters have been developed to address the same type of problems. Choosing the algorithm and hyperparameter s…