Abstract
Patent management is increasingly important for organizations to sustain their competitive advantage. The classification of patents is essential for patent management and industrial analysis. In this study, we propose a novel patent network-based classification method to analyze query patents and predict their classes. The proposed patent network, which contains various types of nodes that represent different features extracted from patent documents, is constructed based on the relationship metrics derived from patent metadata. The novel approach analyzes reachable nodes in the patent ontology network to calculate their relevance to query patents, after which it uses the modified k-nearest neighbor classifier to classify query patents. We evaluate the performance of the proposed approach on a test dataset of patent documents obtained from the United States Patent and Trademark Office (USPTO), and compare it with the performance of the three conventional methods. The results demonstrate that the proposed patent network-based approach outperforms the conventional approaches.
Original language | English |
---|---|
Pages | 962-972 |
Number of pages | 11 |
State | Published - Jul 2010 |
Event | 14th Pacific Asia Conference on Information Systems, PACIS 2010 - Taipei, Taiwan Duration: 9 Jul 2010 → 12 Jul 2010 |
Conference
Conference | 14th Pacific Asia Conference on Information Systems, PACIS 2010 |
---|---|
Country/Territory | Taiwan |
City | Taipei |
Period | 9/07/10 → 12/07/10 |
Keywords
- K-nearest neighbor
- Patent classification
- Patent network analysis
- Patent ontology network