The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Learning from labeled and unlabeled data on a directed graph
Open accessAbstract
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is considered. The time complexity of the algorithm derived from this framework is nearly linear due to recently developed numerical techniques. In the absence of labeled instances, this framework can be utilized as a spectral clustering method for directed graphs, which generalizes the spectral clustering approach for undirected graphs. We have applied our framework to real-world web classification problems and obtained encouraging results.
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
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
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Spline Models for Observational Data.
Muller, H.-G., & Wahba, G. (1991) · Journal of the American Statistical Association · doi:10.2307/2290434 · Cited by 4,928
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-citationLaplacians and the Cheeger Inequality for Directed Graphs
Chung, F. (2005) · Annals of Combinatorics · doi:10.1007/s00026-005-0237-z · Cited by 535
Learning probabilistic models of link structure
Getoor, L., Friedman, N., Koller, D., & Taskar, B. (2003) · Journal of Machine Learning Research · Cited by 252
Hyperlink analysis for the Web
Henzinger, M. R. (2001) · IEEE Internet Computing · doi:10.1109/4236.895141 · Cited by 210
Semi-supervised Learning on Directed Graphs
Zhou, D., Hofmann, T., & Schölkopf, B. (2004) · Max Planck Institute for Plasma Physics · Cited by 198
Self-citationTikhonov regularization and semi-supervised learning on large graphs
Belkin, M., Matveeva, I. V., & Niyogi, P. (2004) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2004.1326716 · Cited by 139
Learning probabilistic models of link structure
GetoorLisa, FriedmanNir, KollerDaphne, & TaskarBenjamin (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944950 · Cited by 91
Algorithmic Challenges in Web Search Engines
Henzinger, M. R. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129079 · Cited by 81
Cited by
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
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
Learning with Hypergraphs: Clustering, Classification, and Embedding
Zhou, D., Huang, J., & Schölkopf, B. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0205 · Cited by 1,283
Self-citationFouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.46 · Cited by 1,265
A review of feature selection methods with applications
Jovic, A., Brkic, K., & Bogunovic, N. (2015) · 2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO) · doi:10.1109/mipro.2015.7160458 · Cited by 1,209
Metadata
- Authors
- Zhou, D., Huang, J., & Schölkopf, B.
- Venue
- Proceedings of the 22nd international conference on Machine learning - ICML '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 1036-1043
- OpenAlex
- W2165922980
- Cited by
- 403
- References
- 14
- FWCI
- 13.12
- Type
- conference paper
- 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.