<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>An Agent-Oriented Personalized Web Searching System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tarek Helmy Satoshi Amamiya</string-name>
          <email>amamiya@al.is.kyushu-u.ac.jp</email>
          <email>helmy@al.is.kyushu-u.ac.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tsunenori Mine</string-name>
          <email>mine@al.is.kyushu-u.ac.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Intelligent Systems Kyushu University 6-1 Kasugakoen</institution>
          ,
          <addr-line>Kasuga-shi</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Web retrieval is now one of the most important issues in computer science, and we believe that applying multi-agent systems to this area is a promising approach. We introduce Kodama1 system, which is being developed and in use at Kyushu University, as a multi-agent-based approach to build a distributed Information Retrieval (IR) system that lets users retrieve relevant distributed information from the Web. We reported methods to agentify the Web, and to cluster the agentified domain into communities. In order to investigate the performance of our system, we carried out several experiments in multiple Server Agent domains and developed a smart query routing mechanism for routing the user's query. The results ensure that the idea of Web page agentification, clustering and routing techniques promise to achieve more relevant information.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        With the exponentially growing amount of information available on the Internet, the task of
retrieving relevant information consistent with the user’s information need has become
increasingly difficult and the users normally face with very large hit lists with low precision.
The information gathering and retrieving processes in the traditional search engine are
independent of the User’s Preference (UP), and therefore feedback from the later process is
hardly adaptive to improve the quality of the former process. Kodama project starts in response
to the need for a new kind of agent-oriented IR system that is completely different from the
traditional search engines populated on the Internet. Researchers in Artificial Intelligence (AI)
and Information Retrieval (IR) fields have already succeeded in developing multi-agent based
techniques to automate the management of information flooding [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. A way to partially address
the scalability problems posted by the size and dynamic nature of the Web is to divide the Web
into localized Sever Agents (SA) that agentify specific domains by a set of Web Page Agents
(WPA) developed in our project [
        <xref ref-type="bibr" rid="ref2 ref3 ref4">2,3,4</xref>
        ]. We will start by describing the agentification of the
Web servers and discuss the methodologies of clustering the agents into communities. We
introduce the routing mechanism of Kodama and the evaluation of Kodama agents.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Web Server Agentifcation</title>
      <p>
        Cooperating intelligent Kodama agents are employed to agentify the Web servers where the
infrastructure is preexisting in the form of Web links. Kodama system uses three types of agents in
the agentification mechanism for searching the Web. A SA assigned to each Web server, a WPA
assigned to each Web page, and a User Interface Agent (UIA) assigned to each user’s machine
[
        <xref ref-type="bibr" rid="ref2 ref3 ref4">2,3,4</xref>
        ]. The SA starts from the portal address of the Web server and creates the hyper structure of
WPAs communities based on the hyper link structure in the Web server, (see Figure 1). The SA
knows all the WPAs in the server and works as a gateway when the WPAs communicate with
each other or with one in another server. The SA clusters the WPAs into communities and
automatically defines its attributes to be used in the routing mechanism. The WPA analyzes and
continually keeps track of the content of its Web page. Each WPA has its own parser, to which the
WPA passes a URL, and an IP vector, in which the WPA keeps all the policy keywords found in
its URL. The WPA takes essential properties and principles given by the SA to create the IP as
ontology that represents the context of the Web page. The created WPAs register themselves to
the SA and write all the words into an IP file. An SA of n Web pages creates one IP file in which
the terms of the Web pages are represented as n vectors of keywords with a weight value assigned
to each keyword and modified according to the user's responses ( ℜ ). The WPA uses the IP to
decide whether or not the user’s query (qi) belongs to the WPA. At the retrieval phase, when the
WPAs receive a qi from a SA, initiate search by interpreting the qi and/or either asking “Is this
yours?” or announcing “This is yours,” to its down-chain WPAs. The selected WPAs and/or their
down-chain WPAs of each Web server, which in turn, interpret the qi according to their IPs and
reply the answer “This is mine” or “Not mine” with some confidence. The UIA is designed to
learn the UP either implicitly or explicitly from his/her browsing history. We have developed
Kodama's browser and investigated some sensors in correlation with the time of visiting the page
to let the UIA detects autonomously the actual user's implicit response. The UIA resides in the
user's machine, communicates with the WPAs via a SA to retrieve information relevant to the qi,
and shows the results returned by the WPAs to the user after filtering and re-ranking them. The
UIAs in Kodama system look over the shoulders of the users, receive ℜ of his/her interest/not
interest to the results and regard them as rewards to adapt the UP files. The UIA uses UP to
predict a user's action based on the similarity of the current query to the already learned UP.
a cluster of WPAs. Let Q be a set of cluster names {CNqi |1 ≤ i ≤ n,CNqi = {w j |1 ≤ j ≤ m}} ,
where w j is a keyword, n is the number of elements in Q. We call the number of elements in
a set, size. Thus, n is a size of Q, and m is a size of CNqi . Let q be a user's query, such
that q = {w j |1 ≤ j ≤ l} ( l is a size of q ) and ϕ be an empty set. The clustering procedure is as
following. Q ←ϕ , enter a query qi . If qi ∩ CNq j = ϕ for any CNq j ∈ Q , then create new
cluster Cqi that consists of a set of Web pages relevant to qi . Then, qi is assigned to CNqi ,
which is the name of Cqi , i.e. CNqi ← qi and Q ← Q ∪CNqi . For each CNq j ∈ Q, if
qi ∩CNq j ≠ ϕ and
qi ⊄ CNq j ,
then
      </p>
      <p>Q ← Q ∪CNqi , CNqi ← CNqi ∪ qi
and
CNqi ← CNqi ∪ k j for every k j ∈Tag . Where Tag is a set of keywords surrounded by
specific tags in such Web pages that are in Cq j and relevant to qi .</p>
    </sec>
    <sec id="sec-3">
      <title>4. Routing Mechanism of Kodama</title>
      <p>Although a single router is scalable enough to potentially handles of thousands of SAs. In
practice it is desirable to run a separate router for relevant SAs of a common topic. For
instances, the SAs of AAAI, IEEE and ACM portals belong to one router agent. The router
delegates the given query to the most popular and relevant SA. For each community of SAs,
there is a router agent that holds a set of attributes as ontology of each SA (see Table 1). Where
A11 to A1m means the set of attributes automatically determined by clustering the WPAs and
adapted by the system to reflect the ontology of the SA1. W is the weight value, which assigned
to each attribute and continually adapted based on the ℜ from the UIAs. Routing refers to the
process of selecting the relevant SA and forwarding queries to it to retrieve the Web pages
consistent with user's information need. Relevancy is used to determine the popularity of the
SA for a particular type of queries. Kodama system maintains the similarity Sij between qi and
the
attribute
fields
of</p>
      <p>SAj
of the
known</p>
      <sec id="sec-3-1">
        <title>SAs's table</title>
        <p>using
the
following
formula. S ij = ∑i w j,i ⋅ g (k i ) . Where, g(ki ) =1 if ki ∈qi ∩SAj , otherwise g (ki ) = 0 .</p>
      </sec>
      <sec id="sec-3-2">
        <title>Relevant SA</title>
        <p>SAt</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>5. Distributing Web Search on Kodama</title>
      <p>There should be a single entity that controls the list of router agents. When you register a router
agent, it goes through one of several dozen routers who work with Kodama to add names to the
list. Kodama, in turn, keeps a central database known as the router's database that contains
information about the profile of each router. Each of the routers has thousands of SAs and
handles its requests. While registering the SA into a router agent, the SA sends the names of its
clusters to be used for routing relevant queries into that SA. The routers are specialized agents
that send your query and those of every other UIAs to their relevant SAs along thousands of
pathways of SAs. When the router receives a query from the UIA, the router does the
followings with it. It asks for a list of relevant SAs. If the router agent found relevant SAs, it
assigns the request with specific SA because it already knows that this SA is relevant to this
query. Then, it merges the results of the query and sends them back to the UIA. Otherwise, it
forwards the queries to other routers if the results do not satisfy the user or the router could not
find a relevant SA. It may return an error message because the router could not find any
relevant SA.</p>
    </sec>
    <sec id="sec-5">
      <title>6. Experimental Results</title>
      <p>We have performed several experiments to make a consistent evaluation of Kodama system
performance. In the experiments, we agantified fifty Web servers by giving the portal addresses
of the Web servers to the system; the number of Web pages within the agentified servers varies
from 300 to 2500 pages. The system creates the hyper structure of the WPA communities based
on the hyperlink structure of each Web server and creates the SA's attributes to be used in the
router side for the routing. Then, the UIAs sent some queries to the system. We calculated the
Precision of the retrieved URLs to user’s queries. The results (see Fig. 2) show that the idea of
Web page agentification and the routing mechanisms promise to achieve more relevant
information to the users and also promoted using Kodama as a PinPoint IR system.
1 0 0
567432819 000000000
0
1 2 3 4 5 6 7 8 9 1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 0 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 3 0</p>
      <p>Q u e r i e s</p>
    </sec>
    <sec id="sec-6">
      <title>7. Conclusion and Future Work</title>
      <p>We introduced methods to agentify the Web, and to cluster the SAs and WPAs into communities.
We also introduced the routing mechanism of Kodama system to select the most relevant SA to
the given query. We carried out experiments to investigate the performance of Kodama system.
Through these experiments, we ensure that Kodama's techniques promise to achieve more
relevant information to the users. Currently, the routing of Kodama is a simple query routing that
binds to two hierarchical levels of router agents. We plan to scale it by increasing the number of
SAs and developing more sophisticated routing mechanism for maintaining multiple hierarchy of
router agents.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Edmund</surname>
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ping C. Koo</surname>
            , and
            <given-names>Elizabth D.</given-names>
          </string-name>
          <string-name>
            <surname>Liddy</surname>
          </string-name>
          , “
          <article-title>Evolving Intelligent Text-based Agents”</article-title>
          ,
          <source>Proc. of the 4th International Conference of Autonomous Agents, June</source>
          <volume>3</volume>
          -7- 2000, Spain, pp.
          <fpage>388</fpage>
          -
          <lpage>395</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T.</given-names>
            <surname>Helmy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Amamiya</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Amamiya</surname>
          </string-name>
          , “
          <article-title>Collaborative Kodama Agents with Automated Learning and Adapting for Personalized Web Searching”</article-title>
          ,
          <source>Proc. of the 13th Inter. Conference on Innovative Applications of AI (IAAI/IJCAI-2001)</source>
          , pp.
          <fpage>65</fpage>
          -
          <lpage>72</lpage>
          ,
          <year>August</year>
          7-
          <issue>9</issue>
          ,
          <year>2001</year>
          , USA.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>T.</given-names>
            <surname>Helmy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Amamiya</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Amamiya</surname>
          </string-name>
          , “
          <article-title>Pinpoint Web Searching and User Modeling on the Collaborative Kodama Agents”</article-title>
          ,
          <source>LNCS Proc. of the 2nd Inter. Conference on Electronic Commerce and Web Technologies EC-WEB</source>
          <year>2001</year>
          , pp.
          <fpage>305</fpage>
          -
          <lpage>314</lpage>
          , Sept.
          <year>2001</year>
          , Germany.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>T.</given-names>
            <surname>Helmy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Amamiya</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Amamiya</surname>
          </string-name>
          , “
          <article-title>User's Ontology-Based Autonomous Interface Agents”</article-title>
          ,
          <source>The Second Inter. Conference on Intelligent Agent Technology (IAT2001) Proc. book entitled “intelligent Agent Technology: Research and Development”</source>
          , pp.
          <fpage>264</fpage>
          -
          <lpage>273</lpage>
          , October 23-26, Japan.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>