Dynamic Search Optimization for Semantic Webs Using Imperialistic Competitive Algorithm

Author

Rasekh, Iman

Author_Institution

Inst. of Comput. Sci., Univ. of Philippines at Los-Banos Los-Banos, Laguna, Philippines

fYear

2012

fDate

23-25 May 2012

Firstpage

1

Lastpage

5

Abstract

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.

Keywords

data structures; document handling; groupware; search engines; search problems; semantic Web; GSS; ICA; W3C; Web 1.0; Web 2.0; Web 3.0; Web document structure; Web technology; Web-of-data; World Wide Web Consortium; collaborative movement; dynamic search optimization; graph structured search; imperialistic competitive algorithm; linear information presentation; multilinear information presentation; semantic Web searching improvement; semantic Webs; semantic search engine; unstructured documents; Algorithm design and analysis; Heuristic algorithms; Microstrip; OWL; Resource description framework; Web sites;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Suwon

Print_ISBN

978-1-4673-1402-2

Type

conf

DOI

10.1109/ICISA.2012.6220931

Filename

6220931