|تعداد مشاهده مقاله||2,477,334|
|تعداد دریافت فایل اصل مقاله||1,746,047|
|Journal of Electrical and Computer Engineering Innovations (JECEI)|
|مقاله 5، دوره 8، شماره 2، مهر 2020، صفحه 193-200 اصل مقاله (798.96 K)|
|نوع مقاله: Original Research Paper|
|شناسه دیجیتال (DOI): 10.22061/jecei.2020.7247.377|
|M. Mirhosseini1؛ M. Fazlali* 2|
|1Department of Data and Computer Science. Faculty of Mathematical Sciences, Shahid Beheshti University, Tehran, Iran.|
|2Department of Data and Computer Science. Faculty of Mathematical Sciences, Shahid Beheshti University, Tehran, Iran.|
|تاریخ دریافت: 02 مهر 1398، تاریخ بازنگری: 28 دی 1398، تاریخ پذیرش: 02 اردیبهشت 1399|
|Background and Objectives: -similarity problem defined as measuring the similarity among objects and finding a group of objects from a dataset that have the most similarity to each other. This problem has been become an important issue in information retrieval and data mining. Theory of this concept is mathematically proven, but it practically has high memory complexity and is so time consuming. Besides, the solutions found by metaheuristics are not exact.|
Methods: This paper is conducted to propose an exact method to solve -similarity problem reducing the memory complexity and decreasing the execution time by parallelism using Open-MP. The experiments are performed on the application of text document resemblance.
Results: It has been shown that the memory complexity of the proposed method is decreased to , and the experimental results show that this method accelerates the speed of the computations about 5 times.
Conclusion: The simulated results of the proposed method display a good improvement in speed, the used memory space, and scalability compared with the previous exact method.
|n-Similarity؛ Parallel Programming؛ Open-MP؛ Text Document Similarity|
 M. Mirhoseini, M. Mashinchi, H. Nezamabadi-pour, “Improving n-Similarity problem by genetic algorithm and its application in text document resemblance,” Fuzzy Information and Engineering, 6: 263-278, 2014.
 M. K. Fallah, V. S. Keshvari, M. Fazlali, “A Parallel Hybrid Genetic Algorithm for Solving the Maximum Clique Problem,” in Proc. High-Performance Computing and Big Data Analysis. TopHPC 2019. Communications in Computer and Information Science, 891: 378-393, 2019.
 M. K. Fallah, M. Mirhosseini, M. Fazlali, M. Daneshtalab, "Scalable Parallel Genetic Algorithm For Solving Large Integer Linear Programming Models Derived From Behavioral Synthesis," in Proc. 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP): 390-394, 2020.
 S. Hong, T. Oguntebi, K. Olukotun, “Efficient Parallel Graph Exploration on Multi-Core CPU and GPU”, 2011 International Conference on Parallel Architectures and Compilation Techniques, Galveston, TX, pp. 78-88, 2011.
 M. Mirhosseini, M. Fazlali, G. Gaydadjiev, “A Parallel and Improved Quadrivalent Quantum-Inspired Gravitational Search Algorithm in Optimal Design of WSNs,” High-Performance Computing and Big Data Analysis. TopHPC 2019. Communications in Computer and Information Science, 891: 352-366, 2019.
 P. Delisle, M. Krajecki, M. Gravel, C. Gagné, “Parallel implementation of an ant colony optimization metaheuristic with OpenMP,” In Proceedings of the 3rd European Workshop on OpenMP (EWOMP’01): 1-7, 2001.
تعداد مشاهده مقاله: 281
تعداد دریافت فایل اصل مقاله: 340