Graph Learning with a Nearest Neighbor Approach
Abstract
Article Graph learning with a nearest neighbor approach Share on Authors: Sven Koenig School of Computer Science, Carnegie Mellon University, Pittsburgh, PA School of Computer Science, Carnegie Mellon University, Pittsburgh, PAView Profile , Yury Smirnov School of Computer Science, Carnegie Mellon University, Pittsburgh, PA School of Computer Science, Carnegie Mellon University, Pittsburgh, PAView Profile Authors Info & Claims COLT '96: Proceedings of the ninth annual conference on Computational learning theoryJanuary 1996 Pages 19–28https://doi.org/10.1145/238061.238065Published:01 January 1996 11citation430DownloadsMetricsTotal Citations11Total Downloads430Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited. To manage your alert preferences, click on the button below. Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Cite
Text
Koenig and Smirnov. "Graph Learning with a Nearest Neighbor Approach." Annual Conference on Computational Learning Theory, 1996. doi:10.1145/238061.238065Markdown
[Koenig and Smirnov. "Graph Learning with a Nearest Neighbor Approach." Annual Conference on Computational Learning Theory, 1996.](https://mlanthology.org/colt/1996/koenig1996colt-graph/) doi:10.1145/238061.238065BibTeX
@inproceedings{koenig1996colt-graph,
title = {{Graph Learning with a Nearest Neighbor Approach}},
author = {Koenig, Sven and Smirnov, Yury V.},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1996},
pages = {19-28},
doi = {10.1145/238061.238065},
url = {https://mlanthology.org/colt/1996/koenig1996colt-graph/}
}