Abstract:
In a rule induction method, an overbroad candidate rule is selected for categorizing a node to be categorized. The candidate rule is specialized by: (i) adding a rule node corresponding to a node level of structured training examples; (ii) including in a rule node a rule pertaining to an attribute of at least one node of the corresponding node level to produce a specialized candidate rule; and (iii) evaluating the specialized candidate rule respective to the structured training examples.

Description:
BACKGROUND 
   The following relates to data classification, data mining, and related arts. It particularly relates to rule induction applied to structured XML data, and is described herein with particular reference thereto. However, the following is amenable to other like applications. 
   Rule induction involves automated determination of predictive rules. Typically, a training data set is used for learning the rule. Each example in the training set is described by a set of values for attributes (for example, Boolean, discrete, or continuous attributes), including an attribute of interest whose value or value range is to be predicted. A rule is constructed based on the training set which predicts that the attribute of interest will have a specified value or value range when specified other attributes have specified values or ranges. 
   For example, a training set listing persons may include examples each having attributes including attributes F3, F4, F6, and F10 where F3 indicates highest attained education level, F4 indicates number of years of education, F6 indicates job description, and F15 indicates salary level. The rule to be induced may be intended to predict when a person will have an income level greater than $50,000. One possible induced rule is: 
   IF F3=“Doctorate” AND F4=“16” AND F6=“Exec-managerial”
         THEN income&gt;50K       

   In one approach, a general or overbroad initial candidate rule is refined by specialization to produce the final rule. For example, the initial candidate rule may be an empty rule which reads upon every example in the training set. Attribute-value pairs are conjunctively added to specialize the rule until a selected termination criterion is reached, such as the rule having a threshold level of prediction accuracy. The process may be repeated to produce a set of such rules, each rule being a conjunctive combination of attribute-value pairs. 
   Heretofore, rule induction has generally been applied to flat data, in which each example is defined by a set of attributes-value pairs. Such rule induction is difficult to apply to structured data. For example, extensible mark-up language (XML), hypertext mark-up language (HTML), and other structured formats provide structure in which the data is organized in a tree-like structure. For example, an XML document may have a root node defined as “document” having child nodes corresponding to sections of the document, such as “introduction”, “chapter 1”, “chapter 2”, . . . , “conclusions”, or so forth. Each child node, in turn, can have its own child nodes. For example, each chapter node may have child nodes corresponding to paragraphs, and so forth. 
   CROSS REFERENCE TO RELATED PATENTS AND APPLICATIONS 
   Chidlovskii et al., U.S. patent application Ser. No. 11/156,776 filed Jun. 20, 2005 entitled “A method for classifying sub-trees in semi-structured documents” is incorporated herein by reference. This application discloses among other aspects methods and apparatuses in which the tree structure is pre-processed, and each XML node is represented as a set of paths. Attributes are also considered as nodes. The learner can use the content of a node in order to categorize it. 
   Chidlovskii, U.S. Pat. No. 6,792,576 entitled “System and Method of Automatic Wrapper Grammar Generation”, and Chidlovskii, U.S. Publ. Appl. 2004/0015784 A1 entitled “Method for Automatic Wrapper Repair”, are each incorporated herein by reference, and disclose among other aspects processing in which structured data is treated as text. 
   Chidlovskii et al., U.S. Published Application 2004/0268236 A1 entitled “System and Method for Structured Document Authoring” is incorporated herein by reference. This application discloses among other aspects a method for learning tree transformation. A structured data tree is pre-processed and split into paths. 
   BRIEF DESCRIPTION 
   According to aspects illustrated herein, there is provided a rule induction method. An overbroad candidate rule is selected for categorizing a node to be categorized. The candidate rule is specialized by: (i) adding a new node using an XML structural interface; (ii) adding a new attribute to a node; (iii) evaluating the specialized candidate rule respective to a set of training examples; and (iv) terminating the specializing when the specialized candidate rule satisfies a termination criterion. 
   According to aspects illustrated herein, there is provided a rule induction system. A general-to-specialized rule inducer generates a rule categorizing a node to be categorized of an XML document by specializing an overbroad candidate rule respective to a set of training XML documents. The general-to-specialized rule inducer includes a rule node adder that selectively adds nodes and attributes to the candidate rule. 
   According to aspects illustrated herein, there is provided a rule induction method. An overbroad candidate rule is selected for categorizing a node to be categorized. The candidate rule is specialized by: (i) adding a rule node corresponding to a node level of structured training examples; (ii) including in a rule node an attribute of at least one node of the corresponding node level to produce a specialized candidate rule; and (iii) evaluating the specialized candidate rule respective to the structured training examples. 

   
     BRIEF DESCRIPTION OF THE DRAWINGS 
       FIG. 1  diagrammatically shows a rule induction system capable of generating structured rules operating on XML data and including rule nodes corresponding to nodes other than the node to be categorized. 
       FIG. 2  diagrammatically shows a structure of pre-processed example XML training documents. 
   

   DETAILED DESCRIPTION 
   With reference to  FIG. 1 , a rule induction system  10  generates categorization rules by specializing an initial overbroad rule based on a set of training documents  12  that are accessible via a suitable XML structural interface  14 , such as an XPath or Document Object Model (DOM) interface. 
   A pre-processor  20  optionally processes the training documents  12  to define attributes of nodes of interest for rule induction, to define additional segmenting nodes that extract content of interest for rule induction, or so forth. For natural language processing applications, for example, each content stream (#PCDATA) is suitably segmented into tokens using a linguistic tool such as the Xerox Incremental Parser (XIP), which is described for example in: Ait-Mokhtar et al., “Robustness beyond Shallowness: Incremental Deep Parsing, in Journal of Natural Language Engineering, Special Issue on Robust Methods in Analysis of Natural Language Data, ed. A. Ballim &amp; V. Pallotta (Cambridge University Press, 2002), which is incorporated herein by reference; and Ait-Mokhtar, Incremental Finite-State Parsing, Proceedings of Applied Natural Language Processing (ANLP-97), Washington, D.C. April 1997, which is also incorporated herein by reference. Alternatively, tokenizers can be used for the segmenting. A list of separators can constitute sufficient segmenting. For each token a new node is appended to the structure with its specific attributes. Each token can also be split into smaller units such as letters (if the purpose is to learn morphological structure for instance). Each new node (word or letter) can be enriched with attributes. For example, each word node can be enriched with its part-of-speech (linguistic category such as noun, verb, preposition, or so forth), normalized form, presence in a specific terminological database, or so forth. Similarly each letter element can be enriched with attributes such as vowel, consonant, capital letter, or so forth. 
     FIG. 2  illustrates an example output of this pre-processing. The pre-processing keeps the original document structure, and adds new leaves, such as the illustrated letter leaves, and/or new node attributes, such as the illustrated surface, pos (part-of-speech), and lemme attributes, to it. If a linguistic tool such as a parser is used for the pre-processing, then richer linguistic information can be integrated such as linguistic dependencies between linguistic elements set forth using IDREF attributes. Depending on the learning task, other preprocessing steps can be applied on content elements. For example, for document categorization, the #PCDATA node can be replaced by a node with the set of words or lemmas found in the #PCDATA, preprocessing which corresponds to the traditional bag-of-words representation usually used in document categorization. If the document is structured in titles, sections, paragraphs, or so forth, this structure can be retained. 
   If the set of training documents  12  is not initially in an XML format, then the pre-processor  20  suitably converts the training documents to XML format. Structured data such as databases are readily converted into XML format. Traditional benchmarks used in machine learning such as the UCI database employ an &lt;attribute-value&gt; formalism and can also be easily converted into XML. For example, an &lt;attribute-value&gt; formatted example such as:
         25, Private, 226802, 11th, 7, Never-married,   Machine-op-inspct, Own-child, Black, Male, 0, 0, 40,   United-States, &lt;=50K
 
is suitably converted to XML according to:
       

                                           &lt;DATA&gt;           &lt;EX F0=“25” F1=“Private” F2=“226802” F3=“11th”           F4=“7” F5=“Never-married” F6=“Machine-op-inspct”           F7=“Own-child” F8=“Black” F9=“Male” F10=“0” F11=“0”           F12=“40” F13=“United-States” CAT=“-”/&gt;           &lt;/DATA&gt;                        
For a training set including many such examples (which is usually the case), each example is similarly disposed within the &lt;DATA&gt;&lt;/DATA&gt; mark-up pair using the &lt;EX /&gt; example mark-up.
 
   After the optional pre-processing, an initial candidate rule selector  22  selects an initial overbroad candidate rule for categorizing a node to be categorized. For example, a function buildEmptyRule( ) can be used to generate the initial overbroad candidate rule. A suitable overbroad initial rule constructed by the buildEmptyRule( ) function for the category GUIDENAME is: 
                                                               &lt;RULE CAT=“GUIDENAME” VALUE=“+”&gt;                &lt;NODE TBC=“+”&gt;                &lt;/RULE&gt;                        
where the attribute TBC designates the structured element or node that will be categorized by this rule. (“TBC” stands for “To Be Categorized”). The initial overbroad rule is specialized using a suitable learning algorithm, such as:
         candidate=buildEmptyRule(category)   learnSetOfRule(candidate,pos,neg)
 
where the function learnSetOfRule is given by:
       
                                                                                                                   learnSetOfRule(candidate,pos,neg)           list            candidate           while x in list do                eval = evaluation(x,pos,neg)   //rule evaluation           if eval&gt; θ then                setOfRules            x               cleanData(x,pos);   // delete covered                positive examples                else                list            specializeRule(x)   // add specialized                rules in the                candidate list                end if           delete(x,list)                end while           return setOfRule                        
where the function specializeRule( ) is given by:
         specializeRule(rule)
           set=set+addNewAttribute(rule)   set=set+addNewNode(rule)   
           Return set
 
and the function addNewNode( ) is given by:
   addNewNode(rule)
           set=emptySet( )   
           set=set+addFather(rule)   set=set+addChild(rule)   set=set+addPrevSibling(rule)   set=set+addNextSibling(rule)       
   return set 
   and the function addNewAttribute( ) is given by: 
   
       
       
         
           addNewAttribute(rule)
           set=emptySet( )   set=addAttribute(rule)   
         
           return set
 
The algorithms set forth above are suitably implemented in ALLiS, which is described for example in: Déjean, “Learning Rules and Their Exceptions”, Journal of Machine Learning Research vol. 2, pp. 669-93 (2002); and Déjean, “ALLiS: a Symbolic Learning System for Natural Language Learning”, in Proceedings of CoNLL-2000, Lisbon, Portugal (2000) pp. 95-98, both of which are incorporated by reference herein. ALLiS stands for “Architecture for Learning Linguistic Structures” and is a symbolic machine learning system which generates categorization rules from a tagged and bracketed corpus. Alternatively, the algorithms can be implemented using other systems suitable for implementing rule induction, such as Prolog. The example learnSetOfRule( ) function implements a general-to-specific learning approach. Other learning functions that include a specialization operation, such as decision tree algorithms, can also be used.
 
         
       
     
  
   With continuing reference to  FIG. 1 , the evaluation( ) function serves as a candidate rule evaluator  26 , and can be implemented in various ways to compute a score for the rule. Accuracy, Laplace estimate, m-estimate, information-gain, or so forth, can be used as scoring criterion. In a decision operator  30 , if the score of a candidate rule is greater than or equal to a threshold value θ, then an induction rules collector  32  puts the candidate rule into the set of rules. Otherwise it is specialized by adding a new piece of information using the specializeRule( ) function. 
   With continuing reference to  FIG. 1 , the specializeRule( ) function serves as a rule specializer  40  that specializes a candidate rule and adds the set of new candidate rules into the candidates list. A new piece of information may, for example, correspond to an attribute-value pair describing a training example. The attribute-value pair is added by the addNewAttribute( ) function  42 . More generally, the rule specializer  40  can specialize the candidate rule by adding substantially any kind of information provided by the XML training data  12 . This generalized capability is provided by a rule node adder such as the illustrated addNewNode( ) function  44 . When the rule is specialized by adding information which corresponds to an ID or IDREF, the resulting rule is not a tree, but a forest describing a structured rule. 
   Rule specialization is done until a termination criterion is satisfied. The termination criterion may include, for example, the decision operator  30  which terminates the specialization when the candidate rule&#39;s frequency in the training data reaches a given threshold. Additionally or alternatively, another decision operator  48  may terminate the specialization of a candidate rule when the rule has a maximum number of elements (nodes and attributes), a maximum numberof nodes, or so forth. In this case, the rule candidate is discarded  52 . The termination criterion thresholds and the maximum complexity of the decision operator  48  are suitably user selectable parameters. 
   The rule specializer  40  generates a new candidate rule with a new attribute and a new value, which depends upon the kind of attribute. Table I outlines how the rule specializer  40  specializes the candidate rule by adding nodes of various types. 
                               TABLE I                       XML Node   Action                           Father node   For each different label of the fathers, a new               candidate is added           Children nodes   For each different label of each child, a new               candidate is added           Sibling nodes   For each different label of each previous               and next sibling, a new candidate is added                        
Table II outlines how the rule specializer  40  specializes the candidate rule by adding attributes of various types.
 
                                         TABLE II               XML Attribute   Explanation   Action                                CDATA   CDATA stands for character   For each value of the           data, that is, text that does not   attribute, a new           form markup   candidate is added       IDREF   IDREF is used to establish   A conjunctive element           connections between   is added with the           elements. The IDREF value of   referred element           the attribute must refer to an           ID value declared elsewhere           in the document       IDREFS   Allows multiple ID values   Iteration over IDREF           separated by whitespace   values       NTOKEN   The first character of an   Idem as CDATA           NMTOKEN value must be a           letter, digit, ‘.’, ‘-’, ‘_’, or ‘:’       NTOKENS   Allows multiple NMTOKEN   Iteration over           names separated by   NTOKEN values           whitespace       ID   ID is a unique identifier of the   Idem as IDREF           attribute       ENTITIES   ENTITYs are used to   Entities are solved           reference data that act as an   during parsing (idem           abbreviation or can be found   as CDATA)           at an external location.       ENUMERATED   Enumerated attribute types   Idem as CDATA           allow you to make a choice           between different attribute           values. The first character of           an Enumerated value must be           a letter, digit, ‘.’, ‘-’, ‘_’, or           ‘:’                    
Information about the new elements that are added in order to create a more specialized candidate rule is collected by querying the training data  12  via the Xpath, DOM, or other structure interface  14 .
 
   As an example, starting with the initial overbroad candidate rule:
         &lt;NODE TBC=‘+’/&gt;
 
the following list shows examples of some new candidates suitably generated by specialization:
   &lt;NODE TBC=‘+’ W=‘Guide’/&gt;   &lt;NODE TBC=‘+’ Up=‘+’/&gt;   &lt;NODE W=‘Select’/&gt;&lt;NODE TBC=‘+’/&gt;   &lt;NODE TBC=‘+’/&gt;&lt;NODE W=‘Guide’/&gt;   &lt;p&gt;&lt;NODE TBC=‘+’/&gt;&lt;/p&gt;   &lt;TREE&gt;&lt;NODE TBC=“+” VERB=“_X1 ”/&gt;&lt;/TREE&gt; |   &lt;TREE&gt;&lt;NODE ID=“_X1” LEMMA=“consist”/&gt;&lt;/TREE&gt;
 
Each new candidate is evaluated by the candidate rule evaluator  26 , and if its score is not high enough as assessed by the decision operation  30 , the new candidate rule is further specialized by the rule specializer  40 , up to the maximum complexity specified by the decision operator  48 .
       

   The following is an example of a structured rule including a plurality of rule nodes that is suitably generated by the rule induction system  10  of  FIG. 1 . 
                                                                                                                                                                                       &lt;RULE CATEGORY=“GUIDENAME”&gt;           &lt;section&gt;                &lt;section&gt;                &lt;list-unordered&gt;                &lt;item&gt;                &lt;p&gt;                &lt;NODE TBC=“+” Up=“+”/&gt;                &lt;NODE W=“Guide”/&gt;                &lt;/p&gt;                &lt;/item&gt;                &lt;/list-unordered&gt;                &lt;/section&gt;                &lt;/section&gt;           &lt;section cond-display=“hide”&gt;                &lt;quiz/&gt;                &lt;/section&gt;                &lt;/RULE&gt;                        
In this rule, a word (element NODE with the attribute TBC) with some specific attributes (Uppercase) in a “content” context (followed by the word “Guide”) and in a relatively complicated structural context is categorized in a given category (Guide Name).
 
   The ID and IDREF attributes enable introduction of variables into the rule formalism. In XML, the type IDREF refers to an ID, unique identifier of a node element. An example of ID/IDREF attributes usage in XML is: 
                                                                                                                               &lt;Node lemma=“The” ID=“_1”/&gt;           &lt;Node lemma=“ABC” ID=“_2”/&gt;           &lt;Node lemma=“gene” ID=“_3”/&gt;           &lt;Node ID=“_X2” lemma=“encode” ID=“_4”/&gt;           &lt;Node lemma=“this” ID=“_5”/&gt;           &lt;Node lemma=“protein” ID=“_6”/&gt;                &lt;DEPENDENCY   PAR1=“_1”   PAR2=“_2”                name=‘MODIFIER’/&gt;                &lt;DEPENDENCY   PAR1=“_2”   PAR2=“_3”                name=‘MODIFIER’/&gt;           &lt;DEPENDENCY PAR1=“_3” PAR2=“_4” name=‘SUBJ’/&gt;           &lt;DEPENDENCY PAR1=“_5” PAR2=“_4” name=‘OBJ’/&gt;                &lt;DEPENDENCY   PAR1=“_5”   PAR2=“_6”                name=‘MODIFIER’/&gt;                        
where the parameters PAR1 and PAR2 are IDREF attributes, and ID is an ID attribute.
 
   Suitable processing for the ID/IDREF attributes during rule induction is as follows. The attribute of type IDREF or ID is added into the rule. In this example, the attribute of type ID=“ — 3” is added as follows:
         &lt;NODE lemma=“gene” ID=“ — 3”&gt;
 
The list of referred elements is collected (IDREF for ID or ID for IDREF). In this example, the referred elements of ID=“ — 3” are:
   &lt;DEPENDENCY PAR1=“ — 3” PAR2=“ — 4” NAME=“SUBJECT”/&gt;   &lt;DEPENDENCY PAR1=“ — 2” PAR2=“ — 3” NAME=“MODIFIER”/&gt;   . . .
 
For each referred element, a conjunctive rule is added with the ID/IDREF attribute:
   &lt;TREE&gt;&lt;NODE lemma=“gene” ID=“ — 3”&gt;&lt;/TREE&gt;   &lt;TREE&gt;&lt;DEPENDENCY ID1=“ — 3”/&gt;&lt;/TREE&gt;
 
The added new rule is specialized by the rule specializer  40  as with other rules:
   &lt;TREE&gt;&lt;NODE &gt;&lt;/TREE&gt;&lt;TREE&gt;&lt;DEPENDENCY PAR1=“ — 3” NAME=“SUBJECT”/&gt;&lt;/TREE&gt;   &lt;TREE&gt;&lt;NODE &gt;&lt;/TREE&gt;&lt;TREE&gt;&lt;DEPENDENCY PAR2=“ — 3” NAME=“MODIFIER” /&gt;&lt;/TREE&gt;   . . .
 
The value of the ID/IDREF attribute is replaced by a variable (existential quantification). Typically, the first variable is named “_X1”, the second “_X2”, and so forth. The list of these variables is added into the candidate head. A universal quantifier is associated each variable implicitly. The new candidates are added into the candidates list. With ID/IDREF processing, the learned rules are no longer a tree but a forest, where a twig of one tree is linked with a twig in one other tree.
       

   An example of rule in ALLiS formalism with IDREF variable is: 
                                                                                                                           &lt;RULE NUM=“23” CATEGORY=“BIOENTITY” FREQ=“12”           SCORE=“0.91” VARIABLES=“_X1_X2”&gt;                &lt;TREE&gt;                &lt;Node TBC=“+”/&gt;           &lt;Node lemma=“gene” ID=“_X1”/&gt;                &lt;/TREE&gt;           &lt;TREE&gt;                &lt;DEPENDENCY PAR1=“_X1” PAR2=“_X2”           name=‘SUBJ’/&gt;                &lt;/TREE&gt;           &lt;TREE&gt;                &lt;Node ID=“_X2” lemma=“encode”/&gt;                &lt;/TREE&gt;                &lt;/RULE&gt;                        
This rule is composed of three conjunctive parts (TREE elements), and two variables, _X1 and _X2. It can be read as: a word followed by the word “gene” which is the subject of a verb “encode” belongs to the BIOENTITY category.
 
   Embodiments of the rule induction system disclosed herein have been tested on several collections. In one test, the goal was to structure the bibliography part of documents provided by the European Patent Office. The problem was then to categorize structural XML elements. Evaluation is given Table III, with and without the use of content. 
                                                         TABLE III                       Precision   Recall   F1-score                                        Without content   0   0   0           With content   95   94   94.5                        
In Table III, F1-score indicates the harmonic means. In another test, this one employing a BioTIP™ collection of bioinformatics content developed by Xerox Corporation, the goal was to tag biological entities such as genes, proteins, and RNA, in articles abstracts of the BioTIP™ collection. Evaluation is given Table IV.
 
                                                         TABLE IV                       Precision   Recall   F1-score                                        With structure   86.21   69.98   76.68           Without structure   87.90   63.47   73.71                        
This test shows that the combination of structural information and content information can improve the prediction performance of a set of rules. If precision decreases slightly (−1.5%), recall is improved by +6.5% and F1 (harmonic means) is improved by +3%.
 
   It will be appreciated that various of the above-disclosed and other features and functions, or alternatives thereof, may be desirably combined into many other different systems or applications. Also that various presently unforeseen or unanticipated alternatives, modifications, variations or improvements therein may be subsequently made by those skilled in the art which are also intended to be encompassed by the following claims.