<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Influential Analysis in Micro Scholar Social Networks Li Weigang1,2, Icaro Araújo Dantas1, Ahmed Abdelfattah Saleh2, Daniel L. Li3</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Li Weigang</string-name>
          <email>weigang@unb.br</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Icaro Araújo Dantas</string-name>
          <email>icaro.a.dantas@gmail.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ahmed Abdelfattah Saleh</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniel L. Li</string-name>
          <email>daniel.lezhi.br@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Coleman Research</institution>
          ,
          <addr-line>Raleigh, North Carolina-NC</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>PPMEC, Department of Mechanical Engineering, University of Brasilia</institution>
          ,
          <addr-line>Brasilia</addr-line>
          ,
          <country country="BR">Brazil</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>TransLab, Department of Computer Science, University of Brasilia</institution>
          ,
          <addr-line>Brasilia</addr-line>
          ,
          <country country="BR">Brazil</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2015</year>
      </pub-date>
      <fpage>22</fpage>
      <lpage>28</lpage>
      <abstract>
        <p>Scholar citation is a basic activity in scientific community. Some academic search engines have been developed in Web such as Google Scholar and Microsoft Academic Search. Efficient flexible querying method is essential for researchers to effectively follow trends within related topics of their research field. In this paper, we propose a procedure to construct Micro Scholar Social Networks (MSSN) from Google Scholar and then develop a querying and ranking method to find the influential researchers or articles in MSSN. An extension to the Follow Model (Extended Follow Model) is proposed in this paper and applied to describe the paper-citation and author-follow relationships. It is also coupled with different ranking algorithms, namely, PageRank, AuthorRank and InventorRank to study a MSSN in Air Traffic Management. The case study shows that Extended Follow Model is robust and efficient for ranking and mining a heterogeneous academic network. In spite the fact that study was done on Google Scholar, but the proposed data mining method is applicable for other academic search engines.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>With the development of Internet technology and
applications, there are at least 114 million English-language
scholarly documents accessible on the Web [Khabsa and Giles,
2014]. The term “scholarly documents” here refers to journal
and conference papers, books, dissertations and theses,
technical reports and working papers. The size of scholarly
documents accessible through the web differs from one
academic search engine to the other; Google Scholar1, for
example, comprises nearly 100 million scholarly documents
and also available advanced search for general consulting.
1 http://scholar.google.com/
Copyright © 2015 for the individual papers by the papers' authors.
Copying permitted for private and academic purposes. This volume
is published and copyrighted by its editors.</p>
      <p>In Google Scholar, the most cited paper is “A short history
of SHELX” [Sheldrick, 2007] with 49,792 citations. The
authors who cited this paper have composed a special society
or a network. Understanding the relations in this society is
valuable to the researchers.</p>
      <p>In this massive academic network, efficient querying
models of academic search engines or databases is crucial for
a researcher to conduct his research while following up the
development trends in a specific research topic of particular
scientific field.</p>
      <p>There are two problems that should be deeply studied: 1)
developing efficient method and system (in Web tool level)
to construct Micro Scholar Social Network (MSSN) for an
especial topic or field from large scholar social networks,
such as Google Scholar, Microsoft Academic Search, Web of
Science or others; 2) developing efficient mining algorithms
to analyze this MSSN for scholar´s diversity objectives.</p>
      <p>In literature, some research developed the mining methods
of heterogeneous information networks [Sun et al. 2012].
Ahmedi et al. focused on the study of the property of the
Co-authorship Networks [Ahmedi et al., 2011].</p>
      <p>In recent years, many researches proposed solutions to
these problems. Liu et al. [2005] demonstrated AuthorRank.
AMiner has been developed by [Tang et al., 2008] as a
scholar platform with the database and search interface.
W-entropy was proposed to measure the influence of the
members from social networks [Weigang et al., 2011].
Sandes et al. [2012] introduced the concept of Follow Model
for the development of advanced queries on social networks.
Du et al. [2015] demonstrated the way of analyzing
importance of nodes in heterogeneous networks.</p>
      <p>In this paper, Extended Follow Model (EMF), an extension
to the Follow Model presented by [Sandes et al, 2012], is
proposed. EMF is applied to describe the paper-citation and
author-follow relationships. It is also coupled with different
ranking algorithms, namely, PageRank, AuthorRank and
InventorRank to study a MSSN in Air Traffic Management.
The case study shows that Extended Follow Model is robust
and efficient for ranking and mining a heterogeneous
academic network. In spite the fact that the MSSN used in this
study was constructed using Google Scholar, but the study is
applicable, as well, for other academic search engines.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Micro Scholar Social Networks (MSSN)</title>
      <p>This section introduces the concept of Micro Scholar Social
