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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · MPG.PuRe (Max Planck Society) · Cited by 3,864
Self-citationSemi-Supervised Learning Literature Survey
Zhu, X. (2005) · Minds at UW (University of Wisconsin) · Cited by 3,844
New spectral methods for ratio cut partitioning and clustering
Hagen, L., & Kahng, A. B. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.159993 · Cited by 1,288
Directed hypergraphs and applications
Gallo, G., Longo, G., Pallottino, S., & Nguyen, S. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90045-p · Cited by 705
A Random Walks View of Spectral Segmentation.
Meilă, M., & Shi, J. (2001) · Cited by 623
Spectral K-way ratio-cut partitioning and clustering
Chan, P. K., Schlag, M. D. F., & Zien, J. Y. (1994) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.310898 · Cited by 442
Cited by
Feng, Y., You, H., Zhang, Z., Ji, R., & Gao, Y. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013558 · Cited by 1,895
Introduction to Semi-Supervised Learning
Zhu, X., & Goldberg, A. B. (2009) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01548-9 · Cited by 1,766
Semi-Supervised Graph-Based Hyperspectral Image Classification
Camps-Valls, G., Bandos Marsheva, T. V., & Zhou, D. (2007) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2007.895416 · Cited by 622
Self-citationTemporal Relational Ranking for Stock Prediction
Feng, F., He, X., Wang, X., Luo, C., Liu, Y., & Chua, T.-S. (2019) · ACM Transactions on Information Systems · doi:10.1145/3309547 · Cited by 553
“Zhou et al. regularized the learning procedure of the target task with a hypergraph that captures the higher-order relations among entities [46].”
BackgroundHypergraphs and Cellular Networks
Klamt, S., Haus, U.-U., & Theis, F. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000385 · Cited by 480
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.