Debugging complex software systems by means of pathfinder networks
Information Sciences: an International Journal
Analysis of the time evolution of scientograms using the subdue graph mining algorithm
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
A multiobjective evolutionary programming framework for graph-based data mining
Information Sciences: an International Journal
Three-objective subgraph mining using multiobjective evolutionary programming
Journal of Computer and System Sciences
Hi-index | 0.00 |
Network scaling algorithms such as the Pathfinder algorithm are used to prune many different kinds of networks, including citation networks, random networks, and social networks. However, this algorithm suffers from run time problems for large networks and online processing due to its O(n4) time complexity. In this article, we introduce a new alternative, the MST-Pathfinder algorithm, which will allow us to prune the original network to get its PFNET(∞, n - 1) in just O(n2 · log n) time. The underlying idea comes from the fact that the union (superposition) of all the Minimum Spanning Trees extracted from a given network is equivalent to the PFNET resulting from the Pathfinder algorithm parameterized by a specific set of values (r = ∞ and q = n - 1), those usually considered in many different applications. Although this property is well-known in the literature, it seems that no algorithm based on it has been proposed, up to now, to decrease the high computational cost of the original Pathfinder algorithm. We also present a mathematical proof of the correctness of this new alternative and test its good efficiency in two different case studies: one dedicated to the post-processing of large random graphs, and the other one to a real world case in which medium networks obtained by a cocitation analysis of the scientific domains in different countries are pruned. © 2008 Wiley Periodicals, Inc.