Evaluating Layout and Clustering Algorithms for Visualizing Named Entity Graph

Authors

  • K. Ibrahim Department of Information System, Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, 94300 Kota Samarahan, Sarawak, Malaysia.
  • B. Ranaivo-Malançon Department of Information System, Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, 94300 Kota Samarahan, Sarawak, Malaysia.
  • T. Lim Department of Information System, Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, 94300 Kota Samarahan, Sarawak, Malaysia.
  • Y.-N. Cheah School of Computer Sciences, Universiti Sains Malaysia, 11800 USM, Penang, Malaysia.

Keywords:

Bio-Named Entities, Graph Clustering Algorithm, Graph Layout Algorithms, Network Visualization,

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Published

2017-09-15

How to Cite

Ibrahim, K., Ranaivo-Malançon, B., Lim, T., & Cheah, Y.-N. (2017). Evaluating Layout and Clustering Algorithms for Visualizing Named Entity Graph. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(2-10), 47–55. Retrieved from https://jtec.utem.edu.my/jtec/article/view/2705