<<Taikichiro Mori Memorial Research Fund>>
Graduate Student Researcher Development Grant Report
Research Project: An Informative Projecting Model between Philosophical Concept Space and Computer Production Space
Project Researcher: Nguyen Thi Ngoc Diep
Affiliation: 2nd year Doctoral student, Graduate School of Media and Governance, Keio University, Japan
The rapid developing speed of technology in one hand brings a convenient life but in other hand, excludes delicate investigations into the nature of ideas and speculations. With a fine enough level of programming, one can program an in-hand application or system, but the remaining part is to make sense of the system: it is not only for entertainment. That is when one needs to dig deeper into the core of the computation, to reason and to understand the meaning of the running process, and to make interpretations for it. This research aims to develop an informative projecting system for philosophical concepts and computation methods with a belief that philosophy helps one argue for a point of their computation.
Assuming that there is a three-step mechanical process to achieve and expand knowledge:
1. Questioning (knowledge requestment)
Questions are asked based on innate curiosity about nature, human conditions, human imagination.
2. Interpretation (knowledge achievement)
For each question, there will be one or more interpretation according to either observation or experiment or reasoning methodology.
3. Investigation (knowledge expansion)
For each interpretation, one or many questions are asked for further investigation into the subject.
Research Activities and Results
Bipartite Graph Knowledge Representation Model
The nature of debating or dialogic discussion is exchanging arguments by questions and answers in which corresponding to one question, there may be many answers from many agents who have different perspectives to the question; then from each answer there will be many other questions that require to be clarified. Based on this obser- vation, this research proposes to use bipartite graphs (or digraphs) to model flows of debates or dialogues. A bipartite graph that has two disjoint vertex sets that are question and answer sets. Every edge connects a question to an answer holds an evidence for the answer and every edge connects an answer to a question holds an argument raised from the answer.
The figure 1 shows an example of a bipartite graph.
Directional Semantic Search Mechanism
The idea is to use graphs of others to update one’s graph as exemplified in figure 2.
The algorithm is generalized as following:
Work on progress:
- Data collection (philosophical topics and computational algorithms)
- User experience study and evaluation
- Debate mining algorithms design
- Publication (preparing)
I would like to express my gratitude to Taikichiro Mori Memorial Research Fund, which supports great financial policies to researchers like me to make progress on our ways.