Abstract:
A method and a system for evaluating/analyzing patent portfolio using patent priorities are provided for selecting a patent family to establish a data set based on members of the patent family and priorities claimed by the members, forming a relationship matrix based on the members and the priorities claimed by the members in the data set and at last, and analyzing a relationship between the members of the patent family and the priorities claimed by the members of the patent family through the relationship matrix to form an analysis result and then, performing patent evaluation patent portfolio according to the analysis result. Accordingly, a patentee having numerous patents may quickly know what patents have high importance, high value and high techniques and the patentee or his competitor is facilitated to perform patent evaluation, patent portfolio, patent application and patent maintenance.

Description:
BACKGROUND OF THE INVENTION 
       [0001]    1. Field of the Invention 
         [0002]    This invention relates to methods for evaluating patent portfolio and related systems, and more particularly, to a method for analyzing relationship between patent family member and its claimed priority to evaluate patent portfolio, and a related system. 
         [0003]    2. Description of Related Art 
         [0004]    While a company faces many competitors, besides increasing research budget, a method for raising competitiveness of itself by transforming intangible technique idea to patent is quite important. If the company would enter a market of some products, it should perform patent portfolio with respect to the products first. Besides understanding techniques of the competitor to avoid infringement, the company may clearly know what&#39;s its core techniques and focus on developing the core techniques, thereby enhancing its patent territory and obtaining great benefits. 
         [0005]    The so-called patent portfolio is to file patent applications around with plan and purpose and to form patent family based on all relevant patent applications at each place. Generally, if a company lacks perfect patent portfolio, the patent enforcing effect may decrease. When the company cooperates with other enterprises, poor patent portfolio may result in decreased licensing counter. Furthermore, relevant techniques have difficult to continue innovation or realize its marker value. Hence, in terms of company technique research or market development later, well patent portfolio will generate more benefits. 
         [0006]    The utilization of the previously mentioned patent family is very wide. It may realize market value of portfolio of other companies through patent family. Furthermore, value of the patent may be clearly known through patent family. Generally, if a patent is not important, a company dose not have to spend huge money for global patent portfolio, that is, the size of patent family members is one of indications of that if the patent is important or not. Moreover, when a patent is proceeding licensing or transaction, it will facilitate to raise negotiation counter if patent portfolio spans many countries. 
         [0007]    Citation relationship is discussed in prior patent portfolio. When there is a citation relationship between a plurality of patents, it may construct patent citation network (PCN). Of course, it comprises self-citation of the same company and mutual citation of different companies therein. It may observe that patent citation condition and its market value through PCN, wherein a patent being frequently cited often has more benefits. Additionally, observing network structure of patent citation may know that which of company cites some patents or the condition that some patent is cited by its own company or other companies and therefore, may not only know the importance of patent but also judge development tendency of patent techniques. 
         [0008]    However, patent citation is under consideration of discussing citation relationship between patents in a view of external analysis point. Using PCN for analysis may observe and know possible market value of patents of a company while there still exists a troublesome problem that it is uncertain whether patent may be transformed to effective financial capital or not. 
         [0009]    In conclusion, a single patent has lower value and is hard to be evaluated for its overall usefulness. In contrast, it clearly judges current development situation and future direction of some technique field better through portfolio of a plurality of patents. Therefore, it is an important issue for a company to find out patent portfolio with high value, high importance and high techniques so as to perform patent licensing, strategy alliance and even to discover potential infringers. 
       SUMMARY OF THE INVENTION 
       [0010]    In view of the above-mentioned problems of the prior art, it is a primary objective of the present invention to provide a method for evaluating/analyzing patent portfolio using patent priority. The method comprises steps of (1) selecting a patent family to establish a data set based on members of the patent family and priorities claimed by the members of the patent family, (2) forming a relationship matrix based on the members of the patent family and the priorities claimed by the members of the patent family in the data set and, (3) analyzing a relationship between the members of the patent family and the priorities claimed by the members of the patent family through the relationship matrix to form an analysis result, and performing patent evaluation or patent portfolio according to the analysis result. 
         [0011]    In a preferable embodiment, the above-described step (1) further comprises (1-1) selecting one of a plurality of litigation case data that has a largest case importance coefficient among case importance coefficients of the litigation cases data as important case data, (1-2) forming key patent data from patents referred by the important case data, (1-3) searching the key patent data to obtain the patent family corresponding to the key patent data and to obtain the members of the patent family and the priorities claimed by the members of the patent family and, (1-4) establishing the data set based on the members of the patent family and the priorities claimed by the members of the patent family. 
         [0012]    The present invention further provides a system for evaluating/analyzing patent portfolio using patent priority. The system comprises a data storage unit for storing litigation cases data, a key patent screening unit for selecting one of the litigation case data that has a largest case importance coefficient among case importance coefficients of the litigation case data stored in the data storage unit as important case data and forming key patent data from patents referred by the important case data, a data set unit for searching the key patent data to obtain patent family corresponding to the key patent data and to obtain members of the patent family and priorities claimed by the members of the patent family so as to establish data set based on the members of the patent family and the priorities claimed by the members of the patent family and, a data analysis unit for analyzing or calculating the data set to obtain a critical chain, a significant chain or at least one core patent candidate through approaches of a priority relationship matrix, priority cumulating or priority screening so as to perform patent evaluation or patent portfolio according to the critical chain, the significant chain or the core patent candidate(s). 
         [0013]    Compared to prior art, the method and system for evaluating/analyzing patent portfolio using patent priority approach of the present invention evaluate a patent portfolio having high importance, high value and high techniques by using the relationship between patent family members and their claimed priorities, and thus facilitate a patentee to perform patent evaluation, patent portfolio, patent application and patent maintenance and therefore, solve problems encountered by prior art of which evaluating patent and its overall effectiveness is hard for the patentee. 
     
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         [0014]      FIG. 1  illustrates a schematic diagram of a relationship between patent family members; 
           [0015]      FIG. 2(   a ) illustrates a schematic diagram of Patent Family-Base (PFB) concept presenting priority claimed by patent family member pf i ; 
           [0016]      FIG. 2(   b ) illustrates a schematic diagram of Priority Patent-based (PPB) concept presenting priority pp j  being claimed by four family members; 
           [0017]      FIG. 3  illustrates a schematic diagram of Patent Priority Approach (PPA) concept; 
           [0018]      FIG. 4  illustrates a schematic diagram of each stage of a process of PPA; 
           [0019]      FIG. 5  illustrates a schematic diagram of a data set establishment process of PPA; 
           [0020]      FIG. 6  illustrates a flow chart of a method for evaluating/analyzing patent portfolio using patent priority in accordance with the present invention; 
           [0021]      FIG. 7  illustrates a flow chart of a process of applying the method for evaluating/analyzing patent portfolio using patent priority to find out a critical chain, a significant chain and core patent candidate(s) in accordance with the present invention; and 
           [0022]      FIG. 8  illustrates a system block diagram of a basic architecture of a system for evaluating/analyzing patent portfolio using patent priority in accordance with the present invention. 
       
    
    
     DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS 
       [0023]    Since information provided by patent family may be various application, the present invention provides a Patent Priority Approach (PPA) on the basis of network structure consisting of priority of patent family to make up deficiencies generated by patent citation network such that a company can have more detailed planning with respect to patent portfolio. 
         [0024]    Relating PPA, a key patent is found from patent litigation cases, and a network structure of patent family is formed by the key patent. The present invention analyzes patent cases and their claimed priorities (i.e., claimed patent) and thus constitutes a Patent Priority Network (PPN). This kind of PPN is different from a patent citation network. Technique development route and technique development duration may be observed through the PPN. Portfolio condition of core patents may be judged by a number of times of claimed priorities. Moreover, this approach is focused on strategy layout inside a company (a patentee) and thus much more beneficial to patent portfolio analysis. 
         [0025]    The present invention arranges priority patent claimed by each member on the basis of application date to form a series of priority patent portfolio called a patent chain. The patent chain represents a development route of related technique of family members. An amount of these priorities is called generation number.  FIG. 1  illustrates related concepts of priority patent, wherein family member D″ and its claimed priorities A, B, C, D and D′ form a network flow chart, wherein D″ claims priority D′, while D′ claims priority D, additionally D claims sequentially priority A, B and C.  FIG. 1  illustrates a priority portfolio claimed by patent D″, that is, the content of its patent chain is {A, B, C, D and D′} and, D″ claims five priorities. Therefore, the generation number is five, and it means that D″ is extended through this five priority. 
         [0026]    Since the relationship “advocate” or “claimed” between patent family member and its claimed priority is only considered, priority network structure may be illustrated by two types on the basis of Patent Family-Based (PFB) and Priority Patent-Based (PPB). PFB is a set of patent family members claiming priority and is represented by set PF={pf 1 , pf 2 , . . . , pf m } while PPB is a set of claimed priority members and is represented by set PP={pp 1 , pp 2 , . . . , pp n }. The concept of PFB and PPB is explained in the following description in conjunction with  FIG. 2 . 
         [0027]      FIG. 2   a  illustrates a concept of PFB. In the patent family set PF, the amount of claimed priority PP is n, wherein the i th  patent family member pf i  is used to be an example for discussion (1□i□m, i is not greater than amount of family member m). This figure represents the priority claimed by pf i , wherein it is shown on the patent chain of pf i  that pf i  claims pp j+1  for priority, pp j+1  claims pp j  and pp j−1  for priority, pp j  and pp j−1  both claim pp j−2  for priority, pp j−2  claims pp 2  for priority, pp 2  claims pp 1  for priority. If there is claimed connection between any two priorities, an arrow is used to connect them, otherwise, no arrow. Therefore, when patent pot is in the patent application, it totally claims six priorities ordered according to time, that is, {pp 1 , pp 2 , pp j−2 , pp j−1 , pp j , pp j+1 } which is a patent chain of pt. Hence, it is inferred that the claim of pf i  is innovatively extended from this six priority patents {pp 1 , pp 2 , pp j−2 , pp j−1 , pp j , pp j+1 } and the generation number of pf i  is six. 
         [0028]      FIG. 2   b  illustrates a concept of PPB. In terms of the j th  priority pp j  (1□j□n) of priority set PP, it is a priority commonly claimed by four patents {pf 1 , pf 2 , pf 4 , pf m } of patent family set PF. Therefore, the number of times of that pp j  is claimed for priority is four. 
         [0029]    The present invention provides PPA on the basis of these two previously described layout approaches. As illustrated in  FIG. 3 , pf 1 -pf 3  are partial members of some patent family PF and, pp 1 -pp 4  are partial priority claimed by these patent family members. Known from this figure, generation number of patent chain is four and, three family members pf 1 -pf 3  form a patent family by commonly claiming priority pp 1 , wherein the number of times of that pp 1  is repeatedly claimed is the greatest, that is, three times, while this means that larger proportion of the patent family is innovatively continued from pp 1 . 
         [0030]    It represents that generation number is greater when patent chain length is longer by analyzing claimed priority amount of each patent chain (i.e., generation number), i.e., the number of continuation times of the patent chain on development is greater and, patent or its technique on the patent chain has more opportunities of research and design, which may present innovation depth of the patent. Moreover, the number of repeated claiming times of each priority presents reference degree of the patent. If the number of claiming times of the priority is more, the patent has basic or greater influence and, it also presents innovation scope of the patent. 
         [0031]    PPA of the present invention begins with dispute patent in litigation case and, analyzes patent portfolio direction or strategy of a company through finding related patent family and priority relationship between members of the patent family. A critical chain and a significant chain of a patent family is further found by previous described patent chain analysis, wherein a member (patent) having the greatest number of times of claimed priority in all patent family members is found, and a set of all priority claimed by the patent during prosecution will constitute a patent chain which is called the critical chain generally meaning that technique development on the patent chain has the longest history and is continuously studied later while the technique has the deepest scalability or is improved. In addition, so-called significant chain refers to that the total number of patent on a patent chain repeatedly claimed for priority is the greatest in all patent chains. It represents that the patent has significance affecting research development of other patent. It should additionally formulates a screening requirement with respect to the number of repeatedly claimed times of priority in the development process of the significant chain. The screening requirement is used to determine which patent has potential of becoming a technique core of company research or utilization for patent planning portfolio. This screening method is called a screening rule of core patent candidates. 
         [0032]    In addition, the analysis process of PPA may be divided into three stages which include data search, data set establishment and data analysis. Generally, required data is screened and searched in litigation case database and patent database, the data is analyzed to establish data set, and a critical chain, a significant chain and possible core patent candidate(s) are obtained through the data analysis of the data set, wherein its process is shown in  FIG. 4 . 
         [0033]    As previous description, PPA may be divided into three stages which include data search, data set establishment and data analysis, wherein the data search stage may be further divided into two parts of important case selection and key patent selection. Each patent has different value in each stage of its life cycle. Hence, it further shows that patent has its importance if the patent experiences litigation process. Generally, it will find that a dispute patent comes from the same patent family by analyzing the dispute patent mentioned inside a litigation case. This shows that the patent family is formed through considerably planned layout. Therefore, one representative patent is chosen herein as a key patent for facilitating the collection of relevant data so as to establish data set. 
         [0034]    A patent litigation case is first searched in the Court of Appeals for the Federal Circuit (CAFC), and any law case database (for instance, LexisNexis, WestLaw, and etc. all having case text of CAFC) is chosen for performing search. It will obtain s cases and, initial analysis is performed. The i th  case is represented by LA i , LA i =(o(N i ), P i ), which contains: 
         [0000]      LA i   ={o ( N   i ), p   i1   ,p   i2   , . . . ,p   in     i     }, i= 1,2 , . . . , s   (1)
 
         [0035]    Wherein o(N i ) represents the amount of litigants in the i th  case, P i ={p i1 , p i2 , . . . , p in     i   }, i=1,2, . . . , s, represents the patent number of dispute patent in the i th  case, N i  represents the litigants in the case, wherein the amount of litigants is the summation of plaintiff and defendant. 
         [0036]    Given the patent number, p ij , of any dispute patent in each case LA i , j=1,2, . . . , n i , p ij  is the j th  element in the set {p i1 , p i2 , . . . , p in     i   }. Any dispute patent number involved in each case LA i  is used as a keyword. Searching the scope of its patent family in INPADOC may obtain the size of patent family members set F i , the size of which is o(F i ), i=1,2, . . . , s. As previously described, dispute patent numbers are usually all from the same patent family. Hence, the size of patent family searched from any dispute patent is the same. 
         [0037]    The previous equation (1) and above steps are combined and, patent family information obtained by searching CAFC cases and INPADOC database is integrated. After arrangement, it may obtain case set L i , shown as equation (2): 
         [0000]        L   i =( o ( N   i ),  P   i , ( o ( F   i )),  i= 1,2, . . . ,  s   (2)
 
         [0038]    ,wherein it comprises three data items which include the amount of litigant of both sides o(N i ), patent number set of dispute patent, P i ={p i1 , p i2 , . . . , p in     i   }, and size of patent family o(F i ) (i.e., amount of family members). o(N i ) and o(F i ) are the respective counts of the elements in sets N i  and F i . 
         [0039]    Next, a case importance coefficient LPF i  of each case is calculated. If the amount of plaintiff and defendant is greater, it means that the litigation case involves more parties and has the higher level impact, and it shows the importance of this patent. Hence, the multiplying result of the amount of litigants o(N i ) of each litigation case and the size of patent family members o(F i ) is used as a judgment index LPF i  of importance of each case, shown as equation (3) and, the value of i which maximizes LPF i  is denoted as i*, shown as equation (4): 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       LPF 
                       i 
                     
                     = 
                     
                       
                         o 
                          
                         
                           ( 
                           
                             N 
                             i 
                           
                           ) 
                         
                       
                       · 
                       
                         o 
                          
                         
                           ( 
                           
                             F 
                             i 
                           
                           ) 
                         
                       
                     
                   
                   , 
                   
                     i 
                     = 
                     1 
                   
                   , 
                   2 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   s 
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
             
               
                 
                   
                     LPF 
                     
                       i 
                       * 
                     
                   
                    
                   
                     Max 
                     
                       1 
                       ≤ 
                       i 
                       ≤ 
                       s 
                     
                   
                    
                   
                     LPF 
                     i 
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
         [0040]    Consequently, the i th  litigation case referred by LPF i*  is an important case L i* , shown as equation (5), which will be an analysis subject of the following key patent selection. 
         [0000]        L   i* =( o ( N   i* ),  P   i*   , o ( F   i* ))  (5)
 
         [0041]    The set of n i*  dispute patents, 
         [0000]    
       
         
           
             
               
                 P 
                 
                   i 
                   * 
                 
               
               = 
               
                 { 
                 
                   
                     p 
                     
                       
                         i 
                         * 
                       
                        
                       1 
                     
                   
                   , 
                   
                     p 
                     
                       
                         i 
                         * 
                       
                        
                       2 
                     
                   
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     p 
                     
                       
                         i 
                         * 
                       
                        
                       
                         n 
                         
                           i 
                           * 
                         
                       
                     
                   
                 
                 } 
               
             
             , 
           
         
       
     
         [0000]    involved in the case may be obtained through the content of important case. And these dispute patents P i*  form a patent family due to relationship of commonly claimed priority. Generally, in a case, one patent is often assigned as a representative of all dispute patent to continuously describe case content. For example, it assigns the j* th  patent P i*j* , in order to provide a representative of all disputed patents 
         [0000]    
       
         
           
             
               { 
               
                 
                   p 
                   
                     
                       i 
                       * 
                     
                      
                     1 
                   
                 
                 , 
                 
                   p 
                   
                     
                       i 
                       * 
                     
                      
                     2 
                   
                 
                 , 
                 … 
                  
                 
                     
                 
                 , 
                 
                   p 
                   
                     
                       i 
                       * 
                     
                      
                     
                       n 
                       
                         i 
                         * 
                       
                     
                   
                 
               
               } 
             
             . 
           
         
       
     
         [0000]    We regard P i*j*  as the key patent, as a basis of data set establishment later. 
         [0042]    The key patent P i*j*  is found by accomplishing the previous approach. Next, data set is established. Its patent family is found via the key patent. After arrangement, it establishes required data set with respect to claimed priority. The approximate process is illustrated in  FIG. 5 . 
         [0043]    Patent family of P i*j*  is searched and obtained in INPADOC database by enabling P i*j*  as a subject, wherein the size of the family members is n pf1 . 
         [0044]    However, different kind codes may occur due to different application state in the patent family members obtained by the previous searching approach while these codes belong to the same patent. Therefore, these patent having the same patent number while having different kind of codes is screened and arranged. It may obtain n pf2  patents by assigning the patent having the earliest application date as a representative while deleting others if necessary. And its size will not be greater than the original size of family members, that is, n pf2 ≦n pf1 . 
         [0045]    Additionally, the patent searched from INPADOC database does not comprise abandoned patent. However, the patent which is applied before but abandoned later is necessary for patent layout of a company. Therefore, the abandoned patent is found by the content of n pf2  searched specification and, its size is set to be n pf3 . 
         [0046]    Arranged patent family having n pf  members may be obtained by integrating n pf2  and n pf3  patents. The patents of the same country are herein ordered on the basis of application date to facilitate later data analysis and to clearly know the sequence of patent application (patent deployment). The patent family member is represented by PF i , wherein i=1, 2, . . . , n pf , n pf =n pf2 +n pf3 . 
         [0047]    Each family member PF i , i=1, 2, . . . , n pf , has respective claimed and different amount of priority PP ik  according to different application relationship with respect to a parent case. Next, n pp  priority patent may be obtained by integrating the same claimed priority of each family member. Similarly, the order is pp 1 ,pp 2 , . . . ,pp n     pp    according to their application dates. Additionally, it sets PPB j =pp j , j=1, 2, . . . , n pp , wherein PPB represents all arranged priorities of the family. A data set Ω is established by the family members PF i  and claimed priority PP ik . The data set is shown as equation (6): 
         [0000]      Ω={ PF   i   ,PP   ik }, i=1, 2 , . . . , n   pf   , k= 1, 2 , . . . ,n   i , 1 ≦n   i   ≦n   pp   (6)
 
         [0048]    Steps of above data search and data set establishment are all for obtaining the data set Ω required by PPA in accordance with the present invention. Next, the data set Ω is analyzed to find out the critical chain, the significant chain and that which of patent may be core patent candidate(s) inside all patent chains in the patent family. 
         [0049]    It establishes a relationship matrix represented by R=└r ij ┘ n     pf     *n     pp    being between patent family member PF i  and its claimed priority PP ik  via data comprised by the data set Ω, wherein, 
         [0000]    
       
         
           
             
               
                 
                   
                     r 
                     ij 
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               
                                 1 
                               
                               
                                 
                                   
                                     PP 
                                     ik 
                                   
                                   = 
                                   
                                     PPB 
                                     j 
                                   
                                 
                               
                             
                             
                               
                                 0 
                               
                               
                                 otherwise 
                               
                             
                           
                            
                           
                             
 
                           
                            
                           i 
                         
                         = 
                         1 
                       
                       , 
                       2 
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         n 
                         pf 
                       
                       , 
                       
                         
 
                       
                        
                       
                         j 
                         = 
                         1 
                       
                       , 
                       2 
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         n 
                         pp 
                       
                       , 
                       
                         
 
                       
                        
                       
                         k 
                         = 
                         1 
                       
                       , 
                       2 
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         n 
                         i 
                       
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
         [0050]    In terms of the i th  family member PF i  in the patent family, the amount of the priority PP ik  claimed by the family member is GR i , which is called generation number, represents the length of the patent chain, and is shown as equation (8), while the largest one GR i*  is found from all GR i  and shown as equation (9): 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       GR 
                       i 
                     
                     = 
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           1 
                         
                         
                           n 
                           pp 
                         
                       
                        
                       
                         r 
                         ij 
                       
                     
                   
                   , 
                   
                     i 
                     = 
                     1 
                   
                   , 
                   2 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     n 
                     pf 
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
             
               
                 
                   
                     GR 
                     
                       i 
                       * 
                     
                   
                   = 
                   
                     
                       Max 
                       
                         1 
                         ≤ 
                         i 
                         ≤ 
                         
                           n 
                           pf 
                         
                       
                     
                      
                     
                       GR 
                       i 
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
         [0051]    GR i*  described in the above equation (9) represents that the size of the priority claimed by the i th  patent family member is the greatest. Hence, its generation number is the greatest and, its corresponding patent chain is the longest. The priority portfolio claimed by the family member is the critical chain PP i*j , j=1, 2, . . . , n i* , shown as equation (10): 
         [0000]    
       
         
           
             
               
                 
                   
                     PP 
                     
                       
                         i 
                         * 
                       
                        
                       j 
                     
                   
                   = 
                   
                     { 
                     
                       
                         pp 
                         
                           
                             i 
                             * 
                           
                            
                           1 
                         
                       
                       , 
                       
                         pp 
                         
                           
                             i 
                             * 
                           
                            
                           2 
                         
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         pp 
                         
                           
                             i 
                             * 
                           
                            
                           
                             n 
                             
                               i 
                               * 
                             
                           
                         
                       
                     
                     } 
                   
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
         [0052]    Additionally, calculating cumulative number of each claimed priority PP j  according to relationship matrix R of equation (7) may obtain cumulative number matrix SR=└sr ij ┘ n     pf     *n     pp   , wherein, 
         [0000]    
       
         
           
             
               
                 
                   
                     sr 
                     ij 
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               
                                 
                                   
                                     ∑ 
                                     
                                       k 
                                       = 
                                       1 
                                     
                                     i 
                                   
                                    
                                   
                                     r 
                                     kj 
                                   
                                 
                               
                               
                                 
                                   
                                     r 
                                     ij 
                                   
                                   = 
                                   1 
                                 
                               
                             
                             
                               
                                 0 
                               
                               
                                 
                                   
                                     
                                       r 
                                       ij 
                                     
                                     = 
                                     0 
                                   
                                   , 
                                 
                               
                             
                           
                            
                           
                             
 
                           
                            
                           i 
                         
                         = 
                         1 
                       
                       , 
                       2 
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         n 
                         pf 
                       
                       , 
                       
                         j 
                         = 
                         1 
                       
                       , 
                       2 
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         n 
                         pp 
                       
                     
                   
                 
               
               
                 
                   ( 
                   11 
                   ) 
                 
               
             
           
         
       
     
         [0000]    wherein calculating cumulative number of row of priority PP j  claimed by the i th  patent family member PF i  in the cumulative number matrix SR may obtain column matrix SSR shown as equation (12): 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       SSR 
                       i 
                     
                     = 
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           1 
                         
                         
                           n 
                           pp 
                         
                       
                        
                       
                         sr 
                         ij 
                       
                     
                   
                   , 
                   
                     i 
                     = 
                     1 
                   
                   , 
                   2 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     n 
                     pf 
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
           
         
       
     
         [0053]    Additionally, calculating cumulative number of column of priority PP ik  claimed by the i th  patent family member PF; in the cumulative number matrix SR may obtain row matrix TR shown as equation (13): 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       TR 
                       j 
                     
                     = 
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           1 
                         
                         
                           n 
                           pf 
                         
                       
                        
                       
                         sr 
                         ij 
                       
                     
                   
                   , 
                   
                     j 
                     = 
                     1 
                   
                   , 
                   2 
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     n 
                     pp 
                   
                 
               
               
                 
                   ( 
                   13 
                   ) 
                 
               
             
           
         
       
     
         [0054]    The number of repeatedly claimed times of priority PP j  may be obtain by the calculation result of TR j  of equation (13). If its number of repeatedly claimed times achieves certain times c or above, it is called a core patent candidate and, its screening rule is shown as equation (14): 
         [0000]        TR   j   □c, j= 1, 2 , . . . ,n   pp   ,c□ 2  (14)
 
         [0055]    ,wherein c is a threshold of core patent candidate screening, represents the number of times of repeatedly claimed priority, and shows significance and influence of the priority. It judges that which of patent has the potential to be a key point for research or patent portfolio strategy of a company via the screening rule. 
         [0056]    Setting c□2 herein means that these priorities were repeatedly claimed and thus have a certain status with respect to patent portfolio of a company. While the value of c is greater, it represents that the patent is closer to technique core or source of technique. Moreover, it may compare merits of patent via different thresholds and then determine the value of c. The judgment approach of that priority exceeding threshold may be core technique or research key is called a screening rule of core patent candidate(s) by analyzing the number of repeatedly claimed times of priority. 
         [0057]    In addition, the greatest SSR 1*  is found from SSR i  of equation (12) and i* is the value of i that maximizes the SSR i  value. SSR i*  is shown as equation (15): 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       SSR 
                       
                         i 
                         * 
                       
                     
                     = 
                     
                       
                         Max 
                         
                           1 
                           ≤ 
                           i 
                           ≤ 
                           
                             n 
                             pf 
                           
                         
                       
                        
                       
                         SSR 
                         i 
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   15 
                   ) 
                 
               
             
           
         
       
     
         [0000]    wherein SSR i*  represents the i th  patent family member PF i* , and the cumulative number summation of its all claimed priority is the greatest, that is, the summation of repeatedly claimed times of these priority are the greatest. The i* patent chain PP i*j  is called a significant chain, j=1, 2, . . . , n i* , shown as equation (16): 
         [0000]    
       
         
           
             
               
                 
                   
                     PP 
                     
                       
                         i 
                         * 
                       
                        
                       j 
                     
                   
                   = 
                   
                     { 
                     
                       
                         pp 
                         
                           
                             i 
                             * 
                           
                            
                           1 
                         
                       
                       , 
                       
                         pp 
                         
                           
                             i 
                             * 
                           
                            
                           2 
                         
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         pp 
                         
                           
                             i 
                             * 
                           
                            
                           
                             n 
                             
                               i 
                               * 
                             
                           
                         
                       
                     
                     } 
                   
                 
               
               
                 
                   ( 
                   16 
                   ) 
                 
               
             
           
         
       
     
         [0058]    Hence, using PPA to analyze the relationship between patent family member and its claimed priority so as to obtain high valuable patent portfolio may be represented via a flow chart in  FIG. 6 . 
         [0059]    In step S 601 , a patent family is chosen for enabling members of the patent family and priority claimed by the members of the patent family to be established as a data set. 
         [0060]    In step S 602 , a relationship matrix is formed by each patent family member and priority claimed by the member of the patent family in the data set. 
         [0061]    In step S 603 , it analyzes the relationship between the members of the patent family and priority claimed by the members of the patent family via the relationship matrix so as to form an analysis result. Then, patent evaluation or patent portfolio is performed according to the analysis result. 
         [0062]    In a preferred embodiment, step S 601  may be performed by the following approach. First, one of the litigation case data is selected that has a greatest case importance coefficient among case importance coefficients of the litigation case data. Then, key patent data is formed from patent involved in the important case data. Next, the key patent data is searched to obtain a member of patent family corresponding to the key patent data and then priority claimed by the member of the patent family. At last, the data set is formed by the members of the patent family and priority claimed by the members of the patent family, wherein the case importance coefficient may be obtained by multiplying the amount of affiliates of the litigation case data with the amount of patent family member. 
         [0063]    As illustrated in  FIG. 7 , a flow chart is to find out a critical chain, a significant chain and core patent candidate(s) by applying the method for evaluating/analyzing patent portfolio using patent priority approach in accordance with the present invention. Its detailed steps are illustrated below. 
         [0064]    In step S 701 , first, a company with litigation cases is determined to be a subject by using company name, product name, “patent” and etc. as keywords. In step S 702 , it searches in a law database storing CAFC (not limited) case text through these keywords. In step S 703 , it chooses any dispute patent from each case and searches the patent family in INPADOC database (not limited). In step S 704 , case importance coefficient is obtained by multiplying the amount of litigants with the amount of patent family members in the case, wherein the greatest one of the case importance coefficient is considered an important case data. In step S 705 , any dispute patent is found from the important case data to be key patent. 
         [0065]    In step S 706 , members of the patent family are searched in INPADOC database (not limited) via the key patent, and members of the same patent having different kind codes are screened to leave the member having the earliest application date and to delete the others so as to avoid repetition while the amount of left members are not necessarily greater than the amount of original family members. Additionally, in step S 707 , a patent which is applied before but abandoned later in the patent family is searched. In step S 708 , a new patent family is formed by arranging and integrating the previous both. In step S 709 , all priority claimed by the member of the new patent family is found to establish data set via a member of these family and priority claimed by the member. 
         [0066]    In step S 710 , a relationship matrix R between patent family members and priorities claimed by the members is established and, GR value is calculated, wherein the GR value represents the amount of priority claimed by the member. In step S 711 , a member of patent family corresponding to the largest one of GR value is found and, priority claimed by the member is formed as a critical chain. In step S 712 , a column matrix SSR and a row matrix TR are obtained via a cumulative number matrix SR, wherein TR value represents the number of repeatedly claimed times of priorities and, SSR value is the number of times of that priorities claimed by members of the patent family is repeatedly claimed by other members of patent family. In step S 713 , when TR value is greater than a threshold (that the threshold c□2 is set in the present invention), the priority is called a core patent candidate. In step S 714 , priority claimed by a family member having the greatest SSR value forms a significant chain. 
         [0067]    Information of the critical chain, the significant chain, the core patent candidate(s) and etc. in patent family is found via the previously described PPA which is on the basis of priority relationship between members of patent family and according to the amount of claimed priority in each patent chain, cumulative number of that priority is claimed and the number of repeatedly claimed times of priorities, wherein the information facilitates research of patent portfolio. 
         [0068]      FIG. 8  illustrates a basic architecture of a system for evaluating/analyzing patent portfolio using patent priority approach, wherein the system  100  for evaluating/analyzing patent portfolio comprises a data storage unit  110 , a key patent screening unit  120 , a data set unit  130  and a data analysis unit  140 . 
         [0069]    The data storage unit  110  is used to store litigation case data or patent family member data of their dispute patents searched in litigation case database (such as LexisNexis) and patent database (such as INPADOC). Then the data is transmitted to the key patent screening unit  120  for being analyzed and screened. The key patent screening unit  120  obtains an important case according to case importance coefficient and uses one dispute patent in the important case as a key patent so as to facilitate data set establishment later. 
         [0070]    The data set unit  130  is primarily used to receive the key patent data and to obtain its patent family, and to establish data set by analyzing and constituting another patent family. The data set unit  130  comprises a patent family analysis module  131  and a data set establishment module  132 . The patent family analysis module  131  is used to analyze patent family of the key patent and to delete patent having the same patent number but different kind while taking one as a representative. The data set establishment module  132  is primarily used to constitute another patent family through summing data analyzed by the patent family analysis module  131  and patent applied before but abandoned later in the patent family and, to constitute data set via the patent family data, wherein the data set is comprised by the patent family member and its claimed priority. 
         [0071]    The data analysis unit  140  is used to receive the data set and to obtain a critical chain, a significant chain and core patent candidate(s) in patent family via analysis and calculation of priority relationship, cumulative number, screening threshold and etc. The data analysis unit  140  comprises an analysis module  141 , a computing module  142 , a core patent candidate screening module  143  and a patent portfolio module  144 . The analysis module  141  analyzes the data set via relationship matrix to obtain a relationship between the patent family member and its claimed priority. The computing module  142  calculates the relationship between each family member and its claimed priority and performs cumulative calculation via relationship cumulative matrix. The core patent candidate screening module  143  sets a threshold for screening core patent candidate(s). The patent portfolio module  144  is used to analyze the result of the computing module  142 , wherein calculation results of the number of claimed times of priority, the number of repeatedly claimed times of priority, cumulative number of the number of times of repeated advocacy and etc. are analyzed. The critical chain and significant chain in patent family may be obtained to perform the following patent evaluation or patent portfolio after analysis of the patent portfolio module  144 . 
         [0072]    In a preferred embodiment, the above described data storage unit, key patent screening unit, data set unit and data analysis unit may be realized in computer software form, wherein the computer software is disposed in storage media such as disc, hard disc drive or memory. 
         [0073]    The previous description is a system architecture for evaluating/analyzing patent portfolio using patent priority approach in accordance with the present invention. When relevant data of litigation case is provided for the system, the system will evaluate/analyze the patent family and provide merits of the patent portfolio. Besides, it may further realize the strategy of the patent owner with respect to the patent portfolio. Therefore, it is more worthy than evaluation of traditional patent citation approach with respect to patent portfolio. 
         [0074]    The present invention provides a patent priority approach based on patent priority to be able to remedy the deficiencies of patent citation network analysis through a priority network analysis approach based on patent family priority. It may enable patent portfolio planning more perfect and enable patent portfolio to achieve more benefit via a critical chain, significant chain and core patent candidate(s) in patent family. On the other hand, it may clearly understand core technique development process of a company, evaluate layout merits and even infer future layout direction, that is, all facilitates to patent portfolio application. 
         [0075]    The foregoing descriptions of the detailed embodiments are only exemplarily illustrated to disclose the features and functions of the present invention and not restrictive of the scope of the present invention. One skilled in the art could modify and vary the previous embodiments without violating the spirit and principle of the present invention. Hence, the protection scope of the present invention should fall within the scope of the appended claims.