A computing device predicts occurrence of an event or classifies an object using semi-supervised data. A label set defines permissible values for a target variable. A value of the permissible values is defined for a subset of observation vectors. A predefined number of times, a distance matrix is computed that defines a distance value between pairs of observation vectors using a distance function and a converged classification matrix; a number of observation vectors is selected that have minimum values for the distance value; a label is requested and a response is received for each of the selected observation vectors; the value of the target variable is updated for each of the selected observation vectors with the received response; and the value of the target variable is determined again by recomputing the converged classification matrix. The value of the target variable for each observation vector is output to a second dataset.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A non-transitory computer-readable medium having stored thereon computer-readable instructions that when executed by a computing device cause the computing device to: read a dataset that includes a plurality of observation vectors; read a label set, wherein the label set defines permissible values for a target variable, wherein a value of the permissible values of the target variable is defined for a subset of the plurality of observation vectors; compute an affinity matrix using a kernel function and the plurality of observation vectors; compute a diagonal matrix by summing each row of the computed affinity matrix, wherein the sum of each row is stored in a diagonal of the row with zeroes in remaining positions of the row; compute a normalized distance matrix using the computed affinity matrix and the computed diagonal matrix; define a label matrix using the value of the target variable of each observation vector of the plurality of observation vectors (a) initialize a classification matrix as the defined label matrix; (b) compute a converged classification matrix, wherein the converged classification matrix defines a label probability for each permissible value defined in the label set for each observation vector of the plurality of observation vectors, wherein the classification matrix is converged using F(t+1)=αSF(t)+(1−α)Y, where F(t+1) is a next classification matrix, α is a relative weighting value, S is the normalized distance matrix defined as S=D−1/2WD−1/2, where W is the computed affinity matrix and D is the computed diagonal matrix, F(t) is the classification matrix, Y is the label matrix defined as Yik=1 if xi is labeled as yi=k; otherwise, Yik=0, where xi is an observation vector of the plurality of observation vectors, i=1, . . . , n, n is a number of vectors of the plurality of observation vectors, k=1, . . . , c, and c is a number of permissible values of the label set, and t is an iteration number, wherein the classification matrix is converged when a second predefined number of iterations of computations of F(t+1)=αSF(t)+(1−α)Y is complete; (c) for each observation vector, update the value of the target variable based on a maximum label probability value identified from the converged classification matrix; a predefined number of times, compute a distance vector that defines a distance value between each pair of the plurality of observation vectors using a distance function applied to only the converged classification matrix; select a number of observation vectors from the dataset that have minimum values for the distance value; request that a user provide a label for each of the selected observation vectors; receive a response to the request from the user for each of the selected observation vectors; update the value of the target variable for each of the selected observation vectors with the received response; and repeat operations (a) to (c); and after the predefined number of times, output the value of the target variable for each observation vector of the plurality of observation vectors to a second dataset. 2. The non-transitory computer-readable medium of claim 1, wherein each observation vector defines an image, and the value of the target variable defines an image label determined using the converged classification matrix or the received response. 3. The non-transitory computer-readable medium of claim 1, wherein the subset of the plurality of observation vectors is less than one percent of the plurality of observation vectors. 4. The non-transitory computer-readable medium of claim 1, wherein the distance function is based on a Kullback-Leibler divergence computation. 5. (canceled) 6. The non-transitory computer-readable medium of claim 4, wherein the distance vector is computed using Dis i = ∑ j = 1 n  ∑ k = 1 c  F kj  ( t )  log  F kj  ( t ) F ki  ( t ) , 7. (canceled) 8. (canceled) 9. The non-transitory computer-readable medium of claim 1, wherein the kernel function is a Gaussian kernel function. 10. The non-transitory computer-readable medium of claim 9, wherein the affinity matrix is defined as W ij = exp  - || x i - x j  || 2 2  s 2 if i≠j and Wii=0, where s is a Gaussian bandwidth parameter and j=1, . . . , n. 11. The non-transitory computer-readable medium of claim 1, wherein the diagonal matrix is defined as Dii=Σj=1nWij and Dij=0 if i≠j. 12. (canceled) 13. (canceled) 14. A computing device comprising: a processor; and a non-transitory computer-readable medium operably coupled to the processor, the computer-readable medium having computer-readable instructions stored thereon that, when executed by the processor, cause the computing device to read a dataset that includes a plurality of observation vectors; read a label set, wherein the label set defines permissible values for a target variable, wherein a value of the permissible values of the target variable is defined for a subset of the plurality of observation vectors; compute an affinity matrix using a kernel function and the plurality of observation vectors; compute a diagonal matrix by summing each row of the computed affinity matrix, wherein the sum of each row is stored in a diagonal of the row with zeroes in remaining positions of the row; compute a normalized distance matrix using the computed affinity matrix and the computed diagonal matrix; define a label matrix using the value of the target variable of each observation vector of the plurality of observation vectors (a) initialize a classification matrix as the defined label matrix; (b) compute a converged classification matrix, wherein the converged classification matrix defines a label probability for each permissible value defined in the label set for each observation vector of the plurality of observation vectors, wherein the classification matrix is converged using F(t+1)=αSF(t)+(1−α)Y, where F(t+1) is a next classification matrix, α is a relative weighting value, S is the normalized distance matrix defined as S=D−1/2WD−1/2, where W is the computed affinity matrix and D is the computed diagonal matrix, F(t) is the classification matrix, Y is the label matrix defined as Yik=1 if xi is labeled as yi=k; otherwise, Yik=0, where xi is an observation vector of the plurality of observation vectors, i=1, . . . , n, n is a number of vectors of the plurality of observation vectors, k=1, . . . , c, and c is a number of permissible values of the label set, and t is an iteration number, wherein the classification matrix is converged when a second predefined number of iterations of computations of F(t+1)=αSF(t)+(1−α)Y is complete; (c) for each observation vector, update the value of the target variable based on a maximum label probability value identified from the converged classification matrix; a predefined number of times, compute a distance vector that defines a distance value between each pair of the plurality of observation vectors using a distance function applied to only the converged classification matrix; select a number of observation vectors from the dataset that have minimum values for the distance value; request that a user provide a label for each of the selected observation vectors; receive a response to the request from the user for each of the selected observation vectors; update the value of the target variable for each of the selected observation vectors with the received response; and repeat operations (a) to (c); and after the predefined number of times, output the value of the target variable for each observation vector of the plurality of observation vectors to a second dataset. 15. (canceled) 16. The computing device of claim 14, wherein the distance vector is computed using Dis i = ∑ j = 1 n  ∑ k = 1 c  F kj  ( t )  log  F kj  ( t ) F ki  ( t ) , 17. (canceled) 18. (canceled) 19. The computing device of claim 15, wherein the diagonal matrix is defined as Dii=Σj=1nWij and Dij=0 if i≠j. 20. (canceled) 21. (canceled) 22. A method of predicting occurrence of an event or classifying an object using semi-supervised data to label unlabeled data in a dataset, the method comprising: reading, by a computing device, a dataset that includes a plurality of observation vectors; reading, by the computing device, a label set, wherein the label set defines permissible values for a target variable, wherein a value of the permissible values of the target variable is defined for a subset of the plurality of observation vectors; computing, by the computing device, an affinity matrix using a kernel function and the plurality of observation vectors; computing, by the computing device, a diagonal matrix by summing each row of the computed affinity matrix, wherein the sum of each row is stored in a diagonal of the row with zeroes in remaining positions of the row; computing, by the computing device, a normalized distance matrix using the computed affinity matrix and the computed diagonal matrix; defining, by the computing device, a label matrix using the value of the target variable of each observation vector of the plurality of observation vectors (a) initializing, by the computing device, a classification matrix as the defined label matrix; (b) computing, by the computing device, a converged classification matrix, wherein the converged classification matrix defines a label probability for each permissible value defined in the label set for each observation vector of the plurality of observation vectors, wherein the classification matrix is converged using F(t+1)=αSF(t)+(1−α)Y, where F(t+1) is a next classification matrix, α is a relative weighting value, S is the normalized distance matrix defined as S=D−1/2WD−1/2, where W is the computed affinity matrix and D is the computed diagonal matrix, F(t) is the classification matrix, Y is the label matrix defined as Yik=1 if xi is labeled as yi=k; otherwise, Yik=0, where xi is an observation vector of the plurality of observation vectors, i=1, . . . , n, n is a number of vectors of the plurality of observation vectors, k=1, . . . , c, and c is a number of permissible values of the label set, and t is an iteration number, wherein the classification matrix is converged when a second predefined number of iterations of computations of F(t+1)=αSF(t)+(1−α)Y is complete; (c) for each observation vector, updating, by the computing device, the value of the target variable based on a maximum label probability value identified from the converged classification matrix; a predefined number of times, computing, by the computing device, a distance vector that defines a distance value between each pair of the plurality of observation vectors using a distance function applied to only the converged classification matrix; selecting, by the computing device, a number of observation vectors from the dataset that have minimum values for the distance value; requesting, by the computing device, that a user provide a label for each of the selected observation vectors; receiving, by the computing device, a response to the request from the user for each of the selected observation vectors; updating, by the computing device, the value of the target variable for each of the selected observation vectors with the received response; and repeating, by the computing device, operations (a) to (c); and after the predefined number of times, outputting, by the computing device, the value of the target variable for each observation vector of the plurality of observation vectors to a second dataset. 23. (canceled) 24. The method of claim 22, wherein the distance vector is computed using Dis i = ∑ j = 1 n  ∑ k = 1 c  F kj  ( t )  log  F kj  ( t ) F ki  ( t ) , 25. (canceled) 26. (canceled) 27. The method of claim 22, wherein the affinity matrix is defined as W ij = exp  - || x i - x j  || 2 2  s 2 if i≠j and Wii=0, where s is a Gaussian bandwidth parameter. 28. The method of claim 22, wherein the diagonal matrix is defined as Dii=Σj=1nWij and Dij=0 if i≠j. 29. (canceled) 30. (canceled)