Efficient versus accurate algorithms for computing a semantic logic-based similarity measure

Fatma-Ezzahra  Gmati; Salem Chakhar; Nadia  Yacoubi-Ayadi; Afef Bahri; Mark Xu

doi:10.1007/978-3-319-92058-0_78

Efficient versus accurate algorithms for computing a semantic logic-based similarity measure

Fatma-Ezzahra Gmati, Salem Chakhar, Nadia Yacoubi-Ayadi, Afef Bahri, Mark Xu

Centre for Operational Research & Logistics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

176 Downloads (Pure)

Abstract

There are three types of Web services matchmakers: logic-based, non logic-based, and hybrid. Logic-based matchmakers employ the semantics of the Web services. Non-logic based matchmakers employ other approaches such as syntactic and structural matching. Hybrid matchmakers combine both approaches. This paper presents and compares two algorithms for computing a semantic logic-based similarity measure in the perspective of Web service matching. The first algorithm offers an efficient solution, while the second algorithm proposes a more accurate result. Both algorithms are evaluated using the SME2 tool. Performance evaluation shows that efficient algorithm reduces substantially the computing time while the accurate algorithm ameliorates considerably the precision of the matching process

Original language	English
Title of host publication	Recent Trends and Future Technology in Applied Intelligence
Subtitle of host publication	31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2018, Montreal, QC, Canada, June 25-28, 2018, Proceedings
Editors	Malek Mouhoub, Samira Sadaoui, Otmane Ait Mohamed, Moonis Ali
Publisher	Springer
Pages	808-820
Number of pages	12
Edition	1
ISBN (Electronic)	978-3-319-92058-0
ISBN (Print)	978-3-319-92057-3
DOIs	https://doi.org/10.1007/978-3-319-92058-0_78
Publication status	Published - Jun 2018
Event	31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: IEA/AIE 2018 - Montreal, Canada Duration: 25 Jun 2018 → 28 Jun 2018

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	10868
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems
Country/Territory	Canada
City	Montreal
Period	25/06/18 → 28/06/18

Keywords

Web service
Matchmaking
Similarity Measure
Degree of Match
Performance

Access to Document

10.1007/978-3-319-92058-0_78

Efficient versus accurate algorithms for computing
The final authenticated version is available online at: http://dx.doi.org/10.1007%2F978-3-319-92058-0_78.
Accepted author manuscript (Post-print), 225 KB

Cite this

Gmati, F.-E., Chakhar, S., Yacoubi-Ayadi, N., Bahri, A., & Xu, M. (2018). Efficient versus accurate algorithms for computing a semantic logic-based similarity measure. In M. Mouhoub, S. Sadaoui, O. Ait Mohamed, & M. Ali (Eds.), Recent Trends and Future Technology in Applied Intelligence: 31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2018, Montreal, QC, Canada, June 25-28, 2018, Proceedings (1 ed., pp. 808-820). ( Lecture Notes in Computer Science; Vol. 10868). Springer. https://doi.org/10.1007/978-3-319-92058-0_78

Gmati, Fatma-Ezzahra ; Chakhar, Salem ; Yacoubi-Ayadi, Nadia et al. / Efficient versus accurate algorithms for computing a semantic logic-based similarity measure. Recent Trends and Future Technology in Applied Intelligence: 31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2018, Montreal, QC, Canada, June 25-28, 2018, Proceedings. editor / Malek Mouhoub ; Samira Sadaoui ; Otmane Ait Mohamed ; Moonis Ali. 1. ed. Springer, 2018. pp. 808-820 ( Lecture Notes in Computer Science).

@inproceedings{45508f952b904aa693d1a837454aa425,

title = "Efficient versus accurate algorithms for computing a semantic logic-based similarity measure",

abstract = "There are three types of Web services matchmakers: logic-based, non logic-based, and hybrid. Logic-based matchmakers employ the semantics of the Web services. Non-logic based matchmakers employ other approaches such as syntactic and structural matching. Hybrid matchmakers combine both approaches. This paper presents and compares two algorithms for computing a semantic logic-based similarity measure in the perspective of Web service matching. The first algorithm offers an efficient solution, while the second algorithm proposes a more accurate result. Both algorithms are evaluated using the SME2 tool. Performance evaluation shows that efficient algorithm reduces substantially the computing time while the accurate algorithm ameliorates considerably the precision of the matching process",

keywords = "Web service, Matchmaking, Similarity Measure, Degree of Match, Performance",

author = "Fatma-Ezzahra Gmati and Salem Chakhar and Nadia Yacoubi-Ayadi and Afef Bahri and Mark Xu",

year = "2018",

month = jun,

doi = "10.1007/978-3-319-92058-0_78",

language = "English",

isbn = "978-3-319-92057-3",

series = " Lecture Notes in Computer Science",

publisher = "Springer",

pages = "808--820",

editor = "Malek Mouhoub and Samira Sadaoui and {Ait Mohamed}, Otmane and Moonis Ali",

booktitle = "Recent Trends and Future Technology in Applied Intelligence",

edition = "1",

note = "31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems : IEA/AIE 2018 ; Conference date: 25-06-2018 Through 28-06-2018",

}

