In contrast to many other scientific disciplines, computer science considers conference publications. Conferences have the advantage of providing fast publication of papers and of bringing researchers together to present and discuss the paper with peers. Previous work on knowledge mapping focused on the map of all sciences or a particular domain based on ISI published Journal Citation Report (JCR). Although this data cover most of the important journals, it lacks computer science conference and workshop proceedings, which results in an imprecise and incomplete analysis of the computer science knowledge. This paper presents an analysis on the computer science knowledge network constructed from all types of publications, aiming at providing a complete view of computer science research. Based on the combination of two important digital libraries (DBLP and CiteSeerX), we study the knowledge network created at journal/conference level using citation linkage, to identify the development of sub-disciplines. We investigate the collaborative and citation behavior of journals/conferences by analyzing the properties of their co-authorship and citation subgraphs. The paper draws several important conclusions. First, conferences constitute social structures that shape the computer science knowledge. Second, computer science is becoming more interdisciplinary. Third, experts are the key success factor for sustainability of journals/conferences.

@article{pham2011development, author = {Pham, Manh and Klamma, Ralf and Jarke, Matthias}, title = {Development of computer science disciplines: a social network analysis approach}, journal = {Social Network Analysis and Mining}, publisher = {Springer}, address = {Wien}, year = {2011}, volume = {1}, number = {4}, pages = {321--340}, url = {http://dx.doi.org/10.1007/s13278-011-0024-x}, doi = {10.1007/s13278-011-0024-x}, issn = {1869-5450}, keywords = {analysis, computer, network, paper, scholary, science, scientometrics, sna, social}, abstract = {In contrast to many other scientific disciplines, computer science considers conference publications. Conferences have the advantage of providing fast publication of papers and of bringing researchers together to present and discuss the paper with peers. Previous work on knowledge mapping focused on the map of all sciences or a particular domain based on ISI published Journal Citation Report (JCR). Although this data cover most of the important journals, it lacks computer science conference and workshop proceedings, which results in an imprecise and incomplete analysis of the computer science knowledge. This paper presents an analysis on the computer science knowledge network constructed from all types of publications, aiming at providing a complete view of computer science research. Based on the combination of two important digital libraries (DBLP and CiteSeerX), we study the knowledge network created at journal/conference level using citation linkage, to identify the development of sub-disciplines. We investigate the collaborative and citation behavior of journals/conferences by analyzing the properties of their co-authorship and citation subgraphs. The paper draws several important conclusions. First, conferences constitute social structures that shape the computer science knowledge. Second, computer science is becoming more interdisciplinary. Third, experts are the key success factor for sustainability of journals/conferences.} }

%0 = article %A = Pham, Manh and Klamma, Ralf and Jarke, Matthias %C = Wien %D = 2011 %I = Springer %T = Development of computer science disciplines: a social network analysis approach %U = http://dx.doi.org/10.1007/s13278-011-0024-x

To account for strong ageing characteristics of citation networks, we modify the PageRank algorithm by initially distributing random surfers exponentially with age, in favour of more recent publications. The output of this algorithm, which we call CiteRank, is interpreted as approximate traffic to individual publications in a simple model of how researchers find new information. We optimize parameters of our algorithm to achieve the best performance. The results are compared for two rather different citation networks: all American Physical Society publications between 1893 and 2003 and the set of high-energy physics theory (hep-th) preprints. Despite major differences between these two networks, we find that their optimal parameters for the CiteRank algorithm are remarkably similar. The advantages and performance of CiteRank over more conventional methods of ranking publications are discussed.

@article{1742-5468-2007-06-P06010, author = {Walker, Dylan and Xie, Huafeng and Yan, Koon-Kiu and Maslov, Sergei}, title = {Ranking scientific publications using a model of network traffic}, journal = {Journal of Statistical Mechanics: Theory and Experiment}, year = {2007}, volume = {2007}, number = {06}, pages = {P06010}, url = {http://stacks.iop.org/1742-5468/2007/i=06/a=P06010}, keywords = {network, paper, publication, ranking, scientific, toread}, abstract = {To account for strong ageing characteristics of citation networks, we modify the PageRank algorithm by initially distributing random surfers exponentially with age, in favour of more recent publications. The output of this algorithm, which we call CiteRank, is interpreted as approximate traffic to individual publications in a simple model of how researchers find new information. We optimize parameters of our algorithm to achieve the best performance. The results are compared for two rather different citation networks: all American Physical Society publications between 1893 and 2003 and the set of high-energy physics theory (hep-th) preprints. Despite major differences between these two networks, we find that their optimal parameters for the CiteRank algorithm are remarkably similar. The advantages and performance of CiteRank over more conventional methods of ranking publications are discussed.} }

%0 = article %A = Walker, Dylan and Xie, Huafeng and Yan, Koon-Kiu and Maslov, Sergei %D = 2007 %T = Ranking scientific publications using a model of network traffic %U = http://stacks.iop.org/1742-5468/2007/i=06/a=P06010