Binary Pathfinder: An improvement to the Pathfinder algorithm
| Autor: | Felipe Zapico-Alonso, Félix de Moya-Anegón, Rocío Gómez Crisóstomo, Vicente P. Guerrero-Bote, María Eugenia Espinosa-Calvo |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
business.industry
Computer science Binary number Library and Information Sciences Management Science and Operations Research Scientometrics Bibliometrics computer.software_genre Computer Science Applications Information visualization Pathfinder Informetrics Citation analysis Media Technology Data mining Pruning (decision trees) business Algorithm computer Information Systems |
| Zdroj: | Information Processing & Management. 42:1484-1490 |
| ISSN: | 0306-4573 |
| Popis: | The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis of, amongst others, citations in BIS (bibliometrics, informetrics, and scientometrics). It has even been proposed for the online display of the search results in an information retrieval system. However, its great time and space complexity limits its use in real-time applications and in networks of any considerable size.The present work describes an improved algorithm with considerably reduced time and space complexity. Its lower execution costs thus increase its applicability both in real time and to large networks. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect