50,95 €
50,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
25 °P sammeln
50,95 €
50,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
25 °P sammeln
Als Download kaufen
50,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
25 °P sammeln
Jetzt verschenken
50,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
25 °P sammeln
  • Format: PDF

A culmination of the authors' years of extensive research on this topic, Relational Data Clustering: Models, Algorithms, and Applications addresses the fundamentals and applications of relational data clustering. It describes theoretic models and algorithms and, through examples, shows how to apply these models and algorithms to solve real-world problems.After defining the field, the book introduces different types of model formulations for relational data clustering, presents various algorithms for the corresponding models, and demonstrates applications of the models and algorithms through…mehr

Produktbeschreibung
A culmination of the authors' years of extensive research on this topic, Relational Data Clustering: Models, Algorithms, and Applications addresses the fundamentals and applications of relational data clustering. It describes theoretic models and algorithms and, through examples, shows how to apply these models and algorithms to solve real-world problems.After defining the field, the book introduces different types of model formulations for relational data clustering, presents various algorithms for the corresponding models, and demonstrates applications of the models and algorithms through extensive experimental results. The authors cover six topics of relational data clustering:Clustering on bi-type heterogeneous relational dataMulti-type heterogeneous relational data Homogeneous relational data clusteringClustering on the most general case of relational dataIndividual relational clustering frameworkRecent research on evolutionary clusteringThis book focuses on both practical algorithm derivation and theoretical framework construction for relational data clustering. It provides a complete, self-contained introduction to advances in the field.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Bo Long is a scientist at Yahoo! Labs in Sunnyvale, California.

Zhongfei Zhang is an associate professor in the computer science department at the State University of New York in Binghamton.

Philip S. Yu is a professor in the computer science department and the Wexler Chair in Information Technology at the University of Illinois in Chicago.