Embedded Systems White Papers

Learning With Hypergraphs: Clustering, Classification, and Embedding

Overview The authors usually endow the investigated objects with pairwise relationships, which can be illustrated as graphs. Naively squeezing the complex relationships into pairwise ones will inevitably lead to loss of information which can be expected valuable for the learning tasks however. Therefore it considers using hypergraphs in-stead to completely represent complex relationships among the objects of the interest, and thus the problem of learning with hypergraphs arises. The main contribution in this paper is to generalize the powerful methodology of spectral clustering which originally operates on undirected graphs to hypergraphs, and further develop algorithms for hypergraph embedding and transductive classification on the basis of the spectral hypergraph clustering approach.

Further White Paper Details
PublisherUniversity of Waterloo File FormatPDF
Date PublishedNovember 2006 Downloads1
FormatWhite Papers   
Topics

Quick Sitemap Links: