Abstract
Scientograms are a kind of graph representations depicting the state of Science in a specific domain. The automatic comparison and analysis of a set of scientograms, to show for instance the evolution of a scientific domain of a given country, is an interesting but challenging task as the handled data is huge and complex. In this paper, we aim to show that graph mining tools are useful to deal with scientogram analysis. We have chosen Subdue, a well-known graph mining algorithm, as a first approach for this purpose. Its operation mode has been customized for the study of the evolution of a scientific domain over time. Our case study clearly shows the potential of graph mining tools in scientogram analysis and it opens the door for a large number of future developments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Börner, K., Scharnhorst, A.: Visual conceptualizations and models of science. Journal of Informetrics 3(3), 161–172 (2009)
Chen, C.: Information Visualization: Beyond the Horizon. Springer, Berlin (2004)
Chen, C., Chen, Y., Horowitz, H., Hou, H., Liu, Z., Pellegrino, D.: Towards an explanatory and computational theory of scientific discovery. Journal of Informetrics 3(3), 191–209 (2009)
Leydesdorff, L., Rafols, I.: A global map of science based on the ISI subject categories. Journal of the American Society for Information Science and Technology 60(2), 348–362 (2009)
Vargas-Quesada, B., Moya-Anegón, F.D.: Visualizing the Structure of Science. Springer, New York (2007)
Wallace, M.L., Gingras, Y., Duhon, R.: A new approach for detecting scientific specialties from raw cocitation networks. Journal of the American Society for Information Science and Technology 60(2), 240–246 (2009)
Washio, T., Motoda, H.: State of the art of graph-based data mining. SIGKDD Explorations 5(1), 59–68 (2003)
Cook, D.J., Holder, L.B.: Graph-based data mining. IEEE Intelligent Systems 15(2), 32–41 (2000)
Rissanen, J.: Stochastic Complexity in Statistical Inquiry Theory. World Scientific Publishing Co., Inc., River Edge (1989)
Moya-Anegón, F.D., Vargas-Quesada, B., Herrero-Solana, V., Chinchilla-Rodríguez, Z., Corera-Álvarez, E., Munoz-Fernández, F.J.: A new technique for building maps of large scientific domains based on the cocitation of classes and categories. Scientometrics 61(1), 129–145 (2004)
Dearholt, D., Schvaneveldt, R.: Properties of Pathfinder networks. In: Schvaneveldt, R. (ed.) Pathfinder Associative Networks: Studies in Knowledge Organization, pp. 1–30. Ablex Publishing Corporation, Greenwich (1990)
Quirin, A., Cordón, O., Guerrero-Bote, V.P., Vargas-Quesada, B., Moya-Anegón, F.D.: A quick MST-based algorithm to obtain Pathfinder networks. Journal of the American Society for Information Science and Technology 59(12), 1912–1924 (2008)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters 31(1), 7–15 (1989)
Cook, D.J., Holder, L.B. (eds.): Mining Graph Data. Wiley, New Jersey (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quirin, A., Cordón, O., Shelokar, P., Zarco, C. (2010). Analysis of the Time Evolution of Scientograms Using the Subdue Graph Mining Algorithm. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds) Computational Intelligence for Knowledge-Based Systems Design. IPMU 2010. Lecture Notes in Computer Science(), vol 6178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14049-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-14049-5_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14048-8
Online ISBN: 978-3-642-14049-5
eBook Packages: Computer ScienceComputer Science (R0)