OrgLion-ML
/
dlib
mirror of https://github.com/davisking/dlib.git
1
0
Fork 0
Code Issues Releases Wiki Activity

updated a spec

This commit is contained in:
Davis King 2012-04-30 20:10:08 -04:00
parent 4b165cd186
commit 18ab8c7a4f
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
dlib/svm/structural_svm_graph_labeling_problem.h
View File

@ -43,6 +43,7 @@ namespace dlib
example graphs of connected nodes while labels should indicate the desired example graphs of connected nodes while labels should indicate the desired
label of each node. The precise requirements for a valid graph labeling label of each node. The precise requirements for a valid graph labeling
problem are listed below. problem are listed below.
- There is at least one node with a label of 0 and one with a label != 0.
- This function returns true if all of the following are true and false otherwise: - This function returns true if all of the following are true and false otherwise:
- is_learning_problem(samples, labels) == true - is_learning_problem(samples, labels) == true
- All the vectors stored on the edges of each graph in samples - All the vectors stored on the edges of each graph in samples