Networks (MSSN) and explains its basic elements and
relations using Google Scholar as an example. In a MSSN,
authors and publications are considered the main objects.
However, in addition to authors, there are also editor of the
journal, editor of the book, conference chairs. As for
publications, there are journal papers, conference papers, books,
book chapters, reports and others. In this study, we use paper
to refer to all different types of publications, and author for
all contributors. The specification of other objects will be
considered in our future data mining studies.</p>
      <p>The “Micro Scholar” term refers to a specific research
field, while “Social Network” term refers to the network
constructed from the relations between papers and authors of
that field. Figure 1 shows the MSSN constructed from 165
papers and 249 authors of the “Air Traffic Management
(ATM)” research field. As seen in figure 1, MSSN-ATM is
constructed of directed graphs, whose vertices are papers
(sub-graph a) or authors (sub-graph b) while the edges
represent the relations among those elements.</p>
    </sec>
    <sec id="sec-3">
      <title>2.1 Elements and Relations in MSSN</title>
      <p>The basic elements in MSSN are papers, authors, venue and
publishers. This paper focuses on the information related to
paper and author. Citation and co-authoring are the core
relations between papers and authors. As such, a MSSN is
constructed using the citation relations among papers and
authors, in addition to the co-author relations among different
authors. These relations among MSSN elements can be
explained as follows:</p>
      <sec id="sec-3-1">
        <title>Relations between papers</title>
        <p>• Citation relation: Citations of a paper p are those papers
that were cited by p.
• Cited In relation: Cited Ins of a paper p are those papers
that cited p.
• Both-cited relation: Two papers a and b are considered
Both-Cited, in the case that paper a cites b and paper b
cites a.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Follow relation between authors</title>
        <p>Citation relation can be extended to describe the relation
among authors. Where, when a paper cites another paper, in
actuality, authors are simply citing authors with prior studies
relevant to their paper. As such, the follow relation, as per the
Follow Model introduced by [Sandes et al, 2012], can be used
to describe the citation relation between authors.
• Followee (Citation relation): Citations of a paper p are
those papers that were cited by p. The authors of these
papers are followee of the authors of p.
• Follower (Cited In relation): Cited Ins of a paper p are
those papers that cited p. The authors of these papers are
followers of the author of paper p.
• R-Friends (Both-cited relation): Two papers a and b are
considered Both-Cited, in the case that paper a cites b and
paper b cites a. The authors of those two papers are
R-Friends.
• Self-Following (Self-Citation): If an author has cited one
of his own papers.</p>
      </sec>
      <sec id="sec-3-3">
        <title>Co-author relation between authors</title>
        <p>Another important relation among authors is that of
co-authorship. Where, for any particular paper, there are
one or more authors. The relationship among those authors
can be referred to as co-author. An author may be a
co-author for several authors in one or more papers. This
paper presents a weighing formula to assign a representitve
weight for each author depending on the order of
authorship of different papers.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>2.2 Types of MSSN</title>
      <p>Scientific papers are characterized by multiple attributes (e.g.
authors, venue, publish time, editor of the journal, editor of
the book, conference chairs, etc.) in addition various relations
among these attributes. As such, MSSN is considered a kind
of heterogeneous information network that contains multiple
types of elements and links [Sun et al., 2012], [Kim and
Leskovec, 2012].</p>
      <p>According to the nature of the elements used to construct a
Micro Scholar Social Networks, MSSN’s can be divided into
two types; i) Homogenous MSSN, with vertices (nodes)
created using the same elements (i.e. papers or authors); and
ii) Heterogeneous MSSN, where the networks vertices
include different classes of elements (i.e. papers and authors)
with their subsequent relations.</p>
      <sec id="sec-4-1">
        <title>2.2.1 Constructing Homogenous MSSN</title>
        <p>Regarding the relations in MSSN, there are citation relations
(citation, cited in and both cited) between papers, as well as
co-author relations and Follow relations (followee, follower,
r-friends) between authors. These relations form three sets of
homogenous MSSN’s.</p>
        <p>A. ATM-MSSN-Papers
Figure 1(a) shows a MSSN of Air Traffic Management
research topic, which is represented by a graph whose
vertices are papers and the citation relation is its edges. The data
reflected in this graph was collected from Google Scholar in
January 26, 2015.</p>
        <p>To create the graph, a citation relation matrix Pc is
