Extraction of non-hierarchical relations from domain texts

被引：4
作者：
Punuru, Janardhana [1 ]
Chen, Jianhua [1 ]
机构：
[1] Louisiana State Univ, Dept Comp Sci, Baton Rouge, LA 70803 USA
来源：
2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DATA MINING, VOLS 1 AND 2 | 2007年
基金：
美国国家科学基金会;
关键词：
D O I：
10.1109/CIDM.2007.368908
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Ontology of a domain mainly consists of concepts, hierarchical relations, and non-hierarchical relations. Even though there exists a variety of methods for extracting concepts and hierarchical relations, very little concentration is on identification and labeling of non-hierarchical relations. In this paper, we present an unsupervised technique for the identification of non- hierarchical relations between the concepts using VF*ICF metric and log-likelihood ratios. The proposed approach is experimented with the electronic voting domain texts and is also compared with one of the existing approaches.
引用
收藏
页码：444 / 449
页数：6
相关论文
共 23 条
  • [1] BERLAND M, P 37 ANN M ASS COMP, P57
  • [2] The Semantic Web - A new form of Web content that is meaningful to computers will unleash a revolution of new possibilities
    Berners-Lee, T
    Hendler, J
    Lassila, O
    [J]. SCIENTIFIC AMERICAN, 2001, 284 (05) : 34 - +
  • [3] CARABALLO SA, 37 ANN M ASS COMP LI
  • [4] CEDERBERG S, 2003, P C NAT LANG EDM CAN
  • [5] CIARAMITA M, 2005, P 19 INT JOINT C ART
  • [6] Dunning T., 1993, Computational Linguistics, V19, P61
  • [7] FAURE D, 1998, P LREC WORKSH AD LEX, P5
  • [8] GIRJU R, P HLT NAACL 03, P80
  • [9] Girju Roxana, 2002, FLAIRS C, P360
  • [10] HASEGAWA T, 2004, P ASS COMP LING
123