The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Como superestrutura do gráfico do conhecimento, a ontologia tem sido amplamente aplicada na engenharia do conhecimento. No entanto, torna-se cada vez mais difícil de ser praticado e compreendido devido ao crescente tamanho dos dados e à complexidade dos esquemas. Conseqüentemente, o resumo da ontologia surgiu para melhorar a compreensão e aplicação da ontologia. Os métodos de resumo existentes concentram-se principalmente na topologia da ontologia sem levar em consideração as informações semânticas, enquanto os humanos entendem as informações com base na semântica. Assim, propusemos um novo algoritmo para integrar informações semânticas e informações topológicas, o que permite que a ontologia seja mais compreensível. Em nosso trabalho, informações semânticas e topológicas são representadas por vetores de conceito, um conjunto de vetores de alta dimensão. As distâncias entre vetores de conceitos representam similaridade de conceitos e selecionamos conceitos importantes seguindo estes dois critérios: 1) as distâncias de conceitos importantes a conceitos normais devem ser as mais curtas possíveis, o que indica que conceitos importantes poderiam resumir bem conceitos normais; 2) as distâncias de um conceito importante aos demais devem ser as maiores possíveis, o que garante que conceitos importantes não sejam semelhantes entre si. K-means++ é adotado para selecionar conceitos importantes. Por último, realizamos avaliações extensas para comparar nosso algoritmo com os existentes. As avaliações comprovam que nossa abordagem tem desempenho melhor que as demais na maioria dos casos.
Yuehang DING
Information Engineering University
Hongtao YU
Information Engineering University
Jianpeng ZHANG
Information Engineering University
Huanruo LI
Information Engineering University
Yunjie GU
Information Engineering University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Yuehang DING, Hongtao YU, Jianpeng ZHANG, Huanruo LI, Yunjie GU, "A Knowledge Representation Based User-Driven Ontology Summarization Method" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 9, pp. 1870-1873, September 2019, doi: 10.1587/transinf.2019EDL8069.
Abstract: As the superstructure of knowledge graph, ontology has been widely applied in knowledge engineering. However, it becomes increasingly difficult to be practiced and comprehended due to the growing data size and complexity of schemas. Hence, ontology summarization surfaced to enhance the comprehension and application of ontology. Existing summarization methods mainly focus on ontology's topology without taking semantic information into consideration, while human understand information based on semantics. Thus, we proposed a novel algorithm to integrate semantic information and topological information, which enables ontology to be more understandable. In our work, semantic and topological information are represented by concept vectors, a set of high-dimensional vectors. Distances between concept vectors represent concepts' similarity and we selected important concepts following these two criteria: 1) the distances from important concepts to normal concepts should be as short as possible, which indicates that important concepts could summarize normal concepts well; 2) the distances from an important concept to the others should be as long as possible which ensures that important concepts are not similar to each other. K-means++ is adopted to select important concepts. Lastly, we performed extensive evaluations to compare our algorithm with existing ones. The evaluations prove that our approach performs better than the others in most of the cases.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019EDL8069/_p
Copiar
@ARTICLE{e102-d_9_1870,
author={Yuehang DING, Hongtao YU, Jianpeng ZHANG, Huanruo LI, Yunjie GU, },
journal={IEICE TRANSACTIONS on Information},
title={A Knowledge Representation Based User-Driven Ontology Summarization Method},
year={2019},
volume={E102-D},
number={9},
pages={1870-1873},
abstract={As the superstructure of knowledge graph, ontology has been widely applied in knowledge engineering. However, it becomes increasingly difficult to be practiced and comprehended due to the growing data size and complexity of schemas. Hence, ontology summarization surfaced to enhance the comprehension and application of ontology. Existing summarization methods mainly focus on ontology's topology without taking semantic information into consideration, while human understand information based on semantics. Thus, we proposed a novel algorithm to integrate semantic information and topological information, which enables ontology to be more understandable. In our work, semantic and topological information are represented by concept vectors, a set of high-dimensional vectors. Distances between concept vectors represent concepts' similarity and we selected important concepts following these two criteria: 1) the distances from important concepts to normal concepts should be as short as possible, which indicates that important concepts could summarize normal concepts well; 2) the distances from an important concept to the others should be as long as possible which ensures that important concepts are not similar to each other. K-means++ is adopted to select important concepts. Lastly, we performed extensive evaluations to compare our algorithm with existing ones. The evaluations prove that our approach performs better than the others in most of the cases.},
keywords={},
doi={10.1587/transinf.2019EDL8069},
ISSN={1745-1361},
month={September},}
Copiar
TY - JOUR
TI - A Knowledge Representation Based User-Driven Ontology Summarization Method
T2 - IEICE TRANSACTIONS on Information
SP - 1870
EP - 1873
AU - Yuehang DING
AU - Hongtao YU
AU - Jianpeng ZHANG
AU - Huanruo LI
AU - Yunjie GU
PY - 2019
DO - 10.1587/transinf.2019EDL8069
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2019
AB - As the superstructure of knowledge graph, ontology has been widely applied in knowledge engineering. However, it becomes increasingly difficult to be practiced and comprehended due to the growing data size and complexity of schemas. Hence, ontology summarization surfaced to enhance the comprehension and application of ontology. Existing summarization methods mainly focus on ontology's topology without taking semantic information into consideration, while human understand information based on semantics. Thus, we proposed a novel algorithm to integrate semantic information and topological information, which enables ontology to be more understandable. In our work, semantic and topological information are represented by concept vectors, a set of high-dimensional vectors. Distances between concept vectors represent concepts' similarity and we selected important concepts following these two criteria: 1) the distances from important concepts to normal concepts should be as short as possible, which indicates that important concepts could summarize normal concepts well; 2) the distances from an important concept to the others should be as long as possible which ensures that important concepts are not similar to each other. K-means++ is adopted to select important concepts. Lastly, we performed extensive evaluations to compare our algorithm with existing ones. The evaluations prove that our approach performs better than the others in most of the cases.
ER -