<!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>Analysis of Strong and Weak Ties in Oil &amp; Gas Professional Community</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fedor Krasnov</string-name>
          <email>Krasnov.FV@gazprom-neft.ru</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>So a Dokuka</string-name>
          <email>sdokuka@hse.ru</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ilya Gorshkov</string-name>
          <email>iagorshkov@edu.hse.ru</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rostislav Yavorskiy</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Fedor Krasnov Gazpromneft NTC</institution>
          ,
          <addr-line>St. Petersburg</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Ilya Gorshkov Department of Data Analysis and Arti cial Intelligence, Faculty of Computer Science, Higher School of Economics</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Rostislav Yavorskiy Department of Data Analysis and Arti cial Intelligence, Faculty of Computer Science, Higher School of Economics</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>So a Dokuka Center for Institutional Studies, Higher School of Economics</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The importance of weak social ties in professional communities is well studied and widely accepted. In our paper we analyze the structure of strong ties based on the co-authorship relation and use the formal concept analysis framework to gure out weak ties. The research is motivated by fast growing need in cross-disciplinary research, which requires experts from di erent areas to understand the bigger picture and identify potential fellows for collaborative research projects in nearest future.</p>
      </abstract>
      <kwd-group>
        <kwd>co-authorship graph</kwd>
        <kwd>strong ties</kwd>
        <kwd>weak ties</kwd>
        <kwd>professional network</kwd>
        <kwd>professional community</kwd>
        <kwd>research management</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Introduction</title>
      <sec id="sec-2-1">
        <title>The nature of the problem</title>
        <p>To keep up with state of the art developments in the Oil &amp; Gag industry
the engineers have to regularly examine specialized conferences organized
under the umbrella of the Society of Petroleum Engineers (SPE)5. The
built in mechanism for expert selection of materials for these
conferences is designed to provide an appropriate level of knowledge, and thus
eliminates the need to waste time on publications, which are not of top
quality.</p>
        <p>All the conferences in the eld are divided into regions to represent the
regional development in the industry. Besides, the SPE has a rule
explicitly stated in every call for papers, according to which the article may
5 SPE is a not-for-pro t professional organization for oil and natural gas exploration
and production (E&amp;P) professionals. It was founded in 1957, and today brings
together more than 165,000 engineers, scientists, managers, and educators
be submitted to only one conference. Therefore the authors of
crossdisciplinary articles have to choose which of the specialized conferences
to apply to.</p>
        <p>Nowadays the easily accessible hydrocarbon resources have run out, so
the industry is focused on hard-to-mine resources (brown elds), which
requires an integrated approach and cross-functionality. Therefore, the
number of cross-disciplinary articles grows from year to year.</p>
        <p>As a result, it may happen for a cross-disciplinary work that the article
falls out of focus. On the other hand there is a common theme for all
conferences, such as those associated with machine learning and big data.
For those interested in topics such specialists should either keep track of
all conferences at once, or use automated search engines.
1.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>The research objectives</title>
        <p>
          Our goal is to develop a methodology and tools for automated analysis
