Martin, Andreas

Lade...
Profilbild
E-Mail-Adresse
Geburtsdatum
Projekt
Organisationseinheiten
Berufsbeschreibung
Nachname
Martin
Vorname
Andreas
Name
Martin, Andreas

Suchergebnisse

Gerade angezeigt 1 - 2 von 2
  • Publikation
    Learning and engineering similarity functions for business recommenders
    (2019) Witschel, Hans Friedrich; Martin, Andreas; Martin, Andreas; Hinkelmann, Knut; Gerber, Aurona; Lenat, Doug; Harmelen, Frank van; Clark, Peter [in: Proceedings of the AAAI 2019 Spring Symposium on Combining Machine Learning with Knowledge Engineering (AAAI-MAKE 2019)]
    We study the optimisation of similarity measures in tasks where the computation of similarities is not directly visible to end users, namely clustering and case-based recommenders. In both, similarity plays a crucial role, but there are also other algorithmic components that contribute to the end result. Our suggested approach introduces a new form of interaction into these scenarios that make the use of similarities transparent to end users and thus allows to gather direct feedback about similarity from them. This happens without distracting them from their goal – rather allowing them to obtain better and more trustworthy results by excluding dissimilar items. We then propose to use the feedback in a way that incorporates machine learning for updating weights and decisions of knowledge engineers about possible additional features, based on insights derived from a summary of user feedback. The reviewed literature and our own previous empirical investigations suggest that this is the most feasible way – involving both machine and human, each in a task that they are particularly good at.
    04B - Beitrag Konferenzschrift
  • Publikation
    A new Retrieval Function for Ontology-Based Complex Case Descriptions
    (2015) Emmenegger, Sandro; Lutz, Jonas; Witschel, Hans Friedrich; Martin, Andreas [in: Proceedings of CBR-MD'15, 2015]
    This work focuses on case-based reasoning in domains where cases have complex structures with relationships to an arbitrary number of other (potentially complex and structured) entities and where case characterisations (queries) are potentially incomplete. We summarise the requirements for such domains in terms of case representation and retrieval functions. We then analyse properties of existing similarity measures used in CBR { above all symmetry { and argue that some of these properties are not desirable. By exploiting analogies with retrieval functions in the area of information retrieval { where similar functions have been replaced by new ones not exhibiting the aforementioned undesired properties { we derive a new asymmetric ranking function for case retrieval. On a generated test-bed, we show that indeed the new function results in di erent ranking of cases { and use testbed examples to illustrate why this is desirable from a user's perspective.
    04B - Beitrag Konferenzschrift