A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time

Information Processing and Management

Volumn 44, Issue 4, 2008, Pages 1611-1623

  Quirin, A ^a   Cordon O ^a   Santamaria J ^b   Vargas Quesada, B ^c   Moya Anegon F ^c  

^a EUROPEAN CENTRE FOR SOFT COMPUTING   (Spain)

^b UNIVERSITY OF CÁDIZ   (Spain)

^c UNIVERSITY OF GRANADA   (Spain)

Author keywords

Cocitation analysis; Graph shortest path algorithms; Information visualization; Large scientific domain visual maps; Pathfinder algorithms; PFNETs

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; PARAMETER ESTIMATION; QUALITY CONTROL;

COCITATION ANALYSIS; GRAPH SHORTEST PATH ALGORITHMS; INFORMATION VISUALIZATION; LARGE SCIENTIFIC DOMAIN VISUAL MAPS; PATHFINDER ALGORITHMS;

DATA VISUALIZATION;

EID: 44349112538     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipm.2007.09.005     Document Type: Article

References (29)

1. Bellman R., and Kalaba R. Dynamic programming and modern control theory (1965), Academic Press, New York, USA
2. Borner K., Chen C., and Boyack K. Visualizing knowledge domains. Annual Review of Information Science and Technology 37 (2003) 179-255
3. Boyack K., Klavans R., and Borner K. Mapping the backbone of science. Scientometrics 64 (2005) 351-374
4. Buzydlowski, J. (2002). A comparison of self-organizing maps and pathfinder networks for the mapping of co-cited authors. PhD thesis, Drexel University.
5. Chen C. Bridging the gap: The use of pathfinder networks in visual navigation. Journal of Visual Languages and Computing 9 (1998) 267-286
6. Chen C. Generalised similarity analysis and pathfinder network scaling. Interacting with Computers 10 (1998) 107-128
7. Chen C. Information visualization and virtual environments (1999), Springer, Berlin, Germany
8. Chen C. Information visualization: Beyond the horizon (2004), Springer, Berlin, Germany
9. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to algorithms. 2nd ed. (2001), The MIT Press
10. Dearholt D., and Schvaneveldt R. Properties of pathfinder networks. In: Schvaneveldt R. (Ed). Pathfinder associative networks: Studies in knowledge organization (1990), Ablex Publishing Corporation 1-30
11. Dijkstra E. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271
12. Dreyfus S. Dynamic programming and the calculus of variations (1965), Academic Press, New York, USA
13. Floyd R. Algorithm 97: Shortest path. Communications of the ACM 5 6 (1962) 345
14. Guerrero-Bote V., Zapico-Alonso F., Espinosa-Calvo M., Gómez-Crisóstomo R., and Moya-Anegón F. Binary pathfinder: An improvement to the pathfinder algorithm. Information Processing and Management 42 (2006) 1484-1490
15. Hjorland B., and Albrechtsen H. Toward a new horizon in information science: Domain analysis. Journal of the American Society for Information Science 46 6 (1995) 400-425
16. Kamada T., and Kawai S. An algorithm for drawing general undirected graphs. Information Processing Letters 31 1 (1989) 7-15
17. Leydesdorff L. Clusters and maps of science journals based on bi-connected graphs in the journal citation reports. Journal of Documentation 60 (2004) 371-427
18. Leydesdorff L. Top-down decomposition of the journal citation report of the social science citation index: Graph and factor-analytical approaches. Scientometrics 60 (2004) 159-180
19. Lin X., White H.D., and Buzydlowski J. Real-time author co-citation mapping for online searching. Information Processing and Management 39 5 (2003) 689-706
20. Moya-Anegón F., Vargas-Quesada B., Herrero-Solana V., Chinchilla-Rodríguez Z., Corera-Álvarez E., and Muñoz-Fernández F. A new technique for building maps of large scientific domains based on the cocitation of classes and categories. Scientometrics 61 1 (2004) 129-145
21. Moya-Anegón F., Vargas-Quesada B., Chinchilla-Rodríguez Z., Corera-Álvarez E., Herrero-Solana V., and Muñoz-Fernández F. Domain analysis and information retrieval through the construction of heliocentric maps based on ISI-JCR category cocitation. Information Processing and Management 41 (2005) 1520-1533
22. Moya-Anegón F., Vargas-Quesada B., Chinchilla-Rodríguez Z., Corera-Álvarez E., González-Molina A., Muñoz-Fernández F., et al. Visualización y análisis de la estructura científica española: ISI web of science 1990-2005 (in Spanish). El Profesional de la Información 15 4 (2006) 258-269
23. Samoylenko I., Chao T.-C., Liu W.-C., and Chen C.-M. Visualizing the scientific world and its evolution. Journal of the American Society for Information Science and Technology 57 (2006) 1461-1469
24. Schvaneveldt R. Pathfinder associative networks (1990), Ablex Publishing Corporation
25. Vargas-Quesada B., and Moya-Anegón F. Visualizing the structure of science (2007), Springer
26. Warshall S. A theorem on boolean matrices. Journal of the ACM 9 1 (1962) 11-12
27. Watts D. Small Worlds. The Dynamics of Networks Between Order and Randomness (2004), Princeton University Press
28. Watts D., and Strogatz S. Collective dynamics of 'small-world' networks. Nature 393 (1998) 440-442
29. White H. Pathfinder networks and author cocitation analysis: A remapping of paradigmatic information scientists. Journal of the American Society for Information Science and Technology 54 5 (2003) 423-434