of a collection of research papers available at the SPE digital library. On
the basis of these analyzes one should be able to:
{ gure out the most important and relevant research topics,
{ assess the in uence of di erent researchers and scienti c schools,
{ identify strong and weak ties in the professional community,
and use all of these in daily research management process. This paper is
focused on the third item in the list. It continues our study of professional
communities started in [
          <xref ref-type="bibr" rid="ref13 ref14 ref15 ref16 ref4 ref5 ref7">15, 13, 14, 16, 4, 5, 7</xref>
          ].
1.3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Social network analysis</title>
        <p>
          The analysis of social networks of co-authorship has a long history [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
There are a plenty of studies examining the structure of co-authorship
ties within diverse scienti c elds and reveal speci c collaboration
patterns for the di erent disciplines [
          <xref ref-type="bibr" rid="ref1 ref19 ref24 ref3 ref6">1, 3, 6, 19, 24</xref>
          ]. Here we intend to uncover
weak social ties in the Oil&amp; Gas professional community. This is similar
to the task of link prediction in social networks, see e.g. [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ].
Weak ties within social networks is one of the key concepts. The idea
of the di erentiation of ties by their strength was rstly considered by
sociologist Granovetter in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], who empirically showed that weak ties
(e.g. ties with not very close friends and relatives) are of a great
importance in case of information propagation and knowledge di usion. In case
of Granovetter, weak ties were the source of the important information
about working places and vacancies.
        </p>
        <p>The identi cation of weak ties within a professional community has a
great practical importance. Firstly, identi cation of people who are
working on the same topic and substantial research idea is very important for
information gathering and knowledge di usion. Secondly, knowing the
social environment, e.g. weak ties within the community can be
important in collaboration and cooperation establishment. In this paper we
aim to identify the strong and weak ties within the professionals of Oil
&amp; Gag industry based on their collaborations which can be inferred from
their coauthorships. In this paper we assume that two researches have
weak ties if they both work with the same objects or concepts and their
research topics are very close to each other.
1.4</p>
      </sec>
      <sec id="sec-2-4">
        <title>Formal concept analysis</title>
        <p>
          Formal concept analysis (FCA) gives a way to analyze collections of
objects and their properties. Recall some basic de nitions from [?]. A
formal context is a triple K = (G; M; I), where G is a set of objects, M
is a set of attributes, and I G M is a binary relation that expresses
which objects have which attributes. Implication A ! B for subsets A,
B of the set of attributes M (A; B M ) holds if A0 B0, i.e. every
object possessing each attribute from A also has each attribute from B.
An association rule is an expression of the form X ! Y , where X; Y M
and X0 Y 0 may not hold. The strength of an association rule can
be measured in terms of its support (denoted by supp) and con dence
(denoted by conf ), where
supp(X ! Y ) = j(X [ Y )0j ; conf (X ! Y ) = j(X [ Y )0j
jGj jX0j
Support determines how often a rule is applicable to a given data set,
while con dence determines how frequently items in Y appear in
transactions that contain X. See [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] for a detailed introduction to the subject.
In this paper we utilize the FCA framework for studying the author
keyword relationship. For us
{ G denotes the set of keywords.
{ M stands for the set of all co-authors of the papers.
{ I G M is a binary relation. One has (g; m) 2 I if m co-authors
a paper for which g is among the keywords.
        </p>
        <p>Then the association rules are interpreted as indicators of connectivity
between di erent research elds, and also used to recognize weak ties
between authors of di erent papers.</p>
        <p>
          The idea to apply FCA in the context of social network analysis is not
new. In [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] it was used for collective network analysis. In [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] a
combination of Formal Concept Analysis and well-known matrix factorization
methods were used to address computational complexity of social
networks analysis and the clarity of their visualization. Bi-clustering and
tri-clustering were used in [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] to analyze data collected from the
Russian online social network VKontakte for extracting groups of users with
similar interests, nding communities of users which belong to similar
groups, and revealing users interests. FCA was extensively used for
analyzing social networks based on co-references, see [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], and detecting
criminal networks [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. For other applications of FCA in social network
analysis see [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. Another rather detailed overview of FCA-based
applications for Social Networks Analysis could be found in [
          <xref ref-type="bibr" rid="ref2 ref20 ref21">21, 20, 2</xref>
          ].
The rest of the paper is organized as follows. In the second section we
describe the data collection procedures and provide descriptive statistics.
In the third section we provide the results for empirical estimation of
the data. The fourth section provides a summary of results and some
conclusions.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Data</title>
      <p>Our study is based on materials of annual SPE Russian Oil and Gas
Conference and Exhibition 2016. The main features of this event are as
follows:
{ Multi-disciplinary. The conference presentations, selected on the
basic directions of development Oil &amp; Gas industry. These areas are
listed below.
{ Periodic. This is an annual conference.
{ Regional. The majority of the participants represented mainly the</p>
      <p>Russian companies.
{ High selection criteria. The conference acceptance rate is
approximately 15%. The selection process is conducted by Subject Matter
Experts.
{ The conference program consists of four parallel sections.
{ At least one co-author must attend the event and present the work.
The data we work on is retrieved from open portal of Society of Petroleum
Engineers (SPE) at http://www.onepetro.org.</p>
      <p>Clean up and preparation of meta information was produced using Python
on hybrid cluster at Gazpromneft NTC LLC. Text analysis was done
using Python NLTK library. Statistical analysis was performed using SciPy
library.
2.1</p>
      <sec id="sec-3-1">
        <title>Features of the collection</title>
        <p>The collection comprises 404 articles written by 839 co-authors. It
includes papers in the following areas:
1. Well construction drilling and completion.
2. Static and dynamic modeling.
3. Hard-to-recover reserves.
4. Well and formation testing.
5. Field development monitoring and control.
6. Well intervention.
7. Shelf development experience and prospects.
8. Field geophysical survey/well logging.
9. Gas condensate and oil gas condensate eld development.
10. Brown elds.
11. Geomechanics.
12. Oil and gas production - equipment and technologies.
13. Cores recovery, examination and analysis
2.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Structure of the data</title>
        <p>In the retrieved data each publication record includes the following
information:
{ title and abstract of the article;
{ the list of authors and their a liations;
{ year of publication.</p>
        <p>The most time-consuming step was to prepare the data and make the
data set clean and useful. Unfortunately, the portal does not have a
directory for authors. As a result sometimes we had up to 6 di erent
spellings of the same name in di erent articles.
2.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Strong ties</title>
        <p>Almost every paper in the collection is written jointly by a few authors.
It usually takes at least several months to write a good paper, so in the
context of professional community each publication could be considered
as a proof of strong ties between the co-authors.</p>
        <p>The descriptive statistics for the co-authorship network is given below.
{ Number of nodes: 839
{ Number of strong ties: 2315
{ Number of connected components: 127
{ Size of the largest connected component: 198
{ Size of the second largest connected component: 20
2.4</p>
      </sec>
      <sec id="sec-3-4">
        <title>Network visualization</title>
        <p>
          The visualization of co-authorship networks is presented in Fig. 1. This
and the other graphs in this paper are produced with yEd Graph Editor
[
          <xref ref-type="bibr" rid="ref27">27</xref>
          ].
        </p>
        <p>An inspection of the largest connected component shows that it mostly
consists of participants of the well established collaborative program
between Gazprom subsidiaries and Schlumberger. Otherwise the picture is
very typical for a large industrial research conference, where the
audience consists of big number of small cliques, which hardly communicate
with each other. It shows that authors prefer working within their small
community and it is di cult for them to establish new links with other
colleagues.</p>
        <p>As it was already mentioned above the goal of our work is to help the
members of a professional community identify participants with similar
interests and then convert weak ties into strong ones by establishing
mutually bene cial collaborative research projects.
3
3.1</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Identi cation of weak ties</title>
      <sec id="sec-4-1">
        <title>Heuristics for identifying weak ties</title>
        <p>
          The importance of weak ties is well studied in the literature, see [
          <xref ref-type="bibr" rid="ref10 ref11">11,
10</xref>
          ]. In this paper we assume that two researchers have weak ties if they
both work with the same objects or concepts. We believe that if two
persons work on the same substantial problem (e.g. they share same
narrow research topic), they should at least know each others' works.
We assume these social ties are weak, because they are very much likely
to know each other and even communicate, but the intensity of their
interactions and communications is very much likely to be low, because
they are not involved in joint projects.
        </p>
        <p>The heuristics is implemented in the following way. First, we start from
extracting keywords for each paper in order to create a formal context,
i.a. object-attribute relation in which objects are words, attributes are
authors, and the relation is \a keyword w is used by an author a". Second,</p>
        <p>
          the association rules with high characteristics of support and con
dentiality are computed using Concept Explorer tool, see [
          <xref ref-type="bibr" rid="ref28 ref29">28, 29</xref>
          ].
Finally, for every association rule of the form
a1; : : : ; am ) b1; : : : ; bk;
(1)
where a1; : : : ; am; b1; : : : ; bk are author IDs we assume that all members
of the joint group fa1; : : : ; am; b1; : : : ; bkg are weakly connected.
3.2
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Keywords extraction</title>
        <p>As it was mentioned above our data set stores titles and abstracts of
papers. As these texts are rather small we initially consider all words as
equally important.</p>
        <p>After the clean up the object-property table has 729 objects (keywords)
and 839 attributes (authors).
3.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Association rules</title>
        <p>we conclude that members with IDs 333, 754, 42, and 133 work on the
close subjects as they use 14 common keywords, so each two of them are
considered weakly tied.</p>
        <p>In general, each rule of a form</p>
        <p>s j a1; : : : ; an = c% ) s0 j b1; : : : ; bm
produces Cn2+m pairwise weak ties within the union set fa1; : : : ; an; b1; : : : ; bmg.
4</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Results</title>
      <p>For the data set of SPE papers the suggested procedure yielded the
following. First, we have got 216 association rules with con dence greater
than 80% and support at least 5 objects (keywords). Some of them are
listed on Table 1. That resulted in 436 weak links out of which 149 were
unique. Finally it turned out that the bigger part of them duplicates
some of the existing strong ties and only 46 out of 149 suggest new
connections. The network graph with the added weak ties is presented
in Fig. 2 and in Fig. 3.</p>
      <p>Brie y, most of the isolated islands are not a ected and remain
isolated.Three cliques got connected to the largest component, see Fig. 2.
Another two joined the second largest component, see Fig. 3.
The fact that out of 149 identi ed weak ties 103 are duplicates of the
already established strong ties shows that the suggested heuristic is rather
conservative, two thirds of the found connections are certainly relevant.
For the remaining new links we rely on expert opinion. To this end
visualization in Fig. 4 was used together with the respective table of
suggested candidate pairs for collaboration.
In this paper we have used Formal Concept Analysis for the identi
cation of weak ties in a social network of co-authorship. This task has a
lot of applications, for example identifying colleagues with similar
academic and professional interests and aims. The identi cation of people
with similar interests can also signi cantly improve the mechanism of
academic and professional recruiting.</p>
      <p>We also believe that the current methodological approach can be
reframed for the case of dynamic social networks and identi cation of weak
ties formation and dissolution in a professional community.
5</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>The article was prepared within the framework of the Basic Research
Program at the National Research University Higher School of
Economics (HSE) and supported within the framework of a subsidy by the
Russian Academic Excellence Project '5-100'. We are also thankful to
the anonymous referees for their comments and suggestions, which
signi cantly improved the text of this paper.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Acedo</surname>
            ,
            <given-names>F.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barroso</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Casanueva</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Galan</surname>
            ,
            <given-names>J.L.:</given-names>
          </string-name>
          <article-title>Co-authorship in management and organizational studies: An empirical and network analysis*</article-title>
          .
          <source>Journal of Management Studies</source>
          <volume>43</volume>
          (
          <issue>5</issue>
          ),
          <volume>957</volume>
          {
          <fpage>983</fpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Aufaure</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le Grand</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Advances in fca-based applications for social networks analysis</article-title>
          .
          <source>International Journal of Conceptual Structures and Smart Applications (IJCSSA) 1</source>
          (
          <issue>1</issue>
          ),
          <volume>73</volume>
          {
          <fpage>89</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Barabasi</surname>
            ,
            <given-names>A.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jeong</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neda</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ravasz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schubert</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vicsek</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Evolution of the social network of scienti c collaborations. Physica A: Statistical mechanics and its applications 311(3</article-title>
          ),
          <volume>590</volume>
          {
          <fpage>614</fpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Barysheva</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Golubtsova</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yavorskiy</surname>
          </string-name>
          , R.:
          <article-title>Pro ling less active users in online communities</article-title>
          .
          <source>In: SNAFCA@ ICFCA</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Barysheva</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Petrov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yavorskiy</surname>
          </string-name>
          , R.:
          <article-title>Building pro les of blog users based on comment graph analysis: The habrahabr. ru case</article-title>
          .
          <source>In: International Conference on Analysis of Images, Social Networks and Texts</source>
          . pp.
          <volume>257</volume>
          {
          <fpage>262</fpage>
          . Springer (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Scienti c collaboration and endorsement: Network analysis of coauthorship and citation networks</article-title>
          .
          <source>Journal of informetrics 5(1)</source>
          ,
          <volume>187</volume>
          {
          <fpage>203</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Dokuka</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yavorskiy</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krasnov</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>The structure of organization: the coauthorship network case</article-title>
          .
          <source>In: Analysis of Images, Social Networks and Texts. 5th International Conference, AIST</source>
          <year>2016</year>
          , Yekaterinburg, Russia, April 7-
          <issue>9</issue>
          ,
          <year>2016</year>
          , Revised Selected Papers.
          <source>Communications in Computer and Information Science</source>
          . pp.
          <volume>93</volume>
          {
          <fpage>101</fpage>
          . Springer International Publishing (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stumme</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wille</surname>
          </string-name>
          , R.:
          <source>Formal Concept Analysis: foundations and applications</source>
          , vol.
          <volume>3626</volume>
          . Springer (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Gnatyshak</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semenov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poelmans</surname>
          </string-name>
          , J.:
          <article-title>Gaining insight in social networks with biclustering and triclustering</article-title>
          .
          <source>In: International Conference on Business Informatics Research</source>
          . pp.
          <volume>162</volume>
          {
          <fpage>171</fpage>
          . Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Granovetter</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The strength of weak ties: A network theory revisited</article-title>
          .
          <source>Sociological theory 1</source>
          (
          <issue>1</issue>
          ),
          <volume>201</volume>
          {
          <fpage>233</fpage>
          (
          <year>1983</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Granovetter</surname>
            ,
            <given-names>M.S.:</given-names>
          </string-name>
          <article-title>The strength of weak ties</article-title>
          .
          <source>American journal of</source>
          sociology pp.
          <volume>1360</volume>
          {
          <issue>1380</issue>
          (
          <year>1973</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Hou</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kretschmer</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>The structure of scienti c collaboration networks in scientometrics</article-title>
          .
          <source>Scientometrics</source>
          <volume>75</volume>
          (
          <issue>2</issue>
          ),
          <volume>189</volume>
          {
          <fpage>202</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Krasnov</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ustalov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yavorskiy</surname>
          </string-name>
          , R.:
          <article-title>Comparison of online communities on the base of lexical analysis of the news feed</article-title>
          .
          <source>In: Proceedings of 2-nd conference on Analysis of Images, Networks and Texts</source>
          , Yekaterinburg. pp.
          <volume>254</volume>
          {
          <issue>257</issue>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Krasnov</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vlasova</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yavorskiy</surname>
          </string-name>
          , R.:
          <article-title>Connectivity analysis of computer science centers based on scienti c publications datafor major russian cities</article-title>
          .
          <source>Procedia Computer Science</source>
          <volume>31</volume>
          ,
          <issue>892</issue>
          {
          <fpage>899</fpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Krasnov</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yavorskiy</surname>
          </string-name>
          , R.:
          <article-title>Measurement of maturity level of a professional community</article-title>
          .
          <source>Business Informatics</source>
          <volume>23</volume>
          (
          <issue>1</issue>
          ) (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Krasnov</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yavorskiy</surname>
            ,
            <given-names>R.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vlasova</surname>
          </string-name>
          , E.:
          <article-title>Indicators of connectivity for urban scienti c communities in russian cities</article-title>
          .
          <source>In: Analysis of Images, Social Networks and Texts</source>
          , pp.
          <volume>111</volume>
          {
          <fpage>120</fpage>
          . Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Kurtz</surname>
            ,
            <given-names>C.F.</given-names>
          </string-name>
          :
          <article-title>Collective network analysis (white paper available at www</article-title>
          .
          <source>cfkurtz.com.)</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obiedkov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Reducing the representation complexity of lattice-based taxonomies</article-title>
          . In: U. Priss,
          <string-name>
            <given-names>S.</given-names>
            <surname>Polovina</surname>
          </string-name>
          , R. Hill, Eds.,
          <source>Proc. 15th International Conference on Conceptual Structures (ICCS 2007), Lecture Notes in Arti cial Intelligence</source>
          (Springer), Vol.
          <volume>4604</volume>
          . pp.
          <volume>241</volume>
          {
          <fpage>254</fpage>
          . Springer (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Newman</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          :
          <article-title>The structure of scienti c collaboration networks</article-title>
          .
          <source>Proceedings of the National Academy of Sciences</source>
          <volume>98</volume>
          (
          <issue>2</issue>
          ),
          <volume>404</volume>
          {
          <fpage>409</fpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Obiedkov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Social Network Analysis and Conceptual Structures: Exploring Opportunities: Proceedings</article-title>
          , ClermontFerrand, France,
          <year>February 2007</year>
          . Universite Blaise Pascal, Laboratoire
          <string-name>
            <surname>Limos</surname>
          </string-name>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Pensa</surname>
            ,
            <given-names>R.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boulicaut</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Towards fault-tolerant formal concept analysis</article-title>
          .
          <source>In: Congress of the Italian Association for Arti cial Intelligence</source>
          . pp.
          <volume>212</volume>
          {
          <fpage>223</fpage>
          . Springer (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Poelmans</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Elzinga</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          :
          <article-title>Semiautomated knowledge discovery: identifying and pro ling human tra cking</article-title>
          .
          <source>International Journal of General Systems</source>
          <volume>41</volume>
          (
          <issue>8</issue>
          ),
          <volume>774</volume>
          {
          <fpage>804</fpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Poelmans</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dedene</surname>
          </string-name>
          , G.:
          <article-title>Formal concept analysis in knowledge processing: A survey on applications</article-title>
          .
          <source>Expert systems with applications</source>
          <volume>40</volume>
          (
          <issue>16</issue>
          ),
          <volume>6538</volume>
          {
          <fpage>6560</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Rodriguez</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pepe</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>On the relationship between the structural and socioacademic communities of a coauthorship network</article-title>
          .
          <source>Journal of Informetrics</source>
          <volume>2</volume>
          (
          <issue>3</issue>
          ),
          <volume>195</volume>
          {
          <fpage>201</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Snasel</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kocibova</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abraham</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Analyzing social networks using fca: complexity aspects</article-title>
          .
          <source>In: Web Intelligence and Intelligent Agent Technologies</source>
          ,
          <year>2009</year>
          . WI-IAT'
          <fpage>09</fpage>
          . IEEE/WIC/ACM International Joint Conferences on. vol.
          <volume>3</volume>
          , pp.
          <volume>38</volume>
          {
          <fpage>41</fpage>
          .
          <string-name>
            <surname>IET</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Link prediction in social networks: the state-of-the-art</article-title>
          .
          <source>Science China Information Sciences</source>
          <volume>58</volume>
          (
          <issue>1</issue>
          ),
          <volume>1</volume>
          {
          <fpage>38</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Wiese</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eiglsperger</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaufmann</surname>
          </string-name>
          , M.:
          <article-title>Y les { visualization and automatic layout of graphs</article-title>
          .
          <source>In: Graph Drawing Software</source>
          , pp.
          <volume>173</volume>
          {
          <fpage>191</fpage>
          . Springer (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Yevtushenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tane</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaiser</surname>
            ,
            <given-names>T.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obiedkov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hereth</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reppe</surname>
          </string-name>
          , H.:
          <article-title>Conexp-the concept explorer (</article-title>
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Yevtushenko</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          :
          <article-title>System of data analysis concept explorer</article-title>
          .
          <source>In: Proceedings of the 7th national conference on Arti cial Intelligence KII</source>
          . vol.
          <year>2000</year>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>