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.

References

“Visualizing Historical Networks,” (Retrieved from http://www.fas.harvard.edu/~histecon/visualizing/).

R. Mihalcea, and D. Radev, Graph-Based Natural Language Processing and Information Retrieval. Cambridge, UK: Cambridge University Press, 2011.

M. Marrero, J. Urbano, S. Sánchez-Cuadrado, J. Morato, and J. M. Gómez-Berbís, “Named entity recognition: fallacies, challenges and opportunities. Computer Standards & Interfaces,” 2013, pp. 482-489.

S. Martin, W. M. Brown, R. Klavans, and K. Boyack, “OpenOrd: An Open-Source Toolbox for Large Graph Layout,” in Proceedings SPIE7868, Visualization and Data Analysis, USA, 2011.

Y. F. Hu, “Efficient and high quality force-directed graph drawing,” The Mathematica Journal, vol. 53, 2005, pp. 1689-1699.

C. Biemann, “Chinese Whispers: An efficient graph-clustering algorithm and its application to natural language processing problems,” in Proc. of TextGraphs: The Second Workshop on Graph-Based Methods for Natural Language Processing, New York City, 2006, pp. 73-80.

M. Girvan and M. E. J. Newman. “Community structure in social and biological networks,” in Proceedings of the National Academy of Sciences, 2002, pp. 7821–7826.

U. Hinrichs, B. Alex, J. Clifford, A. Watson, A. Quigley, E. Klein, and C. M. Coates, “Trading Consequences: A Case Study of Combining Text Mining and Visualization to Facilitate Document Exploration,” Digital Scholarship in the Humanities, vol. 30, 2015, pp. 50-75.

D. Y. Tan, B. Ranaivo-Malançon, and N. Kulathuramaiyer, “Wiki SaGa: An Interactive Timeline to Visualize Historical Documents,” in Information Science and Applications, 2015, pp. 705-712.

M. Grobelnik and D. Mladenic, “Visualization of news articles,” Informatica, vol. 28, 2004, pp. 375-380.

T. Osaki, S. Itsubo, F. Kimura, T. Tezuka, and A. Maeda, “Visualization of Relationships among Historical Persons Using Locational Information,” in Web and Wireless Geographical Information Systems, 2011, pp. 230-239.

M. Itoh and M. Akaishi, "Visualization for Changes in Relationships between Historical Figures in Chronicles," in Proceedings of the International Conference on Information Visualisation,USA, 2012, pp. 283-290.

M. Bastian, S. Heymann and M. Jacomy, "Gephi : An Open Source Software for Explorating and Manipulating Networks," in Proceedings of International AAAI Conference on Web and Social Media, USA, 2009, pp. 361–362.

B. S. Raper, “Graphing the history of philosophy,” (Retrieved from http://www.coppelia.io/2012/06/graphing-the-history-of-philosophy).

C. Harrison, “Visualization Projects,” (Retrieved from http://www.chrisharrison.net/index.php/Visualizations/Welcome).

G. Michailidis, “Data Visualization Through Their Graph Representations,” in Handbook of Data Visualization, Springer Berlin Heidelberg, 2008, pp. 103-120.

W. Huang, P. Eades, S. H. Hong and C. C. Lin, "Improving multiple aesthetics produces better graph drawings," Journal of Visual Languages and Computing, vol. 24, no. 4, 2013, pp. 262-272.

W. Huang, M. L. Huang and C. C. Lin, "Evaluating overall quality of graph visualizations based on aesthetics aggregation," Information Sciences, vol. 330, 2016, pp. 444-454.

M. Jacomy, S. Heymann, T. Venturini and M. Bastian, "ForceAtlas2 , A Graph Layout Algorithm for Handy Network Visualization," 2014.

S. Hachul and M. Jünger, "An experimental comparison of fast algorithms for drawing general large graphs," Graph Drawing, 2006, pp. 235–250.

F. Zaidi, D. Archambault and G. Melançon, "Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths," in ICDM 2010: Advances in Data Mining. Applications and Theoretical Aspects, Germany, 2010, pp. 42-56.

“The BioText Project,” (Retrieved from http://biotext.berkeley.edu/data.html)

B. Rosario and M. A. Hearst, “Classifying Semantic Relations in Bioscience Text,” in Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL 2004), Spain, 2004.

S. G. Kobourov, "Force-Directed Drawing Algorithms," in Handbook of Graph Drawing and Visualization, CRC Press, 2013, pp. 383-408.

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

Issue

Vol. 9 No. 2-10: Technology Transforming Lives II

Section

Articles

License

TRANSFER OF COPYRIGHT AGREEMENT

The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):

  1. All proprietary right other than copyright, such as patent rights
  2. The right to make further copies of all or part of the published article for my use in classroom teaching
  3. The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
  4. The right to make copies of the published work for internal distribution within the institution that employs me

I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.