# Patent

## Title
Augmenting a training set for document categorization

## Abstract

A method and system for augmenting a training set used to train a classifier of documents is provided. The augmentation system augments a training set with training data derived from features of documents based on a document hierarchy. The training data of the initial training set may be derived from the root documents of the hierarchies of documents. The augmentation system generates additional training data that includes an aggregate feature that represents the overall characteristics of a hierarchy of documents, rather than just the root document. After the training data is generated, the augmentation system augments the initial training set with the newly generated training data.

## Background
BACKGROUND
Many search engine services, such as Google and Overture, provide for searching for information that is accessible via the Internet. These search engine services allow users to search for display pages, such as web pages, that may be of interest to users. After a user submits a search request that includes search terms, the search engine service identifies web pages that may be related to those search terms. To quickly identify related web pages, the search engine services may maintain a mapping of keywords to web pages. This mapping may be generated by “crawling” the web (i.e., the World Wide Web) to identify the keywords of each web page. To crawl the web, a search engine service may use a list of base web pages to identify all web pages that are accessible through those base web pages. The keywords of any particular web page can be identified using various well-known information retrieval techniques, such as identifying the words of a headline, the words supplied in the metadata of the web page, the words that are highlighted, and so on. The search engine service may generate a relevance score to indicate how related the information of the web page may be to the search request. The search engine service then displays to the user links to those web pages in an order that is based on their relevance.
Although search engine services may return many web pages as a search result, the presenting of the web pages in relevance order may make it difficult for a user to actually find those web pages of particular interest to the user. Since the web pages that are presented first may be directed to popular topics (e.g., when the ordering is based on Google's PageRank), a user who is interested in an obscure topic may need to scan many pages of the search result to find a web page of interest. To make it easier for a user to find web pages of interest, the web pages of a search result could be presented in a hierarchical organization based on some classification or categorization of the web pages. For example, if a user submits a search request of “court battles,” the search result may contain web pages that can be classified as sports-related or legal-related. The user may prefer to be presented initially with a list of classifications of the web pages so that the user can select the classification of web pages that is of interest. For example, the user might be first presented with an indication that the web pages of the search result have been classified as sports-related and legal-related. The user can then select the legal-related classification to view web pages that are legal-related. In contrast, since sports web pages are more popular than legal web pages, a user might have to scan many pages to find legal-related web pages if the most popular web pages are presented first. Alternatively, the user may be presented with a hierarchy of classifications. The user may select a classification when the user submits a search request. In this case, the search engine would limit the search to web pages within the selected classification.
It would be impractical to manually classify the millions of web pages that are currently available. Although automated classification techniques have been used to classify text-based content, those techniques are not generally applicable to the classification of web pages. Web pages have an organization that includes noisy content, such as an advertisement or a navigation bar, that is not directly related to the primary topic of the web page. Because conventional text-based classification techniques would use such noisy content when classifying a web page, these techniques would tend to produce incorrect classifications of web pages. Moreover, although many attempts have been made to classify web pages, they have generally not been able to effectively classify web pages into hierarchical classifications. A major reason for the inability to effectively classify the web pages is that some of the classifications have very few web pages. Because of the sparseness of web pages in certain classifications, it can be difficult to identify a large enough training set of web pages for training of a classifier for those classifications.
SUMMARY
A method and system for augmenting a training set used to train a classifier of documents is provided. The augmentation system augments a training set with training data derived from features of documents based on a document hierarchy. The training data (i.e., feature and classification) of the initial training set may be derived from the root documents of hierarchies of documents. The augmentation system generates additional training data that includes an aggregate feature that represents the overall characteristics of a hierarchy of documents, rather than just the root document. The augmentation system may exclude the feature of the root document from the generated training data since the feature of the root document is already included in the initial training set. After the additional training data is generated, the augmentation system augments the initial training set with the additional training data. After the training set is augmented, the augmented training set can be used to train the classifier for classifying the documents.
This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram that illustrates components of the augmentation system in one embodiment.
FIG. 2 is a flow diagram that illustrates the processing of the generate classifier component of the augmentation system in one embodiment.
FIG. 3 is a flow diagram that illustrates the processing of the augment training set component of the augmentation system in one embodiment.
FIG. 4 is a flow diagram that illustrates the processing of the create feature component of the augmentation system in one embodiment.



DETAILED DESCRIPTION
A method and system for augmenting a training set used to train a classifier of documents is provided. In one embodiment, the augmentation system augments a training set with training data derived from features of documents based on a document hierarchy. The training data of the training set may include a feature for each document of the training set along with a classification of the document. The feature of a document represents a characteristic or characteristics of the document upon which the classification of the document may depend. For example, the feature of a document may be represented as a word feature vector that includes an element for each keyword of the document that indicates the number of occurrences or frequency of that keyword within that document. The initial training data (i.e., feature and classification) of the training set may be derived from the root document of a hierarchy of documents. For example, when the documents are web pages, the initial training data may represent web sites and may be derived from the root web page of the web sites. The augmentation system generates training data that includes an aggregate feature that represents the overall characteristics of a hierarchy of documents, rather than just the root document. For example, the augmentation system may generate a feature for each web page of a web site and aggregate the features of the web pages into an aggregate feature that represents the web site, rather than just using the root web page as representative of the web site. The augmentation system may exclude the feature of the root document from the generated training data since the feature of the root document is already included in the training set. After the training data is generated, the augmentation system augments the initial training set with the newly generated training data. After the training set is augmented, the augmented training set can be used to train the classifier for classifying the documents. In this way, additional training data can be provided for a classification that may not otherwise have sufficient training data. Also, an aggregated feature can be provided that more accurately represents the characteristics of a hierarchy of documents.
In one embodiment, the augmentation system uses the hierarchical organization of web pages of a web site to specify parent/child relations, which are also referred to as the ancestor/descendent relations. The hierarchy of a web site may be defined by the uniform resource locators (“URL”) of the web pages. For example, the web page with the URL “www.va.gov” may be the common ancestor of all the web pages of the web site, which is also referred to as the root web page of the web site. Child web pages of the root web page may include “www.va.gov/disclaim.htm” and “www.va.gov/resdev.” One skilled in the art will appreciate that various techniques may be used to identify the hierarchical relations or structure of documents and in particular web sites. For example, the hierarchical structure of a web site may be derived from a site map included as a web page of the web site or may be derived from the intra-site links between web pages.
In one embodiment, the augmentation system generates a feature of a web site that represents the overall characteristics of the web pages within that web site. More generally, the augmentation system generates a feature that represents the overall characteristics of a hierarchy of documents. The augmentation system may generate a feature for each web page of a web site that is based on the feature of the web page itself and the features of descendent web pages. For example, a web page may have a word feature vector of (10, 0, 5) indicating that it contains 10 occurrences of the keyword “court,” 0 occurrences of the keyword “lawyer,” and 5 occurrences of the keyword “battle.” The web page may have two child web pages with the word feature vectors of (5, 5, 5) and (7, 11, 3). The augmentation system may calculate the aggregate word feature vector for the web page according to the following equation:




  
    
      
        
          
            F
            *
          
          ⁡
          
            (
            
              p
              k
            
            )
          
        
        =
        
          {
          
            
              
                
                  
                    F
                    ⁡
                    
                      (
                      
                        p
                        k
                      
                      )
                    
                  
                  ,
                
              
              
                
                  
                    CHILD
                    ⁡
                    
                      (
                      
                        p
                        k
                      
                      )
                    
                  
                  =
                  Φ
                
              
            
            
              
                
                  
                    
                      F
                      ⁡
                      
                        (
                        
                          p
                          k
                        
                        )
                      
                    
                    +
                    
                      α
                      ⁢
                      
                        
                          
                            ∑
                            
                              
                                p
                                
                                  k
                                  +
                                  1
                                
                              
                              ∈
                              
                                
                              
                              ⁢
                              
                                CHILD
                                ⁡
                                
                                  (
                                  
                                    p
                                    k
                                  
                                  )
                                
                              
                            
                          
                          ⁢
                          
                            
                              F
                              *
                            
                            ⁡
                            
                              (
                              
                                p
                                
                                  k
                                  +
                                  1
                                
                              
                              )
                            
                          
                        
                        
                          
                          
                            CHILD
                            ⁡
                            
                              (
                              
                                p
                                k
                              
                              )
                            
                          
                          
                        
                      
                    
                  
                  ,
                
              
              
                
                  k
                  >
                  
                    1
                    ⁢
                    
                      
                    
                    ⁢
                    and
                    ⁢
                    
                      
                    
                    ⁢
                    
                      CHILD
                      ⁡
                      
                        (
                        
                          p
                          k
                        
                        )
                      
                    
                  
                  ≠
                  Φ
                
              
            
            
              
                
                  
                    
                  
                  ⁢
                  
                    
                      α
                      ⁢
                      
                        
                          
                            ∑
                            
                              
                                p
                                
                                  k
                                  +
                                  1
                                
                              
                              ∈
                              
                                
                              
                              ⁢
                              
                                CHILD
                                ⁡
                                
                                  (
                                  
                                    p
                                    k
                                  
                                  )
                                
                              
                            
                          
                          ⁢
                          
                            
                              F
                              *
                            
                            ⁡
                            
                              (
                              
                                p
                                
                                  k
                                  +
                                  1
                                
                              
                              )
                            
                          
                        
                        
                          
                          
                            CHILD
                            ⁡
                            
                              (
                              
                                p
                                k
                              
                              )
                            
                          
                          
                        
                      
                    
                    ,
                  
                
              
              
                
                  k
                  =
                  
                    
                      1
                      ⁢
                      
                        
                      
                      ⁢
                      and
                      ⁢
                      
                        
                      
                      ⁢
                      
                        CHILD
                        ⁡
                        
                          (
                          
                            p
                            k
                          
                          )
                        
                      
                    
                    ≠
                    Φ
                  
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where F*(pk) represents the aggregate feature for document pk at level k of the hierarchy, F(pk) represents the feature for document pk itself, CHILD (pk) represents the set of child documents of pk, | | represents the number of documents in a set, Φ represents the empty set, and α represents the weighting factor when aggregating features of child documents. According to this equation, the feature of the root document of a hierarchy is not factored into the aggregation. If a training set already has training data representing the root document of a hierarchy, then the equation can be used to prevent the feature of the root document from being factored a second time into the training set. When the aggregate word feature vector is determined according to this equation, the result is (13, 4, 7) when α is 0.5 (i.e., (10, 0, 5)+0.5*((5+7)/2, (5+11)/2, (5+3)/2)). The augmentation system may calculate the aggregate word feature vector for a web page with child web pages according to the following equation:





  
    
      
        
          
            F
            ′
          
          ⁡
          
            (
            
              p
              k
            
            )
          
        
        =
        
          
            F
            ⁡
            
              (
              
                p
                k
              
              )
            
          
          +
          
            α
            ⁢
            
              
                
                  ∑
                  
                    
                      p
                      
                        k
                        +
                        1
                      
                    
                    ∈
                    
                      
                    
                    ⁢
                    
                      CHILD
                      ⁡
                      
                        (
                        
                          p
                          k
                        
                        )
                      
                    
                  
                
                ⁢
                
                  F
                  ⁡
                  
                    (
                    
                      p
                      
                        k
                        +
                        1
                      
                    
                    )
                  
                
              
              
                
                
                  CHILD
                  ⁡
                  
                    (
                    
                      p
                      k
                    
                    )
                  
                
                
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




where F′(pk) represents the aggregated feature for web page pk, F(pk) represents the feature for web page pk itself, CHILD(pk) represents the set of child web pages of pk, | | represents the number of web pages in a set, and α represents the weighting factor when aggregating features of child web pages. In this equation, the feature of a web page is only based on the feature of the web page itself and the feature of the child web pages themselves. That is, the features only propagate up one level in the hierarchy. More generally, the feature of a document may be based on features of both descendent and ancestor documents. In such a case, the features for a hierarchy of documents may be calculated iteratively until the features converge.

FIG. 1 is a block diagram that illustrates components of the augmentation system in one embodiment. The augmentation system 110 is connected to web sites 130 via communications link 120. The augmentation system includes a generate classifier component 111, an augment training set component 112, a create feature component 113, a crawler component 114, a web page store 115, a training set store 116, a classifier component 117, and a classification hierarchy store 118. The crawler component crawls the various web sites to identify the web pages of the web sites along with their hierarchical organization and stores the web page information in the web page store. The training set store contains the features of selected root web pages of web sites from the web page store along with their classification. The classification hierarchy store contains the hierarchical organization of the classifications for the web pages. The generate classifier component augments the training set based on web pages other than the root web page of a web site and trains the classifier using the augmented training data. The generate classifier component invokes the augment training set component to augment the training set, which in turn invokes the create feature component to create a feature that is representative of the hierarchy of web pages of the web site.
In one embodiment, the classifier may be based on a support vector machine that operates by finding a hyper-surface in the space of possible inputs. The hyper-surface attempts to split the positive examples from the negative examples by maximizing the distance between the nearest of the positive and negative examples to the hyper-surface. This allows for correct classification of data that is similar to but not identical to the training data. Various techniques can be used to train a support vector machine. One technique uses a sequential minimal optimization algorithm that breaks the large quadratic programming problem down into a series of small quadratic programming problems that can be solved analytically. (See Sequential Minimal Optimization, at http://research.microsoft.com/ ̃jplatt/smo.html.)
The computing device on which the augmentation system is implemented may include a central processing unit, memory, input devices (e.g., keyboard and pointing devices), output devices (e.g., display devices), and storage devices (e.g., disk drives). The memory and storage devices are computer-readable media that may contain instructions that implement the augmentation system. In addition, the data structures and message structures may be stored or transmitted via a data transmission medium, such as a signal on a communications link. Various communications links may be used, such as the Internet, a local area network, a wide area network, or a point-to-point dial-up connection.
The augmentation system may be implemented in various operating environments that include personal computers, server computers, multiprocessor systems, microprocessor-based systems, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The augmentation system may be described in the general context of computer-executable instructions, such as program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, and so on that perform particular tasks or implement particular abstract data types. Typically, the functionality of the program modules may be combined or distributed as desired in various embodiments.
FIG. 2 is a flow diagram that illustrates the processing of the generate classifier component of the augmentation system in one embodiment. The generate classifier component generates the training set, augments the training set with newly generated training data, and then trains the classifier using the augmented training set. In block 201, the component generates the training set using conventional techniques. For example, the component may identify the root web pages of web sites selected for the training set, generate a feature for the root web pages, and then input a classification from a user for each web site. In block 202, the component augments the training set with training data derived from the descendent web pages of the root web page of the web sites. In block 203, the component trains the classifier based on the training set as augmented.
FIG. 3 is a flow diagram that illustrates the processing of the augment training set component of the augmentation system in one embodiment. The component generates training data based on the non-root web pages of the web sites represented in the training set. In block 301, the component selects the next web site of the training set. In decision block 302, if all the web sites have already been selected, then the component completes, else the component continues at block 303. In block 303, the component invokes the create feature component to create a feature for the non-root web pages of the selected web site. In block 304, the component adds the created feature along with the classification of the selected web site as training data to the training set and then loops to block 301 to select the next web site in the training set.
FIG. 4 is a flow diagram that illustrates the processing of the create feature component of the augmentation system in one embodiment. The component is invoked recursively to perform a depth first traversal of the hierarchy of web pages. The component aggregates the features of the web pages during the traversal. The component is passed a web page. In decision block 401, if the passed web page has child web pages, then the component continues at block 402, else the component continues at block 409. In block 402, the component generates a feature for the passed web page. In one embodiment, the component may not factor in the feature of the root web page of a web site to avoid duplicate factoring in of that feature in the training set since the training set before augmentation already includes training data for the root web pages. In blocks 403-407, the component loops selecting child web pages of the passed web page and accumulating their contributions to the feature. In block 403, the component selects the next child web page of the passed web page. In decision block 404, if all the child web pages have already been selected, then the component continues at block 408, else the component continues at block 405. In block 405, the component recursively invokes the create feature component passing the selected child web page. In block 406, the component increments the count of the child web pages. In block 407, the component accumulates the feature of the selected child web page to the total of all the features for the child web pages. The component then loops to block 403 to select the next child web page. In block 408, the component calculates the feature for the passed web page as the feature generated in block 402 plus a weighted average feature of the child web pages. The weighting of the features of the child web pages may result in an exponential decay of the contribution of a feature of a web page based on the distance of descendent web pages. The component then returns. In block 409, the passed web page is a leaf web page and the component generates the feature of the web page and returns.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Accordingly, the invention is not limited except as by the appended claims.

## Claims

1. A method for generating a feature from a hierarchy of documents, the method comprising:
providing a hierarchical organization of the documents;
generating a feature for each of the documents in the hierarchy; and
generating an aggregate feature from the generated features of the documents to represent the feature for the hierarchy of documents

wherein the hierarchical organization specifies ancestor/descendent relations between documents and the feature for a document is an aggregate of the features of the document and its descendent documents; and
wherein the feature for a document with child documents is aggregated according to the following equation:




  
    
      F
      ′
    
    ⁡
    
      (
      
        p
        k
      
      )
    
  
  =
  
    
      F
      ⁡
      
        (
        
          p
          k
        
        )
      
    
    +
    
      α
      ⁢
      
        
          
            ∑
            
              
                p
                
                  k
                  +
                  1
                
              
              ∈
              
                
              
              ⁢
              
                CHILD
                ⁡
                
                  (
                  
                    p
                    k
                  
                  )
                
              
            
          
          ⁢
          
            F
            ⁡
            
              (
              
                p
                
                  k
                  +
                  1
                
              
              )
            
          
        
        
          
          
            CHILD
            ⁡
            
              (
              
                p
                k
              
              )
            
          
          
        
      
    
  




where F′(pk) represents the aggregated feature for document pk at level k of the hierarchy, F(pk) represents the feature for document pk itself, CHILD(pk) represents the set of child documents of pk , | | represents the number of documents in a set, and α represents the weighting factor when aggregating features of child documents.

2. The method of claim 1 wherein the document is a web page and the feature represents frequencies of keywords within the web page.

3. The method of claim 1 wherein the document is a web page and the feature for the web page is an aggregate of the features of ancestor and descendent web pages.

4. The method of claim 1 further comprising:
providing a training set of documents and their classifications, each document having a hierarchical organization of documents;
for each document, generating an aggregated feature for the document based on the hierarchical organization of documents associated with that document; and
using the training set and the generated aggregated features to train a classifier to classify documents.

5. The method of claim 4 further comprising:
receiving a document associated with a hierarchical organization of documents;
generating an aggregated feature for the received document based on the hierarchical organization of documents associated with the received document; and
using the classifier to classify the received document based on the generated aggregated feature of the received document.

6. The method of claim 4 wherein a web page is a document, the hierarchical organization of documents is a web site of web pages, and the training set include root web pages of web sites.

7. The method of claim 1 wherein a web page is a document and the hierarchical organization of documents is a web site of web pages.

8. A method for generating a feature from a hierarchy of documents, the method comprising:
providing a hierarchical organization of the documents;
generating a feature for each of the documents in the hierarchy; and
generating an aggregate feature from the generated features of the documents to represent the feature for the hierarchy of documents

wherein the hierarchical organization specifies ancestor/descendent relations between documents and the feature for a document is an aggregate of the features of the document and its descendent documents; and
wherein the feature for a document is aggregated according to the following equation:




  
    
      F
      *
    
    ⁡
    
      (
      
        p
        k
      
      )
    
  
  =
  
    {
    
      
        
          
            
              F
              ⁡
              
                (
                
                  p
                  k
                
                )
              
            
            ,
          
        
        
          
            
              CHILD
              ⁡
              
                (
                
                  p
                  k
                
                )
              
            
            =
            Φ
          
        
      
      
        
          
            
              
                F
                ⁡
                
                  (
                  
                    p
                    k
                  
                  )
                
              
              +
              
                α
                ⁢
                
                  
                    
                      ∑
                      
                        
                          p
                          
                            k
                            +
                            1
                          
                        
                        ∈
                        
                          
                        
                        ⁢
                        
                          CHILD
                          ⁡
                          
                            (
                            
                              p
                              k
                            
                            )
                          
                        
                      
                    
                    ⁢
                    
                      
                        F
                        *
                      
                      ⁡
                      
                        (
                        
                          p
                          
                            k
                            +
                            1
                          
                        
                        )
                      
                    
                  
                  
                    
                    
                      CHILD
                      ⁡
                      
                        (
                        
                          p
                          k
                        
                        )
                      
                    
                    
                  
                
              
            
            ,
          
        
        
          
            k
            >
            
              1
              ⁢
              
                
              
              ⁢
              and
              ⁢
              
                
              
              ⁢
              
                CHILD
                ⁡
                
                  (
                  
                    p
                    k
                  
                  )
                
              
            
            ≠
            Φ
          
        
      
      
        
          
            
              
            
            ⁢
            
              
                α
                ⁢
                
                  
                    
                      ∑
                      
                        
                          p
                          
                            k
                            +
                            1
                          
                        
                        ∈
                        
                          
                        
                        ⁢
                        
                          CHILD
                          ⁡
                          
                            (
                            
                              p
                              k
                            
                            )
                          
                        
                      
                    
                    ⁢
                    
                      
                        F
                        *
                      
                      ⁡
                      
                        (
                        
                          p
                          
                            k
                            +
                            1
                          
                        
                        )
                      
                    
                  
                  
                    
                    
                      CHILD
                      ⁡
                      
                        (
                        
                          p
                          k
                        
                        )
                      
                    
                    
                  
                
              
              ,
            
          
        
        
          
            k
            =
            
              
                1
                ⁢
                
                  
                
                ⁢
                and
                ⁢
                
                  
                
                ⁢
                
                  CHILD
                  ⁡
                  
                    (
                    
                      p
                      k
                    
                    )
                  
                
              
              ≠
              Φ
            
          
        
      
    
  




where F*(pk) represents the aggregated feature for document pk at level k of the hierarchy, F(pk) represents the feature for document pk itself, CHILD(pk) represents the set of child documents of pk , | | represents the number of documents in a set, Φ represents the empty set, and α represents the weighting factor when aggregating features of child documents.

9. The method of claim 8 further comprising:
providing a training set of documents and their classifications, each document having a hierarchical organization of documents;
for each document, generating an aggregated feature for the document based on the hierarchical organization of documents associated with that document; and
using the training set and the generated aggregated features to train a classifier to classify documents.

10. The method of claim 9 further comprising:
receiving a document associated with a hierarchical organization of documents;
generating an aggregated feature for the received document based on the hierarchical organization of documents associated with the received document; and
using the classifier to classify the received document based on the generated aggregated feature of the received document.

11. The method of claim 9 wherein a web page is a document, the hierarchical organization of documents is a web site of web pages, and the training set include root web pages of web sites.

12. The method of claim 8 wherein a web page is a document and the hierarchical organization of documents is a web site of web pages.

13. A computer-readable storage medium containing instructions for controlling a computing device to generate a feature from a hierarchy of documents, by a method comprising:
providing a hierarchical organization of the documents;
generating a feature for each of the documents in the hierarchy; and
generating an aggregate feature from the generated features of the documents to represent the feature for the hierarchy of documents

wherein the hierarchical organization specifies ancestor/descendent relations between documents and the feature for a document is an aggregate of the features of the document and its descendent documents; and
wherein the feature for a document with child documents is aggregated according to the following equation:




  
    
      F
      ′
    
    ⁡
    
      (
      
        p
        k
      
      )
    
  
  =
  
    
      F
      ⁡
      
        (
        
          p
          k
        
        )
      
    
    +
    
      α
      ⁢
      
        
          
            ∑
            
              
                p
                
                  k
                  +
                  1
                
              
              ∈
              
                
              
              ⁢
              
                CHILD
                ⁡
                
                  (
                  
                    p
                    k
                  
                  )
                
              
            
          
          ⁢
          
            F
            ⁡
            
              (
              
                p
                
                  k
                  +
                  1
                
              
              )
            
          
        
        
          
          
            CHILD
            ⁡
            
              (
              
                p
                k
              
              )
            
          
          
        
      
    
  




where F′(pk) represents the aggregated feature for document pk at level k of the hierarchy, F(pk) represents the feature for document pk itself, CHILD(pk) represents the set of child documents of pk, | | represents the number of documents in a set, and α represents the weighting factor when aggregating features of child documents.

14. The computer-readable storage medium of claim 13 further comprising:
providing a training set of documents and their classifications, each document having a hierarchical organization of documents;
for each document, generating an aggregated feature for the document based on the hierarchical organization of documents associated with that document; and
using the training set and the generated aggregated features to train a classifier to classify documents.

15. The computer-readable storage medium of claim 14 further comprising:
receiving a document associated with a hierarchical organization of documents;
generating an aggregated feature for the received document based on the hierarchical organization of documents associated with the received document; and
using the classifier to classify the received document based on the generated aggregated feature of the received document.

16. The computer-readable storage medium of claim 14 wherein a web page is a document, the hierarchical organization of documents is a web site of web pages, and the training set include root web pages of web sites.

17. The computer-readable storage medium of claim 13 wherein a web page is a document and the hierarchical organization of documents is a web site of web pages.