mirror of
https://github.com/davisking/dlib.git
synced 2024-11-01 10:14:53 +08:00
updated docs
This commit is contained in:
parent
285accf33e
commit
5a4a62f74a
@ -2607,7 +2607,7 @@ Davis E. King. <a href="http://www.jmlr.org/papers/volume10/king09a/king09a.pdf"
|
||||
<p>
|
||||
To elaborate, a graph labeling problem is a task to learn a binary classifier which
|
||||
predicts the label of each node in a graph. Additionally, we have information in
|
||||
the form of graph edges between nodes where edges are present when we believe the
|
||||
the form of edges between nodes where edges are present when we believe the
|
||||
linked nodes are likely to have the same label. Therefore, part of a graph labeling
|
||||
problem is to learn to score each edge in terms of how strongly the edge should enforce
|
||||
labeling consistency between its two nodes.
|
||||
|
Loading…
Reference in New Issue
Block a user