<!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>Pro ling Less Active Users in Online Communities</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alexandra Barysheva</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anna Golubtsova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rostislav Yavorskiy</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Data Analysis and Arti cial Intelligence Faculty of Computer Science Higher School of Economics Myasnitskaya 20</institution>
          ,
          <addr-line>Moscow, Russia, 101000</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Our research is focused on the study of social interactions of online community users, especially in business-oriented social networking services like LinkedIn or Habrahabr. The general aim of the work is to design methods for pro ling of discussion participants within groups according to their interaction patterns. One of our goals is to make the approach independent from the language of communication, that is why we build our analysis on the comments graph and do not use information from the posts content. This paper suggest FCA based approach to proling less active users for which not much data is available and statistical analysis is not applicable.</p>
      </abstract>
      <kwd-group>
        <kwd>online community</kwd>
        <kwd>communication graph</kwd>
        <kwd>user pro les</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Social Internet development unveiled great research potential for network
analysis which includes the analysis of relationships and ows between people, groups,
organizations, computers, URLs, and other connected information/knowledge
entities.</p>
      <p>This paper focuses on the behaviour patterns of the members of social
networks groups (communities) of interest. In these online groups, users on a regular
basis can publish information or news that called posts, and interact with each
other by commenting or liking them.</p>
      <p>The general goal of this work is to provide a method of pro ling group users
by analysing the group interaction graph. An interaction graph is a graph where
vertices correspond to users and edges represent relation \user A comments or
likes post of user B".</p>
      <p>Today almost every social media site provides an API for easy data retrieval.
Application programming interface (API) is the set of routines, protocols, and
tools for building software applications using the obtained data. In order to
retrieve the graph of social interaction we use data sets collected from
businessoriented social networking service LinkedIn and Habrahabr (leading Russian blog
on Information Technology topics).</p>
      <p>
        In this paper we continue research described in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], which is also dedicated
to the task of pro ling online community users. The method proposed in that
paper is based on clustering users according to statistical characteristics of their
communication patterns.
      </p>
      <p>
        Clustering based on statistical characteristics allows one to study the
communication patterns, but it is not applicable to users with low activity for which not
enough data is available. Our study shows that actively involved users constitute
approximately 2% of a community, while more than half of the community
member could be classi ed as \observers" (see [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]). That motivates us on designing
a separate technique for pro ling less active members of an online community.
      </p>
      <p>The paper is organized as follows. Section 2 contains the review of relevant
related works organized according to the used approach. Section 3 describes the
data set. Section 4 summarizes achieved and anticipated results. In Section 5 we
conclude and discuss the possible applications of our work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related work</title>
      <p>Relationship is a central concept of the science of Social Network Analysis. Our
race, ethnicity, background and personality | all in uence our behaviour and
interact. Thus, the behavioural patterns analysis in online communities can
provide the information about the user that is not explicit in his or her pro le page
(and obviously cast some light on the principles of social behaviour in online
networks).</p>
      <p>
        There are di erent types of relationships between people: friendship, trust,
in uence, or con ict, dislike etc. In [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] authors provide several types of
relationships in social networks including (1) binary and valued relationships, (2)
symmetric and asymmetric relationships, and (3) multimodal relationships.
Examples of binary and valued relationships are \Sam follows Ann on Facebook"
and \Alex retweeted 4 tweets from Mary" respectively. Following or reposting on
Twitter, Facebook or LinkedIn are asymmetric relationships by de nition, but
a follow-back tie can exist, thus symmetrizing them. An example of
symmetric relation is \Ann and Bob have common interests". Multimodal relationships
are interactions between actors of di erent types people possess information,
group adds people, and so on. In our study, we analyze all these three types of
relationships between group users.
      </p>
      <p>
        The task of user pro le modelling consists of many subtasks and approaches,
such as content-based methods [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], the island method [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], researching of users
friend- or following-connections, or tracing user activity [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] etc. Typically, the
majority of proposed pro ling methods combine di erent techniques.
      </p>
      <p>
        An example of Twitter users pro ling is presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Authors study
