<!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>Knowledge Graph Approach for Complex Relationship: A Study on Kinship in civil servant*</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Copyright © by the paper's authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0). In: N. D. Vo, O.-J. Lee, K.-H. N. Bui</institution>
          ,
          <addr-line>H. G. Lim, H.-J. Jeon, P.-M. Nguyen, B. Q. Tuyen, J.-T. Kim, J. J. Jung</addr-line>
          ,
          <institution>T. A. Vo (eds.): Proceedings of the 2nd International Conference on Human-centered Artificial Intelligence (Computing4Human 2021)</institution>
          ,
          <addr-line>Da Nang</addr-line>
          ,
          <country country="VN">Viet Nam</country>
          ,
          <addr-line>28-October-2021, published at</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Teaching and Research Team for Business Intelligence, University of Economics, The University of Danang</institution>
          ,
          <country country="VN">Vietnam</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Economics, The University of Danang</institution>
          ,
          <country country="VN">Vietnam</country>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Knowledge Graph has been widely applied in many studies to indicate the complex relationships such as social networks, genomes etc. Thereby, It can also detect the relationship between proteins and diseases such as cancer, asthma, etc. Because of the advantages in visual representation and easy access of Knowledge Graph that the relational data system can hardly do. Therefore, this study applies Knowledge Graph to represent and build solutions to quickly retrieve personal relationships in civil servants based on knowledge graph data management system Neo4J and R programming language, combined with the Shiny package. The study showed five relationships of employees including grandparents, parents, spouse, siblings, children. Indeed, the study indicates the applying ability to manage and monitor the work process of employees in organizations.</p>
      </abstract>
      <kwd-group>
        <kwd>Knowledge graph</kwd>
        <kwd>Relationship</kwd>
        <kwd>Civil servant</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The selection and transparency in the work of administrative agencies is an issue of
