Search (3 results, page 1 of 1)

0.020792855 = product of:
  0.04158571 = sum of:
    0.04158571 = product of:
      0.08317142 = sum of:
        0.08317142 = weight(_text_:k in 159) [ClassicSimilarity], result of:
          0.08317142 = score(doc=159,freq=4.0), product of:
            0.18639012 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.052213363 = queryNorm
            0.44622225 = fieldWeight in 159, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0625 = fieldNorm(doc=159)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

0.015916213 = product of:
  0.031832427 = sum of:
    0.031832427 = product of:
      0.06366485 = sum of:
        0.06366485 = weight(_text_:k in 933) [ClassicSimilarity], result of:
          0.06366485 = score(doc=933,freq=6.0), product of:
            0.18639012 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.052213363 = queryNorm
            0.34156775 = fieldWeight in 933, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0390625 = fieldNorm(doc=933)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The number of patent documents is currently rising rapidly worldwide, creating the need for an automatic categorization system to replace time-consuming and labor-intensive manual categorization. Because accurate patent classification is crucial to search for relevant existing patents in a certain field, patent categorization is a very important and useful field. As patent documents are structural documents with their own characteristics distinguished from general documents, these unique traits should be considered in the patent categorization process. In this paper, we categorize Japanese patent documents automatically, focusing on their characteristics: patents are structured by claims, purposes, effects, embodiments of the invention, and so on. We propose a patent document categorization method that uses the k-NN (k-Nearest Neighbour) approach. In order to retrieve similar documents from a training document set, some specific components to denote the so-called semantic elements, such as claim, purpose, and application field, are compared instead of the whole texts. Because those specific components are identified by various user-defined tags, first all of the components are clustered into several semantic elements. Such semantically clustered structural components are the basic features of patent categorization. We can achieve a 74% improvement of categorization performance over a baseline system that does not use the structural information of the patent.

0.014702768 = product of:
  0.029405536 = sum of:
    0.029405536 = product of:
      0.058811072 = sum of:
        0.058811072 = weight(_text_:k in 6581) [ClassicSimilarity], result of:
          0.058811072 = score(doc=6581,freq=2.0), product of:
            0.18639012 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.052213363 = queryNorm
            0.31552678 = fieldWeight in 6581, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0625 = fieldNorm(doc=6581)
      0.5 = coord(1/2)
  0.5 = coord(1/2)