A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time |
| |
Authors: | A Quirin O Cordón J Santamaría B Vargas-Quesada F Moya-Anegón |
| |
Institution: | 1. European Centre for Soft Computing, Edificio Científico Tecnológico, 33600 Mieres, Spain;2. Department of Software Engineering, University of Cádiz, Cádiz, Spain;3. SCImago Group, Library and Information Science Faculty, University of Granada, 18071 Granada, Spain |
| |
Abstract: | In the last few years, there is an increasing interest to generate visual representations of very large scientific domains. A methodology based on the combined use of ISI–JCR category cocitation and social networks analysis through the use of the Pathfinder algorithm has demonstrated its ability to achieve high quality, schematic visualizations for these kinds of domains. Now, the next step would be to generate these scientograms in an on-line fashion. To do so, there is a need to significantly decrease the run time of the latter pruning technique when working with category cocitation matrices of a large dimension like the ones handled in these large domains (Pathfinder has a time complexity order of O(n4), with n being the number of categories in the cocitation matrix, i.e., the number of nodes in the network). |
| |
Keywords: | PFNETs Pathfinder algorithms Cocitation analysis Information visualization Large scientific domain visual maps Graph shortest path algorithms |
本文献已被 ScienceDirect 等数据库收录! |
|