Dynamic search optimization for semantic webs using imperialistic competitive algorithm

Issue Date

5-2012

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 powerful semantic search engine could be designed. © 2012 IEEE.

Source or Periodical Title

2012 International Conference on Information Science and Applications, ICISA 2012

ISSN

2162-9048

Page

1-5

Document Type

Conference Paper

Physical Description

illustrations, tables, diagrams

Language

English

Subject

Dynamic search, Graph based search, imperialistic competitive algorithm, Web 3.0, Semantic Webs

Identifier

doi: 10.1109/ICISA.2012.6220931.

Digital Copy

yes

Link to Full Text

Share

COinS