Home › Computers › Graph Classification & Clustering .(V77)

Graph Classification & Clustering .(V77)

by Riesen Kaspar Publisher: WORLD SCIENTIFIC PUB CO INC

Graph patterns represented as vectors

Regular price $131.12 USD
Regular price $145.69 USD Sale price $131.12 USD
Save 10%

Hardcover New English

In stock · Dispatches in 1–2 business days
Delivery to your door
In stock·Dispatches in 1–2 business days
Standard shipping* from $4.35
Standard shipping transit* 5–8 business days after dispatch

Faster options are available.

Rates and delivery estimates depend on your destination and item quantity. Estimates are informational only; the final shipping method and rate are selected at checkout.

Secure checkout
American Express Apple Pay DiscoverGoogle Pay Mastercard PayPalVisa
30-day eligible returns Returns & refunds policy

AlbakiReads Editorial

Graph patterns represented as vectors

Kaspar Riesen’s book examines graph-based pattern recognition through vector-space embeddings. It presents the dissimilarity-space representation as a way to map graphs into real vector spaces, connecting graph data with methods developed for feature vectors. The volume’s central concern is the trade-off between graphs’ representational capacity and a representation designed for computational efficiency and mathematical convenience. Its focus makes the book a specialized treatment of how graphs can be classified and clustered within established pattern-recognition frameworks.

Good fit for readers who enjoy

  • Researchers and students in pattern recognition or artificial intelligence
  • Readers working with graph data and classification or clustering methods
  • Those interested in vector-space representations of structured data

Themes

Graph-based pattern recognitionDissimilarity-space representationVector-space embeddingClassification and clustering

Based on publisher information and book metadata.

Book overview

This book is concerned with a fundamentally novel approach to graph-based pattern recognition based on vector space embedding of graphs. It aims at condensing the high representational power of graphs into a computationally efficient and mathematically convenient feature vector.This volume utilizes the dissimilarity space representation originally proposed by Duin and Pekalska to embed graphs in real vector spaces. Such an embedding gives one access to all algorithms developed in the past for feature vectors, which has been the predominant representation formalism in pattern recognition and related areas for a long time.
Shipping & returnsShipping options, delivery timing, and our return policy.

In-stock items normally dispatch within 1–2 business days. The ZIP-code estimator on this page is informational only; the final shipping method, price, and availability are confirmed at checkout for your full order.

For the initial delivery estimate we use these transit windows after dispatch: Standard 5–8 business days, Expedited 2–4 business days, and Priority 1–2 business days. Holiday delays are not included.

Eligible items can be returned within 30 days in accordance with our return policy.

Customer reviews

M
AlbakiReads
Malaika Taylor

I highly recommend to for anyone looking for inner clarity

T
AlbakiReads
Thomas DiMassa

Great service and fast service

Great shopping experience! The book arrived quickly, was well packaged, and matched the description perfectly. I would definitely shop with you again

O
AlbakiReads
Olivia

Smooth.