检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《管理工程学报》2014年第1期65-73,101,共10页Journal of Industrial Engineering and Engineering Management
摘 要:本文以UTD国际商学院排名研究项目中确定的24种管理学(商学)领域的顶级权威期刊为研究的范围边界,收集这些期刊2000年至2011年间14855篇文献数据作为原始数据。采用文献计量法,得到发文量在15篇以上的作者共110位及其发表的1907篇论文作为本文的研究对象;应用Ucinet软件实现了高频作者合著网络的可视化;通过对合著网络节点作者中心性分析发现整体网络的集中程度较低,高频作者之间合著现象较少,网络较为松散,大部分作者资源控制和知识信息流通的能力较弱;同时基于社会网络的K-核分析发现,网络中存在内部凝聚力较强关系紧密的合作团体,共划分出11个合作团体。Limited by analytical techniques,previous researches try to undemtand the cooperation status of a specific research field by using simple bibliometric methods to calculate the amount of authors' articles and co-authored articles,coauthor rates,etc.However,these kinds of study can't provide in-depth information about cooperative relations within co-authorship networks and can't tell the position and role of a specific author within co-authorship networks of a certain research field.Social network analysis techniques make it possible to discover information in large cooperation networks.Although some scholars have applied social network analysis to examining co-authorship relationships,the number of existing study is still very limited.Social network analysis is an effective coauthorship analysis method.We try to use social network analysis to study co-authorship issues in the management discipline.This article will help better understand the development features of management discipline,cooperation state and some general characteristics of academic cooperation in the management field.This paper identified the research scope of journals based on a list of journals selected by UTD's researching project.The list contains 24 top journals in the field of management (or business) research.The initial sample used 14855 papers published by top 24 journals between 2000 and 201 1.The final sample are 1,907 papers published by 110 authors who had published more than 15 papers during the period of time.Firstly,a 110 * 110 co-authorship matrix was built.Secondly,a co-authorship network was visualized by importing the built matrix into Ucinet.Thirdly,the matrix was transformed into a 0-1 matrixin order to calculate the degree,freeman betweenness,and closeness for each node.Finally we tried to find whether there are some cooperative groups within the management discipline coauthorship network using K-core analysis.Our research results show that some authors,such as Eric T.Bradlow,and Steven M.Shuganowned have close
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222