Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
We look at the problem of location recognition in a large image dataset using a vocabulary tree. This entails finding the location of a query image in a large dataset containing 3...
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
Christopher M. De Vries, Lance De Vine, Shlomo Gev...
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...