Extracting Maximal Frequent Connecting Sequences for Entities

被引:0
|
作者
Yu, Wei [1 ]
Chen, Junpeng [2 ]
机构
[1] Hong Kong Polytech Univ, Dept Ind & Syst Engn, Hong Kong, Hong Kong, Peoples R China
[2] Wuhan Univ, Sch Comp Sci, Wuhan, Peoples R China
关键词
D O I
10.1109/KAM.2008.65
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Discovering semantic relationships between entities is a crucial problem for many data analysis work. Most recent studies, however, only focus on extracting predefined semantic instances, and the current semantic relationships representations are also weak. This paper presents a new method for extracting meaningful semantic relationships from unstructured natural language sources. The method is based on the maximal frequent connecting sequences extracted from the contexts of entities. For identifying the semantic relationships of entities, connecting terms are found out and used as the seeds to discover the maximal frequent connecting sequences. Experimental results show the effectiveness of our methods.
引用
收藏
页码:855 / 858
页数:4
相关论文
共 50 条
  • [1] Maximal Frequent Sequences for Document Classification
    Hai Nguyen Thi Tuyet
    Tan Hanh
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON ADVANCED TECHNOLOGIES FOR COMMUNICATIONS (ATC), 2016, : 152 - 157
  • [2] Maximal Frequent Item Sequences Mining
    Zhou Lijuan
    Zhang Zhang
    PROGRESS IN MEASUREMENT AND TESTING, PTS 1 AND 2, 2010, 108-111 : 1211 - 1216
  • [3] Document clustering based on maximal frequent sequences
    Hernandez-Reyes, Edith
    Garcia-Hernandez, Rene A.
    Carrasco-Ochoa, J. A.
    Martinez-Trinidad, J. Fco.
    ADVANCES IN NATURAL LANGUAGE PROCESSING, PROCEEDINGS, 2006, 4139 : 257 - 267
  • [4] Knowledge discovery in documents by extracting frequent word sequences
    Ahonen, H
    LIBRARY TRENDS, 1999, 48 (01) : 160 - 181
  • [5] Effect of Preprocessing on Extractive Summarization with Maximal Frequent Sequences
    Ledeneva, Yulia
    MICAI 2008: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5317 : 123 - 132
  • [6] Extracting sequential frequent itemsets from probabilistic sequences database
    Seddiki I.
    Nouioua F.
    Barkat A.
    International Journal of Information Technology, 2023, 15 (5) : 2509 - 2515
  • [7] Extracting uncertain temporal relations from mined frequent sequences
    Guil, Francisco
    Marin, Roque
    TIME 2006: THIRTEENTH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS, 2006, : 152 - +
  • [8] Efficient algorithms for mining and incremental update of maximal frequent sequences
    Kao, B
    Zhang, MH
    Yip, CL
    Cheung, DW
    DATA MINING AND KNOWLEDGE DISCOVERY, 2005, 10 (02) : 87 - 116
  • [9] A fast algorithm to find all the maximal frequent sequences in a text
    García-Hernández, RA
    Martínez-Trinidad, JF
    Carrasco-Ochoa, JA
    PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS AND APPLICATIONS, 2004, 3287 : 478 - 486
  • [10] A scalable algorithm for mining maximal frequent sequences using a sample
    Luo, Congnan
    Chung, Soon M.
    KNOWLEDGE AND INFORMATION SYSTEMS, 2008, 15 (02) : 149 - 179