4.7 Article

SWINN: Efficient nearest neighbor search in sliding windows using graphs

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Artificial Intelligence

Online Extra Trees Regressor

Saulo Martiello Mastelini et al.

Summary: As the amount of data continues to grow, traditional machine learning algorithms are no longer capable of handling large volumes of data. This paper proposes a new online machine learning algorithm called online extra trees, which is based on decision tree ensembles. The algorithm combines subbagging, random tree split points, and model trees to achieve high accuracy while reducing computational costs.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

SOKNL: A novel way of integrating K-nearest neighbours with adaptive random forest regression for data streams

Yibin Sun et al.

Summary: Most research in machine learning for data streams has focused on classification algorithms, with less attention on regression methods. This paper presents a novel forest-based algorithm, called Self-Optimising K-Nearest Leaves (SOKNL), for streaming regression problems. The algorithm extends the Adaptive Random Forest Regression, by generating representative data points (centroids) in each leaf and utilizing only the k trees with the smallest distances for prediction. The algorithm also introduces a mechanism for tuning the k values based on historical information. Experimental results show that the proposed algorithm outperforms standard stream regression methods.

DATA MINING AND KNOWLEDGE DISCOVERY (2022)

Article Computer Science, Information Systems

A survey on graph-based methods for similarity searches in metric spaces

Larissa C. Shimomura et al.

Summary: The development of technology has accelerated the growth of complex data, and similarity search has become a widely used approach. Graph-based methods have emerged as an efficient alternative for similarity retrieval, but there is a lack of experimental analysis on a comprehensive number of graph-based methods under the same search algorithm and execution environment.

INFORMATION SYSTEMS (2021)

Article Computer Science, Software Engineering

PANENE: A Progressive Algorithm for Indexing and Querying Approximate k-Nearest Neighbors

Jaemin Jo et al.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2020)

Article Computer Science, Information Systems

ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms

Martin Aumuller et al.

INFORMATION SYSTEMS (2020)

Article Computer Science, Artificial Intelligence

Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs

Yu A. Malkov et al.

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2020)

Article Computer Science, Artificial Intelligence

The Influence of Hubness on NN-Descent

Brankica Bratic et al.

INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS (2019)

Article Computer Science, Artificial Intelligence

Tackling heterogeneous concept drift with the Self-Adjusting Memory (SAM)

Viktor Losing et al.

KNOWLEDGE AND INFORMATION SYSTEMS (2018)

Article Computer Science, Artificial Intelligence

Adaptive random forests for evolving data stream classification

Heitor M. Gomes et al.

MACHINE LEARNING (2017)

Article Computer Science, Artificial Intelligence

Outlier detection using neighborhood rank difference

Gautam Bhattacharya et al.

PATTERN RECOGNITION LETTERS (2015)

Article Computer Science, Artificial Intelligence

Learning model trees from evolving data streams

Elena Ikonomovska et al.

DATA MINING AND KNOWLEDGE DISCOVERY (2011)

Article Computer Science, Artificial Intelligence

Product Quantization for Nearest Neighbor Search

Herve Jegou et al.

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2011)