Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference8 articles.
1. Queries and concept learning;Angluin;Machine Learning,1988
2. N. Alon, V. Asodi, Learning a hidden subgraph, in: 31st International Colloquium on Automata, Languages and Programming, 2004, pp. 110–121
3. N. Alon, R. Beigel, S. Kasif, S. Rudich, B. Sudakov, Learning a hidden matching, in: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 197–206
4. D. Angluin, J. Chen, Learning a hidden graph using O(logn) queries per edge, in: The 17th Annual Conference on Learning Theory, Springer, 2004, pp. 210–223
5. Learning a hidden hypergraph;Angluin;J. Machine Learning Research,2006
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning Hidden Graphs from Samples;IEEE Transactions on Pattern Analysis and Machine Intelligence;2023
2. Finding MNEMON;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07
3. A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries;Theoretical Computer Science;2022-05
4. Parallel Network Mapping Algorithms;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06
5. Edge Estimation with Independent Set Oracles;ACM Transactions on Algorithms;2020-10-31