Abstract
We have reviewed several state-of-the-art machine learning approaches to different types of link-based clustering in this chapter. Specifically, we have presented the spectral clustering for heterogeneous relational data, the symmetric convex coding for homogeneous relational data, the citation model for clustering the special but popular homogeneous relational data-the textual documents with citations, the probabilistic clustering framework on mixed membership for general relational data, and the statistical graphical model for dynamic relational clustering. We have demonstrated the effectiveness of these machine learning approaches through empirical evaluations.
| Original language | English |
|---|---|
| Title of host publication | Link Mining |
| Subtitle of host publication | Models, Algorithms, and Applications |
| Publisher | Springer New York |
| Pages | 3-44 |
| Number of pages | 42 |
| Volume | 9781441965158 |
| ISBN (Electronic) | 9781441965158 |
| ISBN (Print) | 9781441965141 |
| DOIs | |
| State | Published - 2010 |
Fingerprint
Dive into the research topics of 'Machine learning approaches to link-based clustering'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver