Semantic annotations similarity measure to compare processes profiles
DOI:
https://doi.org/10.15587/1729-4061.2013.14445Keywords:
Semantic profile, similarity measure for semantic annotations, LCA, OWL-SAbstract
Improved method to calculate similarity measure for semantic ontological graph annotations is introduced in the article. Nodes of such a graph are concepts of problem area ontology and edges – relations among them. The method proposed can be used to improve synthesis of structural procedural program schemas based on semantic computing networks. Improved synthesis method takes into account not only computation relations among network components but their semantic annotation, that formalizes the aim of the software component.
By integrating such semantic annotations ontology into top level OWL-S ontology one can use introduced metric to discover or recommend web-service by their detailed profile and user’s requestReferences
- Новиков, Ф. А. Учебно-методическое пособие по дисциплине «Cистемы представления знаний» [Текст] / Ф.А. Новиков – СПб:ИТМО, 2007. – 119 с.
- Martin, D. OWL-S: Semantic markup for web services. [Электронный ресурс] / World Wide Web Consortium (W3C). – Режим доступа / URL:www http://www.w3.org/Submission/2004/SUBM-OWL-S-20041122/ – 08.04.2013 – Заглавие с экрана
- Ermolayev, V. Towards a Framework for Agent-Enabled Semantic Web Service Composition [Текст] / V. Ermolayev , N. Keberle, S. Plaksin, O. Kononenko, V. Terziyan // International Journal of Web Services Research. – 2004. – №1(3). – P.63-87
- Плиско, Д. А. Расширение возможностей программного обеспечения при использовании баз знаний, основанных на OWL 2.0 [Текст] / Д. А. Плиско, А. Ю. Шевченко // Восточно-Европейский журнал передовых технологий. – 2010. – Т.4. – № 2 (46). – С. 32-36.
- Ganjisaffar, Y. A Similarity Measure for OWL-S Annotated Web Services [Text] / Y. Ganjisaffar, H. Abolhassani, M. Neshati // Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence. – Hong Kong, 2006. – P. 621 – 624
- Stumme, G. Ontology merging for federated ontologies on the semantic web [Текст] / G. Stumme, A. Maedche // In Proceedings of the International Workshop for Foundations of Models for Information Integration (FMII-2001). – Sept. 2001. – P. 413-418
- Melnik, S. Similarity flooding: A versatile graph matching algorithm and its applications to schema matching [Текст] / S. Melnik, H. Garcia-Molina, E. Rahm // In Proceedings of the 18th International Conference on Data Engineering. – San Jose, CA: IEEE Computer Society, Feb. 2002. – 45 pp.
- Zhong, J. Conceptual graph matching for semantic search [Текст] / J. Zhong, H. Zhu, J. Li, Y. Yu // Proceedings of the 2002 International Conference on Computational Science (ICCS2002). – Amsterdam, 2002. – P. 92-106
- Иванов, М. Наименьший общий предок. Нахождение за O (sqrt (N)) и O (log N) с препроцессингом O (N) [Электронный ресурс] / Собрание алгоритмов e-maxx. – Режим доступа / URL:www http://e-maxx.ru/algo/lca – 08.04.2013 – Заглавие с экрана
- Федоровский, А.Н. Mail.ru на РОМИП-2005 [Текст] / А.Н. Федоровский, М. Ю. Костин // Сборник «Труды РОМИП’2005» Труды третьего российского семинара по оценке методов информационного поиска. Под ред. И. С. Некрестьянова. – Санкт-Петербург: НИИ Химии СПбГУ, 2005. – С. 106-124.
- Novikov, F.A. (2007) Uchebno-metodicheskoie posobie po distsipine «Sistemy predstavleniia znanii», 119.
- Martin, D. (2004) OWL-S: Semantic markup for web services. W3C Submission. Access: http://www.w3.org/Submission/2004/SUBM-OWL-S-20041122/.
- Ermolayev, V., Keberle,N., Plaksin, S., Kononenko, O. & Terziyan, V. (2004) Towards a Framework for Agent-Enabled Semantic Web Service Composition, International Journal of Web Services Research, 1(3), 63-87.
- Plisko, D.А. & Shevchenko, А.Yu. (2010) Rasshireniie vozmozhnostei programnogo obespecheniia pri ispolzovanii baz znanii, osnovannih na OWL 2.0. Vostochno-Yevropeiskii zhurnal peredovykh tehnologii, 4/2 (46), 32-36
- Ganjisaffar,Y., Abolhassani, H. & Neshati, M. (2006) A Similarity Measure for OWL-S Annotated Web Services. Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence, 621-624. doi: 10.1109/WI.2006.26.
- Stumme, G. &Maedche, A. (2001) Ontology merging for federated ontologies on the semantic web. In Proceedings of the International Workshop for Foundations of Models for Information Integration, 413-418. doi: 10.1.1.21.3387
- Melnik, S., Garcia-Molina, H. & Rahm E. (2002) Similarity flooding: A versatile graph matching algorithm and its applications to schema matching. In Proceedings of the 18th International Conference on Data Engineering, 45. doi: 10.1109/ICDE.2002.994702.
- Zhong J., Zhu H., Li J.& Yu Y. (2002) Conceptual graph matching for semantic search, 92-106. doi:10.1.1.72.9780.
- Ivanov, М. (2011) Naimenshyi obshii predok. Nahozhdenie za O (sqrt (N)) i O (log N) s preprocessingom O (N). Access: http://e-maxx.ru/algo/lca.
- Fedorovskii, А.N. & Kostin, М. Yu. Mail.ru na ROMIP-2005. Sbornik «Trudy ROMIP’2005» Trudy tretiego rosiiskogo seminara po otsenke metodov informatsionnogo poiska, 2005, 106-124.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 Олена Леонідівна Шевченко
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.