Binary Pathfinder: An improvement to the Pathfinder algorithm Export

@article{citeulike:2152576, abstract = {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.}, author = {Guerrero-Bote, Vicente P. and Zapico-Alonso, Felipe and Espinosa-Calvo, Maria E. and Gomez and Moya-Anegon, Felix}, booktitle = {Special Issue on Informetrics}, citeulike-article-id = {2152576}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.ipm.2006.03.015}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6VC8-4K12CH1-1/2/b23019be3af94f3f8565275ff8ab4291}, comment = {pruning social networks}, doi = {10.1016/j.ipm.2006.03.015}, journal = {Information Processing \& Management}, keywords = {findingcommunities, graphlayout, socialnetanalyse, socialnets, visualization}, month = {December}, number = {6}, pages = {1484--1490}, posted-at = {2007-12-20 17:54:24}, priority = {2}, title = {Binary Pathfinder: An improvement to the Pathfinder algorithm}, url = {http://dx.doi.org/10.1016/j.ipm.2006.03.015}, volume = {42}, year = {2006} }

TY - JOUR ID - citeulike:2152576 L3 - citeulike-article-id:2152576 N2 - 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. IS - 6 JF - Information Processing & Management EP - 1490 TI - Binary Pathfinder: An improvement to the Pathfinder algorithm VL - 42 T2 - Special Issue on Informetrics SP - 1484 KW - findingcommunities KW - graphlayout KW - socialnetanalyse KW - socialnets KW - visualization N1 - pruning social networks AU - Guerrero-Bote, Vicente AU - Zapico-Alonso, Felipe AU - Espinosa-Calvo, Maria AU - Gomez AU - Moya-Anegon, Felix PY - 2006/12// UR - http://dx.doi.org/10.1016/j.ipm.2006.03.015 ER -