| http://www.w3.org/ns/prov#value | - For a binary categorization problem, if the two categories are linearly separable, the hyperplane that does the separation can be easily calculated by {right arrow over (w)}To+b=0,| where {right arrow over (w)} is a weight vector, and b is a bias.
|
