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
来源
KAM: 2008 INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING, PROCEEDINGS | 2008年
关键词
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 条
  • [21] FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences
    Tin Truong
    Hai Duong
    Bac Le
    Fournier-Viger, Philippe
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2019, 85 : 1 - 20
  • [22] PALM: A Parallel Mining Algorithm for Extracting Maximal Frequent Conceptual Links from Social Networks
    Stattner, Erick
    Eugenie, Reynald
    Collard, Martine
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2017, PT II, 2017, 10439 : 259 - 274
  • [23] EXiT-B: A new approach for extracting maximal frequent subtrees from XML data
    Paik, J
    Won, D
    Fotouhi, F
    Kim, UM
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING IDEAL 2005, PROCEEDINGS, 2005, 3578 : 1 - 8
  • [24] Drug-Drug Interaction Detection: A New Approach Based on Maximal Frequent Sequences
    Garcia-Blasco, Sandra
    Danger, Roxana
    Rosso, Paolo
    PROCESAMIENTO DEL LENGUAJE NATURAL, 2010, (45): : 263 - 266
  • [25] Extracting Geospatial Entities from Wikipedia
    Witmer, Jeremy
    Kalita, Jugal
    2009 IEEE THIRD INTERNATIONAL CONFERENCE ON SEMANTIC COMPUTING (ICSC 2009), 2009, : 450 - 457
  • [26] A Survey on extracting Frequent Subgraphs
    Thomas, Susanna
    Nair, Jyothisha. J.
    2016 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2016, : 2290 - 2295
  • [27] Finding Frequent Entities in Continuous Data
    Alet, Ferran
    Chitnis, Rohan
    Kaelbling, Leslie P.
    Lozano-Perez, Tomas
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 1992 - 1999
  • [28] Document Clustering using Sequential Pattern (SP) Maximal Frequent Sequences (MFS) as SP representation
    Rahmawati, Dini
    Saptawati, G. A. Putri
    Widyani, Yani
    2015 INTERNATIONAL CONFERENCE ON DATA AND SOFTWARE ENGINEERING (ICODSE), 2015, : 98 - 102
  • [29] An efficient algorithm for mining maximal frequent sequences by Top-Down Delay Decomposition method
    Ren, J. (jdren@ysu.edu.cn), 2007, ICIC Express Letters Office (08):
  • [30] Mining maximal frequent itemsets with frequent pattern list
    Qian, Jin
    Ye, Feiyue
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 1, PROCEEDINGS, 2007, : 628 - 632