论文信息 - Compressing the representation of a causal graph

Compressing the representation of a causal graph

The aim of this paper is to introduce procedure capable of compressing the representation of causal graphs, removing the redundant information introduced. In previous works we have presented several algorithms to extract causal information from text documents by means of a semi-automatic process. As result we obtained a causal graph connecting concepts related to a given topic.

José Angel Olivas | Cristina Puente | E. Garrido | R. Seisdedos

[1] Marc Najork,et al. Comparing the effectiveness of hits and salsa , 2007, CIKM '07.

[2] Rada Mihalcea,et al. Graph-based Ranking Algorithms for Sentence Extraction, Applied to Text Summarization , 2004, ACL.

[3] Syin Chan,et al. Extracting Causal Knowledge from a Medical Database Using Graphical Patterns , 2000, ACL.

[4] Christopher S. G. Khoo,et al. Automatic Extraction of Cause-Effect Information from Newspaper Text Without Knowledge-based Inferencing , 1998 .

[5] Alejandro Sobrino,et al. Extraction, analysis and representation of imperfect conditional and causal sentences by means of a semi-automatic process , 2010, International Conference on Fuzzy Systems.

[6] Euripides G. M. Petrakis,et al. Semantic similarity methods in wordNet and their application to information retrieval on the web , 2005, WIDM '05.

[7] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[8] Jennifer Widom,et al. SimRank: a measure of structural-context similarity , 2002, KDD.

[9] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[10] Gurpreet Singh Lehal,et al. A Survey of Text Summarization Extractive Techniques , 2010 .

[11] Andrea Esuli,et al. PageRanking WordNet Synsets: An Application to Opinion Mining , 2007, ACL.