DocumentCode :
3224693
Title :
A complexity measure for ontology based on UML
Author :
Kang, Dazhou ; Xu, Baowen ; Lu, Jianjiang ; Chu, William C.
Author_Institution :
Dept. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China
fYear :
2004
fDate :
26-28 May 2004
Firstpage :
222
Lastpage :
228
Abstract :
UML is a good tool to represent ontologies. When using UML for ontology development, one of the principal goals is to assure the quality of ontologies. UML class diagrams provide a static modeling capability that is well suited for representing ontologies, so the structural complexity of a UML class diagram is one of the most important measures to evaluate the quality of the ontologies. This paper uses weighted class dependence graphs to represent given class diagrams, and then presents a structure complexity measure for the UML class diagrams based on entropy distance. It considers complexity of both classes and relationships between the classes, and presents rules for transforming complexity value of classes and different kinds of relations into weighted class dependence graphs. This method can measure the structure complexity of class diagrams objectively.
Keywords :
computational complexity; entropy; graph theory; semantic Web; specification languages; UML; class diagrams; complexity measure; entropy distance; ontologies; ontology; semantic Web; static modeling; structural complexity; weighted class dependence graphs; Artificial intelligence; Computer science; Knowledge representation; Laboratories; Object oriented modeling; Ontologies; Resource description framework; Semantic Web; Software quality; Unified modeling language;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 2004. FTDCS 2004. Proceedings. 10th IEEE International Workshop on Future Trends of
Print_ISBN :
0-7695-2118-5
Type :
conf
DOI :
10.1109/FTDCS.2004.1316620
Filename :
1316620
Link To Document :
بازگشت