Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,283

The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.

Learning with Hypergraphs: Clustering, Classification, and Embedding

Open access
Zhou, Dengyong, Huang, Jiayuan, Schölkopf, Bernhard·2007·Advances in Neural Information Processing Systems 19

Abstract

We usually endow the investigated objects with pairwise relationships,\nwhich can be illustrated as graphs. In many real-world problems, however,\nrelationships among the objects of our interest are more complex than pair-\nwise. Naively squeezing the complex relationships into pairwise ones will\ninevitably lead to loss of information which can be expected valuable for\nour learning tasks however. Therefore we consider using hypergraphs in-\nstead to completely represent complex relationships among the objects of\nour interest, and thus the problem of learning with hypergraphs arises. Our\nmain contribution in this paper is to generalize the powerful methodology\nof spectral clustering which originally operates on undirected graphs to hy-\npergraphs, and further develop algorithms for hypergraph embedding and\ntransductive classi¯cation on the basis of the spectral hypergraph cluster-\ning approach. Our experiments on a number of benchmarks showed the\nadvantages of hypergraphs over usual graphs.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.7551/mitpress/7503.003.0205

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 15 references

Cited by

See all 1,283

Metadata

Authors
Zhou, D., Huang, J., & Schölkopf, B.
Venue
Advances in Neural Information Processing Systems 19
Publisher
The MIT Press
Published
2007-09-07
Pages
1601-1608
OpenAlex
W2170057991
Cited by
1,283
References
15
FWCI
22.40
Type
book chapter
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Learning with Hypergraphs: Clustering, Classification, and Embedding. https://app.cochat.ai/papers/10.7551/mitpress/7503.003.0205
The paper
Zhou, D., Huang, J., & Schölkopf, B. (2007). Learning with Hypergraphs: Clustering, Classification, and Embedding. Advances in Neural Information Processing Systems 19. https://doi.org/10.7551/mitpress/7503.003.0205

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.