Abstract:
The present invention relates to a method for incremental learning of a classification model, where pre-defined weak incremental learners are distributed over the distinct regions in a set of partitionings of the input domain. The partitionings and regions are organized via a binary tree and they are allowed to vary in a data-driven way, i.e., in a way to minimize the classification error rate. Moreover, to test a given data point, a mixture of decisions is obtained through the models learned in the regions that this point falls in. Hence, naturally, in the cold start phase of the data stream, the simpler models belonging to the larger regions are favored and as more data get available, the invention automatically puts more weights on the more complex models.

Description:
FIELD OF THE INVENTION 
       [0001]    The present invention relates to a method for incrementally learning a classification model for a large amount of labeled data being streamed in real time, which is based on an adaptive mixture of weak learners distributed on a non-rigid binary tree. 
       BACKGROUND OF THE INVENTION 
       [0002]    In a wide variety of applications ranging from visual target tracking to speech recognition, binary or multi-class classification problems are frequently encountered and used as one of the building blocks. In most of these problems, a need for processing large amount of data that are continuously streamed naturally arises. To this end, the incremental learning (or update) of a classification model in those problems is almost unavoidable. The incremental learners are naturally to be, computationally simple, capable of handling the complex separations in the data and quickly adaptive to the possible variations in the source statistics such as the appearance changes of a target being tracked. The method in this invention achieves these goals. 
         [0003]    It should be first emphasized that the incremental learner of the method in this invention is based on a set (in the course of the input data stream) of varying partitionings of the observation space, i.e., the partitionings are tuned to the observed data in a way to minimize the classification or regression error, and locating a local classifier on each distinct region of the partitionings. This set of varying partitionings and the corresponding local classifiers are organized via a binary tree. Our method accepts a data stream to process via pushing. one more data point to the tree at every time step. To test a data point, considering all the regions defined by the partitionings at the corresponding time step, the classification results of the local classifiers in the regions that this data point hills in are specially combined. i.e., weighted and summed, to obtain the final classification. Here, the local classifiers, the weights of the combinations and the generation of the aforementioned set of partitioning are incrementally updated to lower the empirical classification error at each step. 
         [0004]    The most relevant designs (Ozkan et al.), (Wang et al.) to this method in the corresponding literature exploit the idea of using localized classifiers to a limited degree. In a recent conference proceeding (Wang et al.), a rejection cascade of classifiers is designed for classification problems in the batch processing setting, where the nodes of that cascade design correspond to a region in the space of observations. These regions and the partitioning structure that is resulted are adjusted given a batch of data iteratively. No results or extension for incremental processing are provided. Furthermore, the cascade structure in that method is a very simple one and a natural extension via balanced trees is not mentioned. Also, their local classifiers are located at the deep leaf nodes, which create an immediate weakness when there is not sufficiently available data since the amount of data to populate the regions in the leaf nodes increases exponentially with the data dimensionality. This is the very case at the beginning of a data stream in high dimension in the sequential setting, which is handled by the adaptive mixtures in this method. 
         [0005]    In another design (Ozkan et al.), (1) the authors also exploit the idea of space partitionings. However, the set of partitioning in their method is basically based on listing all possible partitionings (up to certain region granularity) and it is fixed in the course of the data stream. This adversarially affects the adaptiveness of the corresponding incremental learner since in high dimension listing the all possible partitioning up to an arbitrary granularity is not feasible. (2) The authors (Ozkan et al.) also make use of the combination of some local classifiers, which are a simplified version of LDA classifiers in that case. However, the combination they use does not directly target at minimizing the classification accuracy, which clearly sacrifices from the classification accuracy. Moreover, LDA&#39;s are not originally designed for incremental learning. Although there exist several incremental versions of LDAs, the updates usually are more complicated compared to a perhaps more natural choice of perceptrons. 
         [0006]    The United States patent publication numbered U.S. Pat. No. 5,799,311 A discloses a method for generating a decision-tree classifier nom a training set of records, independent of the system memory size. In this invention, each node split is determined based on only one attribute using an appropriate criterion such as the Gini index. Also each split is determined once only and then it is fixed. Clearly, the method disclosed in U.S. Pat. No. 5,799,311 A is not appropriate for sequential processing. Moreover, the corresponding partitioning is fixed and no mixture of experts type of an approach is used to handle the case of insufficient number of available data points. 
         [0007]    The United States patent publication numbered US20050246307 A1 discloses a method for “employing a hybrid Bayesian decision tree for classification”, which has the capability of incrementally updating classification trees. The decision trees of this patent have one attribute evaluation only at each node. Moreover, the incremental learning in that context only means to create a new tree for some synthetic data points for which no tree model is existent as opposed to incrementally adjusting one existing tree structure. 
         [0008]    The United States patent publication numbered U.S. Pat. No. 6,269,353 B1 discloses a method for constructing decision trees, which learns multi-feature splits at the nodes of a decision tree using a neural network. This method does not target the case of sequential processing since it assumes the availability of a training set in advance. Hence, it does not have the capability of updating the structure of the decision tree on demand incrementally. No comment is made regarding the computational complexity, however our method processes every data point once only and does not store. Our method also uses a mixture of experts idea to handle the sparse data, which is an important cold start problem at the beginning of a data stream in the sequential setting. Our mixture of experts implementation favors simpler model trained with all available data points at the beginning and starts favoring more complex models as more data are streamed. 
         [0009]    In general, the existing work and inventions regarding the incremental updates of decision trees have common drawbacks: (1) the split at each node of the tree is usually single attribute based, (2) the split criterion is usually based on class label purities such as the Gini index. In our invention, we take a rather radical approach, which considers the split as a separate binary classification model and operates sequentially, i.e., the classification model for each split is learned incrementally. 
       SUMMARY OF THE INVENTION 
       [0010]    Our invention is capable of processing billions of data (such as feature vectors extracted from video frames) continuously, i.e., with no interrupt, and with incremental updates of a very low memory requirement and very high speed. 
         [0011]    The three main blocks of our invention (learning of the regions classifiers, learning the combinations and learning the space partitionings) are all data-driven and directly target at minimizing of the empirical classification error rate. 
         [0012]    The computational complexity of these updates is independent with the size of data to be processed; hence the method is highly scalable with the data size. 
         [0013]    The method also incrementally learns the space partitioning to distribute the local classifiers, which removes the necessity to list the all possible partitioning for a “good enough” classification. As a result, the method is highly scalable with the data dimensionality. 
         [0014]    The non-linear class separations are approximated via piece-wise linear boundaries incrementally, hence the method has high fitting capability. 
         [0015]    The proposed method is robust to over-fitting, since the local classifiers are linear classifiers, which are of finite “VC” dimensionality. 
         [0016]    The changes in the data source statistics are adaptively learnt and registered. 
         [0017]    Moreover, our method is robust to the noise in data, since the weighted combination of perceptions provides a soft classification decision. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0018]    A method for incremental learning in order to fulfill the objects of the present invention is illustrated in the attached figures, where: 
           [0019]      FIG. 1  is a schematic of the flowchart of the method. 
           [0020]      FIG. 2  is a schematic of the flowchart on the binary decision tree corresponding to a data point to be processed. 
       
    
    
       [0021]      200 . Binary tree 
         [0022]      201 . Corresponding leaf node 
         [0023]      202 . A corresponding intermediate node 
         [0024]      203 . Root node 
       DETAILED DESCRIPTION OF THE INVENTION 
       [0025]    A method for incremental learning ( 100 ) fundamentally comprises the steps of;
       propagating forward on the decision tree to locate the leaf node ( 101 ),   computing the node decision by compiling first the local decision at the node, then computing the node decision, if this node is non-leaf, as the weighted sum of the local decision and the node decision of the corresponding child; if this node is the leaf, as the local decision ( 102 ),   updating the local classification model ( 103 ),   updating the node classification model, i.e., the weighting coefficients ( 104 ),   updating the node partitioning model ( 105 ),   if this is not a root node, back propagating to the upper parent ( 108 ) and going to step  102 , otherwise, returning this node decision as the class label predict ( 106 )       
 
         [0032]    The method in this invention, the incremental learner, takes the instances of a data stream {x t ,y t },x t  ∈ R d ,y t  ∈ {1,−1} as the input, where d is the input dimensionality, x t  is the data point and y t  is the corresponding label. Here, the data point, for an instance, might be the feature vector for a visual target in a real time classification based target tracking application. At a time instant in the course of the data stream, first the data input is provided, then the corresponding decision regarding the class label is made; finally, the true class label is revealed and the classification model is updated. In the following, we first describe the classification model at a time instant; and then the details of the incremental update of the model are explained. 
         [0033]    Our method operates on a binary tree ( 200 ), each node of which corresponds to a partition classifier v p , a local linear classifier v c , and a weighting coefficient vector w to generate a node classifier. At a time instant t for the input data point x t  ( 100 ), a path from the root node to a leaf node is chosen ( 101 ). Namely, at the root node ( 203 ), it is checked if v p   T x t &gt;0, then the right child node is chosen ( 202 ) and included in the corresponding path, and otherwise, the left Child is chosen ( 201 ) and included. We here emphasize that for notational simplicity, we do not explicitly show the dependency of the variables of our method on the corresponding node in the tree and time. This will be clear from the context throughout this document. 
         [0034]    At the leaf node after tracing this path to the very end ( 201 ), the local classification is obtained as λ c =v c   T x t . Since it is a leaf node, the node classification is the same as the local classification ( 102 ). Starting from this leaf node, it is backtracked ( 108 ) up to the root node. 
         [0035]    On this bottom-to-up path, at an intermediate node, i.e., non-leaf node, ( 202 ) the local classification is obtained as λ c =v c   T x t , whereas the node classification is obtained as λ n =w T (λ c ,λ′ n ) T  ( 102 ). Here, λ′ n  is the node decision coming from corresponding child node, and w is the weighting vector at this node at the corresponding time instant. 
         [0036]    Then, the decision for the data input x t  is obtained as the node decision at the root node ( 106 ). ŷ t =sign(λ n ), where λ n  is the node decision at the root. 
         [0037]    We here point out that we calculate the local decisions as soft decisions, i.e., they are not discrete values except that at the root node, we enforce a hard decision by taking the sign of the corresponding node decision. After the data point x t  is observed and its class label is predicted, then the corresponding true class label y t  is revealed, and the incremental update of our classification model is performed. We adapt the voted perceptions (Freund, 1999) for the incremental learning scheme in this method. However, we strongly emphasize that these classifiers can be chosen as one of the many existing incremental linear classifiers. Here, we use voted perceptrons for their conceptual simplicity. In the following, we describe how we adapt them. For a given data point x t , the leaf node is first located on the binary tree ( 101 ). 
         [0038]    Then at the leaf node ( 201 ), the local classifier is updated with (x t ,y t ) ( 103 ). Supposing that the number of data points up to the time t−1 at this leaf node is N−1; the local linear classifier is updated as 
         [0000]        v   c ←(( N− 1) v   c   +μh   t )/ N,  
 
         [0000]    where μ is the learning rate and h t  is the sequence of linear separators learnt as follows: At a time t, we set h t =h t-1 +(y t −h t-1   T x t )x t , where h 0  is set randomly ( 200 ). Note that there is no weighting or further splitting at a leaf node. 
         [0039]    At an intermediate node, i.e., non-leaf node, the local classifier is updated precisely as same as the update rule given for the leaf node. To update the weighting coefficients, i.e., to update the node decision rule ( 104 ), we simply treat the weighting vector w as if it is a linear separator in the domain of the 2 dimensional (or 3 dimensional together with the bias term of the separators) observations of the local decisions and the node decision of the corresponding child. Namely, in addition to the data input x t , note that an intermediate node also observes (λ c ,λ′ n ), i.e., the pair of updated local decision and the updated node decision of the corresponding child node. With this input (λ c ,λ′ n ), we associate the class label y t . Then in this method, the weighting vector w behaves as the linear linear separator for the observations ((λ c ,λ′ n ),y t ). Here, we again use the voted perceptions to update the weighting vector. 
         [0040]    To update the partitioning ( 105 ), i.e., the variable v p  which decides the corresponding child node to pass the input point, v p  is considered as a linear separator in the domain of the data points. Let us name what the node decision would be if the other child were chosen, name it as “hypothetical node decision”, and name the decision resulted from the realized path as “realized node decision”. If the hypothetical node decision is ‘better’ than the realized node decision, i.e., if the hypothetical node decision is closer to the label y t  compared to the realized node decision, then update the node partitioning vector v p , as if the data point x t  is classified with v p  wrong. Otherwise, update the node partitioning vector v p , as if the data point x t  is classified with v p  correct. This update process is similar to the updating of local classifier update except that at every step, the learning rate must be sufficiently smaller than the magnitude of v p  to prevent disturbing the classifiers at the lower levels of the tree too much. For that, we choose the learning rate as a small fraction of the magnitude of v p . Namely, 
         [0000]        v   p ←(( N− 1) v   p   +μh   t )/ N  
 
         [0000]    where μ is the learning rate and h t  is the sequence of linear separators learnt by the typical perception (Freund, 1999). h 0  is set randomly ( 200 ). At a time t, we set h t =h t-1 -sign(h t-1   T x t )x t , if hypothetical node decision is ‘better’, h t =h t-1 , otherwise. Note that there is no weighting or further splitting at a leaf node. 
         [0041]    Despite that the testing and updating procedures are explained above as two separate operations, they can be readily completed through one pass, i.e., the back-propagation from the leaf node to the root node ( 100 ). At every step, first the node decisions are computed and then the models are updated up until the root node is reached ( 107 ). 
         [0042]    Finally, we note that the computational complexity of the invention is O(K) in the test phase, and O(2̂K) in the update phase, where K is the depth of the decision tree.