Search (1 results, page 1 of 1)

  • × author_ss:"Palakal, M."
  • × theme_ss:"Automatisches Klassifizieren"
  1. Mukhopadhyay, S.; Peng, S.; Raje, R.; Palakal, M.; Mostafa, J.: Multi-agent information classification using dynamic acquaintance lists (2003) 0.02
    0.020141672 = product of:
      0.08056669 = sum of:
        0.08056669 = weight(_text_:communication in 1755) [ClassicSimilarity], result of:
          0.08056669 = score(doc=1755,freq=4.0), product of:
            0.19902779 = queryWeight, product of:
              4.317879 = idf(docFreq=1601, maxDocs=44218)
              0.046093877 = queryNorm
            0.4048012 = fieldWeight in 1755, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.317879 = idf(docFreq=1601, maxDocs=44218)
              0.046875 = fieldNorm(doc=1755)
      0.25 = coord(1/4)
    
    Abstract
    There has been considerable interest in recent years in providing automated information services, such as information classification, by means of a society of collaborative agents. These agents augment each other's knowledge structures (e.g., the vocabularies) and assist each other in providing efficient information services to a human user. However, when the number of agents present in the society increases, exhaustive communication and collaboration among agents result in a [arge communication overhead and increased delays in response time. This paper introduces a method to achieve selective interaction with a relatively small number of potentially useful agents, based an simple agent modeling and acquaintance lists. The key idea presented here is that the acquaintance list of an agent, representing a small number of other agents to be collaborated with, is dynamically adjusted. The best acquaintances are automatically discovered using a learning algorithm, based an the past history of collaboration. Experimental results are presented to demonstrate that such dynamically learned acquaintance lists can lead to high quality of classification, while significantly reducing the delay in response time.