Title
Using the K Nearest Neighbor Method and BM25 in the Patent Document Categorization Subtask at NTCIR-5
Abstract
Patent processing is extremely important for indus- try, business, and law. We participated in the F-term categorization subtask at NTCIR-5, in which, we clas- sified patent documents into their F-terms using the k-nearest neighbor method. For document classifica- tion, F-term categories are both very precise and use- ful. We entered five systems in the F-term categoriza- tion subtask. They obtained the best f-measures of all 18 participating systems. This confirmed the effective- ness of our method. After the contest, we performed the experiments again during the theme categoriza- tion subtask, even though we did not officially enter. The results showed that our system obtained higher f-measures than the highest obtained by the other sys- tems performing the subtask. This also confirmed the effectiveness of our method.
Year
Venue
Field
2005
NTCIR
Document classification,k-nearest neighbors algorithm,Categorization,Information retrieval,Computer science,CONTEST
DocType
Citations 
PageRank 
Conference
1
0.41
References 
Authors
5
4
Name
Order
Citations
PageRank
Masaki Murat1284.85
Toshiyuki Kanamaru241.21
Tamotsu Shirado3145.55
Hitoshi Isahara425.53