Cantitate/Preț
Produs

Graph-Based Clustering and Data Visualization Algorithms: SpringerBriefs in Computer Science

Autor Ágnes Vathy-Fogarassy, János Abonyi
en Limba Engleză Paperback – 5 iun 2013
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.
Citește tot Restrânge

Din seria SpringerBriefs in Computer Science

Preț: 37387 lei

Preț vechi: 46734 lei
-20% Nou

Puncte Express: 561

Preț estimativ în valută:
7154 7527$ 5923£

Carte tipărită la comandă

Livrare economică 14-28 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781447151579
ISBN-10: 1447151577
Pagini: 124
Ilustrații: XIII, 110 p. 62 illus.
Dimensiuni: 155 x 235 x 7 mm
Greutate: 0.2 kg
Ediția:2013
Editura: SPRINGER LONDON
Colecția Springer
Seria SpringerBriefs in Computer Science

Locul publicării:London, United Kingdom

Public țintă

Research

Cuprins

Vector Quantisation and Topology-Based Graph Representation.- Graph-Based Clustering Algorithms.- Graph-Based Visualisation of High-Dimensional Data.

Textul de pe ultima copertă

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.

Caracteristici

Examines vector quantization methods, and discusses the advantages and disadvantages of minimal spanning tree-based clustering Presents a novel similarity measure to improve the classical Jarvis-Patrick clustering algorithm Reviews distance-, neighborhood- and topology-based dimensionality reduction methods, and introduces new graph-based visualization algorithms