Examples relate to hidden dynamic systems. In some examples, a conditional probability distribution for labeling data record segments is defined, where the conditional probability distribution models dependencies between class labels and internal substructures of the data record segments. At this stage, optimal parameter values are determined for the conditional probability distribution by applying a quasi-Newton gradient ascent method to training data, where the conditional probability distribution is restricted to a disjoint set of hidden states for each of the class labels. The conditional probability distribution and the optimal parameter values are used to determine a most probable labeling sequence for the data record segments.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A server computing device for analyzing data using hidden dynamic systems, the computing device comprising: a processor to: define a conditional probability distribution for labeling a plurality of data record segments, wherein the conditional probability distribution models dependencies between class labels and internal substructures of the plurality of data record segments; determine optimal parameter values for the conditional probability distribution by applying a quasi-Newton gradient ascent method to training data, wherein the conditional probability distribution is restricted to a disjoint set of hidden states for each of the class labels; and use the conditional probability distribution and the optimal parameter values to determine a most probable labeling sequence for the plurality of data record segments. 2. The server computing device of claim 1, wherein the conditional probability distribution is defined as p  ( S  X ) = 1 Z  ( X )  exp ( ∑ k  λ k · ∑ j = 1 T  f k  ( s j - 1 , s j , X , j ) ) , and wherein X is an observation sequence, Y is a potential labeling sequence, S is a vector of sub-structure variables, and λk is a confidence parameter. 3. The server computing device of claim 2, wherein the quasi-Newton gradient ascent method is performed using a Gaussian prior defined as L  ( Λ ) = ∑ i = 1 n  log   P Λ  ( Y i  X i ) - ∑ k = 1 K  λ k 2 2   σ 2 , and wherein is a set of parameters that includes the confidence parameter. 4. The server computing device of claim 2, wherein the plurality of data segments are applied to the conditional probability distribution to determine a plurality of marginal probabilities for each of the class labels. 5. The server computing device of claim 4, wherein the plurality of marginal probabilities are summed according to the disjoint sets of hidden states to determine the most probably labeling sequence. 6. The server computing device of claim 2, wherein the confidence parameters and a transition function fk model dependencies between the class labels and the internal substructures. 7. A method for analyzing data using hidden dynamic systems, comprising: defining a conditional probability distribution for labeling a plurality of data record segments, wherein the conditional probability distribution models dependencies between class labels and internal substructures of the plurality of data record segments; determining optimal parameter values for the conditional probability distribution by applying a quasi-Newton gradient ascent method to training data, wherein the conditional probability distribution is restricted to a disjoint set of hidden states for each of the class labels; and using the conditional probability distribution and the optimal parameter values to determine a most probable labeling sequence for the plurality of data record segments, wherein the plurality of data segments are applied to the conditional probability distribution to determine a plurality of marginal probabilities for each of the class labels. 8. The method of claim 7, wherein the conditional probability distribution is defined as p  ( S  X ) = 1 Z  ( X )  exp ( ∑ k  λ k · ∑ j = 1 T  f k  ( s j - 1 , s j , X , j ) ) , and wherein X is an observation sequence, Y is a potential labeling sequence, S is a vector of sub-structure variables, and λk is a confidence parameter. 9. The method of claim 8, wherein the quasi-Newton gradient ascent method is performed using a Gaussian prior defined as L  ( Λ ) = ∑ i = 1 n  log   P Λ  ( Y i  X i ) - ∑ k = 1 K  λ k 2 2   σ 2 , and wherein Λ is a set of parameters that includes the confidence parameter. 10. The method of claim 9, wherein the plurality of marginal probabilities are summed according to the disjoint sets of hidden states to determine the most probably labeling sequence. 11. The method of claim 8, wherein the confidence parameters and a transition function fk model dependencies between the class labels and the internal substructures. 12. A non-transitory machine-readable storage medium encoded with instructions executable by a processor for analyzing data using hidden dynamic systems, the machine-readable storage medium comprising instructions to: define a conditional probability distribution for labeling a plurality of data record segments, wherein the conditional probability distribution models dependencies between class labels and internal substructures of the plurality of data record segments; determine optimal parameter values for the conditional probability distribution by applying a quasi-Newton gradient ascent method to training data, wherein the conditional probability distribution is restricted to a disjoint set of hidden states for each of the class labels; and use the conditional probability distribution and the optimal parameter values to determine a most probable labeling sequence for the plurality of data record segments, wherein the plurality of data segments are applied to the conditional probability distribution to determine a plurality of marginal probabilities for each of the class labels. 13. The non-transitory machine-readable storage medium of claim 12, wherein the conditional probability distribution is defined as p  ( S  X ) = 1 Z  ( X )  exp ( ∑ k  λ k · ∑ j = 1 T  f k  ( s j - 1 , s j , X , j ) ) , and wherein X is an observation sequence, Y is a potential labeling sequence, S is a vector of sub-structure variables, and λk is a confidence parameter. 14. The non-transitory machine-readable storage medium of claim 13, wherein the quasi-Newton gradient ascent method is performed using a Gaussian prior defined as L  ( Λ ) = ∑ i = 1 n  log   P Λ  ( Y i  X i ) - ∑ k = 1 K  λ k 2 2   σ 2 , and wherein is a set of parameters that includes the confidence parameter. 15. The non-transitory machine-readable storage medium of claim 14, wherein the plurality of marginal probabilities are summed according to the disjoint sets of hidden states to determine the most probably labeling sequence.