Evaluating Layout and Clustering Algorithms for Visualizing Named Entity Graph

Ibrahim, K. and Ranaivo-Malançon, Bali and Lim, T. and Cheah, Y.N. (2017) Evaluating Layout and Clustering Algorithms for Visualizing Named Entity Graph. Journal of Telecommunication, Electronic and Computer Engineering, 9 (2-10). pp. 47-55. ISSN 2289-8131

[img] PDF
Evaluating - Copy.pdf

Download (230kB)
Official URL: http://journal.utem.edu.my/index.php/jtec/article/...


Myriad of layout and clustering algorithms exist to generate visual graphs of named entities. Consequently, it is hard for researchers to select the appropriate algorithms that fulfill their needs. This paper intends to assist the researchers by presenting the performance evaluation of the combination of graph layout algorithm followed by a clustering algorithm. The layout algorithms are OpenORD and Hu’s algorithms, and the clustering algorithms are Chinese Whispers and GivanNewman algorithms. The evaluation is carried out on bio-named entities that are linked by some annotated relations. The results of the experimentations highlight the strengths and weaknesses of the four combinations regarding running time, loss of relations (or edges), edge crossing, and cluttered display

Item Type: Article
Additional Information: Information, Communication and Creative Technology
Uncontrolled Keywords: Bio-Named Entities, Graph Clustering Algorithm, Graph Layout Algorithms, Network Visualization, unimas, university, universiti, Borneo, Malaysia, Sarawak, Kuching, Samarahan, ipta, education, research, Universiti Malaysia Sarawak.
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Academic Faculties, Institutes and Centres > Faculty of Computer Science and Information Technology
Depositing User: Karen Kornalius
Date Deposited: 25 Sep 2018 07:03
Last Modified: 29 Sep 2022 03:19
URI: http://ir.unimas.my/id/eprint/21711

Actions (For repository members only: login required)

View Item View Item