ABC-SG: A New Artificial Bee Colony Algorithm-Based Distance of Sequential Data Using Sigma Grams

by   Muhammad Marwan Muhammad Fuad, et al.

The problem of similarity search is one of the main problems in computer science. This problem has many applications in text-retrieval, web search, computational biology, bioinformatics and others. Similarity between two data objects can be depicted using a similarity measure or a distance metric. There are numerous distance metrics in the literature, some are used for a particular data type, and others are more general. In this paper we present a new distance metric for sequential data which is based on the sum of n-grams. The novelty of our distance is that these n-grams are weighted using artificial bee colony; a recent optimization algorithm based on the collective intelligence of a swarm of bees on their search for nectar. This algorithm has been used in optimizing a large number of numerical problems. We validate the new distance experimentally.



page 1

page 2

page 3

page 4


A hybrid bat algorithm

Swarm intelligence is a very powerful technique to be used for optimizat...

Similarity Between Points in Metric Measure Spaces

This paper is about similarity between objects that can be represented a...

Improved Binary Artificial Bee Colony Algorithm

The Artificial Bee Colony (ABC) algorithm is an evolutionary optimizatio...

The k-outlier Fréchet distance

The Fréchet distance is a popular metric for curves; however, its bottle...

New Method for 3D Shape Retrieval

The recent technological progress in acquisition, modeling and processin...

Similarity Search on Computational Notebooks

Computational notebook software such as Jupyter Notebook is popular for ...

A new algorithm for the ^KDMDGP subclass of Distance Geometry Problems

The fundamental inverse problem in distance geometry is the one of findi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.