Welcome to the InfoSci Platform
Reference Hub11
A Hierarchical Online Classifier for Patent Categorization

A Hierarchical Online Classifier for Patent Categorization

Domonkos Tikk, György Biro, Attila Törcsvári
Copyright: © 2008 |Pages: 24
ISBN13: 9781599043739|ISBN10: 1599043734|ISBN13 Softcover: 9781616926533|EISBN13: 9781599043753
DOI: 10.4018/978-1-59904-373-9.ch012
Cite Chapter Cite Chapter

MLA

Tikk, Domonkos, et al. "A Hierarchical Online Classifier for Patent Categorization." Emerging Technologies of Text Mining: Techniques and Applications, edited by Hercules Antonio do Prado and Edilson Ferneda, IGI Global, 2008, pp. 244-267. https://doi.org/10.4018/978-1-59904-373-9.ch012

APA

Tikk, D., Biro, G., & Törcsvári, A. (2008). A Hierarchical Online Classifier for Patent Categorization. In H. do Prado & E. Ferneda (Eds.), Emerging Technologies of Text Mining: Techniques and Applications (pp. 244-267). IGI Global. https://doi.org/10.4018/978-1-59904-373-9.ch012

Chicago

Tikk, Domonkos, György Biro, and Attila Törcsvári. "A Hierarchical Online Classifier for Patent Categorization." In Emerging Technologies of Text Mining: Techniques and Applications, edited by Hercules Antonio do Prado and Edilson Ferneda, 244-267. Hershey, PA: IGI Global, 2008. https://doi.org/10.4018/978-1-59904-373-9.ch012

Export Reference

Mendeley
Favorite

Abstract

Abstract: Patent categorization (PC) is a typical application area of text categorization (TC). TC can be applied in different scenarios at the work of patent offices depending on at what stage the categorization is needed. This is a challenging field for TC algorithms, since the applications have to deal simultaneously with large number of categories (in the magnitude of 1000–10000) organized in hierarchy, large number of long documents with huge vocabularies at training, and they are required to work fast and accurate at on-the-fly categorization. In this paper we present a hierarchical online classifier, called HITEC, which meets the above requirements. The novelty of the method relies on the taxonomy dependent architecture of the classifier, the applied weight updating scheme, and on the relaxed category selection method. We evaluate the presented method on two large English patent application databases, the WIPO-alpha and the Espace A/B corpora. We also compare the presented method to other TC algorithms on these collections, and show that it outperforms them significantly.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.