Search (4 results, page 1 of 1)

  • × author_ss:"Nakamura, Y."
  • × language_ss:"e"
  1. Nakamura, Y.: Subdivisions vs. conjunctions : a discussion on concept theory (1998) 0.01 
    0.0060245167 = product of:
  0.015061291 = sum of:
    0.009535614 = weight(_text_:a in 69) [ClassicSimilarity], result of:
      0.009535614 = score(doc=69,freq=8.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.17835285 = fieldWeight in 69, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=69)
    0.005525676 = product of:
      0.011051352 = sum of:
        0.011051352 = weight(_text_:information in 69) [ClassicSimilarity], result of:
          0.011051352 = score(doc=69,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.13576832 = fieldWeight in 69, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0546875 = fieldNorm(doc=69)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    After studying the relations between two words(nouns) that constitute a compound term, the relation between corresponding concepts discussed. The impossibility of having a conjunction between two concepts that have no common feature causes inconvenience in the application of concept theory to information retrieval problems. Another kind of conjunctions, different from that by co-occurrence, is proposed and characteristics of this conjunction is studied. It revealed that one of new ones has the same character with colon combination in UDC. The possibility of having three kinds of conjunction including Wsterian concept conjunction is presented. It is also discussed that subdivisions can be replaced by new conjunctions
    Type
    a
  2. Nakamura, Y.; Ishikawa, T.: Expert systems for automatic UDC number assignment (1990) 0.00 
    0.003303234 = product of:
  0.01651617 = sum of:
    0.01651617 = weight(_text_:a in 257) [ClassicSimilarity], result of:
      0.01651617 = score(doc=257,freq=6.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.3089162 = fieldWeight in 257, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.109375 = fieldNorm(doc=257)
  0.2 = coord(1/5)
    Source
    The UDC: Essays for a new decade. Ed.: A. Gilchrist, D. Strachan
    Type
    a
  3. Nakamura, Y.: Expression of concepts in a classification system (1987) 0.00 
    0.0026970792 = product of:
  0.013485395 = sum of:
    0.013485395 = weight(_text_:a in 660) [ClassicSimilarity], result of:
      0.013485395 = score(doc=660,freq=4.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.25222903 = fieldWeight in 660, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.109375 = fieldNorm(doc=660)
  0.2 = coord(1/5)
    Type
    a
  4. Ishikawa, T.; Nakamura, H.; Nakamura, Y.: UDC number automatic combination system (1994) 0.00 
    0.0025228865 = product of:
  0.012614433 = sum of:
    0.012614433 = weight(_text_:a in 7732) [ClassicSimilarity], result of:
      0.012614433 = score(doc=7732,freq=14.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.23593865 = fieldWeight in 7732, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7732)
  0.2 = coord(1/5)
    Abstract
    In a large-scale classification system, such as UDC, users are often troubled during the process of finding a relevant classification number for his concept or term and producing (combining) a final compound classification number. UDC tables are now computerized in many language editions, and the MRF had released as a master file (database) by the UDCC in 1993. In this paper, a system function is described for a man-machine interactive system to support compound UDC number assignment, and the necessary re-organization of UDC data/file formats are considered for the use in the automatic classification number combination
    Type
    a

Authors

Years

Themes