concern for most countries in the world. The country still has a problem with corruption.
Corruption is not only about money but also about the lack of transparency in the
selection and appointment of cadres. In Vietnam, the fact that there have been many cases
of improper appointment of civil servants and appointment of relatives as officials has
caused frustration in the social and the Government [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. As we know, there were many
officers with many families who were recruited and worked in the agencies that the
officer managed [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]. These cases not only affected the quality of cadres but also
created a wave of anger in the community, eroding people's trust in the government.
      </p>
      <p>Knowledge Graph Approach for Complex Relationship 177</p>
      <p>In reality, the management of human resources in the government is still difficult.
Most of them are using relational databases to manage personnel records. Therefore,
the data is often difficult to represent, difficult to access the complex relationships and
relationships across many objects. Therefore, it is often difficult to manage, evaluate in
general and thoroughly the kinship among personnel in agencies in order to limit the
negative cases.</p>
      <p>
        In recent years, Knowledge Graph (KG) is widely used in many fields world wide
for representing relationships such as semantics, social networks, and search engines.
For example, Microsoft's KG Bing and Google's KG both support searching and
answering search queries. It describes and connects people, places, things, organizations,
all knowledge in the world. Facebook's KG is the world's largest social network,
including contents like music, movies, celebrities, and places of interest etc [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. eBay's
KG represents a product's relationship to real-world entities, identifying them, and
determining their value to buyers. Besides, Graph Database is also applied to research in
the fields of education and medicine. Typical in the medical industry is “GetNNet”, an
integrated genomic analysis that unifies scientific workflows with the Graph Database
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>Therefore, this study used KG to visually represent the complex kinship among civil
servants of organizations. In addition, the study also indicated the ability to strongly
trace complex kinship of civil servants in agencies. Because the personal data of
officials is confidential, this study used demo data based on regulations on personnel
records of the government in Vietnam.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Materials and methods</title>
      <p>
        In knowledge representation and inference, KG uses a topology or graph structured data
model to integrate data. KGs are often used to store interconnected descriptions of
entities, objects, events, situations, or abstract concepts [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. KG is a model for
representing knowledge content in mathematical form. The idea of the model is to reorganize
the content knowledge into nodes, and edges. The edges are used to represent
connecting between nodes in a graph.
      </p>
      <p>Relational data is organized by rows, columns, tables, but KGs are organized by
nodes and edges to represent entities and relationships between entities. Nodes
represent entities or instances such as people, businesses, accounts, or any other item that is
tracked. They are similar to a record, relation, or row in a relational database. Edges
carry the relationship to propagate from this node to other nodes. Edges can be directed
or undirected. In an undirected graph, an edge connecting two nodes has a unique
meaning, but in a directed graph, the edges connecting two different nodes have different
meanings. The nodes and edges may have properties to add more information related
to them.</p>
      <p>
        KG will be an important method to the development of semantic understanding [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ],
turning data into knowledge, creating powerful, user-friendly products and experiences.
Most data and databases of all types can be performed by KG. The Knowledge Graph
is fundamentally simpler than the relational model, but it is more expressive, easier to
modify and expand into big data.
      </p>
      <p>Graph Database (GD) is a type of database structured in the form of graphs mainly
to store data of entities, small or large sets of social entities easily, conveniently and
efficiently. It represents nodes and edges based on relations between them together.
Along with that is the ability to store big data sets with quick query speeds.</p>
      <p>
        In this study, the data was built from the data of human resource management in
agencies of government. The input data was collected from the Resume of civil
servants. For this resume sample, the competent authority requires that employees need to
declare the background information and the declarant's three generations of relatives.
Therefore, this form is considered an important procedure to consider the participation
of workers in the offices. According to current regulations, the resumes of civil servants
are made according to the form circular number 07/2019/TT-BNV stipulating the
regime of statistical reporting and management of employee records. The content of the
form includes 32 items [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. However, this study focuses on the representation and
retrieval of personal relationships and personal information, so we only use some
information including full name, ID, position title (including start time, end time), and
information about kinship relatives with 3 generations including parents, spouse,
children, siblings (including in-law).
      </p>
      <p>In this study, we not only consider employees in one agency, but also consider
employees in other agencies that are affiliated and have relationships with each other,
thereby showing a more complete personal relationship in the way of organizing
agencies in Vietnam. In this case, we use agencies under Quang Nam province, Vietnam
(pictured). The agencies in Vietnam contant the provincial level, the district level and
the commune/ward level, departments, division, etc.</p>
      <p>
        The study used tools such as Neo4j, R. Neo4j is a graph database management
system developed by Neo4j, Inc [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Described by the developers as an ACID – Compliant
transactional database with native graph storage and processing. Neo4j ranks as the
most popular GD according to the DB-Engines rankings and ranks 22nd for databases
overall [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        R is a comprehensive programming language, which means it provides services for
statistical modeling as well as for software development. R is the primary language for
Data Science as well as for developing web applications through its powerful RShiny
package [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Results and Discussion</title>
      <p>Demo data is organized as a CSV file and imported into Neo4J. After importing demo
data into neo4J, the system has built 1741 nodes, including 742 agency nodes and 999
people (employees) nodes. To access the personal relationships in Neo4J, we can use
the Cypher language in Neo4J. As 02 special cases:</p>
      <p>(1) Retrieve people who have a kinship with employee 01 (Emp. 01): Match (c) – []
→ (n: “People{Name: “Emp. 01”}.) – [] → (a: “People”) return n, c, a. This retrieval
shows that there are fours employees have skinship with Emp 01 including Emp. 02</p>
      <p>Knowledge Graph Approach for Complex Relationship 179
(Spouse), Emp. 03 (Grandparent), Emp 04 (Uncle), and Emp. 05 (Parients) (see Fig.
01)
(2) Retrieve any relationship with 1 node on the left and 3 node levels on the right
of Emp. 01: Match n = ()  [] – (m: People{Name: “Emp. 01”}) – [] → (: ’People”)
– [] → () – [] → () return n. This retrieval showed agencies nodes that have relationship
with Emp. 01, and also showed and employees (Emp. 02, Emp. 06) with those positions
who have relationships with employee 01 (see Fig. 02).</p>
      <p>
        In addition, this study has also built a web-based retrieval system through R language
combined with the Shiny package. Through this system, it is possible to support faster
and easier access by user interface and selection operation (see Fig. 03). The system
may fastly show the nodes and relationships by selecting an employee, or kinship, or
agency. When we search by a condition, the system only shows the related nodes and
relationships, the others were disable status.
In fact, KG has been applied in many studies to find complex relationships [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and
relationships that relational data methods cannot do. As studies find the link of genes,
protein with asthma disease [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], cancer [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], Integrated and extensible biochemical
[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. However, there has been no study on applying KG to represent the kinship in
employees. Thereby supporting employee management in government agencies in
particular and organizations in general.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Conclution</title>
      <p>The study has presented demo data of civil servants on the Neo4j graph database. That
can easily access kinship of civil servants through nodes, relationships with levels. The
study also built a web interface to help users access information about personal
relationships fastly. However, because the data of civil servants is confidential data, the
study only uses demo data and has not used actual data. If the study is supported by the
authority agencies, it will indicate an application direction for staff management.
Thereby, a complete system can be built to put into practical use in Vietnamese to
control personnel thoroughly.</p>
      <p>In addition, through this study, we also realize the possibility and feasibility for
applying Knowledge Graph to other fields such as applied to represent COVID-19
infections. Specifically, it is possible to represent F0 cases according to localities, F1 cases
are related to F0 cases through relationships (edge). Thereby, it is possible to visually
represent and easily track the relationship of COVID-19 infected cases. KG also may
perform the training programs in Universities. Specifically, KG can visually represent
majors, courses and the relationships between them. In addition, KG can represent the
output standards of the Majors and courses. Thereby, we can monitor and manage the
training programs visually. Thereby, it can support students for tracking academic
subjects in the curriculum.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>The author acknowledges the study team who are Binh-Yen Le, Thi-Man Nguyen,
Dinh-Hieu Tran, Thi-Vu-Sa Doan, Thi-Thao-Nhi Nguyen. They have built the demo
data and imported it to Neo4J and R.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. http://baochinhphu.vn/
          <article-title>Tin-noi-bat/Vi-sao-Thu-tuong-yeu-cau-tim-nguoi-tai-khong-timnguoi-nha/283469</article-title>
          .vgp
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. https://thanhnien.vn/thoi-su/30-tuoi
          <article-title>-lam-giam-doc-so-ke-hoach-va-dau-tu-tre-nhat-nuoc611811.html</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. https://vov.vn/nhan-su/
          <article-title>uu-ai-bo-nhiem-con-trai-den-luot-chu-tich-quang-nam-nhan-an-kyluat-737595</article-title>
          .vov
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Noy</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narayanan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patterson</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taylor</surname>
          </string-name>
          , J.:
          <article-title>Industry-scale knowledge graphs: lessons and challenges</article-title>
          .
          <source>Communications of the ACM</source>
          <volume>62</volume>
          ,
          <fpage>36</fpage>
          -
          <lpage>43</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Costa</surname>
            ,
            <given-names>R.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gadelha</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ribeiro-Alves</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Porto</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Gennet: An integrated platform for unifying scientific workflow management and graph databases for transcriptome data analysis</article-title>
          .
          <source>bioRxiv 095257</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>6. https://en.wikipedia.org/wiki/Knowledge_graph</mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. https://towardsdatascience.com
          <article-title>/knowledge-graph-bb78055a7884</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. https://www.moha.gov.vn/danh-muc/thong-tu-so-07
          <article-title>-2019-tt-bnv-</article-title>
          <string-name>
            <surname>ngay-</surname>
          </string-name>
          01-6
          <article-title>-2019-cua-bonoi-vu-quy-dinh-ve-che-do-bao-cao-thong-ke-va-quan-ly-ho-so-vien-chuc-40757</article-title>
          .html
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>9. https://neo4j.com/</mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>10. https://www.wanttolearn.xyz/learn-neo4j/</mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. https://en.wikipedia.org/wiki/R_
          <article-title>(programming_language)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Toure</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mazein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Waltemath</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balaur</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saqi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Henkel</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pellet</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auffray</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>STON: exploring biological pathways using the SBGN standard and graph databases</article-title>
          .
          <source>BMC Bioinformatics</source>
          <volume>17</volume>
          ,
          <issue>494</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lysenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roznovat</surname>
            ,
            <given-names>I.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saqi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mazein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rawlings</surname>
            ,
            <given-names>C.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auffray</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Representing and querying disease networks using graph databases</article-title>
          .
          <source>BioData Min</source>
          <volume>9</volume>
          ,
          <issue>23</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Johnson</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Connor</surname>
            ,
            <given-names>A.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McKeever</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deisboeck</surname>
            ,
            <given-names>T.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Quaiser</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shochat</surname>
          </string-name>
          , E.:
          <article-title>Semantically linking in silico cancer models</article-title>
          .
          <source>Cancer Inform</source>
          <volume>13</volume>
          ,
          <fpage>133</fpage>
          -
          <lpage>143</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Swainston</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Batista-Navarro</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Carbonell, P.,
          <string-name>
            <surname>Dobson</surname>
            ,
            <given-names>P.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dunstan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jervis</surname>
            ,
            <given-names>A.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinaixa</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>A.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ananiadou</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Faulon</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendes</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kell</surname>
            ,
            <given-names>D.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scrutton</surname>
            ,
            <given-names>N.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Breitling</surname>
          </string-name>
          , R.: biochem4j:
          <article-title>Integrated and extensible biochemical knowledge through graph databases</article-title>
          .
          <source>PLoS One</source>
          <volume>12</volume>
          ,
          <issue>e0179130</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>