An algorithm for drawing general undirected graphs
Information Processing Letters
Properties of pathfinder networks
Pathfinder associative networks
Toward a new horizon in information science: domain-analysis
Journal of the American Society for Information Science
Journal of the ACM (JACM)
Communications of the ACM
Journal of the American Society for Information Science and Technology
Real-time author co-citation mapping for online searching
Information Processing and Management: an International Journal
Small Worlds: The Dynamics of Networks between Order and Randomness
Small Worlds: The Dynamics of Networks between Order and Randomness
Information Processing and Management: an International Journal - Special issue: Infometrics
Visualizing the scientific world and its evolution: Research Articles
Journal of the American Society for Information Science and Technology
Binary pathfinder: an improvement to the pathfinder algorithm
Information Processing and Management: an International Journal - Special issue: Informetrics
Information Visualization: Beyond the Horizon
Information Visualization: Beyond the Horizon
Visualizing the Structure of Science
Visualizing the Structure of Science
Analysis of terrorist social networks with fractal views
Journal of Information Science
Debugging complex software systems by means of pathfinder networks
Information Sciences: an International Journal
Visualizing polysemy using LSA and the predication algorithm
Journal of the American Society for Information Science and Technology
Visualising the structure of document search results: a comparison of graph theoretic approaches
Information Visualization
Sparsification of influence networks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for path-oriented network simplification
IDA'10 Proceedings of the 9th international conference on Advances in Intelligent Data Analysis
SciMAT: A new science mapping analysis software tool
Journal of the American Society for Information Science and Technology
Simplification of networks by edge pruning
Bisociative Knowledge Discovery
Hi-index | 0.00 |
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(n^4), with n being the number of categories in the cocitation matrix, i.e., the number of nodes in the network). Although a previous improvement called Binary Pathfinder has already been proposed to speed up the original algorithm, its significant time complexity reduction is not enough for that aim. In this paper, we make use of a different shortest path computation from classical approaches in computer science graph theory to propose a new variant of the Pathfinder algorithm which allows us to reduce its time complexity in one order of magnitude, O(n^3), and thus to significantly decrease the run time of the implementation when applied to large scientific domains considering the parameter q=n-1. Besides, the new algorithm has a much simpler structure than the Binary Pathfinder as well as it saves a significant amount of memory with respect to the original Pathfinder by reducing the space complexity to the need of just storing two matrices. An experimental comparison will be developed using large networks from real-world domains to show the good performance of the new proposal.