introduced. Pc is a square matrix of size (N × N), where N is the
total number of papers in the ATM-MSSN. pcij is an element
of the Pc matrix, with i, j= 1,2,…N. As such, if a paper i cited
a paper j then pcij = 1.</p>
        <p>B. ATM-MSSN-Authors
Figure 1(b) shows a graph with follow relations among 249
authors. A close relation can be observed between the two
subfigures, where, subfigure 1(b) is based on 1(a), the only
difference is that one paper can be written by more than one
author.</p>
        <p>The author relation matrix A is introduced to create this
graph. A is a square matrix of size (M × M), where M is the
total number of authors in the ATM-MSSN. aij is an element
of the A matrix, with i, j= 1,2,…M. such, aij represents the
number of times an author i follows an author j.</p>
        <p>C. ATM-MSSN-CoAuthors
Figure 2(a) shows the co-author relations among 249 authors.
An author can be a co-author with more than one author.</p>
        <p>The co-author relation matrix Ac is introduced to create
this graph. Ac is a square matrix of size (M × M), where M is
the total number of authors in the ATM-SSN. acij is an
element of the matrix Ac, with i, j= 1,2,…M. such, acij
represents the number of papers in which authors i and j are
co-authors.</p>
      </sec>
      <sec id="sec-4-2">
        <title>2.2.2. Constructing Heterogeneous MSSN</title>
        <p>Heterogeneous MSSN is formed of multiple elements and/or
relations. As such, a heterogeneous MSSN can be
constructed using multiple elements (e.g. papers and authors)
and connected using a particular relationship and/or multiple
relations for the same element class (e.g. co-author and
follow relations for authors).</p>
        <p>A. ATM-MSSN-Author-Paper graph
Figure 2(b) shows ATM-MSSN, which is a heterogeneous
MSSN constructed using two classes of elements, papers and
authors. Where, authors’ nodes are represented by red circles
while the papers’ nodes are represented by blue triangles.
The citation relation connects the paper nodes, while follow
relation connects the authors. The two classes of nodes are
then connected together using weighted co-authorship
relation, where every author-paper edge has a weight that reflects
the level of involvement (order) of this author in the
authorship of that paper as seen in equation 1. According to
figure 2(b), a matrix PA can be used to present the relations
between authors and papers in the ATM-MSSN model. PA is
a matrix of size (M × N), with M is the total number of
authors in the model, while N is the total number of papers. The
matrix element paij represents the weight of author i in
writing the paper j. In other words, if a paper j has only one
author I then paij = 1. While for a paper i written by more than
one author, then the value of paij depends on the order of
authors who wrote that paper [Du et al., 2015], the equation is
modified as
1
1
1
1
1
1
B. ATM-MSSN-Author-CoAuthor graph
Other type of heterogonous graphs is that constructed using
the same class element (e.g. authors) and then connected by
different types of relations (e.g. follow and co-author
relations).</p>
        <p>Therefore, constructing MSSN’s graphs is the core step in
building an efficient data-mining model that is used to
perform complex analytical queries. As such, suitable
heterogeneous and/or homogenous graph representation is selected
to achieve the intended goal of the mining study. These
graphs could be extended to include various attributes
(conferences, journals, publishers, etc.) in order to develop a
data-mining model that is capable of analyzing the relations
among these attributes.
3</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Extended Follow Model and Querying</title>
      <p>In this section we extend the Follow Model, introduced by
[Sandes et al. 2012], as the best way to model MSSN’s and
perform effective queries. In addition, PageRank and other
ranking methods can be coupled with Extended Follow
Model (EFM) to perform advanced queries.</p>
    </sec>
    <sec id="sec-6">
      <title>3.1 Extended Follow Model (EFM)</title>
      <p>MSSN can be best described in the form of directed graph G
= (V, E) where the vertices set V represents the papers and/or
authors, while the directed edges E: V×V represents the
relations between them. For heterogeneous MSSN, there are
more types of relations; E can be noted as Ea, Ep or ∪ !.
The author follow relation (v, u) ∈ Ea means that author v
follows author u, and the graph Ga = (Va, Ea) presents the
author relationship. While, (a, b) ∈ Ep means that paper a
cites paper b, and the graph Gp = (Vp, Ep) presents the paper
relationship.</p>
      <p>As such, the Extended Follow Model (EFM) can
efficiently describe the relations between the MSSN classes as
mentioned in section 2.1. Where two authors can be related
as either; followee, follower or r-friends while two papers are
related as cited (followee), cited in (follower) or both-cited
(r-friends).</p>
      <p>Using these relations, one can construct data subsets for
