• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
1
0
0

Texte intégral

(1)

Preface: Combining Machine Learning with Knowledge Engineering (AAAI-MAKE 2019)

Andreas Martin

1

, Knut Hinkelmann

1

, Aurona Gerber

2

, Doug Lenat

3

, Frank van Harmelen

4

and Peter Clark

5

1FHNW University of Applied Sciences and Arts Northwestern Switzerland, School of Business, Olten, Switzerland

2University of Pretoria, Department of Informatics, Pretoria, South Africa

3Cycorp Inc., Austin, TX, USA

4VU University, Department of Computer Science, Amsterdam, Netherlands

5Allen Institute for Artificial Intelligence, Seattle, WA, USA

The AAAI 2019 spring symposium on combining ma- chine learning with knowledge engineering, which was held at Stanford University, Palo Alto, California, USA, from 25 to 27 March 2019, brought together researchers and practi- tioners from various communities working together on joint AI that is explainable, compliant and grounded in domain knowledge.

The symposium aimed to combine machine learning with knowledge engineering. Machine learning helps to solve complex tasks based on real-world data instead of pure in- tuition. It is most suitable for building AI systems when knowledge is not known, or knowledge is tacit. Many busi- ness cases and real-life scenarios using machine learning methods, however, demand explanations of results and be- haviour. This is particularly the case where decisions can have serious consequences. Furthermore, application areas such as banking, insurance and medicine, are highly regu- lated and require compliance with law and regulations. This specific application knowledge cannot be learned but needs to be represented, which is the area of knowledge engineer- ing.

Knowledge engineering, on the other hand, is appropri- ate for representing expert knowledge, which people are aware of and that has to be considered for compliance rea- sons or explanations. Knowledge-based systems that make knowledge explicit are often based on logic and thus can explain their conclusions. These systems typically require a higher initial effort during development than systems that use machine learning approaches. However, symbolic ma- chine learning and ontology learning approaches are promis- ing for reducing the effort of knowledge engineering.

Because of their complementary strengths and weak- nesses, there is an increasing demand for the integration of knowledge engineering and machine learning. Conclusively, recent results indicate that explicitly represented application knowledge could assist data-driven machine-learning approaches to converge faster on sparse data and to be more robust against noise.

Copyright held by the author(s). In A. Martin, K. Hinkelmann, A.

Gerber, D. Lenat, F. van Harmelen, P. Clark (Eds.), Proceedings of the AAAI 2019 Spring Symposium on Combining Machine Learn- ing with Knowledge Engineering (AAAI-MAKE 2019). Stanford University, Palo Alto, California, USA, March 25-27, 2019.

The over 70 participants of the AAAI-MAKE symposium contributed to the intense discussion during the presenta- tion of the 28 position and full papers, and four posters and demonstrations.

Most notably, the participants had the opportunity to at- tend several keynotes. On the first day, Doug Lenat em- phasised a need for a more expressive logic language in his keynote presentation. He gave a recap on the Cyc knowledge-based and showed ways to connect knowledge- based systems with machine learning. Then on the second day, Frank van Harmelen showed the limitations of machine learning, in particular in areas where not much knowledge is available like the recognition of rare diseases. He introduced the concept of boxology to represent the re-usable architec- tural patterns for combining learning and reasoning.

In the plenary session on day two, Aurona Gerber gave a short and witty overview of the AAAI-MAKE symposium by using the analogy to Asterix.

On the final day, the co-chairs Knut Hinkelmann and An- dreas Martin concluded the symposium and emphasised a concluding discussion on how this new joint community should continue contributing further on this topic.

Références

Documents relatifs

Now a reversal preserving the latter is of great interest because m a n y analytic and stochastic properties of a process seem to possess an inner duality and

We would like to thank all the people involved in the organization of the event: the REFSQ 2016 organizers, who supported the event; the panel of experts (see next page for

The aim of the 2 nd Workshop on Innovative Software Engineering Education 1 is to bring software engineering educators together to actively work and discuss the most important

If you notice an error in typing before you hit the CR. you can delete the last character by the Rub-Out key or delete the entire line by the Alt-Mode key. Tiny basic

Figure 10(b) illustrates this decomposition. One could augment predicate-action diagrams with some notation for indicating fairness condi- tions. However, the conditions that are

Only aspcct<; of object display that materially effect the user's model should be defined here (see Display Window below).. Illustration - This is a graphic

This scheme implies that any future schemes for arbitrary instantiation will involve an indirect ancestor link, as the ancestor can not be counted on to have

changes the context (and thus the domain for symbol-lookup) to the program module whose name ismodulename. If there is more than one instance of a module named