Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Fatma Ezzahra Gmati"'
Publikováno v:
ICAC
This paper proposes a Time Series Shape (TSS) based framework for time series representation and abstraction. The paper also introduces a Dynamic Time Shape Wrapping (DTSW), which is a shape extension of the well-known Dynamic Time Wrapping (DTW) dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cecfa596afd6a7eae9f7c541eb23080
https://doi.org/10.23919/icac50006.2021.9594127
https://doi.org/10.23919/icac50006.2021.9594127
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030229986
IEA/AIE
IEA/AIE
Most of existing event prediction approaches consider event prediction problems within a specific application domain while event prediction is naturally a cross-disciplinary problem. This paper introduces a generic taxonomy of event prediction approa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86bbece67eeb13a6e7669427f814272d
https://doi.org/10.1007/978-3-030-22999-3_2
https://doi.org/10.1007/978-3-030-22999-3_2
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319920573
IEA/AIE
IEA/AIE
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 matchi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c54a7aea21d8a0e4fb73d5696cf5ec3
https://doi.org/10.1007/978-3-319-92058-0_78
https://doi.org/10.1007/978-3-319-92058-0_78
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319920573
IEA/AIE
IEA/AIE
This paper introduces and illustrates a rough-set based approach to event prediction in multiple time series. The proposed approach uses two different versions of rough set theory to predict events occurrences and intensities. First, classical Indisc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::283d144e44b28fb744352ed0f3ed525a
https://doi.org/10.1007/978-3-319-92058-0_77
https://doi.org/10.1007/978-3-319-92058-0_77
Publikováno v:
Lecture Notes in Business Information Processing ISBN: 9783319664675
WEBIST (Revised Selected Papers)
WEBIST (Revised Selected Papers)
The matchmaking is a crucial operation in Web service discovery and selection. The objective of the matchmaking is to discover and select the most appropriate Web service among the different available candidates. Different matchmaking frameworks are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::060d1364bfeaa3eb169de4a21ed673ad
https://doi.org/10.1007/978-3-319-66468-2_2
https://doi.org/10.1007/978-3-319-66468-2_2
Publikováno v:
Software Engineering Research, Management and Applications ISBN: 9783319339023
The PMRF (Parameterized Matching-Ranking Framework) is a highly configurable framework supporting a parameterized matching and ranking of Web services. This paper first introduces the matching and ranking algorithms supported by the PMRF. Next, it pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00ea56cefb16fee0e612d44d59a37d4d
https://doi.org/10.1007/978-3-319-33903-0_13
https://doi.org/10.1007/978-3-319-33903-0_13
Publikováno v:
On the Move to Meaningful Internet Systems: OTM 2014 Conferences ISBN: 9783662455623
The paper presents two parameterized and customizable algorithms for matching and ranking Web services. Given a user query and a set of available Web services, the matching algorithm performs a logic-based semantic matchmaking to select services that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d7b56df2fb08723fb24f1784c0f6737
https://doi.org/10.1007/978-3-662-45563-0_50
https://doi.org/10.1007/978-3-662-45563-0_50
Publikováno v:
Scopus-Elsevier
Gmati, F-E, Yacoubi-Ayadi, N, Bahri, A, Chakhar, S & Ishizaka, A 2015, A tree-based algorithm for ranking web services . in V Monfort & K-H Krempels (eds), The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, May 20-22 . SciTePress, pp. 170-178, The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, 20/05/15 . https://doi.org/10.5220/0005498901700178
WEBIST
Gmati, F-E, Yacoubi-Ayadi, N, Bahri, A, Chakhar, S & Ishizaka, A 2015, A tree-based algorithm for ranking web services . in V Monfort & K-H Krempels (eds), The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, May 20-22 . SciTePress, pp. 170-178, The 11th International Conference on Web Information Systems and Technologies (WEBIST 2015), Lisbon, Portugal, 20/05/15 . https://doi.org/10.5220/0005498901700178
WEBIST
The aim of this paper is to propose a new algorithm for Web services ranking. The proposed algorithm relies on a tree data structure that is constructed based on the scores of Web services. Two types of scores are considered, which are computed by re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a58ba3d74447ab106a74a8b79f6b4338
http://www.scopus.com/inward/record.url?eid=2-s2.0-84945331529&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84945331529&partnerID=MN8TOARS
Publikováno v:
Scopus-Elsevier
WEBIST (1)
WEBIST (1)
The Parameterized Semantic Matchmaking and Ranking (PMRF) is a highly configurable framework supporting a parameterized matching and ranking of Web services. The paper introduces the matching and ranking algorithms supported by the PMRF and presents
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c09e3decc6ec03310cb9b744a55df24
http://www.scopus.com/inward/record.url?eid=2-s2.0-84979741969&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84979741969&partnerID=MN8TOARS