Add to ORKGWe consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergraph or not. We show tha
The last few years have seen an increasing interest in mining and learning from graphs. Most work in...
A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces...
We study the stochastic matching problem on k-uniform hypergraphs. In this problem, we are given a h...
Abstract We study the problem of learning a hidden graph by edge-detecting queries, each of which te...
AbstractWe consider the problem of learning a general graph using edge-detecting queries. In this mo...
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a...
We study the problem of learning a hypergraph via edge detecting queries. In this problem, a learner...
Abstract. We consider the problem of learning and verifying hidden graphs and their properties given...
We consider the problem of learning the hypergraph using edge-detecting queries. In this model, the ...
We consider the problem of inferring a matching hidden in a weighted random k-hypergraph. We assume ...
AbstractWe give a competitive algorithm to identify all d defective edges in a hypergraph with d unk...
Abstract. We propose a new formulation called hyperedge expansion (HE) for hypergraph learning. The ...
Hypergraph is a powerful representation in several computer vision, machine learning and pattern rec...
We consider the problem of querying the existence of hyperedges in hypergraphs. More formally, given...
Recent years have witnessed a surge of interest in graph-based transductive image classification. Ex...
The last few years have seen an increasing interest in mining and learning from graphs. Most work in...
A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces...
We study the stochastic matching problem on k-uniform hypergraphs. In this problem, we are given a h...
Abstract We study the problem of learning a hidden graph by edge-detecting queries, each of which te...
AbstractWe consider the problem of learning a general graph using edge-detecting queries. In this mo...
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a...
We study the problem of learning a hypergraph via edge detecting queries. In this problem, a learner...
Abstract. We consider the problem of learning and verifying hidden graphs and their properties given...
We consider the problem of learning the hypergraph using edge-detecting queries. In this model, the ...
We consider the problem of inferring a matching hidden in a weighted random k-hypergraph. We assume ...
AbstractWe give a competitive algorithm to identify all d defective edges in a hypergraph with d unk...
Abstract. We propose a new formulation called hyperedge expansion (HE) for hypergraph learning. The ...
Hypergraph is a powerful representation in several computer vision, machine learning and pattern rec...
We consider the problem of querying the existence of hyperedges in hypergraphs. More formally, given...
Recent years have witnessed a surge of interest in graph-based transductive image classification. Ex...
The last few years have seen an increasing interest in mining and learning from graphs. Most work in...
A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces...
We study the stochastic matching problem on k-uniform hypergraphs. In this problem, we are given a h...