Wei Wang, Q. Zheng, Jun Liu, Yingying Chen, Pengfei Tang
{"title":"Exploiting various information for knowledge element relation recognition","authors":"Wei Wang, Q. Zheng, Jun Liu, Yingying Chen, Pengfei Tang","doi":"10.1109/GRC.2009.5255057","DOIUrl":null,"url":null,"abstract":"Knowledge element relation recognition is to mine intrinsic and hidden relations, i.e., preorder, analogy and illustration from knowledge element set, which can be used in knowledge organization and knowledge navigation system. This paper focuses on what information is employed to recognize knowledge element relations. First, a formal definition of knowledge element and the types of relation are given. Next, an algorithm for knowledge element sort is proposed to gain the sequence number of knowledge element. Then, information of term, type, distance, knowledge element relation level and document level is selected to represent candidate relation instances. Evaluation on the four data sets related to “computer” discipline, using Support Vector Machines, shows that term, type and distance features contribute to most of the performance improvement, and incorporation of all features can achieve excellent performance of relation recognition, whose F1 Micro-averaged measure is above 83%.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Granular Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRC.2009.5255057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Knowledge element relation recognition is to mine intrinsic and hidden relations, i.e., preorder, analogy and illustration from knowledge element set, which can be used in knowledge organization and knowledge navigation system. This paper focuses on what information is employed to recognize knowledge element relations. First, a formal definition of knowledge element and the types of relation are given. Next, an algorithm for knowledge element sort is proposed to gain the sequence number of knowledge element. Then, information of term, type, distance, knowledge element relation level and document level is selected to represent candidate relation instances. Evaluation on the four data sets related to “computer” discipline, using Support Vector Machines, shows that term, type and distance features contribute to most of the performance improvement, and incorporation of all features can achieve excellent performance of relation recognition, whose F1 Micro-averaged measure is above 83%.