Embeddings, connectivity and minimum spanning trees in dimensionality reduction

In this work we follow the idea of using connectivity properties of graphs in order to build a graph that represents the underlying manifold without a trial and error procedure. A theoretic explanation of the right choice for graph building is presented in terms of topological, graph and physical co...

Full description

Autores:
Quintero Peña, Carlos Andrés
Tipo de recurso:
Fecha de publicación:
2011
Institución:
Universidad de los Andes
Repositorio:
Séneca: repositorio Uniandes
Idioma:
eng
OAI Identifier:
oai:repositorio.uniandes.edu.co:1992/11392
Acceso en línea:
http://hdl.handle.net/1992/11392
Palabra clave:
Variedades (Matemáticas) - Investigaciones
Análisis de componentes principales
Arboles de expansión (Teoría de grafos)
Ingeniería
Rights
openAccess
License
https://repositorio.uniandes.edu.co/static/pdf/aceptacion_uso_es.pdf
id UNIANDES2_9d9c443717070bd306934c77b00e2bd6
oai_identifier_str oai:repositorio.uniandes.edu.co:1992/11392
network_acronym_str UNIANDES2
network_name_str Séneca: repositorio Uniandes
repository_id_str
spelling Al consultar y hacer uso de este recurso, está aceptando las condiciones de uso establecidas por los autores.https://repositorio.uniandes.edu.co/static/pdf/aceptacion_uso_es.pdfinfo:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Lozano Martínez, Fernando Enriquevirtual::14309-1Quintero Peña, Carlos Andrés536866002018-09-28T07:56:00Z2018-09-28T07:56:00Z2011http://hdl.handle.net/1992/11392u445193.pdfinstname:Universidad de los Andesreponame:Repositorio Institucional Sénecarepourl:https://repositorio.uniandes.edu.co/In this work we follow the idea of using connectivity properties of graphs in order to build a graph that represents the underlying manifold without a trial and error procedure. A theoretic explanation of the right choice for graph building is presented in terms of topological, graph and physical concepts and experiments using artificial data are shown in order to compare the proposed methodology with other approaches. Also a new algorithm based on a linear local assumption in the manifold and minimum spanning trees is proposed in order to create a more robust neighborhood graph.Magíster en Ingeniería Electrónica y de ComputadoresMaestría114 hojasapplication/pdfengUniandesMaestría en Ingeniería Electrónica y de ComputadoresFacultad de IngenieríaDepartamento de Ingeniería Eléctrica y Electrónicainstname:Universidad de los Andesreponame:Repositorio Institucional SénecaEmbeddings, connectivity and minimum spanning trees in dimensionality reductionTrabajo de grado - Maestríainfo:eu-repo/semantics/masterThesishttp://purl.org/coar/version/c_970fb48d4fbd8a85Texthttp://purl.org/redcol/resource_type/TMVariedades (Matemáticas) - InvestigacionesAnálisis de componentes principalesArboles de expansión (Teoría de grafos)IngenieríaPublicationedd81d8c-e0b9-4c1f-bf04-eed0e12e755dvirtual::14309-1edd81d8c-e0b9-4c1f-bf04-eed0e12e755dvirtual::14309-1https://scienti.minciencias.gov.co/cvlac/visualizador/generarCurriculoCv.do?cod_rh=0000025550virtual::14309-1TEXTu445193.pdf.txtu445193.pdf.txtExtracted texttext/plain156557https://repositorio.uniandes.edu.co/bitstreams/addaafdb-b6f2-4f58-90af-df49962e28e7/downloadd254e00499318f21bd1499993a270a9eMD54ORIGINALu445193.pdfapplication/pdf6691407https://repositorio.uniandes.edu.co/bitstreams/d24e5dc1-91ef-49c7-810e-308799391113/download740b834150920f0b0600417802e03147MD51THUMBNAILu445193.pdf.jpgu445193.pdf.jpgIM Thumbnailimage/jpeg6221https://repositorio.uniandes.edu.co/bitstreams/79276d21-569f-42da-b394-29872f0d3705/downloadf80d51a262a5a22dfb848127f8e443b3MD551992/11392oai:repositorio.uniandes.edu.co:1992/113922024-03-13 15:10:08.949https://repositorio.uniandes.edu.co/static/pdf/aceptacion_uso_es.pdfopen.accesshttps://repositorio.uniandes.edu.coRepositorio institucional Sénecaadminrepositorio@uniandes.edu.co
dc.title.es_CO.fl_str_mv Embeddings, connectivity and minimum spanning trees in dimensionality reduction
title Embeddings, connectivity and minimum spanning trees in dimensionality reduction
spellingShingle Embeddings, connectivity and minimum spanning trees in dimensionality reduction
Variedades (Matemáticas) - Investigaciones
Análisis de componentes principales
Arboles de expansión (Teoría de grafos)
Ingeniería
title_short Embeddings, connectivity and minimum spanning trees in dimensionality reduction
title_full Embeddings, connectivity and minimum spanning trees in dimensionality reduction
title_fullStr Embeddings, connectivity and minimum spanning trees in dimensionality reduction
title_full_unstemmed Embeddings, connectivity and minimum spanning trees in dimensionality reduction
title_sort Embeddings, connectivity and minimum spanning trees in dimensionality reduction
dc.creator.fl_str_mv Quintero Peña, Carlos Andrés
dc.contributor.advisor.none.fl_str_mv Lozano Martínez, Fernando Enrique
dc.contributor.author.none.fl_str_mv Quintero Peña, Carlos Andrés
dc.subject.keyword.es_CO.fl_str_mv Variedades (Matemáticas) - Investigaciones
Análisis de componentes principales
Arboles de expansión (Teoría de grafos)
topic Variedades (Matemáticas) - Investigaciones
Análisis de componentes principales
Arboles de expansión (Teoría de grafos)
Ingeniería
dc.subject.themes.none.fl_str_mv Ingeniería
description In this work we follow the idea of using connectivity properties of graphs in order to build a graph that represents the underlying manifold without a trial and error procedure. A theoretic explanation of the right choice for graph building is presented in terms of topological, graph and physical concepts and experiments using artificial data are shown in order to compare the proposed methodology with other approaches. Also a new algorithm based on a linear local assumption in the manifold and minimum spanning trees is proposed in order to create a more robust neighborhood graph.
publishDate 2011
dc.date.issued.none.fl_str_mv 2011
dc.date.accessioned.none.fl_str_mv 2018-09-28T07:56:00Z
dc.date.available.none.fl_str_mv 2018-09-28T07:56:00Z
dc.type.spa.fl_str_mv Trabajo de grado - Maestría
dc.type.coarversion.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.driver.spa.fl_str_mv info:eu-repo/semantics/masterThesis
dc.type.content.spa.fl_str_mv Text
dc.type.redcol.spa.fl_str_mv http://purl.org/redcol/resource_type/TM
dc.identifier.uri.none.fl_str_mv http://hdl.handle.net/1992/11392
dc.identifier.pdf.none.fl_str_mv u445193.pdf
dc.identifier.instname.spa.fl_str_mv instname:Universidad de los Andes
dc.identifier.reponame.spa.fl_str_mv reponame:Repositorio Institucional Séneca
dc.identifier.repourl.spa.fl_str_mv repourl:https://repositorio.uniandes.edu.co/
url http://hdl.handle.net/1992/11392
identifier_str_mv u445193.pdf
instname:Universidad de los Andes
reponame:Repositorio Institucional Séneca
repourl:https://repositorio.uniandes.edu.co/
dc.language.iso.es_CO.fl_str_mv eng
language eng
dc.rights.uri.*.fl_str_mv https://repositorio.uniandes.edu.co/static/pdf/aceptacion_uso_es.pdf
dc.rights.accessrights.spa.fl_str_mv info:eu-repo/semantics/openAccess
dc.rights.coar.spa.fl_str_mv http://purl.org/coar/access_right/c_abf2
rights_invalid_str_mv https://repositorio.uniandes.edu.co/static/pdf/aceptacion_uso_es.pdf
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.extent.es_CO.fl_str_mv 114 hojas
dc.format.mimetype.es_CO.fl_str_mv application/pdf
dc.publisher.es_CO.fl_str_mv Uniandes
dc.publisher.program.es_CO.fl_str_mv Maestría en Ingeniería Electrónica y de Computadores
dc.publisher.faculty.es_CO.fl_str_mv Facultad de Ingeniería
dc.publisher.department.es_CO.fl_str_mv Departamento de Ingeniería Eléctrica y Electrónica
dc.source.es_CO.fl_str_mv instname:Universidad de los Andes
reponame:Repositorio Institucional Séneca
instname_str Universidad de los Andes
institution Universidad de los Andes
reponame_str Repositorio Institucional Séneca
collection Repositorio Institucional Séneca
bitstream.url.fl_str_mv https://repositorio.uniandes.edu.co/bitstreams/addaafdb-b6f2-4f58-90af-df49962e28e7/download
https://repositorio.uniandes.edu.co/bitstreams/d24e5dc1-91ef-49c7-810e-308799391113/download
https://repositorio.uniandes.edu.co/bitstreams/79276d21-569f-42da-b394-29872f0d3705/download
bitstream.checksum.fl_str_mv d254e00499318f21bd1499993a270a9e
740b834150920f0b0600417802e03147
f80d51a262a5a22dfb848127f8e443b3
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositorio institucional Séneca
repository.mail.fl_str_mv adminrepositorio@uniandes.edu.co
_version_ 1812134026682564608

Publicaciones similares