As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
In case-based reasoning, improving the performance of the retrieval phase is still an important research issue for complex case representations and computationally expensive similarity measures. This holds particularly for the of retrieval workflows, which is a recent topic in process-oriented case-based reasoning. While most index-based retrieval methods are restricted to attribute-value representations, the application of a MAC/FAC retrieval approach introduces significant additional domain-specific development effort due to design the MAC phase. In this paper, we present a new index-based retrieval algorithm, which is applicable beyond attribute-value representations without introducing additional domain-specific development effort. It consists of a new clustering algorithm that constructs a cluster-based index structure based on case similarity, which helps finding the most similar cases more efficiently. The approach is developed and analyzed for the retrieval of semantic workflows. It significantly improves the retrieval time compared to a linear retriever, while maintaining a high retrieval quality. Further, it achieves a similar performance than the MAC/FAC retriever if the case base has a cluster structure, i.e., if it contains groups of similar cases.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.