Welcome to Central Library, SUST
Amazon cover image
Image from Amazon.com
Image from Google Jackets

Graph-Based Clustering and Data Visualization Algorithms [electronic resource] / by Ágnes Vathy-Fogarassy, János Abonyi.

By: Contributor(s): Material type: TextTextSeries: SpringerBriefs in Computer SciencePublisher: London : Springer London : Imprint: Springer, 2013Description: XIII, 110 p. 62 illus. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781447151586
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 006.312 23
LOC classification:
  • QA76.9.D343
Online resources:
Contents:
Vector Quantisation and Topology-Based Graph Representation -- Graph-Based Clustering Algorithms -- Graph-Based Visualisation of High-Dimensional Data.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

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

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.

There are no comments on this title.

to post a comment.