A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search

M Wang, X Xu, Q Yue, Y Wang - arXiv preprint arXiv:2101.12631, 2021 - arxiv.org
Approximate nearest neighbor search (ANNS) constitutes an important operation in a
multitude of applications, including recommendation systems, information retrieval, and …

[HTML][HTML] Survey on exact kNN queries over high-dimensional data space

N Ukey, Z Yang, B Li, G Zhang, Y Hu, W Zhang - Sensors, 2023 - mdpi.com
k nearest neighbours (kNN) queries are fundamental in many applications, ranging from
data mining, recommendation system and Internet of Things, to Industry 4.0 framework …

Ultra-scalable spectral clustering and ensemble clustering

D Huang, CD Wang, JS Wu, JH Lai… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
This paper focuses on scalability and robustness of spectral clustering for extremely large-
scale datasets with limited resources. Two novel algorithms are proposed, namely, ultra …

Approximate nearest neighbor search on high dimensional data—experiments, analyses, and improvement

W Li, Y Zhang, Y Sun, W Wang, M Li… - … on Knowledge and …, 2019 - ieeexplore.ieee.org
Nearest neighbor search is a fundamental and essential operation in applications from
many domains, such as databases, machine learning, multimedia, and computer vision …

A survey on large-scale machine learning

M Wang, W Fu, X He, S Hao… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Machine learning can provide deep insights into data, allowing machines to make high-
quality predictions and having been widely used in real-world applications, such as text …

Efanna: An extremely fast approximate nearest neighbor search algorithm based on knn graph

C Fu, D Cai - arXiv preprint arXiv:1609.07228, 2016 - arxiv.org
Approximate nearest neighbor (ANN) search is a fundamental problem in many areas of
data mining, machine learning and computer vision. The performance of traditional …

Grale: Designing networks for graph learning

J Halcrow, A Mosoi, S Ruth, B Perozzi - Proceedings of the 26th ACM …, 2020 - dl.acm.org
How can we find the right graph for semi-supervised learning? In real world applications, the
choice of which edges to use for computation is the first step in any graph learning process …

Scalable mutual information estimation using dependence graphs

M Noshad, Y Zeng, AO Hero - ICASSP 2019-2019 IEEE …, 2019 - ieeexplore.ieee.org
The Mutual Information (MI) is an often used measure of dependency between two random
variables utilized in information theory, statistics and machine learning. Recently several MI …

[HTML][HTML] Node attribute-enhanced community detection in complex networks

C Jia, Y Li, MB Carson, X Wang, J Yu - Scientific reports, 2017 - nature.com
Community detection involves grouping the nodes of a network such that nodes in the same
community are more densely connected to each other than to the rest of the network …

Label information guided graph construction for semi-supervised learning

L Zhuang, Z Zhou, S Gao, J Yin, Z Lin… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
In the literature, most existing graph-based semi-supervised learning methods only use the
label information of observed samples in the label propagation stage, while ignoring such …