Co-authorship networks in the digital library research community

Liu, Xiaoming; Bollen, Johan; Nelson, Michael L.; Sompel, Herbert Van de

doi:10.1016/j.ipm.2005.03.012

Cited by 678 publications

(494 citation statements)

References 27 publications

Supporting

Mentioning

405

Contrasting

Unclassified

Order By: Relevance

“…Nesse sentido, as redes de coautoria entre autores e pesquisadores científicos consistem em uma importante classe de redes sociais que tem sido usada de forma extensiva para se compreender a dinâmica das relações entre esses indivíduos (Liu, Bollen, Nelson, & Van de Sompel, 2005). Como já argumentado, as relações de coautoria se mostram como representações fiéis do trabalho de colaboração intelectual em pesquisa científica (Acedo, Barroso, Casanueva, & Galan, 2006) -tendo sua produção, às vezes, mais bem-avaliada do que as produções individuais (Nudelman & Landers, 1972) -e reforçando a ideia de que as revoluções na ciência não acontecem do dia para a noite nem são fruto de esforços solitários (Kuhn, 2012).…”

Section: Um Cenário De Relações De Competição E Colaboração Concomitaunclassified

Tréplica - Redes de Indivíduos e Redes de Instituições como Redes e, Claro, Organizações

Oliveira

Lopes

2014

Rev. adm. contemp.

View full text Add to dashboard Cite

Section: Um Cenário De Relações De Competição E Colaboração Concomitaunclassified

Tréplica - Redes de Indivíduos e Redes de Instituições como Redes e, Claro, Organizações

Oliveira

Lopes

2014

Rev. adm. contemp.

View full text Add to dashboard Cite

“…For measuring trust, we use the analysis of degree centrality which is frequently used when measuring authority and influence value [4]- [6]. Considering a graph G := (V, E A ) and E A the set of the directed connections E = (e 1,1 , e 1,2 , · · · , e i, j ) between the users of the set V then the in-degree centrality, K in i , and out-degree centrality, K out i of a vertex V i are the sum of the inbound connections and outbound connections to that vertex, respectively [4]- [6].…”

Section: Trust Measurementmentioning

confidence: 99%

“…In that case, the degree centrality is computed by the influence domain of the vertex. For a non directed graph G := (V, E, E), the influence domain of a vertex V i is the number or proportion of all other vertices which are connected by a path to that particular vertex [4]- [6].…”

Section: Trust Measurementmentioning

confidence: 99%

See 1 more Smart Citation

InfluenceRank: Trust-Based Influencers Identification Using Social Network Analysis in Q&A Sites

Park

Seo

Lee

et al. 2012

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYQuestion and Answering (Q&A) sites are recently gaining popularity on the Web. People using such sites are like a communityanyone can ask, anyone can answer, and everyone can share, since all of the questions and answers are public and searchable immediately. This mechanism can reduce the time and effort to find the most relevant answer. Unfortunately, the users suffer from answer quality problem due to several reasons including limited knowledge about the question domain, bad intentions (e.g. spam, making fun of others), limited time to prepare good answers, etc. In order to identify the credible users to help people find relevant answer, in this paper, we propose a ranking algorithm, InfluenceRank, which is basis of analyzing relationship in terms of users' activities and their mutual trusts. Our experimental studies show that the proposed algorithm significantly outperforms the baseline algorithms. key words: knowledge sharing, question answering, social network analysis, identifying influencers

show abstract

“…Many of the issues in this research appear from the low degree of structure of the data as well as the ambiguities often present 9,22,27 . Another important issue is the analysis of the networks themselves 14,17,20,28 .…”

Section: Introductionmentioning

confidence: 99%

ScriptLattes: an open-source knowledge extraction system from the Lattes platform

Mena‐Chalco¹,

César²

2009

J. Braz. Comp. Soc.

View full text Add to dashboard Cite

Abstract:The Lattes platform is the major scientific information system maintained by the National Council for Scientific and Technological Development (CNPq). This platform allows to manage the curricular information of researchers and institutions working in Brazil based on the so called Lattes Curriculum. However, the public information is individually available for each researcher, not providing the automatic creation of reports of several scientific productions for research groups. It is thus difficult to extract and to summarize useful knowledge for medium to large size groups of researchers. This paper describes the design, implementation and experiences with scriptLattes: an open-source system to create academic reports of groups based on curricula of the Lattes Database. The scriptLattes system is composed by the following modules: (a) data selection, (b) data preprocessing, (c) redundancy treatment, (d) collaboration graph generation among group members, (e) research map generation based on geographical information, and (f) automatic report creation of bibliographical, technical and artistic production, and academic supervisions. The system has been extensively tested for a large variety of research groups of Brazilian institutions, and the generated reports have shown an alternative to easily extract knowledge from data in the context of Lattes platform. The source code, usage instructions and examples are available at http://scriptlattes.sourceforge.net/.

show abstract

Co-authorship networks in the digital library research community

Cited by 678 publications

References 27 publications

Tréplica - Redes de Indivíduos e Redes de Instituições como Redes e, Claro, Organizações

Tréplica - Redes de Indivíduos e Redes de Instituições como Redes e, Claro, Organizações

InfluenceRank: Trust-Based Influencers Identification Using Social Network Analysis in Q&A Sites

ScriptLattes: an open-source knowledge extraction system from the Lattes platform

Contact Info

Product

Resources

About