DocumentCode :
3461421
Title :
Making a Graph Database from Unstructured Text
Author :
Seungwoo Jeon ; Khosiawan, Yohanes ; Bonghee Hong
Author_Institution :
Dept. of Electr. & Comput. Eng., Pusan Nat. Univ., Pusan, South Korea
fYear :
2013
fDate :
3-5 Dec. 2013
Firstpage :
981
Lastpage :
988
Abstract :
From a huge volume of text of emails and SNS, it is required to extract human relations to determine whether or not there exist illegal connections each other. A graph structure becomes very useful for giving better representation of human relations compared with the original plain text. In this paper, we propose a way of constructing graph from a number of texts. To make the graph more concise and compact, it is also required to remove duplication and outliers in the graph. The key point of merging a graph structure is to perform automatic and semi-automatic merging method based on our novel merge-feasibility measurement. To justify our new methods of extracting and merging the graph structure, we describe the implementation and testing of our proposed system.
Keywords :
behavioural sciences computing; electronic mail; graph theory; text analysis; SNS; duplication removal; e-mail text; graph database; graph structure extraction; graph structure merging; human relation extraction; illegal connections; merge-feasibility measurement; outlier removal; semiautomatic merging method; social network services; unstructured text; Classification algorithms; Data mining; Databases; Educational institutions; Electronic mail; Merging; Tagging; graph extraction; graph merging; graph structure; human relation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Science and Engineering (CSE), 2013 IEEE 16th International Conference on
Conference_Location :
Sydney, NSW
Type :
conf
DOI :
10.1109/CSE.2013.144
Filename :
6755325
Link To Document :
بازگشت