Improving n-Similarity Problem by Genetic Algorithm and Its Application in Text Document Resemblance

Fuzzy Information and Engineering

M. Mirhosseini¹  H. Nezamabadi-pour²  M. Mashinchi³ 

[1] Department of Computer Science, Faculty of Mathematics and Computing, Higher Education Complex of Bam, Bam, Kerman, Iran;Department of Electrical Engineering, Faculty of Engineering, Shahid Bahonar University of Kerman, Kerman, Iran;Department of Statistics, Faculty of Mathematics and Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran;

关键词: n-Similarity;    Genetic algorithm;    Similarity measure;   

DOI  :  10.1016/j.fiae.2014.12.001

来源: DOAJ

【 摘 要 】

In this paper, some methods of similarity measures between objects are presented with their properties reviewed. The study is conducted to propose a new method based on genetic algorithm in order to reduce the time complexity of finding n most similar objects among the huge number of objects. This method is tested on two applications. The former aims at finding the most similar residents in a condominium, and the latter deals with finding the most similar n-groups of text documents out of a great dataset. The simulation results show that the proposed method can efficiently improve the order of time complexity especially for the second application.

【 授权许可】

Unknown