Computer Science Technical Reports
CS at VT

Clustering constrained by dependencies

Tadepalli, Satish and Ramakrishnan, Naren and Watson, Layne T. (2009) Clustering constrained by dependencies. Technical Report TR-09-12, Computer Science and Mathematics, Virginia Tech.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
ACMSurv09.pdf (2176311)

Abstract

Clustering is the unsupervised method of grouping data samples to form a partition of a given dataset. Such grouping is typically done based on homogeneity assumptions of clusters over an attribute space and hence the precise definition of the similarity metric affects the clusters inferred. In recent years, new formulations of clustering have emerged that posit indirect constraints on clustering, typically in terms of preserving dependencies between data samples and auxiliary variables. These formulations find applications in bioinformatics, web mining, social network analysis, and many other domains. The purpose of this survey is to provide a gentle introduction to these formulations, their mathematical assumptions, and the contexts under which they are applicable.

Item Type:Departmental Technical Report
Subjects:Computer Science > Artificial Intelligence
ID Code:1076
Deposited By:Administrator, Eprints
Deposited On:09 July 2009