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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Semi-Supervised Learning Literature Survey
Zhu, X. (2005) · Minds at UW (University of Wisconsin) · Cited by 4,506
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-citationNew 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
Learning from labeled and unlabeled data on a directed graph
Zhou, D., Huang, J., & Schölkopf, B. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102482 · Cited by 403
Self-citationClustering categorical data: an approach based on dynamical systems
Gibson, D., Kleinberg, J., & Raghavan, P. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050005 · Cited by 382
Klein, D., & Manning, C. D. (2001) · Cited by 102
Hyper-edges and multidimensional centrality
Bonacich, P., Holdren, A., & Johnston, M. (2004) · Soc. Networks · doi:10.1016/j.socnet.2004.01.001 · Cited by 94
Distributed Information Regularization on Graphs
Corduneanu, A., & Jaakkola, T. (2004) · Cited by 36
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
Introduction to Semi-Supervised Learning
Zhu, X., & Goldberg, A. B. (2009) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00196ed1v01y200906aim006 · Cited by 1,022
Hypergraph convolution and hypergraph attention
Bai, S., Zhang, F., & Torr, P. H. S. (2021) · Pattern Recognition · doi:10.1016/j.patcog.2020.107637 · Cited by 809
3-D Object Retrieval and Recognition With Hypergraph Analysis
Gao, Y., Wang, M., Tao, D., Ji, R., & Dai, Q. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2199502 · Cited by 633
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
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.