By Topic

Dynamic Search Optimization for Semantic Webs Using Imperialistic Competitive Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Rasekh, I. ; Inst. of Comput. Sci., Univ. of Philippines at Los-Banos Los-Banos, Laguna, Philippines

Web 3.0 is known as next generation of web technology after linear presentation of information (Web 1.0) and multi-linear presentation of information (Web 2.0) .Semantic Web is a new collaborative movement toward Web3.0 that led by the World Wide Web Consortium (W3C) .the Semantic Web aims at converting the current web of unstructured documents into a "web of data". Searching is a big challenge in semantic web. Its searching strategy is graph structured search (GSS). It is quite different with the current structure of Web documents. GSS defines as a graph of relationships between anchor nodes but still there is no sufficient search engine designed for it. In this paper we tried to use imperialistic Competitive Algorithm (ICA) to improve Semantic Web Searching. By using ICA, a structured scheme, a pow.erful semantic search engine could be designed.

Published in:

Information Science and Applications (ICISA), 2012 International Conference on

Date of Conference:

23-25 May 2012