Using Soft-Matching Mined Rules to Improve Information Extraction

作者: Un Yong Nahm , Raymond J. Mooney

DOI:

关键词:

摘要: By discovering predictive relationships between different pieces of extracted data, data-mining algorithms can be used to improve the accuracy information extraction. However, textual variation due typos, abbreviations, and other sources prevent productive discovery utilization hard-matching rules. Recent methods for inducing softmatching rules from data more effectively find exploit in data. This paper presents techniques using mined soft-matching association increase Experimental results on a corpus computer-science job postings demonstrate that extraction than

参考文章(24)
John M. Pierre, Mining Knowledge from Text Collections Using Automatically Generated Metadata practical aspects of knowledge management. pp. 537- 548 ,(2002) , 10.1007/3-540-36277-0_47
Nicholas Kushmerick, Dayne Freitag, Boosted Wrapper Induction national conference on artificial intelligence. pp. 577- 583 ,(2000)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Xindong Wu, Chengqi Zhang, Shichao Zhang, Mining Both Positive and Negative Association Rules international conference on machine learning. pp. 658- 665 ,(2002)
Kamal Nigam, Andrew McCallum, A comparison of event models for naive bayes text classification national conference on artificial intelligence. pp. 41- 48 ,(1998)
R. Ghani, A.E. Fano, Using text mining to infer semantic attributes for retail data mining international conference on data mining. pp. 195- 202 ,(2002) , 10.1109/ICDM.2002.1183903
Gerard Salton, Automatic text processing: the transformation, analysis, and retrieval of information by computer Addison-Wesley Longman Publishing Co., Inc.. ,(1989)