Evaluating layout and clustering algorithms for visualizing named entity graph

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 givan-newman 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.