Computational models of relevance propagation in web directories

Web Directories consist of large collections of links to websites, arranged by topic in different categories. The structure of Web Directories is typically not flat, since there are hierarchical and non-hierarchical relationships among topics. As a consequence, websites classified under certain topi...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Xamena, Eduardo, Brignole, Nélida Beatriz, Maguitman, Ana Gabriela
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2011
Materias:	Ciencias Informáticas Computational Models Web Directories
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/125240
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

id	I19-R120-10915-125240
record_format	dspace
institution	Universidad Nacional de La Plata
institution_str	I-19
repository_str	R-120
collection	SEDICI (UNLP)
language	Inglés
topic	Ciencias Informáticas Computational Models Web Directories
spellingShingle	Ciencias Informáticas Computational Models Web Directories Xamena, Eduardo Brignole, Nélida Beatriz Maguitman, Ana Gabriela Computational models of relevance propagation in web directories
topic_facet	Ciencias Informáticas Computational Models Web Directories
description	Web Directories consist of large collections of links to websites, arranged by topic in different categories. The structure of Web Directories is typically not flat, since there are hierarchical and non-hierarchical relationships among topics. As a consequence, websites classified under certain topic may be relevant to other topics. While some of these relevance relations are explicit, most of them must be discovered by an analysis of the structure of these directories. This paper proposes a family of models of relevance propagation in Web Directories. An efficient computational framework for inferring implicit relevance relations is described. The framework presented here combines the use of matrices to represent relevance relations and the application of boolean operations on these matrices to infer implicit relations. Nine different models were computed for a portion of the Open Directory Project graph consisting of more than half a million nodes and approximately 1.5 million edges of different types. The models were compared by performing both a quantitative and qualitative analysis on them. It is found that some general difficulties rule out the possibility of defining flawless models of relevance propagation that only take into account structural features of Web Directories.
format	Objeto de conferencia Objeto de conferencia
author	Xamena, Eduardo Brignole, Nélida Beatriz Maguitman, Ana Gabriela
author_facet	Xamena, Eduardo Brignole, Nélida Beatriz Maguitman, Ana Gabriela
author_sort	Xamena, Eduardo
title	Computational models of relevance propagation in web directories
title_short	Computational models of relevance propagation in web directories
title_full	Computational models of relevance propagation in web directories
title_fullStr	Computational models of relevance propagation in web directories
title_full_unstemmed	Computational models of relevance propagation in web directories
title_sort	computational models of relevance propagation in web directories
publishDate	2011
url	http://sedici.unlp.edu.ar/handle/10915/125240
work_keys_str_mv	AT xamenaeduardo computationalmodelsofrelevancepropagationinwebdirectories AT brignolenelidabeatriz computationalmodelsofrelevancepropagationinwebdirectories AT maguitmananagabriela computationalmodelsofrelevancepropagationinwebdirectories
bdutipo_str	Repositorios
_version_	1764820451429711874

Computational models of relevance propagation in web directories

Ejemplares similares