確率推移検索システム

概要

論文の詳細を見る
Recently, a graph theory and a probability theory have been applied to various fields of researches in a computer science. It is convenient to discuss transition phenomena with the use of a directed graph and a concept of probability. And also, we are interested in developing a question-answering system by the aid of the graph theory and the probability theory. One of the purposes of this paper is to make a theoretical foundation of the system on these theories. This paper shows a formulation with which Markov chain graphs having transition probabilities are effciently analyzed by a computer. Using the formulation, we have realized the probable transition searching system in a FORTRAN program. The system analyzes just only the structure of directed graphs, apart from the concrete meanings of the graphs. Then, we consider that the system has many possibilities of applications.
一般社団法人情報処理学会の論文
1976-08-15