105,195 research outputs found
Recommended from our members
Mining Useful Information from Big Data Models Through Semantic-based Process Modelling and Analysis
Over the past few decades, most of the existing methods for analysing large growing knowledge bases, particularly Big Data, focus on building algorithms and/or technologies to help the knowledge-bases automatically or semi-automatically extend. Indeed, a vast number of such systems that construct the said large knowledge-bases continuously grow, and most often, they do not contain all of the facts about each process instance or elements that can be found within the process base. As a consequence, the resultant process models tend to be vague or missing value datasets. In view of such challenge, the work in this paper demonstrates that a well-designed information retrieval system or the process mining (PM) methods should present the results or discovered patterns in a formal and structured format qua being interpreted as domain knowledge. To this end, the work introduces a process mining approach that supports further enhancement of existing information systems or knowledge-base through the conceptual means of data analysis. In turn, the paper proposes a semantic-based process mining and analysis method, or better still, information retrieval and extraction system - that is capable of detecting patterns or unobserved behaviours within any given knowledge base by making use of the underlying semantics or properties (metadata) that describes the available data. Thus, the proposed approach is grounded on the semantic modelling and process mining techniques. The work illustrates this method using the case study of Learning Process. The goal is to discover user interaction patterns within a learning execution environment and respond by making decisions based on the semantical analysis of the captured users data. Practically, the method applies semantic annotation and ontological representation of the learning process domain data and the resultant models in order to discover patterns automatically by means of semantic reasoning. Theoretically, the process mining and modelling method show that a way of addressing the common challenge with computational intelligent systems or methods is through an effectively well-designed and fit for purpose system that meets the requirements and needs of the intended users. In other words, this paper applies effective reasoning methods to make inferences over a process knowledge-base (e.g. learning process) that leads to an automated discovery of learning patterns or behaviour
Inductive reasoning in ontologies using conceptual spaces
Structured knowledge about concepts plays an increasingly
important role in areas such as information retrieval. The
available ontologies and knowledge graphs that encode such
conceptual knowledge, however, are inevitably incomplete.
This observation has led to a number of methods that aim
to automatically complete existing knowledge bases. Unfortunately,
most existing approaches rely on black box models,
e.g. formulated as global optimization problems, which
makes it difficult to support the underlying reasoning process
with intuitive explanations. In this paper, we propose a
new method for knowledge base completion, which uses interpretable
conceptual space representations and an explicit
model for inductive inference that is closer to human forms of
commonsense reasoning. Moreover, by separating the task of
representation learning from inductive reasoning, our method
is easier to apply in a wider variety of contexts. Finally, unlike
optimization based approaches, our method can naturally be
applied in settings where various logical constraints between
the extensions of concepts need to be taken into account
BeamSearchQA: Large Language Models are Strong Zero-Shot QA Solver
Open-domain question answering is a crucial task that often requires
accessing external information. Existing methods typically adopt a single-turn
retrieve-then-read approach, where relevant documents are first retrieved, and
questions are then answered based on the retrieved information. However, there
are cases where answering a question requires implicit knowledge that is not
directly retrievable from the question itself. In this work, we propose a novel
question-answering pipeline called BeamSearchQA. Our approach leverages large
language models to iteratively generate new questions about the original
question, enabling an iterative reasoning process. By iteratively refining and
expanding the scope of the question, our method aims to capture and utilize
hidden knowledge that may not be directly obtainable through retrieval. We
evaluate our approach on the widely-used open-domain NQ and WebQ datasets. The
experimental results demonstrate that BeamSearchQA significantly outperforms
other zero-shot baselines, indicating its effectiveness in tackling the
challenges of open-domain question answering.Comment: Work in progres
Context guided retrieval
This paper presents a hierarchical case representation that uses a context guided retrieval method The performance of this method is compared to that of a simple flat file representation using standard nearest neighbour retrieval. The data presented in this paper is more extensive than that presented in an earlier paper by the same authors. The estimation of the construction costs of light industrial warehouse buildings is used as the test domain. Each case in the system comprises approximately 400 features. These are structured into a hierarchical case representation that holds more general contextual features at its top and specific building elements at its leaves. A modified nearest neighbour retrieval algorithm is used that is guided by contextual similarity. Problems are decomposed into sub-problems and solutions recomposed into a final solution. The comparative results show that the context guided retrieval method using the hierarchical case representation is significantly more accurate than the simpler flat file representation and standard nearest neighbour retrieval
CBR and MBR techniques: review for an application in the emergencies domain
The purpose of this document is to provide an in-depth analysis of current reasoning engine practice and the integration strategies of Case Based Reasoning and Model Based Reasoning that will be used in the design and development of the RIMSAT system.
RIMSAT (Remote Intelligent Management Support and Training) is a European Commission funded project designed to:
a.. Provide an innovative, 'intelligent', knowledge based solution aimed at improving the quality of critical decisions
b.. Enhance the competencies and responsiveness of individuals and organisations involved in highly complex, safety critical incidents - irrespective of their location.
In other words, RIMSAT aims to design and implement a decision support system that using Case Base Reasoning as well as Model Base Reasoning technology is applied in the management of emergency situations.
This document is part of a deliverable for RIMSAT project, and although it has been done in close contact with the requirements of the project, it provides an overview wide enough for providing a state of the art in integration strategies between CBR and MBR technologies.Postprint (published version
Effective retrieval and new indexing method for case based reasoning: Application in chemical process design
In this paper we try to improve the retrieval step for case based reasoning for preliminary design. This improvement deals with three major parts of our CBR system. First, in the preliminary design step, some uncertainties like imprecise or unknown values remain in the description of the problem, because they need a deeper analysis to be withdrawn. To deal with this issue, the faced problem description is soften with the fuzzy sets theory. Features are described with a central value, a percentage of imprecision and a relation with respect to the central value. These additional data allow us to build a domain of possible values for each attributes. With this representation, the calculation of the similarity function is impacted, thus the characteristic function is used to calculate the local similarity between two features. Second, we focus our attention on the main goal of the retrieve step in CBR to find relevant cases for adaptation. In this second part, we discuss the assumption of similarity to find the more appropriated case. We put in highlight that in some situations this classical similarity must be improved with further knowledge to facilitate case adaptation. To avoid failure during the adaptation step, we implement a method that couples similarity measurement with adaptability one, in order to approximate the cases utility more accurately. The latter gives deeper information for the reusing of cases. In a last part, we present a generic indexing technique for the base, and a new algorithm for the research of relevant cases in the memory. The sphere indexing algorithm is a domain independent index that has performances equivalent to the decision tree ones. But its main strength is that it puts the current problem in the center of the research area avoiding boundaries issues. All these points are discussed and exemplified through the preliminary design of a chemical engineering unit operation
- …