Graph-based clustering and data visualization algorithms /

Saved in:
Bibliographic Details
Author / Creator:Vathy-Fogarassy, Ágnes.
Imprint:London ; New York : Springer, c2013.
Description:1 online resource.
Language:English
Series:SpringerBriefs in computer science, 2191-5768
SpringerBriefs in Computer Science.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/9851255
Hidden Bibliographic Details
Other authors / contributors:Abonyi, Janos, 1974-
ISBN:9781447151586 (electronic bk.)
1447151585 (electronic bk.)
9781447151579
Notes:Includes bibliographical references and index.
Summary:This work presents a data visualization technique that combines graph-based topology representation and dimensionality reduction methods to visualize the intrinsic data structure in a low-dimensional vector space. The application of graphs in clustering and visualization has several advantages. A graph of important edges (where edges characterize relations and weights represent similarities or distances) provides a compact representation of the entire complex data set. This text describes clustering and visualization methods that are able to utilize information hidden in these graphs, based on the synergistic combination of clustering, graph-theory, neural networks, data visualization, dimensionality reduction, fuzzy methods, and topology learning. The work contains numerous examples to aid in the understanding and implementation of the proposed algorithms, supported by a MATLAB toolbox available at an associated website.