Abstract
With the increasing penetration of interdisciplinary subjects, it is more difficult for researchers to complete a paper individually, showing that the division of labor can improve the level and efficiency of scientific research. Thus, collaboration among multiple scholars has become a trend in academic research. However, because the numbers of scholars and papers are increasing and cooperation between scholars has become more frequent in recent years, it is an increasingly challenging task to discover useful knowledge resources for researchers. Against the background of big data, how to help scholars quickly find interested target collaborators, encourage them to participate more actively in academic communication, and create high-quality achievements in scientific research has become a significant problem. Considering this challenge, this article proposes a framework of coauthorship strength, author contribution, and search (CCS，taking the first letter of the keyword), which is based on the coauthorship feature of Google Academics. In CSS, we combined the search algorithm to select the optimal connection path to help scholars find interested target scholars efficiently and to better solve practical application problems. Finally, our proposal is evaluated by a set of experiments based on a real-world dataset. Experimental results of our approach show better search outcomes compared to other competitive approaches.
Highlights
With the development of Internet information technology, academic communication and cooperation are no longer restricted by geographical location
Considering the above challenges, we propose a coauthorship strength, author contribution, and search framework (CCS) based on the Google Academic Platform. is new approach considers multiple coauthorship indicators to comprehensively calculate coauthorship strength and uses the Dijkstra search algorithm to apply it to the actual coauthorship scene. erefore, it can use a more comprehensive coauthorship strength calculation method to choose more suitable intermediaries, which can establish connections between scholars and solve the existing research shortcomings
Since the weight of the edge is the reciprocal of Shortest path length coauthorship strength, using the shortest path search algorithm to select a node with a smaller weight represents choosing a scholar with a closer coauthorship strength as an intermediary
Summary
With the development of Internet information technology, academic communication and cooperation are no longer restricted by geographical location. Scholar A inadvertently reads the scientific research achievements of scholar B and wants to exchange ideas and enter discussions with scholar B. At this time, intermediary scholars can make connections. The greater the coauthorship intensity is, the closer the communication is, and the easier it is to establish connections with other scholars. Erefore, establishing a coauthor network and selecting proper intermediary scholars to help other researchers connect with each other will be useful and meaningful. Research faces the two following challenges: Security and Communication Networks (1) e current scholarly contributions mainly use single indicators, for example, the number of coauthors, which lacks a comprehensive method to calculate coauthorship strength. Research faces the two following challenges: Security and Communication Networks (1) e current scholarly contributions mainly use single indicators, for example, the number of coauthors, which lacks a comprehensive method to calculate coauthorship strength. is may lead to an assessment of the results of the collaboration that are not sufficiently accurate
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
