TY - CONF AB - Whenever customers have to decide between different instances of the same product, they are interested in buying the best product. In contrast, companies are interested in reducing the construction effort (and usually as a consequence thereof, the quality) to gain profit. The described setting is widely known as opposed preferences in quality of the product and also applies to the context of service-oriented computing. In general, service-oriented computing emphasizes the construction of large software systems out of existing services, where services are small and self-contained pieces of software that adhere to a specified interface. Several implementations of the same interface are considered as several instances of the same service. Thereby, customers are interested in buying the best service implementation for their service composition wrt. to metrics, such as costs, energy, memory consumption, or execution time. One way to ensure the service quality is to employ certificates, which can come in different kinds: Technical certificates proving correctness can be automatically constructed by the service provider and again be automatically checked by the user. Digital certificates allow proof of the integrity of a product. Other certificates might be rolled out if service providers follow a good software construction principle, which is checked in annual audits. Whereas all of these certificates are handled differently in service markets, what they have in common is that they influence the buying decisions of customers. In this paper, we review state-of-the-art developments in certification with respect to service-oriented computing. We not only discuss how certificates are constructed and handled in service-oriented computing but also review the effects of certificates on the market from an economic perspective. AU - Jakobs, Marie-Christine AU - Krämer, Julia AU - van Straaten, Dirk AU - Lettmann, Theodor ED - Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz ID - 115 T2 - The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION) TI - Certification Matters for Service Markets ER - TY - CONF AB - In this paper, we present the annotation challenges we have encountered when working on a historical language that was undergoing elaboration processes. We especially focus on syntactic ambiguity and gradience in Middle Low German, which causes uncertainty to some extent. Since current annotation tools consider construction contexts and the dynamics of the grammaticalization only partially, we plan to extend CorA – a web-based annotation tool for historical and other non-standard language data – to capture elaboration phenomena and annotator unsureness. Moreover, we seek to interactively learn morphological as well as syntactic annotations. AU - Seemann, Nina AU - Merten, Marie-Luis AU - Geierhos, Michaela AU - Tophinke, Doris AU - Hüllermeier, Eyke ID - 1158 T2 - Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature TI - Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German ER - TY - GEN AU - Schnitker, Nino Noel ID - 5694 TI - Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies ER - TY - GEN AU - Gupta, Pritha AU - Hetzer, Alexander AU - Tornede, Tanja AU - Gottschalk, Sebastian AU - Kornelsen, Andreas AU - Osterbrink, Sebastian AU - Pfannschmidt, Karlson AU - Hüllermeier, Eyke ID - 5722 TI - jPL: A Java-based Software Framework for Preference Learning ER - TY - GEN AU - Hetzer, Alexander AU - Tornede, Tanja ID - 5724 TI - Solving the Container Pre-Marshalling Problem using Reinforcement Learning and Structured Output Prediction ER - TY - CONF AB - Today, software verification tools have reached the maturity to be used for large scale programs. Different tools perform differently well on varying code. A software developer is hence faced with the problem of choosing a tool appropriate for her program at hand. A ranking of tools on programs could facilitate the choice. Such rankings can, however, so far only be obtained by running all considered tools on the program.In this paper, we present a machine learning approach to predicting rankings of tools on programs. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for programs. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from the software verification competition SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy (rank correlation > 0.6). AU - Czech, Mike AU - Hüllermeier, Eyke AU - Jakobs, Marie-Christine AU - Wehrheim, Heike ID - 71 T2 - Proceedings of the 3rd International Workshop on Software Analytics TI - Predicting Rankings of Software Verification Tools ER - TY - GEN AB - Software verification competitions, such as the annual SV-COMP, evaluate software verification tools with respect to their effectivity and efficiency. Typically, the outcome of a competition is a (possibly category-specific) ranking of the tools. For many applications, such as building portfolio solvers, it would be desirable to have an idea of the (relative) performance of verification tools on a given verification task beforehand, i.e., prior to actually running all tools on the task.In this paper, we present a machine learning approach to predicting rankings of tools on verification tasks. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for verification tasks. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy. In particular, our method outperforms a recently proposed feature-based approach of Demyanova et al. (when applied to rank predictions). AU - Czech, Mike AU - Hüllermeier, Eyke AU - Jakobs, Marie-Christine AU - Wehrheim, Heike ID - 72 TI - Predicting Rankings of Software Verification Competitions ER - TY - GEN AU - Fürnkranz, J. AU - Hüllermeier, Eyke ID - 10589 T2 - Encyclopedia of Machine Learning and Data Mining TI - Preference Learning ER - TY - CHAP AU - Fürnkranz, J. AU - Hüllermeier, Eyke ED - Sammut, C. ED - Webb, G.I. ID - 10784 T2 - Encyclopedia of Machine Learning and Data Mining TI - Preference Learning VL - 107 ER - TY - CONF AB - These days, there is a strong rise in the needs for machine learning applications, requiring an automation of machine learning engineering which is referred to as AutoML. In AutoML the selection, composition and parametrization of machine learning algorithms is automated and tailored to a specific problem, resulting in a machine learning pipeline. Current approaches reduce the AutoML problem to optimization of hyperparameters. Based on recursive task networks, in this paper we present one approach from the field of automated planning and one evolutionary optimization approach. Instead of simply parametrizing a given pipeline, this allows for structure optimization of machine learning pipelines, as well. We evaluate the two approaches in an extensive evaluation, finding both approaches to have their strengths in different areas. Moreover, the two approaches outperform the state-of-the-art tool Auto-WEKA in many settings. AU - Wever, Marcel Dominik AU - Mohr, Felix AU - Hüllermeier, Eyke ID - 1180 T2 - 27th Workshop Computational Intelligence TI - Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization ER - TY - CONF AU - Melnikov, Vitaly AU - Hüllermeier, Eyke ED - Hoffmann, F. ED - Hüllermeier, Eyke ED - Mikut, R. ID - 15397 T2 - in Proceedings 27th Workshop Computational Intelligence, Dortmund Germany TI - Optimizing the structure of nested dichotomies. A comparison of two heuristics ER - TY - CONF AU - Czech, M. AU - Hüllermeier, Eyke AU - Jacobs, M.C. AU - Wehrheim, Heike ID - 15399 T2 - in Proceedings ESEC/FSE Workshops 2017 - 3rd ACM SIGSOFT, International Workshop on Software Analytics (SWAN 2017), Paderborn Germany TI - Predicting rankings of software verification tools ER - TY - CONF AU - Couso, Ines AU - Dubois, D. AU - Hüllermeier, Eyke ID - 15110 T2 - in Proceedings SUM 2017, 11th International Conference on Scalable Uncertainty Management, Granada, Spain TI - Maximum likelihood estimation and coarse data ER - TY - CONF AU - Ewerth, Ralph AU - Springstein, M. AU - Müller, E. AU - Balz, A. AU - Gehlhaar, J. AU - Naziyok, T. AU - Dembczynski, K. AU - Hüllermeier, Eyke ID - 10204 T2 - Proc. IEEE Int. Conf. on Multimedia and Expo (ICME 2017) TI - Estimating relative depth in single images via rankboost ER - TY - CONF AU - Ahmadi Fahandar, Mohsen AU - Hüllermeier, Eyke AU - Couso, Ines ID - 10205 T2 - Proc. 34th Int. Conf. on Machine Learning (ICML 2017) TI - Statistical Inference for Incomplete Ranking Data: The Case of Rank-Dependent Coarsening ER - TY - CONF AU - Mohr, Felix AU - Lettmann, Theodor AU - Hüllermeier, Eyke ID - 10206 T2 - Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017) TI - Planning with Independent Task Networks ER - TY - CONF AU - Czech, M. AU - Hüllermeier, Eyke AU - Jakobs, M.-C. AU - Wehrheim, Heike ID - 10207 T2 - Proc. 3rd ACM SIGSOFT Int. I Workshop on Software Analytics (SWAN@ESEC/SIGSOFT FSE 2017 TI - Predicting rankings of software verification tools ER - TY - CONF AU - Couso, Ines AU - Dubois, D. AU - Hüllermeier, Eyke ID - 10208 T2 - Proc. 11th Int. Conf. on Scalable Uncertainty Management (SUM 2017) TI - Maximum Likelihood Estimation and Coarse Data ER - TY - CONF AU - Ahmadi Fahandar, Mohsen AU - Hüllermeier, Eyke ID - 10209 T2 - Proc. AAAI 2017, 32nd AAAI Conference on Artificial Intelligence TI - Learning to Rank based on Analogical Reasoning ER - TY - CONF AU - Hoffmann, F. AU - Hüllermeier, Eyke AU - Mikut, R. ID - 10212 TI - (Hrsg.) Proceedings 27. Workshop Computational Intelligence, KIT Scientific Publishing, Karlsruhe, Germany 2017 ER - TY - CONF AU - Melnikov, Vitaly AU - Hüllermeier, Eyke ID - 10213 T2 - Proceedings 27. Workshop Computational Intelligence, Dortmund, Germany 2017 TI - Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics ER - TY - CONF AU - Shaker, Ammar AU - Heldt, W. AU - Hüllermeier, Eyke ID - 10216 T2 - Proceedings ECML/PKDD, European Conference on Machine Learning and Knowledge Discovery in Databases, Skopje, Macedonia TI - Learning TSK Fuzzy Rules from Data Streams ER - TY - JOUR AU - Bräuning, M. AU - Hüllermeier, Eyke AU - Keller, T. AU - Glaum, M. ID - 10267 IS - 1 JF - European Journal of Operational Research TI - Lexicographic preferences for predictive modeling of human decision making. A new machine learning method with an application in accounting VL - 258 ER - TY - JOUR AU - Platenius, M.-C. AU - Shaker, Ammar AU - Becker, M. AU - Hüllermeier, Eyke AU - Schäfer, W. ID - 10268 IS - 8 JF - IEEE Transactions on Software Engineering TI - Imprecise Matching of Requirements Specifications for Software Services Using Fuzzy Logic VL - 43 ER - TY - JOUR AU - Hüllermeier, Eyke ID - 10269 JF - The Computing Research Repository (CoRR) TI - From Knowledge-based to Data-driven Modeling of Fuzzy Rule-based Systems: A Critical Reflection ER - TY - JOUR AU - Ramaswamy, Arunselvan AU - Bhatnagar, Shalabh ID - 24154 IS - 8 JF - Stochastics TI - Stochastic recursive inclusion in two timescales with an application to the lagrangian dual problem VL - 88 ER - TY - JOUR AU - Melnikov, Vitalik AU - Hüllermeier, Eyke AU - Kaimann, Daniel AU - Frick, Bernd AU - Gupta, Pritha ID - 3318 JF - Schedae Informaticae SN - 2083-8476 TI - Pairwise versus Pointwise Ranking: A Case Study VL - 25 ER - TY - JOUR AB - Today, software components are provided by global markets in the form of services. In order to optimally satisfy service requesters and service providers, adequate techniques for automatic service matching are needed. However, a requester’s requirements may be vague and the information available about a provided service may be incomplete. As a consequence, fuzziness is induced into the matching procedure. The contribution of this paper is the development of a systematic matching procedure that leverages concepts and techniques from fuzzy logic and possibility theory based on our formal distinction between different sources and types of fuzziness in the context of service matching. In contrast to existing methods, our approach is able to deal with imprecision and incompleteness in service specifications and to inform users about the extent of induced fuzziness in order to improve the user’s decision-making. We demonstrate our approach on the example of specifications for service reputation based on ratings given by previous users. Our evaluation based on real service ratings shows the utility and applicability of our approach. AU - Platenius, Marie Christin AU - Shaker, Ammar AU - Becker, Matthias AU - Hüllermeier, Eyke AU - Schäfer, Wilhelm ID - 190 IS - 8 JF - IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017 TI - Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic ER - TY - CONF AB - In this paper, we propose a framework for a class of learning problems that we refer to as “learning to aggregate”. Roughly, learning-to-aggregate problems are supervised machine learning problems, in which instances are represented in the form of a composition of a (variable) number on constituents; such compositions are associated with an evaluation, score, or label, which is the target of the prediction task, and which can presumably be modeled in the form of a suitable aggregation of the properties of its constituents. Our learning-to-aggregate framework establishes a close connection between machine learning and a branch of mathematics devoted to the systematic study of aggregation functions. We specifically focus on a class of functions called uninorms, which combine conjunctive and disjunctive modes of aggregation. Experimental results for a corresponding model are presented for a review data set, for which the aggregation problem consists of combining different reviewer opinions about a paper into an overall decision of acceptance or rejection. AU - Melnikov, Vitaly AU - Hüllermeier, Eyke ID - 184 T2 - Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016) TI - Learning to Aggregate Using Uninorms ER - TY - GEN AU - Fürnkranz, J. AU - Hüllermeier, Eyke ED - Sammut, C. ED - Webb, G.I. ID - 10785 T2 - Encyclopedia of Machine Learning and Data Mining TI - Preference Learning ER - TY - CONF AU - Labreuche, C. AU - Hüllermeier, Eyke AU - Vojtas, P. AU - Fallah Tehrani, A. ED - Busa-Fekete, R. ED - Hüllermeier, Eyke ED - Mousseau, V. ED - Pfannschmidt, Karlson ID - 15400 T2 - in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany TI - On the identifiability of models in multi-criteria preference learning ER - TY - CONF AU - Schäfer, D. AU - Hüllermeier, Eyke ED - Busa-Fekete, R. ED - Hüllermeier, Eyke ED - Mousseau, V. ED - Pfannschmidt, Karlson ID - 15401 T2 - in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany TI - Preference -based reinforcement learning using dyad ranking ER - TY - CONF AU - Couso, Ines AU - Ahmadi Fahandar, Mohsen AU - Hüllermeier, Eyke ED - Busa-Fekete, R. ED - Hüllermeier, Eyke ED - Mousseau, V. ED - Pfannschmidt, Karlson ID - 15402 T2 - in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany TI - Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators ER - TY - CONF AU - Lu, S. AU - Hüllermeier, Eyke ED - Hüllermeier, Eyke ED - Hoffmann, F. ED - Mikut, R. ID - 15403 T2 - in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany TI - Support vector classification on noisy data using fuzzy superset losses ER - TY - CONF AU - Schäfer, D. AU - Hüllermeier, Eyke ID - 15404 T2 - in Workshop LWDA "Lernen, Wissen, Daten, Analysen" Potsdam, Germany TI - Plackett-Luce networks for dyad ranking ER - TY - CONF AU - Pfannschmidt, Karlson AU - Hüllermeier, Eyke AU - Held, S. AU - Neiger, R. ID - 15111 T2 - In Proceedings IPMU 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands TI - Evaluating tests in medical diagnosis-Combining machine learning with game-theoretical concepts ER - TY - JOUR AU - Leinweber, M. AU - Fober, T. AU - Strickert, M. AU - Baumgärtner, L. AU - Klebe, G. AU - Freisleben, B. AU - Hüllermeier, Eyke ID - 16041 IS - 6 JF - IEEE Transactions on Knowledge and Data Engineering TI - CavSimBase: A database for large scale comparison of protein binding sites VL - 28 ER - TY - THES AU - Mohr, Felix ID - 141 TI - Towards Automated Service Composition Under Quality Constraints ER - TY - CHAP AU - Fürnkranz, J. AU - Hüllermeier, Eyke ED - Sammut, C. ED - Webb, G.I. ID - 10214 T2 - Encyclopedia of Machine Learning and Data Mining TI - Preference Learning ER - TY - GEN ED - Hoffmann, F. ED - Hüllermeier, Eyke ED - Mikut, R. ID - 10221 TI - Proceedings 26. Workshop Computational Intelligence KIT Scientific Publishing, Karlsruhe, Germany ER - TY - CONF AU - Jasinska, K. AU - Dembczynski, K. AU - Busa-Fekete, Robert AU - Klerx, Timo AU - Hüllermeier, Eyke ED - Balcan, M.F. ED - Weinberger, K.Q. ID - 10222 T2 - Proceedings ICML-2016, 33th International Conference on Machine Learning, New York, USA TI - Extreme F-measure maximization using sparse probability estimates ER - TY - CONF AU - Melnikov, Vitaly AU - Hüllermeier, Eyke ID - 10223 T2 - European Conference on Machine Learning and Knowledge Discovery in Databases, Part II, Riva del Garda, Italy TI - Learning to aggregate using uninorms, in Proceedings ECML/PKDD-2016 ER - TY - CONF AU - Dembczynski, K. AU - Kotlowski, W. AU - Waegeman, W. AU - Busa-Fekete, Robert AU - Hüllermeier, Eyke ID - 10224 T2 - In Proceedings ECML/PKDD European Conference on Maschine Learning and Knowledge Discovery in Databases, Part II, Riva del Garda, Italy TI - Consistency of probalistic classifier trees ER - TY - CONF AU - Shabani, Aulon AU - Paul, Adil AU - Platon, R. AU - Hüllermeier, Eyke ID - 10225 T2 - In Proceedings ICCBR, 24th International Conference on Case-Based Reasoning, Atlanta, GA, USA TI - Predicting the electricity consumption of buildings: An improved CBR approach ER - TY - CONF AU - Pfannschmidt, Karlson AU - Hüllermeier, Eyke AU - Held, S. AU - Neiger, R. ID - 10226 T2 - In Proceedings IPMU 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands TI - Evaluating tests in medical diagnosis-Combining machine learning with game-theoretical concepts ER - TY - CONF AU - Labreuche, C. AU - Hüllermeier, Eyke AU - Vojtas, P. AU - Fallah Tehrani, A. ED - Busa-Fekete, Robert ED - Hüllermeier, Eyke ED - Mousseau, V. ED - Pfannschmidt, Karlson ID - 10227 T2 - Proceedings DA2PL ´2016, Euro Mini Conference from Multiple Criteria Decision Aid to Preference Learning TI - On the Identifiability of models in multi-criteria preference learning ER - TY - CONF AU - Schäfer, Dirk AU - Hüllermeier, Eyke ED - Busa-Fekete, Robert ED - Hüllermeier, Eyke ED - Mousseau, V. ED - Pfannschmidt, Karlson ID - 10228 T2 - Proceedings DA2PL ´2016, Euro Mini Conference from Multiple Criteria Decision Aid to Preference Learning TI - Preference-Based Reinforcement Learning Using Dyad Ranking ER - TY - CONF AU - Couso, Ines AU - Ahmadi Fahandar, Mohsen AU - Hüllermeier, Eyke ED - Busa-Fekete, Robert ED - Hüllermeier, Eyke ED - Mousseau, V. ED - Pfannschmidt, Karlson ID - 10229 T2 - Proceedings DA2PL ´2016, Euro Mini Conference from Multiple Criteria Decision Aid to Preference Learning TI - Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators ER - TY - CONF AU - Lu, S. AU - Hüllermeier, Eyke ED - Hoffmann, F. ED - Hüllermeier, Eyke ED - Mikut, R. ID - 10230 T2 - Proceedings 26. Workshop Computational Intelligence, KIT Scientific Publishing TI - Support vector classification on noisy data using fuzzy supersets losses ER - TY - CONF AU - Schäfer, Dirk AU - Hüllermeier, Eyke ID - 10231 T2 - In Workshop LWDA "Lernen, Wissen, Daten, Analysen" TI - Plackett-Luce networks for dyad ranking ER - TY - GEN ED - Kaminka, G.A. ED - Fox, M. ED - Bouquet, P. ED - Hüllermeier, Eyke ED - Dignum, V. ED - Dignum, F. ED - van Harmelen, F. ID - 10263 TI - ECAI 2016, 22nd European Conference on Artificial Intelligence, including PAIS 2016, Prestigious Applications of Artificial Intelligence VL - 285 ER - TY - JOUR AU - Leinweber, M. AU - Fober, T. AU - Strickert, M. AU - Baumgärtner, L. AU - Klebe, G. AU - Freisleben, B. AU - Hüllermeier, Eyke ID - 10264 IS - 6 JF - IEEE Transactions on Knowledge and Data Engineering TI - CavSimBase: A database for large scale comparison of protein binding sites VL - 28 ER - TY - JOUR AU - Riemenschneider, M. AU - Senge, Robin AU - Neumann, U. AU - Hüllermeier, Eyke AU - Heider, D. ID - 10266 IS - 10 JF - BioData Mining TI - Exploiting HIV-1 protease and reverse transcriptase cross-resistance information for improved drug resistance prediction by means of multi-label classification VL - 9 ER - TY - CONF AB - The Collaborative Research Centre "On-The-Fly Computing" works on foundations and principles for the vision of the Future Internet. It proposes the paradigm of On-The-Fly Computing, which tackles emerging worldwide service markets. In these markets, service providers trade software, platform, and infrastructure as a service. Service requesters state requirements on services. To satisfy these requirements, the new role of brokers, who are (human) actors building service compositions on the fly, is introduced. Brokers have to specify service compositions formally and comprehensively using a domain-specific language (DSL), and to use service matching for the discovery of the constituent services available in the market. The broker's choice of the DSL and matching approaches influences her success of building compositions as distinctive properties of different service markets play a significant role. In this paper, we propose a new approach of engineering a situation-specific DSL by customizing a comprehensive, modular DSL and its matching for given service market properties. This enables the broker to create market-specific composition specifications and to perform market-specific service matching. As a result, the broker builds service compositions satisfying the requester's requirements more accurately. We evaluated the presented concepts using case studies in service markets for tourism and university management. AU - Arifulina, Svetlana AU - Platenius, Marie Christin AU - Mohr, Felix AU - Engels, Gregor AU - Schäfer, Wilhelm ID - 280 T2 - Proceedings of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service Composition for the Future Internet TI - Market-Specific Service Compositions: Specification and Matching ER - TY - JOUR AB - On-the-fly composition of service-based software solutions is still a challenging task. Even more challenges emerge when facing automatic service composition in markets of composed services for end users. In this paper, we focus on the functional discrepancy between “what a user wants” specified in terms of a request and “what a user gets” when executing a composed service. To meet the challenge of functional discrepancy, we propose the combination of existing symbolic composition approaches with machine learning techniques. We developed a learning recommendation system that expands the capabilities of existing composition algorithms to facilitate adaptivity and consequently reduces functional discrepancy. As a representative of symbolic techniques, an Artificial Intelligence planning based approach produces solutions that are correct with respect to formal specifications. Our learning recommendation system supports the symbolic approach in decision-making. Reinforcement Learning techniques enable the recommendation system to adjust its recommendation strategy over time based on user ratings. We implemented the proposed functionality in terms of a prototypical composition framework. Preliminary results from experiments conducted in the image processing domain illustrate the benefit of combining both complementary techniques. AU - Jungmann, Alexander AU - Mohr, Felix ID - 323 IS - 1 JF - Journal of Internet Services and Applications TI - An approach towards adaptive service composition in markets of composed services ER - TY - CONF AB - Services are self-contained software components that can beused platform independent and that aim at maximizing software reuse. Abasic concern in service oriented architectures is to measure the reusabilityof services. One of the most important qualities is the functionalreusability, which indicates how relevant the task is that a service solves.Current metrics for functional reusability of software, however, have verylittle explanatory power and do not accomplish this goal.This paper presents a new approach to estimate the functional reusabilityof services based on their relevance. To this end, it denes the degreeto which a service enables the execution of other services as its contri-bution. Based on the contribution, relevance of services is dened as anestimation for their functional reusability. Explanatory power is obtainedby normalizing relevance values with a reference service. The applicationof the metric to a service test set conrms its supposed capabilities. AU - Mohr, Felix ID - 324 T2 - Proceedings of the 14th International Conference on Software Reuse (ICSR) TI - A Metric for Functional Reusability of Services ER - TY - CONF AB - Services are self-contained and platform independent software components that aim at maximizing software reuse. The automated composition of services to a target software artifact has been tackled with many AI techniques, but existing approaches make unreasonably strong assumptions such as a predefined data flow, are limited to tiny problem sizes, ignore non-functional properties, or assume offline service repositories. This paper presents an algorithm that automatically composes services without making such assumptions. We employ a backward search algorithm that starts from an empty composition and prepends service calls to already discovered candidates until a solution is found. Available services are determined during the search process. We implemented our algorithm, performed an experimental evaluation, and compared it to other approaches. AU - Mohr, Felix AU - Jungmann, Alexander AU - Kleine Büning, Hans ID - 319 T2 - Proceedings of the 12th IEEE International Conference on Services Computing (SCC) TI - Automated Online Service Composition ER - TY - JOUR AU - Senge, Robin AU - Hüllermeier, Eyke ID - 4792 IS - 6 JF - IEEE Transactions on Fuzzy Systems SN - 1063-6706 TI - Fast Fuzzy Pattern Tree Learning for Classification VL - 23 ER - TY - CONF AU - Schäfer, D. AU - Hüllermeier, Eyke ID - 15406 T2 - in Proceedings of the 2015 international Workshop on Meta-Learning and Algorithm Selection co-located ECML/PKDD, Porto, Portugal TI - Preference-based meta-learning using dyad ranking: Recommending algorithms in cold-start situations ER - TY - CONF AU - Paul, Adil AU - Hüllermeier, Eyke ID - 15749 T2 - In Workshop Proceedings from ICCBR, 23rd International Conference on Case-Based Reasoning, Frankfurt, Germany TI - A cbr approach to the angry birds game ER - TY - CONF AU - Ewerth, R. AU - Balz, A. AU - Gehlhaar, J. AU - Dembczynski, K. AU - Hüllermeier, Eyke ED - Hoffmann, F. ED - Hüllermeier, Eyke ID - 15750 T2 - In Proceedings 25. Workshop Computational Intelligence, Dortmund, Germany TI - Depth estimation in monocular images: Quantitative versus qualitative approaches ER - TY - CONF AU - Lu, S. AU - Hüllermeier, Eyke ED - Hoffmann, F. ED - Hüllermeier, Eyke ID - 15751 T2 - in Proceedings 25th Workshop Computational Intelligence, Dortmund Germany TI - Locally weighted regression through data imprecisiation ER - TY - JOUR AU - Senge, Robin AU - Hüllermeier, Eyke ID - 16049 IS - 6 JF - IEEE Transactions on Fuzzy Systems TI - Fast fuzzy pattern tree learning for classification VL - 23 ER - TY - JOUR AU - Hüllermeier, Eyke ID - 16051 IS - 6 JF - Informatik Spektrum TI - From knowledge-based to data driven fuzzy modeling: Development, criticism and alternative directions VL - 38 ER - TY - JOUR AU - Hüllermeier, Eyke ID - 16053 JF - Fuzzy Sets and Systems TI - Does machine learning need fuzzy logic? VL - 281 ER - TY - JOUR AU - Waegeman, W. AU - Dembczynski, K. AU - Jachnik, A. AU - Cheng, W. AU - Hüllermeier, Eyke ID - 16058 JF - Journal of Machine Learning Research TI - On the Bayes-optimality of F-measure maximizers VL - 15 ER - TY - JOUR AU - Shaker, A. AU - Hüllermeier, Eyke ID - 16067 JF - Neurocomputing TI - Recovery analysis for adaptive learning from non-stationary data streams: Experimental design and case study VL - 150 ER - TY - CONF AU - Hüllermeier, Eyke AU - Minor, M. ID - 10234 T2 - in Proceedings 23rd International Conference on Case-Based Reasoning (ICCBR 2015) LNAI 9343 TI - Case-Based Reasoning Research and Development ER - TY - CONF AU - Hoffmann, F. AU - Hüllermeier, Eyke ID - 10235 TI - Proceedings 25. Workshop Computational Intelligence KIT Scientific Publishing ER - TY - CONF AU - Abdel-Aziz, A. AU - Hüllermeier, Eyke ID - 10236 T2 - In Proceedings 23rd International Conference on Case-Based Reasoning (ICCBR 2015) TI - Case Base Maintenance in Preference-Based CBR ER - TY - CONF AU - Szörényi, B. AU - Busa-Fekete, Robert AU - Weng, P. AU - Hüllermeier, Eyke ID - 10237 T2 - In Proceedings International Conference on Machine Learning (ICML 2015) TI - Qualitative Multi-Armed Bandits: A Quantile-Based Approach ER - TY - CONF AU - Schäfer, Dirk AU - Hüllermeier, Eyke ID - 10238 T2 - in Proceedings European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD) TI - Dyad Ranking Using A Bilinear Plackett-Luce Model ER - TY - CONF AU - Hüllermeier, Eyke AU - Cheng, W. ID - 10239 T2 - in Proceedings European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD) TI - Superset Learning Based on Generalized Loss Minimization ER - TY - CONF AU - Henzgen, Sascha AU - Hüllermeier, Eyke ID - 10240 T2 - in Proceedings European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD) TI - Weighted Rank Correlation : A Flexible Approach Based on Fuzzy Order Relations ER - TY - CONF AU - Szörényi, B. AU - Busa-Fekete, Robert AU - Paul, Adil AU - Hüllermeier, Eyke ID - 10241 T2 - in Advances in Neural Information Processing Systems 28 (NIPS 2015) TI - Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach ER - TY - CONF AU - Szörényi, B. AU - Busa-Fekete, Robert AU - Dembczynski, K. AU - Hüllermeier, Eyke ID - 10242 T2 - in Advances in Neural Information Processing Systems 28 (NIPS 2015) TI - Online F-Measure Optimization ER - TY - CONF AU - El Mesaoudi-Paul, Adil AU - Hüllermeier, Eyke ID - 10243 T2 - in Workshop Proc. 23rd International Conference on Case-Based Reasoning (ICCBR 2015) TI - A CBR Approach to the Angry Birds Game ER - TY - CONF AU - Schäfer, Dirk AU - Hüllermeier, Eyke ID - 10244 T2 - in Proceedings of the 2015 International Workshop on Meta-Learning and Algorithm Selection (MetaSel@PKDD/ECML) TI - Preference-Based Meta- Learning Using Dyad Ranking: Recommending Algorithms in Cold-Start Situations ER - TY - CONF AU - Lu, S. AU - Hüllermeier, Eyke ID - 10245 T2 - Proceedings 25. Workshop Computational Intelligence TI - Locally weighted regression through data imprecisiation ER - TY - CONF AU - Ewerth, Ralph AU - Balz, A. AU - Gehlhaar, J. AU - Dembczynski, K. AU - Hüllermeier, Eyke ID - 10246 T2 - Proceedings 25. Workshop Computational Intelligence TI - Depth estimation in monocular images: Quantitative versus qualitative approaches ER - TY - JOUR AU - Waegeman, W. AU - Dembczynski, K. AU - Jachnik, A. AU - Cheng, W. AU - Hüllermeier, Eyke ID - 10319 JF - in Journal of Machine Learning Research TI - On the Bayes-Optimality of F-Measure Maximizers VL - 15 ER - TY - JOUR AU - Hüllermeier, Eyke ID - 10320 JF - Fuzzy Sets and Systems TI - Does machine learning need fuzzy logic? VL - 281 ER - TY - JOUR AU - Shaker, Ammar AU - Hüllermeier, Eyke ID - 10321 JF - Neurocomputing TI - Recovery analysis for adaptive learning from non-stationary data streams: Experimental design and case study VL - 150 ER - TY - JOUR AU - Hüllermeier, Eyke ID - 10322 IS - 6 JF - Informatik Spektrum TI - From Knowledge-based to Data-driven fuzzy modeling-Development, criticism and alternative directions VL - 38 ER - TY - JOUR AU - Garcia-Jimenez, S. AU - Bustince, U. AU - Hüllermeier, Eyke AU - Mesiar, R. AU - Pal, N.R. AU - Pradera, A. ID - 10323 IS - 4 JF - IEEE Transactions on Fuzzy Systems TI - Overlap Indices: Construction of and Application of Interpolative Fuzzy Systems VL - 23 ER - TY - JOUR AU - Senge, Robin AU - Hüllermeier, Eyke ID - 10324 IS - 6 JF - IEEE Transactions on Fuzzy Systems TI - Fast Fuzzy Pattern Tree Learning of Classification VL - 23 ER - TY - JOUR AU - Basavaraju, Manu AU - Chandran, L Sunil AU - Rajendraprasad, Deepak AU - Ramaswamy, Arunselvan ID - 24155 IS - 6 JF - Graphs and Combinatorics TI - Rainbow connection number of graph power and graph products VL - 30 ER - TY - JOUR AU - Basavaraju, Manu AU - Chandran, L Sunil AU - Rajendraprasad, Deepak AU - Ramaswamy, Arunselvan ID - 24156 IS - 2 JF - Graphs and Combinatorics TI - Rainbow connection number and radius VL - 30 ER - TY - CONF AB - There are many technologies for the automation of processesthat deal with services; examples are service discovery and composition.Automation of these processes requires that the services are described semantically. However, semantically described services are currently not oronly rarely available, which limits the applicability of discovery and composition approaches. The systematic support for creating new semanticservices usable by automated technologies is an open problem.We tackle this problem with a template based approach: Domain independent templates are instantiated with domain specific services andboolean expressions. The obtained services have semantic descriptionswhose correctness directly follows from the correctness of the template.Besides the theory, we present experimental results for a service repository in which 85% of the services were generated automatically. AU - Mohr, Felix AU - Walther, Sven ID - 353 T2 - Proceedings of the 14th International Conference on Software Reuse (ICSR) TI - Template-based Generation of Semantic Services ER - TY - CONF AB - Automatic service composition is still a challengingtask. It is even more challenging when dealing witha dynamic market of services for end users. New servicesmay enter the market while other services are completelyremoved. Furthermore, end users are typically no experts in thedomain in which they formulate a request. As a consequence,ambiguous user requests will inevitably emerge and have tobe taken into account. To meet these challenges, we proposea new approach that combines automatic service compositionwith adaptive service recommendation. A best first backwardsearch algorithm produces solutions that are functional correctwith respect to user requests. An adaptive recommendationsystem supports the search algorithm in decision-making.Reinforcement Learning techniques enable the system to adjustits recommendation strategy over time based on user ratings.The integrated approach is described on a conceptional leveland demonstrated by means of an illustrative example fromthe image processing domain. AU - Jungmann, Alexander AU - Mohr, Felix AU - Kleinjohann, Bernd ID - 447 T2 - Proceedings of the 10th World Congress on Services (SERVICES) TI - Combining Automatic Service Composition with Adaptive Service Recommendation for Dynamic Markets of Services ER - TY - CONF AB - Automatically composing service-based software solutionsis still a challenging task. Functional as well as nonfunctionalproperties have to be considered in order to satisfyindividual user requests. Regarding non-functional properties,the composition process can be modeled as optimization problemand solved accordingly. Functional properties, in turn, can bedescribed by means of a formal specification language. Statespacebased planning approaches can then be applied to solvethe underlying composition problem. However, depending on theexpressiveness of the applied formalism and the completenessof the functional descriptions, formally equivalent services maystill differ with respect to their implemented functionality. As aconsequence, the most appropriate solution for a desired functionalitycan hardly be determined without considering additionalinformation. In this paper, we demonstrate how to overcome thislack of information by means of Reinforcement Learning. Inorder to resolve ambiguity, we expand state-space based servicecomposition by a recommendation mechanism that supportsdecision-making beyond formal specifications. The recommendationmechanism adjusts its recommendation strategy basedon feedback from previous composition runs. Image processingserves as case study. Experimental results show the benefit of ourproposed solution. AU - Jungmann, Alexander AU - Mohr, Felix AU - Kleinjohann, Bernd ID - 457 T2 - Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA) TI - Applying Reinforcement Learning for Resolving Ambiguity in Service Composition ER - TY - CONF AB - Services are self-contained software components that can be used platform independent and that aim at maximizing software reuse. A basic concern in service oriented architectures is to measure the reusability of services. One of the most important qualities is the functional reusability, which indicates how relevant the task is that a service solves. Current metrics for functional reusability of software, however, either require source code analysis or have very little explanatory power. This paper gives a formally described vision statement for the estimation of functional reusability of services and sketches an exemplary reusability metric that is based on the service descriptions. AU - Mohr, Felix ID - 428 T2 - Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC) TI - Estimating Functional Reusability of Services ER - TY - JOUR AU - Agarwal, M. AU - Fallah Tehrani, A. AU - Hüllermeier, Eyke ID - 16046 IS - 3-4 JF - Journal of Multi-Criteria Decision Analysis TI - Preference-based learning of ideal solutions in TOPSIS-like decision models VL - 22 ER - TY - JOUR AU - Krotzky, T. AU - Fober, T. AU - Hüllermeier, Eyke AU - Klebe, G. ID - 16060 IS - 5 JF - IEEE/ACM Transactions of Computational Biology and Bioinformatics TI - Extended graph-based models for enhanced similarity search in Cabase VL - 11 ER - TY - JOUR AU - Hüllermeier, Eyke ID - 16064 IS - 7 JF - International Journal of Approximate Reasoning TI - Learning from imprecise and fuzzy observations: Data disambiguation through generalized loss minimization VL - 55 ER - TY - JOUR AU - Henzgen, Sascha AU - Strickert, M. AU - Hüllermeier, Eyke ID - 16069 JF - Evolving Systems TI - Visualization of evolving fuzzy-rule-based systems VL - 5 ER - TY - JOUR AU - Busa-Fekete, Robert AU - Szörenyi, B. AU - Weng, P. AU - Cheng, W. AU - Hüllermeier, Eyke ID - 16077 IS - 3 JF - Machine Learning TI - Preference-based reinforcement learning: evolutionary direct policy search using a preference-based racing algorithm. VL - 97 ER - TY - JOUR AU - Krempl, G. AU - Zliobaite, I. AU - Brzezinski, D. AU - Hüllermeier, Eyke AU - Last, M. AU - Lemaire, V. AU - Noack, T. AU - Shaker, A. AU - Sievi, S. AU - Spiliopoulou, M. AU - Stefanowski, J. ID - 16078 IS - 1 JF - SIGKDD Explorations TI - Open challenges for data stream mining research VL - 16 ER - TY - JOUR AU - Strickert, M. AU - Bunte, K. AU - Schleif, F.M. AU - Hüllermeier, Eyke ID - 16079 JF - Neurocomputing TI - Correlation-based embedding of pairwise score data VL - 141 ER - TY - JOUR AU - Shaker, Ammar AU - Hüllermeier, Eyke ID - 16080 IS - 1 JF - International Journal of Applied Mathematics and Computer Science TI - Survival analysis on data streams: Analyzing temporal events in dynamically changing environments VL - 24 ER -