• DocumentCode
    475925
  • Title

    Mining lexical hyponymy relations from large-scale concept set

  • Author

    Zhou, Jia-yu ; Pu, Yan ; Li, Jing-jing

  • Author_Institution
    Sch. of Comput. & Inf. Technol., Beijing Jiaotong Univ., Beijing
  • Volume
    1
  • fYear
    2008
  • fDate
    12-15 July 2008
  • Firstpage
    281
  • Lastpage
    286
  • Abstract
    Inner structures of Chinese lexical concepts have embedded some useful semantic relations. In this paper, we proposed a new statistical approach to mine lexical hyponymy relations from large-scale concept set, instead of analyzing inner structures. Firstly we designed common suffix tree to cluster the lexical concept set. Class concepts are then extracted by statistic-base rules we investigated in concept set. Finally, we export hyponymy relations from the common suffix tree. Experimental result showed us that this approach achieved a precision of 95.833% and a recall of 67.241% when the concept size achieved 800,000.
  • Keywords
    data mining; set theory; trees (mathematics); Chinese lexical concepts; common suffix tree; large-scale concept set; lexical hyponymy relations; mining lexical hyponymy relations; semantic relations; statistic-base rules; statistical approach; Clustering algorithms; Cybernetics; Data mining; Embedded computing; Information technology; Instruction sets; Large-scale systems; Machine learning; Natural language processing; Statistics; Common Suffix Tree; Information Extraction; Knowledge Acquisition; Lexical Hyponymy Relation Acquisition; Suffix Probability Inflexion Rule;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2008 International Conference on
  • Conference_Location
    Kunming
  • Print_ISBN
    978-1-4244-2095-7
  • Electronic_ISBN
    978-1-4244-2096-4
  • Type

    conf

  • DOI
    10.1109/ICMLC.2008.4620418
  • Filename
    4620418