Mapping ontology vertices to a line using hypergraph framework
As a conceptual semantic tool, ontology is widely used in many disciplines such as genetics, nutrition, and social sciences. The key issues for ontology applications are similarity calculations and ontology alignment. In recent years, various machine learning methods and computational models have be...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
KeAi Communications Co., Ltd.
2020-06-01
|
| Series: | International Journal of Cognitive Computing in Engineering |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2666307420300012 |
| _version_ | 1828086186672914432 |
|---|---|
| author | Linli Zhu Gang Hua Wei Gao |
| author_facet | Linli Zhu Gang Hua Wei Gao |
| author_sort | Linli Zhu |
| collection | DOAJ |
| description | As a conceptual semantic tool, ontology is widely used in many disciplines such as genetics, nutrition, and social sciences. The key issues for ontology applications are similarity calculations and ontology alignment. In recent years, various machine learning methods and computational models have been widely used in ontology optimization and computation. The core idea is to map the entire ontology graph into one-dimensional data, such as on a real axis or on a natural number set. Through the analysis of the previous multi-dividing ontology algorithm, the technique of achieving dimensionality reduction comes from the pairwise comparison of the ontology sample vertices. The weakness of such tricks is that only two ontology vertices can be extracted for comparison at a time, which causes the number of vertex pairs to be compared in the optimization model to become very large as the totally ontology sample size increases. This paper proposes a new class of ontology learning strategies, which aims to arrange the ontology concepts into one-dimensional data according to the sequence of natural numbers. The ontology optimization model does not compare two ontology vertices, but compares a set of ontology vertices and calculates the weight of each vertex by means of random walk calculating. Each set of compared ontology vertices constitutes a hyperedge, and thus the ontology sample sets and the computational framework are represented by hypergraph and its associated bipartite graph. The algorithm proposed in this paper has potential guiding significance and theoretical value for engineering applications. In addition, two examples are presented to illustrate that our hypergraph based ontology learning algorithm is effective for a specific application background. |
| first_indexed | 2024-04-11T04:50:47Z |
| format | Article |
| id | doaj.art-3396ca854c7544bcbd4c9583be0ccef7 |
| institution | Directory Open Access Journal |
| issn | 2666-3074 |
| language | English |
| last_indexed | 2024-04-11T04:50:47Z |
| publishDate | 2020-06-01 |
| publisher | KeAi Communications Co., Ltd. |
| record_format | Article |
| series | International Journal of Cognitive Computing in Engineering |
| spelling | doaj.art-3396ca854c7544bcbd4c9583be0ccef72022-12-27T04:37:07ZengKeAi Communications Co., Ltd.International Journal of Cognitive Computing in Engineering2666-30742020-06-01118Mapping ontology vertices to a line using hypergraph frameworkLinli Zhu0Gang Hua1Wei Gao2School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China; School of Computer Engineering, Jiangsu University of Technology, Changzhou 213001, China; Corresponding author at: School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China.School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, ChinaSchool of Information Science and Technology, Yunnan Normal University, Kunming 650500, ChinaAs a conceptual semantic tool, ontology is widely used in many disciplines such as genetics, nutrition, and social sciences. The key issues for ontology applications are similarity calculations and ontology alignment. In recent years, various machine learning methods and computational models have been widely used in ontology optimization and computation. The core idea is to map the entire ontology graph into one-dimensional data, such as on a real axis or on a natural number set. Through the analysis of the previous multi-dividing ontology algorithm, the technique of achieving dimensionality reduction comes from the pairwise comparison of the ontology sample vertices. The weakness of such tricks is that only two ontology vertices can be extracted for comparison at a time, which causes the number of vertex pairs to be compared in the optimization model to become very large as the totally ontology sample size increases. This paper proposes a new class of ontology learning strategies, which aims to arrange the ontology concepts into one-dimensional data according to the sequence of natural numbers. The ontology optimization model does not compare two ontology vertices, but compares a set of ontology vertices and calculates the weight of each vertex by means of random walk calculating. Each set of compared ontology vertices constitutes a hyperedge, and thus the ontology sample sets and the computational framework are represented by hypergraph and its associated bipartite graph. The algorithm proposed in this paper has potential guiding significance and theoretical value for engineering applications. In addition, two examples are presented to illustrate that our hypergraph based ontology learning algorithm is effective for a specific application background.http://www.sciencedirect.com/science/article/pii/S2666307420300012OntologySimilarity measureHypergraphHyperedge |
| spellingShingle | Linli Zhu Gang Hua Wei Gao Mapping ontology vertices to a line using hypergraph framework International Journal of Cognitive Computing in Engineering Ontology Similarity measure Hypergraph Hyperedge |
| title | Mapping ontology vertices to a line using hypergraph framework |
| title_full | Mapping ontology vertices to a line using hypergraph framework |
| title_fullStr | Mapping ontology vertices to a line using hypergraph framework |
| title_full_unstemmed | Mapping ontology vertices to a line using hypergraph framework |
| title_short | Mapping ontology vertices to a line using hypergraph framework |
| title_sort | mapping ontology vertices to a line using hypergraph framework |
| topic | Ontology Similarity measure Hypergraph Hyperedge |
| url | http://www.sciencedirect.com/science/article/pii/S2666307420300012 |
| work_keys_str_mv | AT linlizhu mappingontologyverticestoalineusinghypergraphframework AT ganghua mappingontologyverticestoalineusinghypergraphframework AT weigao mappingontologyverticestoalineusinghypergraphframework |