Gmati, F-E, Chakhar, S, Yacoubi-Ayadi, N, Bahri, A & Xu, M 2018, Efficient versus accurate algorithms for computing a semantic logic-based similarity measure. in M Mouhoub, S Sadaoui, O Ait Mohamed & M Ali (eds), Recent Trends and Future Technology in Applied Intelligence: 31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2018, Montreal, QC, Canada, June 25-28, 2018, Proceedings. 1 edn, Lecture Notes in Computer Science, vol. 10868, Springer, pp. 808-820, 31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, Montreal, Quebec, Canada, 25/06/18. https://doi.org/10.1007/978-3-319-92058-0_78

Efficient versus accurate algorithms for computing a semantic logic-based similarity measure. / Gmati, Fatma-Ezzahra ; Chakhar, Salem; Yacoubi-Ayadi, Nadia et al.
Recent Trends and Future Technology in Applied Intelligence: 31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2018, Montreal, QC, Canada, June 25-28, 2018, Proceedings. ed. / Malek Mouhoub; Samira Sadaoui; Otmane Ait Mohamed; Moonis Ali. 1. ed. Springer, 2018. p. 808-820 ( Lecture Notes in Computer Science; Vol. 10868).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Efficient versus accurate algorithms for computing a semantic logic-based similarity measure

AU - Gmati, Fatma-Ezzahra

AU - Chakhar, Salem

AU - Yacoubi-Ayadi, Nadia

AU - Bahri, Afef

AU - Xu, Mark

PY - 2018/6

Y1 - 2018/6

N2 - There are three types of Web services matchmakers: logic-based, non logic-based, and hybrid. Logic-based matchmakers employ the semantics of the Web services. Non-logic based matchmakers employ other approaches such as syntactic and structural matching. Hybrid matchmakers combine both approaches. This paper presents and compares two algorithms for computing a semantic logic-based similarity measure in the perspective of Web service matching. The first algorithm offers an efficient solution, while the second algorithm proposes a more accurate result. Both algorithms are evaluated using the SME2 tool. Performance evaluation shows that efficient algorithm reduces substantially the computing time while the accurate algorithm ameliorates considerably the precision of the matching process

AB - There are three types of Web services matchmakers: logic-based, non logic-based, and hybrid. Logic-based matchmakers employ the semantics of the Web services. Non-logic based matchmakers employ other approaches such as syntactic and structural matching. Hybrid matchmakers combine both approaches. This paper presents and compares two algorithms for computing a semantic logic-based similarity measure in the perspective of Web service matching. The first algorithm offers an efficient solution, while the second algorithm proposes a more accurate result. Both algorithms are evaluated using the SME2 tool. Performance evaluation shows that efficient algorithm reduces substantially the computing time while the accurate algorithm ameliorates considerably the precision of the matching process

KW - Web service

KW - Matchmaking

KW - Similarity Measure

KW - Degree of Match

KW - Performance

U2 - 10.1007/978-3-319-92058-0_78

DO - 10.1007/978-3-319-92058-0_78

M3 - Conference contribution

SN - 978-3-319-92057-3

T3 - Lecture Notes in Computer Science

SP - 808

EP - 820

BT - Recent Trends and Future Technology in Applied Intelligence

A2 - Mouhoub, Malek

A2 - Sadaoui, Samira

A2 - Ait Mohamed, Otmane

A2 - Ali, Moonis

PB - Springer

T2 - 31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems

Y2 - 25 June 2018 through 28 June 2018

ER -

Gmati FE, Chakhar S, Yacoubi-Ayadi N, Bahri A, Xu M. Efficient versus accurate algorithms for computing a semantic logic-based similarity measure. In Mouhoub M, Sadaoui S, Ait Mohamed O, Ali M, editors, Recent Trends and Future Technology in Applied Intelligence: 31st International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2018, Montreal, QC, Canada, June 25-28, 2018, Proceedings. 1 ed. Springer. 2018. p. 808-820. ( Lecture Notes in Computer Science). Epub 2018 May 30. doi: 10.1007/978-3-319-92058-0_78

Efficient versus accurate algorithms for computing a semantic logic-based similarity measure

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this