An Optimized Approach of Modified BAT Algorithm to Record Deduplication

Abstract

The task of recognizing, in a data warehouse, records that pass on to the identical real world entity despite misspelling words, kinds, special writing styles or even unusual schema versions or data types is called as the record deduplication. In existing research they offered a genetic programming (GP) approach to record deduplication. Their approach combines several different parts of substantiation extracted from the data content to generate a deduplication purpose that is capable to recognize whether two or more entries in a depository are duplications or not. Because record deduplication is a time intense task even for undersized repositories, their aspire is to promote a method that discovers a proper arrangement of the best pieces of confirmation, consequently compliant a deduplication function that maximizes performance using a small representative portion of the corresponding data for preparation purposes also the optimization of process is less. Our research deals these issues with a novel technique called modified bat algorithm for record duplication. The incentive behind is to generate a flexible and effective method that employs Data Mining algorithms. The structure distributes many similarities with evolutionary computation techniques such as Genetic programming approach. This scheme is initialized with an inhabitant of random solutions and explores for optima by updating bat inventions. Nevertheless, disparate GP, modified bat has no development operators such as crossover and mutation. We also compare the proposed algorithm with other existing algorithms, including GP from the experimental results.

Nature - Inspired enhanced data deduplication for efficient cloud storage

“…A set of several files of varying sizes and formats is considered to be the data set for assessment. For assessing the performance of deduplication of records in databases, Precision, F-measure and Recall are the parameters used for comparison [7] [11]. In addition to these parameters, time taken to identify the duplicates can also be considered to make the comparison more vivid and effective.…”

“…The alphabet Σ of probable characters ch gives the set of all probable sequences. ED can be computed using dynamic programming [11]. This algorithm is capable to finding the minimum value required for insertion, deletion and substitution of a character to a word in order to obtain the original word.…”

Particle Swarm Optimization Algorithm for Facial Image Expression Classification

“…In some situations, it is necessary to switch to exploitation stage, we have to vary the loudness Ai and the rate ri of pulse emission during the iterations. Since the loudness usually decreases once a bat has found its prey, while the rate of pulse emission increases, the loudness can be chosen as any value of convenience, between Amin and Amax, assuming that a bat has just found the prey by stop emitting sound [5]. BAT algorithm uses echolocation and frequency tuning to solve problems [1].…”

Optimization noise figure of fiber Raman amplifier based on bat algorithm in optical communication network

“…The metaheuristic algorithms can be summed up in optimization problem in the in the field of business, artificial intelligence, engineering technology and other applications have been derived from the social behaviour of biological systems (animals). Bat algorithm (BA) is a novel feature; biological algorithm developed by Xin-She Yang in 2010 [18], depending on the echolocation behavior of bats and uses a frequency-tuning technique with varying loudness [19][20][21][22][23][24]. Initial population of the bats is performed randomly generated from real-valued vectors.…”