Parallel and Exact Method for Solving n-Similarity Problem
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 conce...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Shahid Rajaee Teacher Training University
2020-07-01
|
| Series: | Journal of Electrical and Computer Engineering Innovations |
| Subjects: | |
| Online Access: | https://jecei.sru.ac.ir/article_1461_853f78fd157cc8020c98ba3a5002ebd5.pdf |
| _version_ | 1818197109455716352 |
|---|---|
| author | M. Mirhosseini M. Fazlali |
| author_facet | M. Mirhosseini M. Fazlali |
| author_sort | M. Mirhosseini |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-12T01:44:45Z |
| format | Article |
| id | doaj.art-b710cb323a1b4a38b04543394c70d825 |
| institution | Directory Open Access Journal |
| issn | 2322-3952 2345-3044 |
| language | English |
| last_indexed | 2024-12-12T01:44:45Z |
| publishDate | 2020-07-01 |
| publisher | Shahid Rajaee Teacher Training University |
| record_format | Article |
| series | Journal of Electrical and Computer Engineering Innovations |
| spelling | doaj.art-b710cb323a1b4a38b04543394c70d8252022-12-22T00:42:37ZengShahid Rajaee Teacher Training UniversityJournal of Electrical and Computer Engineering Innovations2322-39522345-30442020-07-018219320010.22061/jecei.2020.7247.3771461Parallel and Exact Method for Solving n-Similarity ProblemM. Mirhosseini0M. Fazlali1Department of Data and Computer Science. Faculty of Mathematical Sciences, Shahid Beheshti University, Tehran, Iran.Department of Data and Computer Science. Faculty of Mathematical Sciences, Shahid Beheshti University, Tehran, Iran.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.https://jecei.sru.ac.ir/article_1461_853f78fd157cc8020c98ba3a5002ebd5.pdfn-similarityparallel programmingopen-mptext document similarity |
| spellingShingle | M. Mirhosseini M. Fazlali Parallel and Exact Method for Solving n-Similarity Problem Journal of Electrical and Computer Engineering Innovations n-similarity parallel programming open-mp text document similarity |
| title | Parallel and Exact Method for Solving n-Similarity Problem |
| title_full | Parallel and Exact Method for Solving n-Similarity Problem |
| title_fullStr | Parallel and Exact Method for Solving n-Similarity Problem |
| title_full_unstemmed | Parallel and Exact Method for Solving n-Similarity Problem |
| title_short | Parallel and Exact Method for Solving n-Similarity Problem |
| title_sort | parallel and exact method for solving n similarity problem |
| topic | n-similarity parallel programming open-mp text document similarity |
| url | https://jecei.sru.ac.ir/article_1461_853f78fd157cc8020c98ba3a5002ebd5.pdf |
| work_keys_str_mv | AT mmirhosseini parallelandexactmethodforsolvingnsimilarityproblem AT mfazlali parallelandexactmethodforsolvingnsimilarityproblem |