|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 12 of 43 found articles
| Title: |
A Novel Parallel Algorithm for Clustering Documents Based on the Hierarchical Agglomerative Approach |
| Author: |
Amal Elsayed Aboutabl Mohamed Nour Elsayed |
| Appeared in: |
International journal of computer science and information technology |
| Paging: | Volume 3 (2011) nr. 2 pages 152-163 |
| Year: |
2011 |
| Contents: |
As the amount of internet documents has been growing, document clustering has become practicallyimportant. This has led the interest in developing document clustering algorithms. Exploiting parallelismplays an important role in achieving fast and high quality clustering. In this paper, we propose a parallelalgorithm that adopts a hierarchical document clustering approach. Our focus is to exploit the sources ofparallelism to improve performance and decrease clustering time. The proposed parallel algorithm istested using a test-bed collection of 749 documents from CACM. A multiprocessor system based onmessage-passing is used. Various parameters are considered for evaluating performance includingaverage inter-cluster similarity, speedup and processors' utilization. Simulation results show that theproposed algorithm improves performance, decreases the clustering time, and increases the overallspeedup while still keeping a high clustering quality. By increasing the number of processors, theclustering time decreases till a certain point where any more processors will no longer be effective.Moreover, the algorithm is applicable for different domains for other document collections. |
| Publisher: |
Academy & Industry Research Collaboration Center (AIRCC) (provided by DOAJ) |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 12 of 43 found articles
| << previous | next >> |