big data querying. These data subsets can be extracted using
the following functions:
fout(u)={v|(u,v)∈Ea}, (2)
where, fout(u) is the followee function to present the subset,
Vout, of all followees, v, of author u, Va → Vout, Va⊂V; |fout(u)|
is the number of the elements (authors) in the followee subset
of author u; "%#$ &amp; ={p(v)|(u,v)∈Ea}, p(v) is a value of the
author v, such as the order in the subset or h-index of the
author etc. "'#$ &amp; ={w(v)|(u,v)∈Ea}, w(v) is a weight value
of the link between the authors u and v, such as the number of
citations etc.</p>
      <p>fin(u)={v|(v,u)∈Ea}, (3)
where, fin(u) is the follower function to present the subset,
Vin, of all followers, v, of author u, Va→ Vin, Va⊂V; |fin(u)| is
the number of the elements (authors) in the follower subset of
author; %( &amp; ={p(v)|(v,u)∈Ea}, p(v) is a value of the author
v, such as the order in the subset or h-index of the author etc.</p>
      <p>'( &amp; ={w(v)|(u,v)∈Ea}, w(v) is a weight value of the link
between the authors u and v, such as the number of citations.
fr(u)=fout(u) ∩fin(u), (4)
where, fr(u)is the r-friend function to present the subset,
Va, of all r-friends of author u, Va→Vr, Va⊂V. |fr(u)| is the
number of the elements (authors) in the r-friend subset of
author; )% &amp; ={p(.)}, p(.) is a value of the r-friends of author
u, such as the order in the subset or h-index of the author etc.
)' &amp; ={w(.)}, w(.) is a weight value of the link between the
author u and his f-friends, such as the number of co-author,
etc.</p>
      <p>With these basic definitions, EFM has both numeric |f(.)|
and symbolic f(.) representations for more sophisticated
relationships between users.</p>
      <p>The Follow Model is also characterized by three properties:
reverse relationship, compositionality, and extensibility
[Sandes et al. 2012, Weigang et al., 2014]. Joining functions
allow us to create many other relationship functions. For
example: finfout(u) represents the followers of followees of u;
( &amp; represents the followers of followers of u; "#$ &amp;
represents the followees of followees of u; ) &amp; represents
the r-friends of r-friends of u.</p>
      <p>In this research, beside EFM is applied as a querying
method for MSSN-AUTHOR, it is also used in
MSSN-PAPER by three functions: 1) fout(p) is a function to
present all papers which are cited by paper p; 2) fin(p) is a
function to present all the papers which cited the paper p; and
3) fr(p) is a function to present the paper p´s both-cited, which
are papers that cited p and were cited by p.
3.2</p>
    </sec>
    <sec id="sec-7">
      <title>Querying Google Scholar using Follow Model</title>
      <p>EFM can be applied for querying in MSSN from Google
Scholar or Microsoft Academic Search to satisfy the needs of
users of these academic search engines. For example:
•
•
•
•
•
•
•</p>
      <p>An author of a paper p may be interested in the papers
