In some examples, a system includes an access engine and a hyperplane determination engine. The access engine may access a training vector set that includes sparse binary training vectors and a set of labels classifying each of the sparse binary training vectors through a positive label or a negative label. The hyperplane determination engine may initialize a candidate hyperplane vector and maintain a scoring vector including scoring vector elements to track separation variances of the sparse binary training vectors with respect to the candidate hyperplane vector. Through iterations of identifying, according to the scoring vector, a particular sparse binary training vector with a greatest separation variance with respect to the candidate hyperplane vector, the hyperplane determination engine may incrementally update the candidate hyperplane vector and incrementally update the scoring vector to adjust separation variances affected by updates to the candidate hyperplane vector.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A system comprising: an access engine to: access a training vector set comprising sparse binary training vectors that characterize elements of a physical system; and access a set of labels classifying each of the sparse binary training vectors through a positive label or a negative label; and a hyperplane determination engine to: initialize a candidate hyperplane vector; maintain a scoring vector comprising scoring vector elements to track separation variances of the sparse binary training vectors with respect to the candidate hyperplane vector; through iterations of identifying, according to the scoring vector, a particular sparse binary training vector with a greatest separation variance with respect to the candidate hyperplane vector: incrementally update the candidate hyperplane vector; and incrementally update the scoring vector to adjust separation variances affected by updates to the candidate hyperplane vector. 2. The system of claim 1, wherein the hyperplane determination engine is to incrementally update the candidate hyperplane vector by, for each iteration: identifying a vector index of a non-zero element of the particular sparse binary training vector; and updating a candidate hyperplane vector element indexed by the vector index to account for a label of the particular sparse binary training vector. 3. The system of claim 2, wherein the particular sparse binary training vector identified by a numerical identifier; and wherein the hyperplane determination engine is to incrementally update the scoring vector to adjust affected separation variances by, for each iteration: for each other sparse binary training vector also having a non-zero element at the vector index: updating a particular scoring vector element indexed by a numerical identifier of the other sparse binary training vector to account for a label of the other sparse binary training vector and a label of the particular sparse binary training vector. 4. The system of claim 1, wherein the hyperplane determination engine is to maintain the scoring vector by initializing the scoring vector prior to a start of the iterations of identifying the particular sparse binary training vector. 5. The system of claim 1, wherein the hyperplane determination engine is further to, after the iterations are completed: determine the candidate hyperplane vector as a separating hyperplane that separates sparse binary training vectors classified with the positive label from sparse binary training vectors classified with the negative label. 6. A method comprising: receiving a training vector set comprising sparse binary training vectors that characterize elements of a physical system; receiving a set of labels classifying each of the sparse binary training vectors through a positive label or a negative label; determining a separating hyperplane that separates sparse binary training vectors classified with the positive label from sparse binary training vectors classified with the negative label, wherein determining the hyperplane comprises: initializing a scoring vector, the scoring vector comprising scoring vector elements to track separation variances of the sparse binary training vectors with respect to a candidate hyperplane vector; selecting a particular sparse binary training vector among the training vector set, the particular sparse binary training vector identified by a numerical identifier; identifying a vector index of a non-zero element of the particular sparse binary training vector, updating the candidate hyperplane vector by updating a candidate hyperplane vector element indexed by the vector index to account for a label of the particular sparse binary training vector; and for each other sparse binary training vector also having a non-zero element at the vector index: updating a particular scoring vector element indexed by a numerical identifier of the other sparse binary training vector to account for a label of the other sparse binary training vector and a label of the particular sparse binary training vector. 7. The method of claim 6, wherein the positive label is a ‘1’ value and the negative label is a ‘−1’ value. 8. The method of claim 7, wherein updating a particular scoring vector element indexed by the numerical identifier of the particular sparse binary training vector comprises, for each of the other sparse binary training vectors also having a non-zero element at the vector index: summing a current value of the particular scoring vector element with a product of a label of the particular sparse binary training vector and the label of the other sparse binary training vector. 9. The method of claim 7, wherein updating the candidate hyperplane vector element indexed by the vector index comprises summing a current value of the candidate hyperplane vector element with the label of the particular sparse binary training vector. 10. The method of claim 6, wherein: identifying comprises identifying each of the vector indices of non-zero elements of the particular sparse binary training vector; and updating the hyperplane vector comprises updating each of the candidate hyperplane vector elements of the candidate hyperplane vector indexed by the vector indices of non-zero elements of the particular sparse binary training vector. 11. The method of claim 6, comprising initializing the scoring vector prior to the selecting the particular sparse binary training vector, identifying the vector index, updating the candidate hyperplane vector, and updating the particular scoring vector element. 12. The method of claim 6, comprising selecting the particular sparse binary training vector responsive to identifying, according to the scoring vector, that the particular sparse binary training vector has a greatest separation variance with respect to the candidate hyperplane vector. 13. The method of claim 6, comprising iteratively selecting the particular sparse binary training vector, identifying the vector index, updating the candidate hyperplane vector, and updating the particular scoring vector element for a number of iterations specified by an iteration parameter. 14. The method of claim 13, further comprising, after the number of iterations have been performed: determining the candidate hyperplane vector as the separating hyperplane that separates the sparse binary training vectors in the training vector set classified with the positive label from the sparse binary training vectors in the training vector set classified with the negative label. 15. A non-transitory machine-readable medium comprising instructions executable by a processing resource to: receive a training vector set comprising sparse binary training vectors that characterize elements of a physical system; receive labels classifying each of the sparse binary training vectors through a positive label or a negative label; initialize a candidate hyperplane vector; initialize a scoring vector including scoring vector elements to track separation variances of the sparse binary training vectors with respect to the candidate hyperplane vector; for a number of iterations specified by an iteration parameter: identify a particular sparse binary training vector with, according to the scoring vector, a greatest separation variance with respect to the candidate hyperplane vector, the particular sparse binary training vector identified by a numerical identifier; for each non-zero element of the particular sparse binary training vector: identify a vector index of the non-zero element; update the candidate hyperplane vector by updating a candidate hyperplane vector element indexed by the vector index to account for a label of the particular sparse binary training vector; for each other sparse binary training vector also having a non-zero element at the vector index: update a particular scoring vector element indexed by a numerical identifier of the other sparse binary training vector to account for a label of the other sparse binary training vector and the label of the particular sparse binary training vector; and after the number of iterations complete: determine the candidate hyperplane vector as a separating hyperplane for the training vector set.