2010
DOI: 10.1007/978-3-642-16444-6_12
|View full text |Cite
|
Sign up to set email alerts
|

A New Approach for Semantic Web Matching

Abstract: In this work we propose a new approach for semantic web matching to improve the performance of Web Service replacement. Because in automatic systems we should ensure the self-healing, self-configuration, self-optimization and self-management, all services should be always available and if one of them crashes, it should be replaced with the most similar one. Candidate services are advertised in Universal Description, Discovery and Integration (UDDI) all in Web Ontology Language (OWL). By the help of bipartite g… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…The similarity rate just considers whether two services are similar, but does not explore how much similar they are and it is more about service composition. And finally, our last work on semantic web matching [2] used bipartite graph for comparing two web services functionalities to find the most similar one. But matching rate was computing with fuzzy methods and was not accurate.…”
Section: V2-194mentioning
confidence: 99%
“…The similarity rate just considers whether two services are similar, but does not explore how much similar they are and it is more about service composition. And finally, our last work on semantic web matching [2] used bipartite graph for comparing two web services functionalities to find the most similar one. But matching rate was computing with fuzzy methods and was not accurate.…”
Section: V2-194mentioning
confidence: 99%