On building maps of web pages with a cellular automaton
- Autores
- Azzag, Hanene; Ratsimba, David; Costa, David da; Guinot, Christiane; Venturrini, Giles
- Año de publicación
- 2006
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- We present in this paper a clustering algorithm which is based on a cellular automaton and which aims at displaying a map of web pages. We describe the main principles of methods that build such maps, and the main principles of cellular automata. We show how these principles can be applied to the problem of web pages clustering: the cells, which are organized in a 2D grid, can be either empty or may contain a page. The local transition function of cells favors the creation of groups of similar states (web pages) in neighbouring cells. We then present the visual results obtained with our method on standard data as well as on sets of documents. These documents are thus organized into a visual map which eases the browsing of these pages
1st IFIP International Conference on Biologically Inspired Cooperative Computing - Web Organization
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Clustering
Algorithms
Cellular arrays and automata - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/23998
Ver los metadatos del registro completo
id |
SEDICI_10841c233aae5721a6f0af3dca868a0b |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/23998 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
On building maps of web pages with a cellular automatonAzzag, HaneneRatsimba, DavidCosta, David daGuinot, ChristianeVenturrini, GilesCiencias InformáticasClusteringAlgorithmsCellular arrays and automataWe present in this paper a clustering algorithm which is based on a cellular automaton and which aims at displaying a map of web pages. We describe the main principles of methods that build such maps, and the main principles of cellular automata. We show how these principles can be applied to the problem of web pages clustering: the cells, which are organized in a 2D grid, can be either empty or may contain a page. The local transition function of cells favors the creation of groups of similar states (web pages) in neighbouring cells. We then present the visual results obtained with our method on standard data as well as on sets of documents. These documents are thus organized into a visual map which eases the browsing of these pages1st IFIP International Conference on Biologically Inspired Cooperative Computing - Web OrganizationRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23998enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34632-5info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-10T11:59:02Zoai:sedici.unlp.edu.ar:10915/23998Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-10 11:59:02.388SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
On building maps of web pages with a cellular automaton |
title |
On building maps of web pages with a cellular automaton |
spellingShingle |
On building maps of web pages with a cellular automaton Azzag, Hanene Ciencias Informáticas Clustering Algorithms Cellular arrays and automata |
title_short |
On building maps of web pages with a cellular automaton |
title_full |
On building maps of web pages with a cellular automaton |
title_fullStr |
On building maps of web pages with a cellular automaton |
title_full_unstemmed |
On building maps of web pages with a cellular automaton |
title_sort |
On building maps of web pages with a cellular automaton |
dc.creator.none.fl_str_mv |
Azzag, Hanene Ratsimba, David Costa, David da Guinot, Christiane Venturrini, Giles |
author |
Azzag, Hanene |
author_facet |
Azzag, Hanene Ratsimba, David Costa, David da Guinot, Christiane Venturrini, Giles |
author_role |
author |
author2 |
Ratsimba, David Costa, David da Guinot, Christiane Venturrini, Giles |
author2_role |
author author author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Clustering Algorithms Cellular arrays and automata |
topic |
Ciencias Informáticas Clustering Algorithms Cellular arrays and automata |
dc.description.none.fl_txt_mv |
We present in this paper a clustering algorithm which is based on a cellular automaton and which aims at displaying a map of web pages. We describe the main principles of methods that build such maps, and the main principles of cellular automata. We show how these principles can be applied to the problem of web pages clustering: the cells, which are organized in a 2D grid, can be either empty or may contain a page. The local transition function of cells favors the creation of groups of similar states (web pages) in neighbouring cells. We then present the visual results obtained with our method on standard data as well as on sets of documents. These documents are thus organized into a visual map which eases the browsing of these pages 1st IFIP International Conference on Biologically Inspired Cooperative Computing - Web Organization Red de Universidades con Carreras en Informática (RedUNCI) |
description |
We present in this paper a clustering algorithm which is based on a cellular automaton and which aims at displaying a map of web pages. We describe the main principles of methods that build such maps, and the main principles of cellular automata. We show how these principles can be applied to the problem of web pages clustering: the cells, which are organized in a 2D grid, can be either empty or may contain a page. The local transition function of cells favors the creation of groups of similar states (web pages) in neighbouring cells. We then present the visual results obtained with our method on standard data as well as on sets of documents. These documents are thus organized into a visual map which eases the browsing of these pages |
publishDate |
2006 |
dc.date.none.fl_str_mv |
2006-08 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/23998 |
url |
http://sedici.unlp.edu.ar/handle/10915/23998 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/isbn/0-387-34632-5 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1842903789319749633 |
score |
12.993085 |