Edit toggle to center
Add picture annotations, no more than 140 words (optional)
Edit toggle to center
Add picture annotations, no more than 140 words (optional)
Solution with centrality 0
It is normal for the author and organization of Chinese data to publish too few articles, and it is still 0 after clicking. But you still have to try it out.
Edit toggle to center
Add picture annotations, no more than 140 words (optional)
overview
Betweenness centrality is defined for each node in the network. It measures the probability of any shortest path through a node in the network. Nodes with high betweenness centrality may lie in the middle of two large clusters or subnetworks, hence the term intermediary. In CiteSpace, nodes with high betweenness centrality are shown as purple rings. The thickness of the purple ring describes the value of betweenness centrality. The use of betweenness centrality in CiteSpace is guided by structural hole theory. The theory was originally developed for social networks. An insightful observation is that connectivity, or lack thereof, can guide us to find the most valuable nodes in the network. CiteSpace builds on these theories to detect crossover potential and new connections in scholarly publications. By default, CiteSpace automatically calculates the betweenness centrality of all nodes in the network, provided the size of the network is less than 350. You can modify the default setting: Preferences > Defer the calculation of betweenness centrality.
References
-
Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1, 215-239.
-
Brandes, U. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25, 2 (2001), 163-177.
Edit toggle to center
Add picture annotations, no more than 140 words (optional)
citation pop
In this case, the light blue line indicates that an article has not been published, and the dark blue line depicts when an article was published. The beginning of the red line segment marks the beginning of the emergence cycle, while the end of the red line segment marks the end of the emergence cycle.
Emergence Detection Emergence refers to a surge in the frequency of a particular type of event, such as a surge in citations of a Nobel Prize-winning publication.
CiteSpace supports emergence detection for several types of events:
-
Words or multi-word phrases from publication titles, abstracts, or other parts
-
Citations of cited references over time
-
Keyword frequency changes over time
-
Number of publications by author, institution or country
A detailed description of the original algorithm can be found in Kleinber's 2002 publication.
In CiteSpace, users can adjust burst detection parameters in the Burstness tab of the control panel. For example, to find more emergent items, i.e. increase the sensitivity of burst detection and decrease the gamma value. To reduce the number of salient items to be recognized, increase the minimum duration.
References Kleinberg, J. Bursty and hierarchical structure in streams. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Edmonton, Alberta, Canada, 2002), ACM Press, 2002, 91-101.
Edit toggle to center
Add picture annotations, no more than 140 words (optional)
CiteSpace provides the modularity and silhouette indicators based on the network structure and clustering clarity, namely the module value (Q value) and the average silhouette value (S value), which can be used as a basis for us to judge the drawing effect of the map. Generally speaking, the Q value is generally in the interval [o, 1), and Q>0.3 means that the divided community structure is significant; when the S value is 0.7, the clustering is efficient and convincing, if in Above 0.5, the clustering is generally considered reasonable. If the S value is infinite, the number of clusters is usually 1, so the selected network may be too small and only represent one research topic. The drawing of the knowledge map needs to select different thresholds to draw multiple times, and select an ideal map according to the Q value and S value as the final result.
CiteSpace will give several clustering options, which can be selected more flexibly according to the modularity and silhouette indicators of various clustering combinations, or you can directly choose the combination with the largest number of clusters. See Chen C, lbekwe-SanJuan F, Hou J.2010. The structure and dynamics of co-citation clusters: a multiple-perspective co-citation analysis. Journal of the American Society for Information Science and Technology, 61(7):1386-1409 .
Article source: CiteSpace Visual Analysis
1. Large-scale spatial simulation prediction and digital mapping technology
2. CMIP6 data processing methods and typical case analysis practice technology application
3. Based on Citespace and vosviewer bibliometrics visualization SCI paper efficient writing method
5. Python data mining and machine learning practice technology