Clustering Relational Data

  • Batagelj V
  • Ferligoj A
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the paper we show, based on the optimization approach to clustering, that clustering with relational constraint and blockmodeling (of social networks) problems are essentially special cases of the clustering relational data problem. An overview of the main results in this field, some open problems and directions for the future research are presented.

Cite

CITATION STYLE

APA

Batagelj, V., & Ferligoj, A. (2000). Clustering Relational Data (pp. 3–15). https://doi.org/10.1007/978-3-642-58250-9_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free