that cited his paper. In this case Follow model can be
used, * ( , where P(p) is the set of all papers
that cited the paper p (Cited Ins).</p>
      <p>The same author may be interested in listing authors who
follow him, therefore according to follow model,
+ ( , where A(p) is the set of authors that cites
paper p (i.e. followers of the author).</p>
      <p>One of many other interesting queries in the same
context is obtaining the list of papers cited by those papers
that cited p, or in other words, the list of followees of the
author’s followers A(p). Follow model can simplify this
query using + "#$ (
In addition an author may be interested in the set of
papers that cites a particular paper (cited by his paper
as well) in addition to his paper p. As such, f(pi) = fin(p)
∩ fin(pi), where P(pi) is the set of all papers that cited his
paper p in addition to .</p>
      <p>Other users may be interested in the citations of paper p.
Using Follow model, * "#$ , where P(p) is the
set of the papers that were cited by p.</p>
      <p>Other queries include: finding out the set of top-x (x may
be 5 or more) papers, in terms of number of Cited Ins, for
the papers cited by p. Follow model can present this
query as * ( "#$ , , where fout(p) is a
function containing the set of papers (Pc) that were cited by
paper p; ( -. , is a function generating the top 5
papers, cited papers of the set Pc, that have the highest
number of Cited-Ins.</p>
      <p>Also, finding out the set of top-x papers, in terms of the
influence of the paper or the authors, for the papers that
were cited by the papers that cited p. Follow model can
present this query as * "#$ ( /0 ,
where ( is a function containing the set of papers
(Pc) that cited paper p; "#$ -. /0 is a function
generatingthe top 10 papers, that were cited by papers of
the set Pc, that have the highest influence. Different
ranking algorithms, explained in the following section,
can be used to determine the influence of papers and
authors.</p>
    </sec>
    <sec id="sec-8">
      <title>4 Influential Scholar Ranking Models</title>
      <p>Ranking algorithms can be used to find the influential
scholars in a MSSN. This section presents three ranking
methods: PageRank, AuthorRank and InventorRank. All
these models are presented in the form of Extended Follow
Model.</p>
    </sec>
    <sec id="sec-9">
      <title>4.1 PageRank and AuthorRank</title>
      <p>PageRank [Brin and Page, 1998] can be presented in the form
of EFM as follows:
*1
1 –
3
4
%
(
| "#$6 (
7|
8
(5)
where, i is an author, %( is the set of the values of all
authors who linked (followed) to i, and 4 %( is the sum
7| is the number of
of the values in this set. | "#$6 (
followers of the followee of i.</p>
      <p>On the other hand, AuthorRank is an indicator of the
impact of an individual author in the network [Liu et al.
2005]. This algorithm is considered as an improvement of
PageRank algorithm. Where, weights of nodes represent the
number of times by which an author was co-author with
another. Using EFM, AuthorRank can be represented as
follows:
+1
1 –
Where, the &gt;?A@.. ? represents the weights of the followee
represents the weights of the followers</p>
    </sec>
    <sec id="sec-10">
      <title>4.2 InventorRank</title>
      <p>In the study of the data model of the inventor-ranking
framework, [Du et al. 2015] demonstrates how to perform
analysis of important nodes in heterogeneous networks. EFM
is used to present one of the three rules described by [Du et al.
2015] for determining influential authors based on
co-authorship. Where, highly ranked authors tend to
co-author with other highly ranked authors. The first rule of
InventorRank is determined using the following equation:
1 E</p>
      <p>F GH46 )' . )% . I 7
1 E 1</p>
      <p>I . | ) E |JK 7
where Ri(k) is the rank of author k, fr(k) is the set of the all
co-authors of k. See other rules in [Du et al. 2015].</p>
    </sec>
    <sec id="sec-11">
      <title>4.3 Adjusting PageRank and Inventor Rank with SJR</title>
      <p>Based on the fact that articles are usually published in some
events or journals, González-Pereira [2010] proposes a way
to classify the influence of a journal, based on the weight of
citations and eigenvector centrality, in heterogeneous
networks, this model is called SCImago Journal Rank (SJR).
Siebelt et al. [2010] e Macedo et al. [2010] are examples of
some researchers that suggest using SJR to calculate the
importance of an article. It is suggested that, like Du et al.
[2015] used the classification of journals for classifying
authors, it is possible to use periodicals classification as a
mean for calculating journals or authors importance. As such
this paper proposes adding journals weights in the previously
defined classification algorithm. Thus, modified equations
can be as follows:</p>
      <sec id="sec-11-1">
        <title>PageRank:</title>
        <p>SR(i) = PR(i) * SCImago_Rank</p>
      </sec>
      <sec id="sec-11-2">
        <title>InventorRank:</title>
        <p>1% M = 1% M * SCImago_Rank
(8)
(9)</p>
        <p>Note that AuthorRank was not modified to use this
technique due to the fact that this method is restricted to
classification of a network that contains only authors.
5</p>
      </sec>
    </sec>
    <sec id="sec-12">
      <title>ATM-MSSN Ranking Case Study</title>
      <p>In this section, the ranking case study in ATM-MSSN is
described in details, to demonstrate how EFM can be coupled
with three classification algorithms; PageRank, AuthorRank
and InventerRank; to achieve effective querying. It also
demonstrates the application of SJR to obtain influential
rankings.</p>
      <p>In figure 2(b), Heterogenous ATM-MSSN includes a total
of 249 authors and 165 papers. Citation relationships
between the papers (where an article cites others) and
between the authors (an author cites / follows others) are
illustrated. There is also another kind of relationship between
authors and articles which is defined as the co-authoring
relationship.</p>
      <p>For all these tests, the parameters of the models are defined
by the following pattern: For PageRank and AuthorRank,
parameter d was set at 0.5. For the parameters, αOO, αOQ e αQO,
the values were 0.4, 0.4 and 0.2 respectively. The
I and I % were both set as 0.5. The classification values
were all obtained from SJR´s site:
http://www.scimagojr.com/. If there is no journal, it is
considered as null classification and does not influence the
ranking calculation.
5.1</p>
    </sec>
    <sec id="sec-13">
      <title>Ranking authors and papers without SJR</title>
      <p>The first result obtained is related to the author´s ranking in
ATM-MSSN. The ranking results are diferent due to the
diferent characteristics of each model.</p>
      <p>From Table 1, it is possible to observe that each profile at
the top of the ranking reflects the characteristics that most
affect the model.
a total of 13 citations (followees). E Ferons, best ranked by
InventorRank model, co-authored with A R Odoni, B
Delcairet, H Idris, J P Clarke, W D Hall e B Delcairet, all
well ranked authors in ATM-MSSN. This shows that
although A R Odoni received many citations, a total of 89
(followers), it was not significant enough to affect his
ranking because those that work with him are not the best
ranked in the network. In case of AuthorRank, J F Butler
received top ranking because his papers received most of the
citations from A R Odoni, G Andreatta and B G Sokkapa.</p>
      <p>Table 2, which lists the Top 5 papers by PageRank and
InventorRank. For InventorRank, the paper´s ranking is
affected mostly by the authors’ influence, and vise-vesa. This
correlation is not observed in PageRank.</p>
    </sec>
    <sec id="sec-14">
      <title>Ranking authors and papers considering SJR</title>
      <p>When analyzing the best papers ranked by InventorRank, it
is observed that the position of the authors influence dictates
the paper's ranking. PageRank does not yield similar results
and relations, because it is not well structured to evaluate
heterogeneous networks. The tests below analyze how these
models operate when adding new characteristics to the
network.</p>
      <p>From table 3, it is possible to observe that the
InventorRank differed in the ranking of a few others, which
indicates that its results obtained in table 1 may not be
representative. Table 3 shows that the weight of SJR for the
journals where E Ferons’ articles were published did not
contribute to his rankings. Instead, A R Odoni , M O Ball and
others are well ranked.</p>
      <p>Comparing Table 2 to Table 4, we observe that PageRank
is altered significantly when considering SJR. This was a
result of either the quality of the journals where the articles
were published, or in some cases where the articles were not
even published as they were simply graduate dissertations or
internal reports within the institution.</p>
      <p>Table 3 Top 10 Authors Ranking Considering SJR</p>
    </sec>
    <sec id="sec-15">
      <title>Conclusion</title>
      <p>This paper presents the construction of Micro Scholar Social
Networks (MSSN) for specific research topic using Google
Scholar academic search engine. Extended Follow Model
(EFM) was proposed as a comprehensive way of creating
efficient data-mining model for querying homogenous and
heterogeneous MSSNs. By means of the advantages, EFM
was coupled with ranking algorithms to achieve a full
querying and ranking models for scholarly documents of Google
Scholar.</p>
      <p>Comparing the results of such algorithms shows that
InventorRank is a much more robust and accurate model,
especially when considering the amount of information used
for classification and ranking. Where, InventorRank can be
easily adapted to adding new features to the network, in
addition to its flexibility resulted from the ability to set the
degree of importance of each term of the algorithm. On the
other hand, changes in the network directly affect
classification ability of Pagerank algorithm.</p>
      <p>It is worth mentioning that Extended Follow Model
provides a simple and efficient means for representing several
existing ranking models. Such representation facilitates the
coding routine for developers, as complex equations are
represented as an easy to understand and code algorithms.</p>
      <p>This study also showed that the ranking system can be
further modified to consider the level of influence of the
journal where the paper is published. However, such
modification requires caustion as models such as PageRank
is very sensitive to alterations, and may incorrectly classify
articles of high quality.</p>
      <p>Thanks to the mentioned authors and their papers in
ATM-MSSN from Google Scholar.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <source>[Brin and Page</source>
          , 1998]
          <string-name>
            <given-names>Sergey</given-names>
            <surname>Brin</surname>
          </string-name>
          and
          <string-name>
            <given-names>Lawrence</given-names>
            <surname>Page</surname>
          </string-name>
          .
          <article-title>The anatomy of a large-scale hypertextual Web search engine</article-title>
          .
          <source>Computer networks and ISDN systems</source>
          ,
          <volume>30</volume>
          (
          <issue>1</issue>
          ):
          <fpage>107</fpage>
          -
          <lpage>117</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [Ahmedi et al.,
          <year>2011</year>
          ]
          <string-name>
            <given-names>Lule</given-names>
            <surname>Ahmedi</surname>
          </string-name>
          , Lejla Abazi-Bexheti,
          <string-name>
            <given-names>Arbana</given-names>
            <surname>Kadriu</surname>
          </string-name>
          .
          <article-title>A Uniform Semantic Web Framework for Co-authorship Networks</article-title>
          .
          <source>In Proceedings of IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing</source>
          , pages
          <fpage>958</fpage>
          -
          <lpage>965</lpage>
          . Sydney, Australia,
          <year>2011</year>
          . IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [Du et al.,
          <volume>20015</volume>
          ]
          <string-name>
            <surname>Yong-ping Du</surname>
          </string-name>
          , Chang-qing
          <string-name>
            <surname>Yao</surname>
            ,
            <given-names>Nan</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Using Heterogeneous Patent Network Features to Rank and Discover Influential Inventors</article-title>
          . To appear
          <source>in Frontiers of Information Technology &amp; Electronic Engineering</source>
          ,
          <year>2015</year>
          . doi:
          <volume>10</volume>
          .1631/FITEE.1400394
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [
          <string-name>
            <surname>González-Pereira</surname>
          </string-name>
          et al.,
          <year>2010</year>
          ]
          <string-name>
            <given-names>Borja</given-names>
            <surname>González-Pereira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Vicente P.</given-names>
            <surname>Guerrero-Bote</surname>
          </string-name>
          , and
          <string-name>
            <surname>Félix</surname>
          </string-name>
          Moya-Anegón.
          <article-title>A new approach to the metric of journals' scientific prestige: The SJR indicator</article-title>
          .
          <source>Journal of informetrics</source>
          ,
          <volume>4</volume>
          (
          <issue>3</issue>
          ):
          <fpage>379</fpage>
          -
          <lpage>391</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <source>[Hirsch</source>
          , 2005]
          <string-name>
            <surname>Jorge E. Hirsch.</surname>
          </string-name>
          <article-title>An index to quantify an individual's scientific research output</article-title>
          .
          <source>In Proceedings of the National academy of Sciences of the United States of America</source>
          ,
          <volume>102</volume>
          (
          <issue>46</issue>
          ),
          <fpage>16569</fpage>
          -
          <lpage>16572</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <source>[Khabsa and Giles</source>
          , 2014]
          <string-name>
            <given-names>Madian</given-names>
            <surname>Khabsa</surname>
          </string-name>
          and
          <string-name>
            <given-names>C. Lee</given-names>
            <surname>Giles</surname>
          </string-name>
          .
          <article-title>The Number of Scholarly Documents on the Public Web</article-title>
          .
          <source>PloS one</source>
          ,
          <volume>9</volume>
          (
          <issue>5</issue>
          ): e93949,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <source>[Kim and Leskovec</source>
          , 2012]
          <string-name>
            <given-names>Myunghwan</given-names>
            <surname>Kim</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jure</given-names>
            <surname>Leskovec</surname>
          </string-name>
          .
          <source>Multiplicative Attribute Graph Model of Real-World Networks. Internet Mathematics</source>
          ,
          <volume>8</volume>
          (
          <issue>1</issue>
          -2):
          <fpage>113</fpage>
          -
          <lpage>160</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [Liu et al.,
          <year>2005</year>
          ] Xiaoming Liu, Johan Bollen, Michael L. Nelson, Herbert Van de Sompe.
          <article-title>Co-authorship networks in the digital library research community</article-title>
          .
          <source>Information processing &amp; management</source>
          ,
          <volume>41</volume>
          (
          <issue>6</issue>
          ):
          <fpage>1462</fpage>
          -
          <lpage>1480</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [Macedoa et al.,
          <year>2010</year>
          ] Luciana G. Macedoa,
          <string-name>
            <surname>Mark R. Elkinsb</surname>
          </string-name>
          , Christopher Mahera,
          <string-name>
            <surname>Anne M. Moseleya</surname>
            ,
            <given-names>Robert D.</given-names>
          </string-name>
          <string-name>
            <surname>Herberta</surname>
            ,
            <given-names>Catherine</given-names>
          </string-name>
          <string-name>
            <surname>Sherrington</surname>
          </string-name>
          .
          <article-title>There was evidence of convergent and construct validity of Physiotherapy Evidence Database quality scale for physiotherapy trials</article-title>
          .
          <source>Journal of Clinical Epidemiology</source>
          ,
          <volume>63</volume>
          (
          <issue>8</issue>
          ):
          <fpage>920</fpage>
          -
          <lpage>925</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [Sandes et al.,
          <year>2012</year>
          ] Edans
          <string-name>
            <given-names>F.</given-names>
            <surname>Sandes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Li</given-names>
            <surname>Weigang</surname>
          </string-name>
          and
          <string-name>
            <surname>Alba C. de Melo</surname>
          </string-name>
          .
          <article-title>Logical Model of Relationship for Online Social Networks and Performance Optimizing of Queries</article-title>
          .
          <source>In Proceedings of Web Information Systems Engineering</source>
          , pages
          <fpage>726</fpage>
          -
          <lpage>736</lpage>
          , Paphos, Cyprus,
          <year>Nuvember 2012</year>
          . Springer Berlin Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <source>[Sheldrick</source>
          , 2007]
          <string-name>
            <surname>George</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Sheldrick</surname>
          </string-name>
          .
          <article-title>A short history of SHELX</article-title>
          .
          <source>Acta Crystallographica Section A: Foundations of Crystallography</source>
          ,
          <volume>64</volume>
          (
          <issue>1</issue>
          ):
          <fpage>112</fpage>
          -
          <lpage>122</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [Siebel et al.,
          <year>2010</year>
          ]
          <string-name>
            <given-names>Michiel</given-names>
            <surname>Siebel</surname>
          </string-name>
          , Teun Siebelt,
          <string-name>
            <given-names>Peter</given-names>
            <surname>Pilot</surname>
          </string-name>
          , Rolf Bloem,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bhandari</surname>
          </string-name>
          and
          <string-name>
            <given-names>Rudolf</given-names>
            <surname>Poolman</surname>
          </string-name>
          .
          <article-title>Citation analysis of orthopaedic literature; 18 major orthopaedic journals compared for Impact Factor and SCImago</article-title>
          .
          <source>BMC Musculoskeletal Disorders</source>
          ,
          <volume>11</volume>
          (
          <issue>1</issue>
          ), 4,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [Sun et al.,
          <year>2012</year>
          ]
          <string-name>
            <given-names>Yizhou</given-names>
            <surname>Sun</surname>
          </string-name>
          , Jiawei Han, Charu C. Aggarwal,
          <string-name>
            <surname>Nitesh</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Chawla</surname>
          </string-name>
          .
          <article-title>When will it happen?: relationship prediction in heterogeneous information networks</article-title>
          .
          <source>In Proceedings of the fifth ACM international conference on Web search and data mining</source>
          . Pages:
          <fpage>663</fpage>
          -
          <lpage>672</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [Tang et al.,
          <year>2008</year>
          ]
          <string-name>
            <given-names>Jie</given-names>
            <surname>Tang</surname>
          </string-name>
          , Jing Zhang, Limin Yao,
          <string-name>
            <given-names>Juanzi</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <surname>Li Zhang</surname>
          </string-name>
          , Zhong Su.
          <article-title>Arnetminer: extraction and mining of academic social networks</article-title>
          .
          <source>In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          , pages
          <fpage>990</fpage>
          -
          <lpage>998</lpage>
          ,
          <year>August 2008</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [Weigang et al.,
          <year>2014</year>
          ]
          <string-name>
            <given-names>Li</given-names>
            <surname>Weigang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Edans F.</given-names>
            <surname>Sandes</surname>
          </string-name>
          , Jianya Zheng, Alba C. de Melo, and
          <string-name>
            <given-names>Lorna</given-names>
            <surname>Uden</surname>
          </string-name>
          .
          <article-title>Querying dynamic communities in online social networks</article-title>
          .
          <source>Journal of Zhejiang</source>
          University - Science C,
          <volume>15</volume>
          (
          <issue>2</issue>
          ):
          <fpage>81</fpage>
          -
          <lpage>90</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [Weigang et al.,
          <year>2014</year>
          ]
          <string-name>
            <given-names>Li</given-names>
            <surname>Weigang</surname>
          </string-name>
          , Jianya Zheng, and
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>W-entropy index: the impact of members on social networks</article-title>
          .
          <source>In Proceedings of the Web Information Systems and Mining Conference, LNCS 6987 (I)</source>
          , pages
          <fpage>226</fpage>
          -
          <lpage>233</lpage>
          , Taiyuan, China,
          <year>2011</year>
          . Springer Berlin Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [Yu and Van de Sompel,
          <year>1965</year>
          ]
          <string-name>
            <given-names>Pingkang</given-names>
            <surname>Yu and H. Van de Sompel</surname>
          </string-name>
          ,
          <article-title>Networks of scientific papers</article-title>
          .
          <source>Science</source>
          ,
          <volume>169</volume>
          :
          <fpage>510</fpage>
          -
          <lpage>515</lpage>
          ,
          <year>1965</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>