2026-03-11T17:11:03Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00079534 2025-01-20T06:54:04Z 581:6276:6633

Incremental Construction of Causal Network from News Articles Incremental Construction of Causal Network from News Articles Hiroshi, Ishii Qiang, Ma Masatoshi, Yoshikawa Hiroshi, Ishii Qiang, Ma Masatoshi, Yoshikawa 特集：情報爆発時代におけるIT基盤技術 We propose a novel method for the incremental construction of causal networks to clarify the relationships among news events. We propose the Topic-Event Causal (TEC) model as a causal network model and an incremental constructing method based on it. In the TEC model, a causal relation is expressed using a directed graph and a vertex representing an event. A vertex contains structured keywords consisting of topic keywords and an SVO tuple. An SVO tuple, which consists of a tuple of subject,verb and object keywords represent the details of the event. To obtain a chain of causal relations, vertices representing a similar event need to be detected. We reduce the time taken to detect them by restricting the calculation to topics using topic keywords. We detect them on a concept level. We propose an identification method that identifies the sense of the keywords and introduce three semantic distance methods to compare keywords. Our method detects vertices representing similar events more precisely than conventional methods. We carried out experiments to validate the proposed methods. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.1 (online) DOI　http://dx.doi.org/10.2197/ipsjjip.20.207 ------------------------------ We propose a novel method for the incremental construction of causal networks to clarify the relationships among news events. We propose the Topic-Event Causal (TEC) model as a causal network model and an incremental constructing method based on it. In the TEC model, a causal relation is expressed using a directed graph and a vertex representing an event. A vertex contains structured keywords consisting of topic keywords and an SVO tuple. An SVO tuple, which consists of a tuple of subject,verb and object keywords represent the details of the event. To obtain a chain of causal relations, vertices representing a similar event need to be detected. We reduce the time taken to detect them by restricting the calculation to topics using topic keywords. We detect them on a concept level. We propose an identification method that identifies the sense of the keywords and introduce three semantic distance methods to compare keywords. Our method detects vertices representing similar events more precisely than conventional methods. We carried out experiments to validate the proposed methods. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.1 (online) DOI　http://dx.doi.org/10.2197/ipsjjip.20.207 ------------------------------ 2011-12-15 eng journal article https://ipsj.ixsq.nii.ac.jp/records/79534 1882-7764 AN00116647 情報処理学会論文誌 52 12 https://ipsj.ixsq.nii.ac.jp/record/79534/files/IPSJ-JNL5212040.pdf application/pdf 1.8 MB 2013-12-15