File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

나승훈

Na, Seung-Hoon
Natural Language Processing Lab
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 1182 -
dc.citation.number 5 -
dc.citation.startPage 1173 -
dc.citation.title INFORMATION PROCESSING & MANAGEMENT -
dc.citation.volume 43 -
dc.contributor.author Kang, In-Su -
dc.contributor.author Na, Seung-Hoon -
dc.contributor.author Kim, Jungi -
dc.contributor.author Lee, Jong-Hyeok -
dc.date.accessioned 2025-04-25T15:13:57Z -
dc.date.available 2025-04-25T15:13:57Z -
dc.date.created 2025-04-08 -
dc.date.issued 2007-09 -
dc.description.abstract Through the recent NTCIR workshops, patent retrieval casts many challenging issues to information retrieval community. Unlike newspaper articles, patent documents are very long and well structured. These characteristics raise the necessity to reassess existing retrieval techniques that have been mainly developed for structure-less and short documents such as newspapers. This study investigates cluster-based retrieval in the context of invalidity search task of patent retrieval. Cluster-based retrieval assumes that clusters would provide additional evidence to match user's information need. Thus far, cluster-based retrieval approaches have relied on automatically-created clusters. Fortunately, all patents have manuallyassigned cluster information, international patent classification codes. International patent classification is a standard taxonomy for classifying patents, and has currently about 69,000 nodes which are organized into a five-level hierarchical system. Thus, patent documents could provide the best test bed to develop and evaluate cluster-based retrieval techniques. Experiments using the NTCIR-4 patent collection showed that the cluster-based language model could be helpful to improving the cluster-less baseline language model. (c) 2006 Elsevier Ltd. All rights reserved. -
dc.identifier.bibliographicCitation INFORMATION PROCESSING & MANAGEMENT, v.43, no.5, pp.1173 - 1182 -
dc.identifier.doi 10.1016/j.ipm.2006.11.006 -
dc.identifier.issn 0306-4573 -
dc.identifier.scopusid 2-s2.0-34247387208 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/86841 -
dc.identifier.wosid 000246869800003 -
dc.language 영어 -
dc.publisher ELSEVIER SCI LTD -
dc.title Cluster-based patent retrieval -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Computer Science, Information Systems; Information Science & Library Science -
dc.relation.journalResearchArea Computer Science; Information Science & Library Science -
dc.type.docType Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor invalidity search -
dc.subject.keywordAuthor international patent classification -
dc.subject.keywordAuthor cluster-based retrieval -
dc.subject.keywordAuthor patent retrieval -
dc.subject.keywordPlus INFORMATION-RETRIEVAL -
dc.subject.keywordPlus DOCUMENT-RETRIEVAL -
dc.subject.keywordPlus MODEL -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.