demographic estimation algorithms based on users tweets and community
relationships. They propose a hybrid community-based and text-based method where
demographics of Twitter users are estimated by tracking the tweet history and
clustering the followers/followings. The method estimates wide varieties of
demographics such as gender, age, area etc. The authors also consider users with
few tweets such as followers of corporate accounts.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] authors suggest a generic model for user classi cation in social media
with application to Twitter. Analyzing the users behaviour, linguistic content
and the network structure of the users Twitter feed they develop the method
of automatic inferring the values of user attributes such as political orientation
or ethnicity. Machine learning approach is used relying on four general feature
classes: user pro le, user tweeting behaviour, linguistic content of user messages
and user social network features. The paper presents experimental results on 3
tasks with di erent characteristics: ethnicity identi cation, political a liation
detection and detecting a nity for a particular business.
      </p>
      <p>
        A weakly supervised approach to user pro le extraction from Twitter is also
suggested in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. In addition to traditional linguistic features, this approach also
takes into account network information, o ered by social media. Authors use
users pro les from social media websites such as Facebook or Google Plus as
a distant source of supervision for extraction of their attributes from
usergenerated text. They test the algorithm on three attribute domains including
spouse, job and education and results demonstrate accurate predictions for users
attributes based on tweets.
      </p>
      <p>
        Unlike previous mentioned works, article [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] focus just on user activity,
ignoring the content of messages a user exchanged. Authors take into consideration
both social interactions and tweeting patterns of microblogging integrating
service Twitter, which allow pro ling users according to their activity patterns.
According to the investigation, there are 75 % of the users in their appropriate
cluster, which can be classi ed with a 0.9 assignment probability. Clusters are
characterized by a set of statistical features relating user activity, network
structure and dynamic patterns. Furthermore, the authors propose three algorithms
to analyze the impact of content posted by a user.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] authors use modelling user pro le to predict the pro le of another user
in the network. They gather ne-grained data from two social networks and try
to infer user pro le attributes. The article proposes a method of inferring user
attributes that is inspired by previous approaches to detecting communities in
social networks based on the fact, that users with common attributes are more
likely to be friends and often form dense communities. Results show that certain
user attributes can be inferred with high accuracy when given information on as
little as 20% of the users.
      </p>
      <p>
        The expertise retrieval task of user pro ling is also mentioned in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. In this
work, the topical pro ling task is decomposed into two stages: (1) discovering and
identifying possible knowledge areas, and (2) measuring the persons competency
in each of these areas.
      </p>
      <p>Our research has the same goal as the previous mentioned works | to provide
a method of pro ling users. Main task of this paper is to suggest an approach
for pro ling of less active users, which usually form the majority of any online
community. Since we have little data for these members, statistical analysis of
their behaviour is not possible. That is why we turn to FCA tools.</p>
      <p>
        The idea to apply formal concept analysis to social network analysis is not
