Probable Transition Searching System

スポンサーリンク

概要

• 論文の詳細を見る

• A graph theory and a probability theory are very useful to discuss transition phenomena. We are interested in applying these theories to an information retrieval system which is represented by a weighted directed graph. This paper shows its theoretical foundation and its general property. Using the formula, we have realized the probable transition searching system with a FORTRAN program. The system can efficiently retrieve the most probable sequence of events which are connected with one another by a binary relation. If you can ideally abstract the binary relation and its weight from a concrete object, the model is applicable to any objects in virtue of the general technique.

• 一般社団法人情報処理学会の論文

著者

• Isomoto Yukuo

  Osaka University Computation Center Osaka University

• Isomoto Yukuo

  Osaka University Computation Center

• YAMAGATA Keiichi

  Faculty of Engineering, Osaka University

• Yamagata Keiichi

  Facully Of Engineering Osaka University

関連論文

• Theoretical Analysis on Thermal Behavior of a Disk in Profile Milling
• Test Method for a Computer Program of Characteristic Equations
• Guidance System for Structuring or Restructuring of a Database in Multiple Database Management Systems
• Probable Transition Searching System

スポンサーリンク