Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Linghan Zeng

dblp:402/1818 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
high-dimensional data analysis
0.912025
On Finding Hubs in High Dimensions with Sampling · AAAI 2025
Algorithms and data structures › similarity search › nearest neighbor search
hubness
0.912025
On Finding Hubs in High Dimensions with Sampling · AAAI 2025
Algorithms and data structures › similarity search
nearest neighbor search
0.912025
On Finding Hubs in High Dimensions with Sampling · AAAI 2025

Methods — techniques the papers use, named apart from their topics

sampling · 1.7approximate kNN indexes · 1.7
YearPublicationVenuePosition
2025 On Finding Hubs in High Dimensions with Sampling
abstract
Hubs are a few points that frequently appear in the k-nearest neighbors (kNN) of many other points in a high-dimensional data set. The hubs' effects, called the hubness phenomenon, degrade the performance of kNN based models in high dimensions. We present SamHub, a simple sampling approach to efficiently identify hubs with theoretical guarantees. Apart from previous works based on approximate kNN indexes, SamHub is generic and applicable to any distance measure with negligible additional memory footprint. Empirically, by sampling only 10% of points, SamHub runs significantly faster and offers higher accuracy than existing hub detection methods on many real-world data sets with dot product, L1, L2, and dynamic time warping distances. Our ablation studies of SamHub on improving kNN-based classification show potential for other high-dimensional data analysis tasks.
Huiwen Dong, Linghan Zeng, Zhiwen Zhao, Francesco Silvestri 0001, Ninh Pham
AAAI2