IEICE TRANSACTIONS on Information
Super-Node Based Detection of Redundant Ontology Relations
Summary :
Redundant relations refer to explicit relations which can also be deducted implicitly. Although there exist several ontology redundancy elimination methods, they all do not take equivalent relations into consideration. Actually, real ontologies usually contain equivalent relations; their redundancies cannot be completely detected by existing algorithms. Aiming at solving this problem, this paper proposes a super-node based ontology redundancy elimination algorithm. The algorithm consists of super-node transformation and transitive redundancy elimination. During the super-node transformation process, nodes equivalent to each other are transferred into a super-node. Then by deleting the overlapped edges, redundancies relating to equivalent relations are eliminated. During the transitive redundancy elimination process, redundant relations are eliminated by comparing concept nodes' direct and indirect neighbors. Most notably, we proposed a theorem to validate real ontology's irredundancy. Our algorithm outperforms others on both real ontologies and synthetic dynamic ontologies.
- Publication
- IEICE TRANSACTIONS on Information Vol.E102-D No.7 pp.1400-1403
- Publication Date
- 2019/07/01
- Publicized
- 2019/04/18
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2019EDL8010
- Type of Manuscript
- LETTER
- Category
- Data Engineering, Web Information Systems
Authors
Yuehang DING
National Digital Switching System Engineering and Technological R&D Center
Hongtao YU
National Digital Switching System Engineering and Technological R&D Center
Jianpeng ZHANG
National Digital Switching System Engineering and Technological R&D Center
Yunjie GU
National Digital Switching System Engineering and Technological R&D Center
Ruiyang HUANG
National Digital Switching System Engineering and Technological R&D Center
Shize KANG
National Digital Switching System Engineering and Technological R&D Center
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Yuehang DING, Hongtao YU, Jianpeng ZHANG, Yunjie GU, Ruiyang HUANG, Shize KANG, "Super-Node Based Detection of Redundant Ontology Relations" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 7, pp. 1400-1403, July 2019, doi: 10.1587/transinf.2019EDL8010.
Abstract: Redundant relations refer to explicit relations which can also be deducted implicitly. Although there exist several ontology redundancy elimination methods, they all do not take equivalent relations into consideration. Actually, real ontologies usually contain equivalent relations; their redundancies cannot be completely detected by existing algorithms. Aiming at solving this problem, this paper proposes a super-node based ontology redundancy elimination algorithm. The algorithm consists of super-node transformation and transitive redundancy elimination. During the super-node transformation process, nodes equivalent to each other are transferred into a super-node. Then by deleting the overlapped edges, redundancies relating to equivalent relations are eliminated. During the transitive redundancy elimination process, redundant relations are eliminated by comparing concept nodes' direct and indirect neighbors. Most notably, we proposed a theorem to validate real ontology's irredundancy. Our algorithm outperforms others on both real ontologies and synthetic dynamic ontologies.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019EDL8010/_p
Copy
@ARTICLE{e102-d_7_1400,
author={Yuehang DING, Hongtao YU, Jianpeng ZHANG, Yunjie GU, Ruiyang HUANG, Shize KANG, },
journal={IEICE TRANSACTIONS on Information},
title={Super-Node Based Detection of Redundant Ontology Relations},
year={2019},
volume={E102-D},
number={7},
pages={1400-1403},
abstract={Redundant relations refer to explicit relations which can also be deducted implicitly. Although there exist several ontology redundancy elimination methods, they all do not take equivalent relations into consideration. Actually, real ontologies usually contain equivalent relations; their redundancies cannot be completely detected by existing algorithms. Aiming at solving this problem, this paper proposes a super-node based ontology redundancy elimination algorithm. The algorithm consists of super-node transformation and transitive redundancy elimination. During the super-node transformation process, nodes equivalent to each other are transferred into a super-node. Then by deleting the overlapped edges, redundancies relating to equivalent relations are eliminated. During the transitive redundancy elimination process, redundant relations are eliminated by comparing concept nodes' direct and indirect neighbors. Most notably, we proposed a theorem to validate real ontology's irredundancy. Our algorithm outperforms others on both real ontologies and synthetic dynamic ontologies.},
keywords={},
doi={10.1587/transinf.2019EDL8010},
ISSN={1745-1361},
month={July},}
Copy
TY - JOUR
TI - Super-Node Based Detection of Redundant Ontology Relations
T2 - IEICE TRANSACTIONS on Information
SP - 1400
EP - 1403
AU - Yuehang DING
AU - Hongtao YU
AU - Jianpeng ZHANG
AU - Yunjie GU
AU - Ruiyang HUANG
AU - Shize KANG
PY - 2019
DO - 10.1587/transinf.2019EDL8010
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2019
AB - Redundant relations refer to explicit relations which can also be deducted implicitly. Although there exist several ontology redundancy elimination methods, they all do not take equivalent relations into consideration. Actually, real ontologies usually contain equivalent relations; their redundancies cannot be completely detected by existing algorithms. Aiming at solving this problem, this paper proposes a super-node based ontology redundancy elimination algorithm. The algorithm consists of super-node transformation and transitive redundancy elimination. During the super-node transformation process, nodes equivalent to each other are transferred into a super-node. Then by deleting the overlapped edges, redundancies relating to equivalent relations are eliminated. During the transitive redundancy elimination process, redundant relations are eliminated by comparing concept nodes' direct and indirect neighbors. Most notably, we proposed a theorem to validate real ontology's irredundancy. Our algorithm outperforms others on both real ontologies and synthetic dynamic ontologies.
ER -
English
