Revealing paths of relevant information in web graphs

Kouzas, G; Kolias, V; Anagnostopoulos, I; Kayafas, E

dc.contributor.author	Kouzas, G	en
dc.contributor.author	Kolias, V	en
dc.contributor.author	Anagnostopoulos, I	en
dc.contributor.author	Kayafas, E	en
dc.date.accessioned	2014-03-01T01:31:48Z
dc.date.available	2014-03-01T01:31:48Z
dc.date.issued	2009	en
dc.identifier.issn	15715736	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19933
dc.subject	Ant Colony Optimization	en
dc.subject	Web Graph	en
dc.subject	Web Search	en
dc.title	Revealing paths of relevant information in web graphs	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/978-1-4419-0221-4_14	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-1-4419-0221-4_14	en
heal.publicationDate	2009	en
heal.abstract	In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a user's query. The algorithm aims to trace routes between hyperlinks, which connect two or more relevant information nodes of a web graph, with the minimum possible cost. The methodology uses the Ant-Seeker algorithm, where agents in the web paradigm are considered as ants capable of generating routing paths of relevant information through a web graph. The paper provides the implementation details of the web search methodology proposed, along with its initial assessment, which presents with quite promising results. © 2009 International Federation for Information Processing.	en
heal.journalName	IFIP International Federation for Information Processing	en
dc.identifier.doi	10.1007/978-1-4419-0221-4_14	en
dc.identifier.volume	296	en
dc.identifier.spage	105	en
dc.identifier.epage	112	en