Beyond pairwise classification and clustering using hypergraphs

D Zhou, Jiashu Huang, Bernhard SchölkopfMPG.PuRe 2005

Abstract

In many applications, relationships among objects of interest are more complex than pairwise. Simply approximating complex relationships as pairwise ones can lead to loss of information. An alternative for these applications is to analyze complex relationships among data directly, without the need to first represent the complex relationships into pairwise ones. A natural way to describe complex relationships is to use hypergraphs. A hypergraph is a graph in which edges can connect more than two vertices. Thus we consider learning from a hypergraph, and develop a general framework which is applicable to classification and clustering for complex relational data. We have applied our framework to real-world problems and obtained encouraging results.
BibTeX
@inproceedings{zhou2005beyond,
  author = {D Zhou and Jiashu Huang and Bernhard Schölkopf},
  title = {{Beyond pairwise classification and clustering using hypergraphs}},
  booktitle = {MPG.PuRe},
  year = {2005},
}

Loading related content...

Figure