new, see e.g. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] or [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Usually the technique is used for network clustering
and detecting communities. Our goal is slightly di erent, we assume that a
community is already given. We target at detailed description of roles of di erent
users in this community.
      </p>
      <p>
        Method of retrieving groups of websites users with similar behaviour using
Formal Concept Analysis presented in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Authors propose to construct a
taxonomy based on users visits of di erent pages of websites. The problem of big
number of concepts is solved by applying the stability index [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] to the lattice
concepts.
      </p>
      <p>
        Extension of using the stability index (not only in terms of intent stability,
but also in terms of extent stability) to taxonomy construction described in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
For instance, in this work authors study the dataset from research by Davis,
Gardner and Gardner [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] which features ladies attending particular events in a
small Mississippi town in the 1930s. By constructing stabilised lattice (according
to extent) authors found the core members in groups.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Description of the data set</title>
      <p>In our work we use two data sets. The rst one is communication graph retrieved
from Habrahabr blogging site for several most popular topics. The second
includes communication graphs for several LinkedIn groups.
3.1</p>
      <sec id="sec-3-1">
        <title>Habrahabr data</title>
        <p>HabraHabr (http://habrahabr.ru/) is the most popular Russian blog service
devoted to Information Technology. Currently we work with communication graphs
for the most active topics including "Algorithms", "Big Data", "High
performance computing", "Information security" and others. For a given topic the
dataset is a single table with the following columns:
{ Post Id
{ Post author
{ Comment Id
{ Comment author
{ Parent comment Id
{ Time stamp
Also, for conveniece we added some derived values like comment depth, number
of child comments etc.</p>
        <p>Data set for "Big data" community in CSV format is available at the project
page on GitHub, see https://github.com/ryavorsky/HabraGraph.
4
4.1</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Users pro ling</title>
      <p>3.2</p>
      <sec id="sec-4-1">
        <title>LinkedIn data</title>
        <p>Business-oriented social networking service LinkedIn, http://www.linkedin.com,
allows users to create pro les and interact with each other in an online social
network, which may represent real-world professional relationships. LinkedIn
also supports the formation of interest groups that are, generally, employment
related, although the majority of topics are covered mainly around professional
and career issues. Currently we work with communication graphs for the largest
groups related to the topic "Bioinformatics". The dataset has the same structure:
Post Id, Post author, Comment Id, Comment author, Like author, Time stamp,
and some derived characteristics, such as the number of child comments and its
depth in the thread.</p>
      </sec>
      <sec id="sec-4-2">
        <title>Clustering according to the statistical characteristics</title>
        <p>
          In this paper we continue research on pro ling online community users described
in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. Firstly, a set of the user attributes that can be computed using community
comment graph and post comment graphs is listed. They are: the number of
people that leave comment to the user and were commented by the user, the
number of posts the user wrote and commented, average depth of the user's
comment and how often the user's comment was a terminal. These attributes
re ect the user's communication style in online discussions.
        </p>
        <p>The clustering allowed us to gure out the following user types:
1. Silent stars (2 users). Authors of popular posts who do not participate in
the discussions.
2. Communicative stars (2 users). Authors of popular posts who are actively
involved in the discussions.
3. Active chatters (2% of users). Participants who leave many comments,
and reply to almost every comment on their posts.
4. Idle chatters (2% of users). People who write few comments, but usually
their comments support the subsequent debate.
5. Socializers (5% of users). Users who do not produce many comments,
although the number of people their talk with is notably high.
6. Investigators (15% of users). Participants who communicate with many
people within very narrow discussion (few blog posts).
7. Concluders(22% of users). Participants, who produce little comments and
quite often their comment is the last one in the discussion branch.
8. There is also one more type of user - observers (more than 50%) who are
the most inactive users: each one leaved no more than 3 comments.</p>
        <p>It can be seen that less active users represent bigger part of community.
That is why the goal of the current work is to provide method of detection of
dependencies between users with di erent activity rate. In other words we want
to know to whom among the active users the less active users are similar.
4.2</p>
      </sec>
      <sec id="sec-4-3">
        <title>Pro ling of less active users</title>
        <p>As it was mentioned above, the task of analyzing and pro ling of user behaviour
is rather straightforward for more active users, when a lot of data is available.</p>
        <p>For the other part of online community, the majority of less active members,
we suggest to describe the user pro le in terms of similarity to one or several
preselected benchmarks, key users of the community with well-known behavioural
patterns.</p>
        <p>In more details the suggested procedure is the following. First, select a small
number of key users of the studied community. Second, build the object-attribute
table, in which rows (objects) are all group users and columns (properties) are
benchmark pro les (key users). Then use use FCA tools to compute the lattice
of formal concepts. Finally, conclude that activity pattern of user user1 could
be described in terms of intersection of few benchmarks, e. g. core user1 and
core user3.
4.3</p>
      </sec>
      <sec id="sec-4-4">
        <title>Core users</title>
        <p>
          There are many di erent ways to determine the set of benchmarks. In our work
we use the notion of communication graph core [
          <xref ref-type="bibr" rid="ref16 ref17">16,17</xref>
          ]. The picture on g. 1
shows 3-core for users-posts graph (that is the largest subset of users and posts,
in which each user left comments in at least three posts and each post has
comments from at least three users) corresponding to \big data" community at
Habrahabr.ru platform.
        </p>
        <p>Restricting our focus with the 3-core helps us to lter out blog posts which
are not very relevant to the main community topic, and also gure out users,
which play central role in the group communications.</p>
        <p>Consider for example an irrelevant post, which produced quite intensive
discussion. We can detect its irrelevance by the fact that core users did not
participated in the thread. Formally, to classify a post as a core one we require that
at least 3 core users participate in the discussion.</p>
        <p>Similarly, there might be a user, who went into long comments exchange in a
single thread or left few remarks in some rather irrelevant discussions. User with
such a behaviour usually is interpreted as a casual visitor, not a core one. To be
included into the community core we require that the user should participate in
at least 3 core discussions.
4.4</p>
        <p>
          Why FCA
As it was already mentioned above, the main goal of this work is to design an
approach for describing pro les for majority of less active members of an online
community. Usually we have very little data for such users, a couple of comments
or so. That is why classi cation according to numerical characteristics suggested
in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] hardly makes sense. The users will be classi ed as \inactive" and that's it.
        </p>
        <p>In this paper we suggest to use information about the particular topics, which
attracted a user. That data has \object-property" type, so we turn to FCA.</p>
        <p>The formal context is de ned as follows. Assuming user is a group user and
benchmark is a core user we say that object user has property benchmark if
users user and benchmark together participated in a post discussion. For the
example of \big data" community mentioned above the formal context table has
13 properties (the number of core users) and hundreds of objects (for all the
other community members).</p>
        <p>
          We use FCA tools (Concept Explorer [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] and FCArt [
          <xref ref-type="bibr" rid="ref19 ref20">19,20</xref>
          ]) to build the
lattice of the formal context. As a result, the set of formal concepts is given (see
g. 2). Each formal concept has a set of objects (extent). These users are similar
to each other and their pro le could be speci ed in terms of the benchmarks,
the set of core users.
        </p>
        <p>By combining the 3-core graph and the lattice we can get a visual map of
the community, see g. 3.</p>
        <p>Also, in applications we can use the resulting formal concepts for introducing
the corresponding links between the user pro les. Indeed, for a user with low
activity the pro le will be almost empty due to lack of statistics. The links from
this empty pro le to more detailed pro les of most similar core users will help
to get at least some information about the user interests.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>The paper describes work in progress on developing a universal tool for
automated building of pro les for online community users. The proposed method
is based on the user activity in the process of posting, liking and commenting
group posts.</p>
      <p>To make the approach suitable for the analysis of di erent online
communities, the approach does not use information from the user pro le or content
analysis. Thus, it is based on user activity and his/her skills to interact with
other group participants.</p>
      <p>In order to classify less active online group members the method based on
retrieving formal concepts with core users as attributes is suggested. The results
can be used to extend the functionality of the groups with the detailed
description of the pro le of participants and the nature of their interaction, which in
turn should help to understand users behaviour.</p>
      <p>The developed method can be applied to any online community.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Barysheva</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yavorskiy</surname>
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Building</surname>
          </string-name>
          <article-title>Pro les of Blog Users Based on Comment Graph Analysis</article-title>
          ,
          <source>Proceedings of AIST'</source>
          <year>2015</year>
          , 4-th
          <source>International Conference \Analysis of Images, Social Networks and Texts"</source>
          ,
          <source>Yekaterinburg</source>
          ,
          <fpage>9</fpage>
          -
          <lpage>11</lpage>
          April
          <year>2015</year>
          . To appear in Springer CCIS.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Kouznetsov</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsvetovat</surname>
            <given-names>M.</given-names>
          </string-name>
          <article-title>Social network analysis for startups</article-title>
          <string-name>
            <surname>O'Reily</surname>
          </string-name>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Santosh R. Author</surname>
          </string-name>
          <article-title>Pro ling: Predicting Age and Gender from Blogs</article-title>
          ,
          <source>PAN at CLEF</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Rocha</surname>
            <given-names>E.</given-names>
          </string-name>
          <article-title>User pro ling on Twitter, Semantic Web</article-title>
          . Interoperability, Usability, Applicability,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kazushi</surname>
            <given-names>I</given-names>
          </string-name>
          .
          <article-title>Twitter user pro ling based on text and community mining for market analysis Knowledge-Based Systems,</article-title>
          <year>2013</year>
          , pp.
          <fpage>35</fpage>
          -
          <lpage>47</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Pennachiotti</surname>
            <given-names>M. A.</given-names>
          </string-name>
          <article-title>Machine Learning Approach to Twitter User Classi cation</article-title>
          ,
          <source>Fifth International AAAI Conference on Weblogs and Social Media</source>
          ,
          <year>2011</year>
          , p.
          <fpage>45</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Li</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ritter</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hovy</surname>
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Weakly Supervised User Pro le Extraction from Twitter</surname>
            <given-names>ACL</given-names>
          </string-name>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Druschel</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gummadi</surname>
            <given-names>K. P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mislove</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Viswanath</surname>
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>You Are Who You</surname>
          </string-name>
          <article-title>Know: Inferring User Pro les in Online Social Networks ACM WSDM</article-title>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Balog</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fang</surname>
            <given-names>Y</given-names>
          </string-name>
          .,
          <string-name>
            <surname>de Rijke</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Serdyukov</surname>
            <given-names>P.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Si</surname>
          </string-name>
          . L. Expertise Retrieval,
          <source>Foundations and Trends in Information Retrieval</source>
          ,
          <volume>6</volume>
          (
          <issue>2-3</issue>
          ),
          <year>2012</year>
          , pp.
          <fpage>127</fpage>
          -
          <lpage>256</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Snasel</surname>
            , Vaclav,
            <given-names>Zdenek</given-names>
          </string-name>
          <string-name>
            <surname>Horak</surname>
            , and
            <given-names>Ajith</given-names>
          </string-name>
          <string-name>
            <surname>Abraham</surname>
          </string-name>
          .
          <article-title>Understanding social networks using formal concept analysis</article-title>
          .
          <source>Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology-Volume 03. IEEE Computer Society</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <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>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2012</year>
          ).
          <article-title>Gaining insight in social networks with biclustering and triclustering</article-title>
          .
          <source>In Perspectives in Business Informatics Research</source>
          (pp.
          <fpage>162</fpage>
          -
          <lpage>171</lpage>
          ). Springer Berlin Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Sergei O. Kuznetsov</surname>
            ,
            <given-names>D.I. Ignatov</given-names>
          </string-name>
          ,
          <article-title>Concept Stability for Constructing Taxonomies of Web-site users</article-title>
          . In: S. Obiedkov, C. Roth, Eds.,
          <source>Proc. Social Network Analysis and Conceptual Structures: Exploring Opportunities</source>
          ,
          <string-name>
            <surname>Clermont-Ferrand</surname>
          </string-name>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          :
          <article-title>On stability of a formal concept</article-title>
          . In SanJuan, E., ed.: JIM, Metz, France (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Sergei O. Kuznetsov</surname>
          </string-name>
          ,
          <article-title>Sergei Obiedkov and Camille Roth, 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.
          <fpage>241</fpage>
          -
          <lpage>254</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gardner</surname>
            ,
            <given-names>B.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gardner</surname>
            ,
            <given-names>M.R.</given-names>
          </string-name>
          : Deep South. University of Chicago Press, Chicago (
          <year>1941</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Batagelj</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaversnik</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Generalized Cores</surname>
          </string-name>
          , arXiv:cs/0202039v1,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Seidman S</surname>
          </string-name>
          . B.
          <article-title>Network structure and minimum degree Social Networks</article-title>
          ,
          <volume>5</volume>
          ,
          <year>1983</year>
          , pp.
          <volume>269</volume>
          {
          <fpage>287</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Yevtushenko</surname>
          </string-name>
          ,
          <article-title>Serhiy A. System of data analysis\Concept Explorer"</article-title>
          .
          <source>Proceedings of the 7th national conference on Arti cial Intelligence KII</source>
          . Vol.
          <year>2000</year>
          .
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Neznanov</surname>
            , Alexey,
            <given-names>Dmitry</given-names>
          </string-name>
          <string-name>
            <surname>Ilvovsky</surname>
            , and
            <given-names>Andrey</given-names>
          </string-name>
          <string-name>
            <surname>Parinov</surname>
          </string-name>
          .
          <article-title>Advancing FCA Workow in FCART System for Knowledge Discovery in Quantitative Data</article-title>
          .
          <source>Procedia Computer Science</source>
          <volume>31</volume>
          (
          <year>2014</year>
          ):
          <fpage>201</fpage>
          -
          <lpage>210</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Neznanov</surname>
            ,
            <given-names>A. A.</given-names>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Parinov. FCA Analyst</surname>
          </string-name>
          <article-title>Session and Data Access Tools in FCART</article-title>
          .
          <source>Arti cial Intelligence: Methodology, Systems, and Applications</source>
          . Springer International Publishing,
          <year>2014</year>
          .
          <fpage>214</fpage>
          -
          <lpage>221</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>