Leydesdorff, L.: Clusters and maps of science journals based on bi-connected graphs in Journal Citation Reports (2004)
0.01
0.0059357807 = product of:
0.023743123 = sum of:
0.023743123 = product of:
0.047486246 = sum of:
0.047486246 = weight(_text_:software in 4427) [ClassicSimilarity], result of:
0.047486246 = score(doc=4427,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.2629875 = fieldWeight in 4427, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.046875 = fieldNorm(doc=4427)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- The aggregated journal-journal citation matrix derived from Journal Citation Reports 2001 can be decomposed into a unique subject classification using the graph-analytical algorithm of bi-connected components. This technique was recently incorporated in software tools for social network analysis. The matrix can be assessed in terms of its decomposability using articulation points which indicate overlap between the components. The articulation points of this set did not exhibit a next-order network of "general science" journals. However, the clusters differ in size and in terms of the internal density of their relations. A full classification of the journals is provided in the Appendix. The clusters can also be extracted and mapped for the visualization.
