{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T08:01:04Z","timestamp":1790668864756,"version":"4.1.0"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2014,7]]},"abstract":"<jats:p>\n            Data-driven Web services build on service-oriented technologies to provide an interoperable method of interacting with data sources on top of the Web. Data Web services composition has emerged as a flexible solution to answer users\u2019 complex queries on the fly. However, as the number of Web services on the Web grows quickly, a large number of candidate compositions that would use different (most likely competing) services may be used to answer the same query. User preferences are a key factor that can be used to rank candidate services\/compositions and retain only the best ones. In this article, we present a novel approach for computing the top-\n            <jats:italic>k<\/jats:italic>\n            data service compositions based on user preferences. In our approach, we model user preferences using fuzzy sets and incorporate them into the composition query. We use an efficient RDF query rewriting algorithm to determine the relevant services that may be used to answer the composition query. We match the (fuzzy) constraints of the relevant services to those of the query and determine their matching degrees using a set of matching methods. We then rank-order the candidate services based on a fuzzification of Pareto dominance and compute the top-\n            <jats:italic>k<\/jats:italic>\n            data service compositions. In addition, we introduce a new method for increasing the diversity of returned top-\n            <jats:italic>k<\/jats:italic>\n            compositions while maintaining as much as possible the compositions with the highest scores. Finally, we describe the architecture of our system and present a thorough experimental study of our proposed techniques and algorithms. The experimental study demonstrates the efficiency and the effectiveness of our techniques in different settings.\n          <\/jats:p>","DOI":"10.1145\/2576231","type":"journal-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T12:28:17Z","timestamp":1406636897000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Web Service Compositions with Fuzzy Preferences"],"prefix":"10.1145","volume":"13","author":[{"given":"Karim","family":"Benouaret","sequence":"first","affiliation":[{"name":"LIRIS, Universit\u00e9 Claude Bernard Lyon 1"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Djamal","family":"Benslimane","sequence":"additional","affiliation":[{"name":"LIRIS, Universit\u00e9 Claude Bernard Lyon 1"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Allel","family":"Hadjali","sequence":"additional","affiliation":[{"name":"LIAS, ENSMA -- Poitiers"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahmoud","family":"Barhamgi","sequence":"additional","affiliation":[{"name":"LIRIS, Universit\u00e9 Claude Bernard Lyon 1"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zakaria","family":"Maamar","sequence":"additional","affiliation":[{"name":"Zayed University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quan Z.","family":"Sheng","sequence":"additional","affiliation":[{"name":"University of Adelaide"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,7]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the ICSOC Workshop on Dynamic Web Processes. Kunal Verma, Amit Sheth, Michal Zaremba, and Christoph Bussler Eds., 1--12","author":"Agarwal Sudhir","year":"2005","unstructured":"Sudhir Agarwal and Steffen Lamparter . 2005 . User preference based automated selection of Web service compositions . In Proceedings of the ICSOC Workshop on Dynamic Web Processes. Kunal Verma, Amit Sheth, Michal Zaremba, and Christoph Bussler Eds., 1--12 . Sudhir Agarwal and Steffen Lamparter. 2005. User preference based automated selection of Web service compositions. In Proceedings of the ICSOC Workshop on Dynamic Web Processes. Kunal Verma, Amit Sheth, Michal Zaremba, and Christoph Bussler Eds., 1--12."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772693"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452473"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.4"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2011.93"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982412"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the Conference on VLDB. 1430--1433","author":"Benouaret Karim","year":"2011","unstructured":"Karim Benouaret , Djamal Benslimane , Allel Hadjali , and Mahmoud Barhamgi . 2011 c. FuDoCS: A Web service composition system based on fuzzy dominance for preference query answering . In Proceedings of the Conference on VLDB. 1430--1433 . Karim Benouaret, Djamal Benslimane, Allel Hadjali, and Mahmoud Barhamgi. 2011c. FuDoCS: A Web service composition system based on fuzzy dominance for preference query answering. In Proceedings of the Conference on VLDB. 1430--1433."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2011.86"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2536669.2536677"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184340"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"e_1_2_1_13_1","volume-title":"Encyclopedia of Database Systems","author":"Davidson Ian","unstructured":"Ian Davidson . 2009. Clustering with constraints . In Encyclopedia of Database Systems . Springer , 393--396. Ian Davidson. 2009. Clustering with constraints. In Encyclopedia of Database Systems. Springer, 393--396."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.008"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055571"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the Conference on VLDB. 372--383","author":"Dong Xin","year":"2004","unstructured":"Xin Dong , Alon Y. Halevy , Jayant Madhavan , Ema Nemes , and Jun Zhang . 2004 . Simlarity search for Web services . In Proceedings of the Conference on VLDB. 372--383 . Xin Dong, Alon Y. Halevy, Jayant Madhavan, Ema Nemes, and Jun Zhang. 2004. Simlarity search for Web services. In Proceedings of the Conference on VLDB. 372--383."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1860702.1860709"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the FQAS. 89--103","author":"Dubois Didier","year":"1996","unstructured":"Didier Dubois and Henri Prade . 1996 . Using fuzzy sets in database systems: Why and how? In Proceedings of the FQAS. 89--103 . Didier Dubois and Henri Prade. 1996. Using fuzzy sets in database systems: Why and how? In Proceedings of the FQAS. 89--103."},{"key":"e_1_2_1_19_1","volume-title":"2000. Fundamentals of Fuzzy Sets","author":"Dubois Didier","unstructured":"Didier Dubois and Henri Prade Eds. 2000. Fundamentals of Fuzzy Sets . Kluwer , Boston, MA . Didier Dubois and Henri Prade Eds. 2000. Fundamentals of Fuzzy Sets. Kluwer, Boston, MA."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2206869.2206873"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the Conference on VLDB. 229--240","author":"Godfrey Parke","year":"2005","unstructured":"Parke Godfrey , Ryan Shipley , and Jarek Gryz . 2005 . Maximal vector computation in large data sets . In Proceedings of the Conference on VLDB. 229--240 . Parke Godfrey, Ryan Shipley, and Jarek Gryz. 2005. Maximal vector computation in large data sets. In Proceedings of the Conference on VLDB. 229--240."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1786094.1786116"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10383-4_18"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the Conference on VLDB. 275--286","author":"Kossmann Donald","year":"2002","unstructured":"Donald Kossmann , Frank Ramsak , and Steffen Rost . 2002 . Shooting stars in the sky: An online algorithm for Skyline queries . In Proceedings of the Conference on VLDB. 275--286 . Donald Kossmann, Frank Ramsak, and Steffen Rost. 2002. Shooting stars in the sky: An online algorithm for Skyline queries. In Proceedings of the Conference on VLDB. 275--286."},{"key":"e_1_2_1_25_1","volume-title":"Chang","author":"Li Chen","year":"2001","unstructured":"Chen Li and Edward Y . Chang . 2001 . On answering queries in the presence of limited access patterns. In Proceedings of the ICDT. 219--233. Chen Li and Edward Y. Chang. 2001. On answering queries in the presence of limited access patterns. In Proceedings of the ICDT. 219--233."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978055"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454163"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30581-1_4"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/646180.682439"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10383-4_40"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872814"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the Conference on VLDB. 15--26","author":"Pei Jian","year":"2007","unstructured":"Jian Pei , Bin Jiang , Xuemin Lin , and Yidong Yuan . 2007 . Probabilistic Skylines on uncertain data . In Proceedings of the Conference on VLDB. 15--26 . Jian Pei, Bin Jiang, Xuemin Lin, and Yidong Yuan. 2007. Probabilistic Skylines on uncertain data. In Proceedings of the Conference on VLDB. 15--26."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the Conference on VLDB. 129--138","author":"Raghavan Sriram","year":"2001","unstructured":"Sriram Raghavan and Hector Garcia-Molina . 2001 . Crawling the Hidden Web . In Proceedings of the Conference on VLDB. 129--138 . Sriram Raghavan and Hector Garcia-Molina. 2001. Crawling the Hidden Web. In Proceedings of the Conference on VLDB. 129--138."},{"key":"e_1_2_1_34_1","unstructured":"Pierre Senellart Serge Abiteboul and R\u00e9mi Gilleron. 2008a. Understanding the Hidden Web. ERCIM News 72.  Pierre Senellart Serge Abiteboul and R\u00e9mi Gilleron. 2008a. Understanding the Hidden Web. ERCIM News 72 ."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458502.1458505"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350232"},{"key":"e_1_2_1_37_1","first-page":"8","article-title":"Semantics enhanced services: METEOR-S","volume":"31","author":"Sheth Amit P.","year":"2008","unstructured":"Amit P. Sheth , Karthik Gomadam , and Ajith Ranabahu . 2008 . Semantics enhanced services: METEOR-S , SAWSDL and SA-REST.IEEE Data Eng. Bull. 31 , 3, 8 -- 12 . Amit P. Sheth, Karthik Gomadam, and Ajith Ranabahu. 2008. Semantics enhanced services: METEOR-S, SAWSDL and SA-REST.IEEE Data Eng. Bull. 31, 3, 8--12.","journal-title":"SAWSDL and SA-REST.IEEE Data Eng. Bull."},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the Conference on VLDB, Workshop on Personalized Access, Profile Management, and Context Awareness in Databases. 898--909","author":"Skoutas Dimitrios","year":"2010","unstructured":"Dimitrios Skoutas , Mohammad Alrifai , and Wolfgang Nejdl . 2010 a. Re-ranking Web service search results under diverse user preferences . In Proceedings of the Conference on VLDB, Workshop on Personalized Access, Profile Management, and Context Awareness in Databases. 898--909 . Dimitrios Skoutas, Mohammad Alrifai, and Wolfgang Nejdl. 2010a. Re-ranking Web service search results under diverse user preferences. In Proceedings of the Conference on VLDB, Workshop on Personalized Access, Profile Management, and Context Awareness in Databases. 898--909."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516463"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.14"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the Conference on VLDB. 301--310","author":"Tan Kian-Lee","year":"2001","unstructured":"Kian-Lee Tan , Pin-Kwang Eng , and Beng Chin Ooi . 2001 . Efficient progressive Skyline computation . In Proceedings of the Conference on VLDB. 301--310 . Kian-Lee Tan, Pin-Kwang Eng, and Beng Chin Ooi. 2001. Efficient progressive Skyline computation. In Proceedings of the Conference on VLDB. 301--310."},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the International Conference on Machine Learning (ICML). 1103--1110","author":"Wagstaff Kiri","year":"2000","unstructured":"Kiri Wagstaff and Claire Cardie . 2000 . Clustering with instance-level constraints . In Proceedings of the International Conference on Machine Learning (ICML). 1103--1110 . Kiri Wagstaff and Claire Cardie. 2000. Clustering with instance-level constraints. In Proceedings of the International Conference on Machine Learning (ICML). 1103--1110."},{"key":"e_1_2_1_43_1","volume-title":"Encyclopedia of Machine Learning","author":"Wagstaff Kiri L.","unstructured":"Kiri L. Wagstaff . 2010. Constrained clustering . In Encyclopedia of Machine Learning . Springer , 220--221. Kiri L. Wagstaff. 2010. Constrained clustering. In Encyclopedia of Machine Learning. Springer, 220--221."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10383-4_6"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2008.49"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10383-4_41"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.7"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2010.48"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90241-X"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060754"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576231","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:13:59Z","timestamp":1750277639000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576231"}},"subtitle":["A Graded Dominance Relationship-Based Approach"],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["10.1145\/2576231"],"URL":"https:\/\/doi.org\/10.1145\/2576231","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]},"assertion":[{"value":"2011-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}