Learning Stochastic Logical Automaton

Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic models through inductive generalisation. The inductive generalisation algorithms consist of three parts. The first part describes the graphical generalisation of state transition models. State transition models are generalised by applying state mergers. The second part involves symbolic generalisation of logic programs which are embedded in each states. Plotkin’s LGG is used for symbolic generalisation of logic programs. The third part covers learning of parameters using statistics derived from the input sequences. The state transitions are unobservable in our settings. The probability distributions over the state transitions and actions are estimated using the EM algorithm. As an application of these algorithms, we learn chemical reaction rules from StochSim, the stochastic software simulator of biochemical r...

• Type: Conference
• Year: 2005
• Where: JSAI
• Authors: Hiroaki Watanabe, Stephen Muggleton
• Keywords: Generalisation, Inductive Generalisation, JSAI 2005, State Transitions