
Relational Data Clustering
Models, Algorithms, and Applications
Chapman & Hall/CRC (Publisher)
1st Edition
Published on 19. September 2019
Book
Paperback/Softback
216 pages
978-0-367-38405-0 (ISBN)
Description
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 data
Multi-type heterogeneous relational data
Homogeneous relational data clustering
Clustering on the most general case of relational data
Individual relational clustering framework
Recent research on evolutionary clustering
This 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.
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 data
Multi-type heterogeneous relational data
Homogeneous relational data clustering
Clustering on the most general case of relational data
Individual relational clustering framework
Recent research on evolutionary clustering
This 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.
More details
Language
English
Place of publication
Oxford
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
Professional and scholarly
Professional Practice & Development
Dimensions
Height: 234 mm
Width: 156 mm
Thickness: 12 mm
Weight
333 gr
ISBN-13
978-0-367-38405-0 (9780367384050)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Bo Long | Zhongfei Zhang | Philip S. Yu
Relational Data Clustering
Models, Algorithms, and Applications
Book
05/2010
1st Edition
Chapman & Hall/CRC
€145.40
Shipment within 15-20 days

Bo Long | Zhongfei Zhang | Philip S. Yu
Relational Data Clustering
Models, Algorithms, and Applications
E-Book
05/2010
Chapman & Hall/CRC
€86.99
Available for download

Bo Long | Zhongfei Zhang | Philip S. Yu
Relational Data Clustering
Models, Algorithms, and Applications
E-Book
05/2010
Chapman and Hall
€86.99
Available for download
Persons
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.
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.
Content
Introduction. Models. Algorithms. Applications. Summary. References. Index.