# Patent

## Title
Clustering triz analysis method

## Abstract

The TRIZ decision process of the clustering method proposed by this invention uses the characteristics and invention rules from the contradiction matrix table resulting from massive quantities of patent inferences to find a similar or approximate character group and invention rule group of the physical meanings, and also applies statistics to calculate the number of display times of the groups to be the basic foundation. Apart from the number of display times, Bayes probability, fuzzy object oriented method and Bayes probability combined with fuzzy object oriented method can be used as the system. The reading value is utilized as a foundation for prioritizing the sequence of consideration for the groups, in which the system reading value constructed by different models gives designers lots of options to perform the reading, so as to acquire the undesired result features of the prioritized consideration.

## Background
BACKGROUND
The invention relates to decision process, and in particular to TRIZ decision process of a clustering method.
This section is intended to introduce the reader to various aspects of the art, which may be related to various aspects of the present invention, which are described and/or claimed below. This discussion is believed to be helpful in providing the reader with background information to facilitate a better understanding of the various aspects of the present invention. Accordingly, it should be understood that these statements are to be read given said understanding, and not as admissions of prior art.
In creating a design, designers are often confronted with contradictory problems due to different realistic conditions, or are indulged in deep thought, resulting in research and development (R & D) delays and inefficient use of time. In order to facilitate the creative process, abstract-idea-based design concepts and engineering problem-solving techniques have become objective trends for designers. The intelligent system implemented by this practice shall help improve the design process.
Conventionally, when using a TRIZ matrix, manpower is required for determining improving features and no-worsening features in advance, thereby finding several inventive principles, and accordingly determining better inventive principles. It is difficult for a less-experienced user to determine no-worsening features and priority among inventive principles.
SUMMARY
Certain aspects commensurate in scope with the claimed invention are set forth below. It should be understood that these aspects are presented merely to provide the reader with a brief summary of certain forms the invention might take and that these aspects are not intended to limit the scope of the invention. Indeed, the invention may encompass a variety of aspects that may not be set forth below.
A clustering TRIZ analysis method is provided. The method comprises steps of: (1) constructing cluster elements according to features and inventive principles of a TRIZ matrix by associating items with similar physical meanings as one cluster; (2) calculating display times of each cluster according to improved feature cluster and inventive principle cluster, calculating the display times of the corresponding inventive principle cluster and the no-worsening feature cluster according to a TRIZ contradiction matrix, and storing results of the calculation in a database; (3) determining discrimination values of each model according to the display time results in step (2), and using the discrimination values to determine a priority order of the clusters.



BRIEF DESCRIPTION OF DRAWINGS
The invention can be more fully understood by reading the subsequent detailed description and examples with references made to the accompanying drawings, wherein:
FIG. 1 is a schematic view of an embodiment of a clustering TRIZ deciphering model;
FIG. 2 is a schematic view of an embodiment of construction of cluster elements;
FIG. 3 is a schematic view of an embodiment of calculation of display times of each cluster;
FIG. 4 shows a schematic view of an embodiment of establishment of discrimination values of each model; and
FIG. 5 shows a flowchart of a process for improving the deciphering ability of the TRIZ matrix.



DETAILED DESCRIPTION
One or more specific embodiments of the invention are described below. In an effort to provide a concise description of these embodiments, not all features of an actual implementation are described in the specification. It should be appreciated that in the development of any such actual implementation, as in any engineering or design project, numerous implementation-specific decisions must be made to achieve the developers' specific goals, such as compliance with system-related and business-related constraints, which may vary from one implementation to another. Moreover, it should be appreciated that such a development effort might be complex and time consuming, but would nevertheless be a routine undertaking of design, fabrication, and manufacturing for those with ordinary skill of the art having the benefit of this disclosure.
In the following detailed description, reference is made to the accompanying drawings which form a part hereof, shown by way of illustration of specific embodiments. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention, and it is to be understood that other embodiments may be utilized and that structural, logical and electrical changes may be made without departing from the spirit and scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense. The leading digit(s) of reference numbers appearing in the figures corresponds to the Figure number, with the exception that the same reference number is used throughout to refer to an identical component which appears in multiple Figures. It should be understood that many of the elements described and illustrated throughout the specification are functional in nature and may be embodied in one or more physical entities or may take other forms beyond those described or depicted.
FIG. 1 shows a clustering TRIZ deciphering model, which is generally described as follows:
In step S10, a TRIZ matrix is provided.
In step S11, cluster elements are constructed. The cluster elements are matched with the features and the inventive principles of the TRIZ matrix, and are collated to be clusters according to similar physical meanings, as shown in FIG. 2.
In step S12, display times of each cluster are calculated. The display times of the corresponding inventive principle cluster and the no-worsening feature cluster are calculated by means of the clustered improved feature cluster and inventive principle cluster, and through the TRIZ contradiction matrix, and then stored in the database, which can be a reference for the construction of each model. The details are shown in FIG. 3.
In step S13, the discrimination values of each model are established. The discrimination values are matched with the display time results from the statistics in step S12. Furthermore, the display times are used to construct the discrimination methods of each model (including the display time model, Bayes probability model, fuzzy value model, and the combined fuzzy value and the Bayes probability model). The discrimination value acquired by the system is taken as the priority order of clusters (step S14), from which designers can consider a suitable priority order of clusters for the design (steps S15 and 16). The details are shown in FIG. 4.
1. Construction of Cluster Elements (Step S11 in FIG. 1, as Shown in FIG. 2)
Based on the likelihood of the physical meanings, the 39 features and 40 inventive principles of the TRIZ matrix are rearranged to be 13 clusters. For example, the clustering of the 40 features comprises object segmentation and extraction cluster, prior handling cluster, counteraction cluster, cluster of partial action or structural change, balance object cluster, vibration and structural dynamicity cluster, harmful factor cluster, mechanical system replacement cluster, material cluster, physical change cluster, chemical action cluster, rejection and maintenance cluster, and system combination cluster. Object segmentation and extraction cluster comprises principles of segmentation, extraction, asymmetry, prior action, cushion in advance, and dynamicity. Cluster of partial action or structural change comprises principles of local quality, spheroidality, and partial, overdone or excessive action. Mechanical system replacement cluster comprises principles of moving to a new dimension, copying, replacement of a mechanical system, use of a pneumatic or hydraulic construction, and color change. Material cluster comprises principles of substituting an expensive, durable object by an inexpensive, short-life one, flexible film or thin membrane, use of porous material, homogeneity, and composite material.
2. Next, construction of each model is described. (FIG. 1, step S13)
(1) Display Time Model
The construction process of the display time model is described as follows:
Step 1: The improved feature clusters and the inventive principle clusters having similar physical meanings are selected.
Step 2: The display times acquired from the statistics on the various clusters are calculated in accordance with the contents of the TRIZ matrix, together with the display time results from the statistics on each corresponding inventive principle cluster made by each improved feature cluster.
Step 3: The acquired display times are used as a reference for users in arranging the priority order of the inventive principle clusters. The display times are arranged in proper order as shown in Table 1.
Step 4: The moving object cluster is acquired. The moving object cluster is the display times acquired from the statistics on the corresponding inventive principle clusters and no-worsening feature clusters of the improved feature clusters in accordance with the contents of the TRIZ matrix, together with the display time results from the statistics on each corresponding no-worsening feature cluster made by each corresponding inventive principle cluster of each improved feature cluster.
Step S5: The acquired display times are used as a reference for users in arranging the priority order of the no-worsening feature clusters. Taking the moving object feature cluster as the considered improving factor, the display times of the object segmentation and extraction inventive principle clusters and the corresponding no-worsening feature clusters can be acquired, as shown in Table 2.
(2) Bayes Probability Model
The construction process of the Bayes probability model is described as follows:
Step 1: The improved feature clusters and the inventive principle clusters having similar physical meanings are selected.
Step 2: The required display probability is acquired in accordance with the contents of the TRIZ matrix, together with the display time results from the statistics on each corresponding inventive principle cluster (Ij) made by each improved feature cluster. The Bayes probability (P(Ci|Ij)) of each inventive principle cluster is realized through the Bayes theorem equation, which is expressed as equation (3-1).




  
    
      
        
          P
          ⁡
          
            (
            
              
                C
                i
              
              |
              
                I
                j
              
            
            )
          
        
        =
        
          
            
              
                P
                ⁡
                
                  (
                  
                    C
                    i
                  
                  )
                
              
              ×
              
                P
                ⁡
                
                  (
                  
                    
                      I
                      j
                    
                    |
                    
                      C
                      
                        i
                        ⁢
                        
                          
                        
                      
                    
                  
                  )
                
              
            
            
              P
              ⁡
              
                (
                
                  I
                  j
                
                )
              
            
          
          =
          
            
              
                P
                ⁡
                
                  (
                  
                    C
                    i
                  
                  )
                
              
              ×
              
                P
                ⁡
                
                  (
                  
                    
                      I
                      j
                    
                    |
                    
                      C
                      
                        i
                        ⁢
                        
                          
                        
                      
                    
                  
                  )
                
              
            
            
              
                ∑
                
                  j
                  =
                  1
                
                a
              
              ⁢
              
                [
                
                  
                    P
                    ⁡
                    
                      (
                      
                        C
                        i
                      
                      )
                    
                  
                  ×
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          I
                          j
                        
                        |
                        
                          C
                          i
                        
                      
                      )
                    
                  
                
                ]
              
            
          
        
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          1
        
        )
      
    
  




In equation (3-1), “a” denotes the total number of inventive principle clusters, i denotes the number of improved feature clusters, and i=1, 2, . . . , 10, j denotes number of inventive principle clusters, and j=1, 2, . . . , 13, P(Ci) denotes the display probability of improved feature cluster (Ci) in the entire TRIZ table, and P(Ij|Ci) denotes the display probability of inventive principle cluster (Ij) in the improved feature cluster.
Step 3: The acquired Bayes probability value is taken as the priority order, which is taken by users as a reference for priority order in the no-worsening feature clusters. A table of the probability value of each corresponding inventive principle cluster of the moving object improved feature cluster is formulated, as shown in Table 3.
Step 4: The required display probability is acquired in accordance with the contents of the TRIZ matrix, together with the statistics on the display times of each corresponding no-worsening feature cluster (I′j) made by each corresponding inventive principle cluster (C′i) of each improved feature cluster. The Bayes probability value P′(C′i|I′j) of each no-worsening feature cluster is realized through the Bayes theorem equation, which is expressed as equation (3-2):




  
    
      
        
          
            P
            ′
          
          ⁡
          
            (
            
              
                C
                i
                ′
              
              |
              
                I
                j
                ′
              
            
            )
          
        
        =
        
          
            
              
                
                  P
                  ′
                
                ⁡
                
                  (
                  
                    C
                    i
                    ′
                  
                  )
                
              
              ×
              
                
                  P
                  ′
                
                ⁡
                
                  (
                  
                    
                      I
                      j
                      ′
                    
                    |
                    
                      C
                      i
                      
                        ′
                        ⁢
                        
                          
                        
                      
                    
                  
                  )
                
              
            
            
              
                P
                ′
              
              ⁡
              
                (
                
                  I
                  j
                  ′
                
                )
              
            
          
          =
          
            
              
                
                  P
                  ′
                
                ⁡
                
                  (
                  
                    C
                    i
                    ′
                  
                  )
                
              
              ×
              
                
                  P
                  ′
                
                ⁡
                
                  (
                  
                    
                      I
                      j
                      ′
                    
                    |
                    
                      C
                      i
                      
                        ′
                        ⁢
                        
                          
                        
                      
                    
                  
                  )
                
              
            
            
              
                ∑
                
                  j
                  =
                  1
                
                b
              
              ⁢
              
                [
                
                  
                    
                      P
                      ′
                    
                    ⁡
                    
                      (
                      
                        C
                        i
                        ′
                      
                      )
                    
                  
                  ×
                  
                    
                      P
                      ′
                    
                    ⁡
                    
                      (
                      
                        
                          I
                          j
                          ′
                        
                        |
                        
                          C
                          i
                          ′
                        
                      
                      )
                    
                  
                
                ]
              
            
          
        
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          2
        
        )
      
    
  




In equation (3-2), b denotes the total number of no-worsening feature clusters, i denotes the number of inventive principle clusters, and i=1, 2, . . . , 13, j denotes number of no-worsening feature clusters, and j=1, 2, . . . , 10, P′(C′i) denotes the display probability of improved feature cluster (C′i) in the inventive feature cluster, and P′(I′j|C′i) denotes the display probability of no-worsening feature cluster (I′j) in the inventive principle cluster.
Step S5: The acquired Bayes probability value is taken as the priority order, which is a reference for priority order in the no-worsening feature cluster. Table 4 shows the probability values of the corresponding object segmentation and extraction inventive principle clusters and the corresponding no-worsening feature clusters while taking the moving object feature cluster as the considered improving factor.
(3) Fuzzy Value Model
The construction process of the Fuzzy value model is described as follows:
Step 1: The improved feature clusters and the inventive principle clusters having similar physical meanings are selected.
Step 2: The fuzzy relationship value of each element in each feature cluster is defined by 10 feature clusters having similar physical meanings in accordance with the concept of the fuzzy object oriented model. For example, a certain feature in the cluster is used as a major consideration factor for defining the fuzzy relationship value (F_value) between the major considered feature factor and other related features. In the moving object cluster, if the weight of moving object (simply referred to as “WMO,” hereinafter) is taken as the major consideration target, then the fuzzy relationship value with the length of moving object (simply referred to as “LMO,” hereinafter) is 0.6, the fuzzy relationship value with the area of moving object (simply referred to as “AMO,” hereinafter) is 0.7, and the fuzzy relationship value with the volume of moving object (simply referred to as “VMO,” hereinafter) is 0.8. The fuzzy relationship values of other elements are shown in Table 5.
Step 3: The display times (I_F_valuei) of the added fuzzy value of each cluster and the total display times (S_F_valuej) of the added fuzzy values of the entire cluster required by the system is acquired in accordance with the contents of the TRIZ matrix, together with the statistics on the display times (Ni) of each corresponding inventive principle cluster made by the improved feature cluster, and from the fuzzy relationship value (F_valuei) between the display times (Ni) and the elements in the improved feature cluster acquired through the fuzzy object oriented model. The correlation is shown as in equation (3-3, 3-4):




  
    
      
        
          
            I_F
            ⁢
            
              _value
              i
            
          
          =
          
            
              N
              i
            
            ×
            
              F_value
              i
            
          
        
        ,
        
          
        
        ⁢
        
          i
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        a
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          3
        
        )
      
    
  
  
    
      
        
          
            S_F
            ⁢
            
              _value
              j
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              a
            
            ⁢
            
              (
              
                I_F
                ⁢
                
                  _value
                  i
                
              
              )
            
          
        
        ,
        
          
        
        ⁢
        
          j
          =
          1
        
        ,
        2
        ,
        ...
        ⁢
        
          
        
        ,
        13
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          4
        
        )
      
    
  




In equations (3-3) and (3-4), “a” denotes the total number of feature factors contained in the cluster.
Step 4: The acquired total display times of the added fuzzy values of the entire cluster is taken as the priority order, which is the user's referential priority order in the inventive principle cluster.
Step S5: The display times (N_I_F_valuei) of the added fuzzy value of each cluster and the total display times (N_S_F_valuej) of the added fuzzy values of the entire cluster required by the system are acquired in accordance with the contents of the TRIZ matrix, together with the statistics on the display times (N_Ni) of each corresponding no-worsening feature cluster made by each corresponding inventive principle cluster of the elements in each improved feature cluster, and from the fuzzy relationship value (F_valuei) between the display times (N_Ni) and the elements in the improved feature clusters acquired through the fuzzy object oriented model. The correlation is shown in equations (3-5) and (3-6):




  
    
      
        
          
            N_I
            ⁢
            _F
            ⁢
            
              _value
              i
            
          
          =
          
            
              N_N
              i
            
            ×
            
              F_value
              i
            
          
        
        ,
        
          
        
        ⁢
        
          i
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        a
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          5
        
        )
      
    
  
  
    
      
        
          
            N_S
            ⁢
            _F
            ⁢
            
              _value
              j
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              a
            
            ⁢
            
              N_I
              ⁢
              _F
              ⁢
              
                _value
                i
              
            
          
        
        ,
        
          
        
        ⁢
        
          j
          =
          1
        
        ,
        2
        ,
        ...
        ⁢
        
          
        
        ,
        10
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          6
        
        )
      
    
  




In equations (3-5) and (3-6), “a” denotes the total number of feature factors contained in the cluster.
Step 6: The acquired total display times of the added fuzzy values of the entire cluster is taken as the priority order, which is the user's referential priority order in the no-worsening feature cluster.
(4) Combined Fuzzy Value and Bayes Probability Model
The construction process of the combined fuzzy value and Bayes probability model is described as follows:
Step 1: The improved feature clusters and the inventive principle clusters having similar physical meanings are selected.
Step 2: The fuzzy relationship value of each element in each cluster is defined by 10 feature clusters having similar physical meanings in accordance with the concept of the fuzzy object oriented model. The practice is to take a certain feature in the cluster as a major consideration factor for defining the fuzzy relationship value (F_value) between the major considered feature factor and other related features. In the moving object feature cluster, if the WMO is taken as the major consideration target, then the fuzzy relationship value with the LMO is 0.6, the fuzzy relationship value with the AMO is 0.7, and the fuzzy relationship value with the VMO is 0.8. The fuzzy relationship values of other elements are shown in Table 6.
Step 3: The display times (I_F_valuei) of the added fuzzy value of each feature factor and the total display times (S_F_valuei) of the added fuzzy values of the entire cluster are acquired in accordance with the contents of the TRIZ matrix, together with the statistics on the display times (Ni) of each corresponding inventive principle cluster made by the improved feature cluster (Cm), and from the fuzzy relationship value (F_valuei) between the display times and the elements in the improved feature cluster acquired through the fuzzy object oriented model. The correlation is shown in equation (3-7, 3-8).




  
    
      
        
          
            I_F
            ⁢
            
              _value
              i
            
          
          =
          
            
              N
              i
            
            ×
            
              F_value
              i
            
          
        
        ,
        
          
        
        ⁢
        
          i
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        a
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          7
        
        )
      
    
  
  
    
      
        
          
            S_F
            ⁢
            
              _value
              j
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              a
            
            ⁢
            
              (
              
                I_F
                ⁢
                
                  _value
                  i
                
              
              )
            
          
        
        ,
        
          
        
        ⁢
        
          j
          =
          1
        
        ,
        2
        ,
        ...
        ⁢
        
          
        
        ,
        13
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          8
        
        )
      
    
  




In equations (3-7) and (3-8), “a” denotes the total number of inventive principle clusters.
Table 7 shows the display times of the corresponding object segmentation and extraction cluster of each feature factor in the moving object cluster. Table 8 shows the fuzzy relationship values that take WMO as the major element in the moving object cluster. Table 9 shows the display times (I_F_valuei) of the added fuzzy value of the corresponding object segmentation and extraction cluster of each feature factor in the moving object cluster and the total display times (S_F_valuei) of the added fuzzy values of the WMO-based object segmentation and extraction cluster.
Step 4: The display probability (P(F_In|Cm)) of the added fuzzy value is obtained by using the total display times (S_F_valuei) of the added fuzzy values of the entire cluster acquired in Step 3. The relation equation is shown in equation (3-9). The Bayes probability value (P(Cm|F_In)) of the added fuzzy value of each inventive principle cluster is acquired through the Bayes theorem equation. The Bayes theorem equation is expressed as equation (3-10).




  
    
      
        
          P
          ⁡
          
            (
            
              
                F_I
                n
              
              |
              
                C
                m
              
            
            )
          
        
        =
        
          
            S_F
            ⁢
            
              _value
              i
            
          
          
            
              ∑
              
                i
                =
                1
              
              13
            
            ⁢
            
              S_F
              ⁢
              
                _value
                i
              
            
          
        
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          9
        
        )
      
    
  
  
    
      
        
          P
          ⁡
          
            (
            
              
                C
                m
              
              |
              
                F_I
                n
              
            
            )
          
        
        =
        
          
            
              P
              ⁡
              
                (
                
                  C
                  m
                
                )
              
            
            ×
            
              P
              ⁡
              
                (
                
                  
                    F_I
                    n
                  
                  |
                  
                    C
                    m
                  
                
                )
              
            
          
          
            
              ∑
              
                n
                =
                1
              
              13
            
            ⁢
            
              [
              
                
                  P
                  ⁡
                  
                    (
                    
                      C
                      m
                    
                    )
                  
                
                ×
                
                  P
                  ⁡
                  
                    (
                    
                      
                        F_I
                        n
                      
                      |
                      
                        C
                        m
                      
                    
                    )
                  
                
              
              ]
            
          
        
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          10
        
        )
      
    
  




In equations (3-9) and (3-10), “m” denotes the number of improved feature clusters, and m=1, 2, . . . , 10, “n” denotes the number of inventive principle clusters, and n=1, 2, . . . , 13, P(Cm) denotes the display probability of the added fuzzy value of the improved feature cluster (Cm) in the entire TRIZ matrix, and P(F_In|Cm) denotes the display probability of the added fuzzy value of the inventive principle cluster (F_In) in the improved feature cluster.
Table 10 shows the representative values of P(Cm) and P(F_In|Cm) of the corresponding object segmentation and extraction cluster of the moving object cluster. Table 11 shows the probability value (P(Cm|F_In)) of the corresponding object segmentation and extraction cluster of the moving object cluster.
Step S5: The acquired probability value of the added fuzzy value is taken as the priority order, which is the user's referential priority order in the inventive principle cluster. Table 12 shows the fuzzied probability value of each corresponding inventive principle cluster of the moving object cluster which takes WMO as the consideration target.
Step 6: The display times (N′_I_F_valuei) of the added fuzzy value of each cluster and the total display times (N′_S_F_valuej) of the added fuzzy values of the entire cluster are acquired in accordance with the contents of the TRIZ matrix, together with the statistics on the display times (N′_Ni) of each corresponding no-worsening feature cluster (C′m) made by each corresponding inventive principle cluster of the element in each improved feature cluster, and from the fuzzy relationship value (F_valuei) between the display times (N′_Ni) and the elements in the improved feature cluster acquired through the fuzzy object oriented model. The correlation is shown in equation (3-11, 3-12).




  
    
      
        
          
            
              N
              ′
            
            ⁢
            _I
            ⁢
            _F
            ⁢
            
              _value
              i
            
          
          =
          
            
              N
              ′
            
            ⁢
            
              _N
              i
            
            ×
            
              F_value
              i
            
          
        
        ,
        
          
        
        ⁢
        
          i
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        a
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          11
        
        )
      
    
  
  
    
      
        
          
            
              N
              ′
            
            ⁢
            _S
            ⁢
            _F
            ⁢
            
              _value
              j
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              a
            
            ⁢
            
              
                N
                ′
              
              ⁢
              _I
              ⁢
              _F
              ⁢
              
                _value
                i
              
            
          
        
        ,
        
          
        
        ⁢
        
          j
          =
          1
        
        ,
        2
        ,
        ...
        ⁢
        
          
        
        ,
        10
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          12
        
        )
      
    
  




In equations (3-11) and (3-12), “a” denotes the total number of inventive principle clusters.
Table 13 shows the display times of the corresponding physical property cluster of the feature factor in the moving object cluster that takes WMO as the major consideration factor. Table 14 shows the fuzzy relationship values of the feature factor in the moving object cluster that takes WMO as the major consideration factor. Table 15 shows the display times of the added fuzzy value of the physical property cluster in each feature factor and the total display times of the added fuzzy values of the entire cluster.
Step 7: The display probability (P′(F′_In|Cm)) of the added fuzzy value is obtained by using the total display times (N′_S_F_valuej) of the added fuzzy values of the entire cluster acquired in Step 6. The relation equation is shown in equation (3-13). The Bayes probability value of each inventive principle cluster is acquired through the Bayes theorem equation. The Bayes theorem equation is expressed as equation (3-14).




  
    
      
        
          
            P
            ′
          
          ⁡
          
            (
            
              
                
                  F
                  ′
                
                ⁢
                
                  _I
                  n
                
              
              |
              
                C
                m
                ′
              
            
            )
          
        
        =
        
          
            
              N
              ′
            
            ⁢
            _S
            ⁢
            _F
            ⁢
            
              _value
              j
            
          
          
            
              ∑
              
                i
                =
                1
              
              13
            
            ⁢
            
              
                N
                ′
              
              ⁢
              _S
              ⁢
              _F
              ⁢
              
                _value
                j
              
            
          
        
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          13
        
        )
      
    
  
  
    
      
        
          
            P
            ′
          
          ⁡
          
            (
            
              
                C
                m
                ′
              
              |
              
                
                  F
                  ′
                
                ⁢
                
                  _I
                  n
                
              
            
            )
          
        
        =
        
          
            
              
                P
                ′
              
              ⁡
              
                (
                
                  C
                  m
                  ′
                
                )
              
            
            ×
            
              
                P
                ′
              
              ⁡
              
                (
                
                  
                    
                      F
                      ′
                    
                    ⁢
                    
                      _I
                      n
                    
                  
                  |
                  
                    C
                    m
                    ′
                  
                
                )
              
            
          
          
            
              ∑
              
                n
                =
                1
              
              10
            
            ⁢
            
              [
              
                
                  
                    P
                    ′
                  
                  ⁡
                  
                    (
                    
                      C
                      m
                      ′
                    
                    )
                  
                
                ×
                
                  
                    P
                    ′
                  
                  ⁡
                  
                    (
                    
                      
                        
                          F
                          ′
                        
                        ⁢
                        
                          _I
                          n
                        
                      
                      |
                      
                        C
                        m
                        ′
                      
                    
                    )
                  
                
              
              ]
            
          
        
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          14
        
        )
      
    
  




In equations (3-13) and (3-14), “m” denotes the number of inventive principle clusters, and m=1, 2, . . . , 13; “n” denotes number of worsening feature clusters, and n=1, 2, . . . , 10; P′(C′m) denotes the display probability of the added fuzzy value of the improved feature cluster (C′m) in the improved feature cluster, and P′(F′_In|C′m) denotes the display probability of the added fuzzy value of the no-worsening feature cluster (F′_In) in the inventive principle cluster.
Table 16 shows the representative values of P′(C′m) and P′(F′_In|C′m) of the object segmentation and extraction inventive principle cluster. Table 17 shows the probability value of the added fuzzy value required by the system of the corresponding physical property cluster of the moving object cluster.
Step 8: The probability value of the added fuzzy value is taken as the priority order, which is the user's referential priority order in the no-worsening feature cluster. Table 18 shows the probability value of the added fuzzy value, which is matched with the Bayes probability equation of the system of each corresponding no-worsening feature cluster of the corresponding object segmentation and extraction inventive principle cluster of the moving object cluster.
3. Deciphering Procedures of Clustering TRIZ Deciphering Model
The process for improving the deciphering ability of the TRIZ matrix is illustrated in FIG. 5, comprising 6 steps:
In step S51, the design direction is determined. A user (designer) evaluates knowledge of various aspects of the design and related patent information, and determines the goal achievements of the new design direction and the related limitation conditions.
In step S52, the improved feature clusters are selected. Coordinating with the decided new design direction, the consideration of the meanings of the 10 feature clusters is carried out. The improved feature clusters that conform to the design direction are selected to carry out system judgment.
In step S53, the priority of inventive principle cluster is determined by the system. Entering the system interface by inputting selected improved feature cluster (as shown in Appendix 1), a menu for selecting the decided improved feature clusters is provided, such as the moving object cluster. When the analysis button is pressed, the priority order of the related inventive principle clusters is determined, as shown in the table in Appendix 2. The table shows the inventive principle cluster of the priority order. The order of the considered selections from the top to the bottom includes the inventive principle clusters which are considered suitable for the design direction and available technology. When the button of the statistical table on times and the probability table is pressed, a file in Excel format is shown (see Appendix 3). References of different models are provided for facilitating calculation of the discrimination value, helping users make a correct judgment when considering the inventive principle cluster conforming to the design direction.
In step S54, the priority order of the no-worsening feature cluster is determined by the system. According to the inventive principle clusters selected in Step S53, the clusters in the interfaced table are selected, as shown in Appendix 4. The priority order of the no-worsening feature cluster is determined by the system. The order of the considered selections from the top to the bottom includes the no-worsening feature clusters which are considered suitable for the design direction and available technology. When the button of the statistical table on times and the probability table is pressed, a file in Excel format is shown (see Appendix 5). It provides users with referential values in deciding the priority order when considering the no-worsening feature cluster conforming to the design direction.
In step S55, the general table of discrimination values of the entire inventive principle cluster and the no-worsening feature cluster is generated, just like the general table of display times of the corresponding inventive principle cluster of the moving object cluster and different no-worsening feature clusters, as shown in Appendix 6. The table of probability conversion is selected, and then the display times are converted to the form of a probability value, as shown in Appendix 7. Based on the selected no-worsening feature clusters, it is determined whether the best priority order is in the general table of discrimination values of the inventive principle cluster and the no-worsening feature cluster. During the discrimination, it is determined whether the roll is the best priority order through the vertical examination of the selected inventive principle clusters, or whether the column is the best priority order through the horizontal examination of the selected no-worsening feature clusters. After the determination, it is known whether the result conforms to the design direction, limitation conditions and technological requirements. If positive, a better no-worsening feature cluster can be decided, if negative, the steps return to Step 3 to decide the adoption of inventive principle cluster again.
In step S56, the original TRIZ matrix is discriminated. From the selected improved feature clusters and the finally decided no-worsening feature clusters, the single improved feature and the single worsened feature that conform with the design direction and limitation conditions are selected. The original TRIZ matrix, as shown in Table 19, shows the corresponding inventive principle. Then, the preliminary idea of design can be acquired (step S57).
In S57 step, the user get some inventive principle form s56. Then according to these ideas, engineer can judged by the ways of engineering knowledge, inference, analog, etc. So as to generator a preliminary technological idea of a design
Using an automatic polishing pad changing structure of the compensating chemical mechanical wafer polishing apparatus as an example, a technological shortcoming exists, i.e., when the main polishing head having a diameter smaller than that of a wafer, and the compensating polishing head are used to undergo polishing, the polishing pad is adhered to the polishing head, and when replacing the polishing pad, the worn out old polishing pad is detached from the polishing head, the surface is cleaned, and then a new polishing pad is attached to it. During the replacement, the CMP has to be shut down for a long period of time, causing inconvenience and inefficient use of time. Therefore, the replacement of polishing pad is improved by automation of the replacement process. The design idea acquired at this time takes the designers' professional experience principles as a reference. Having understood the design direction based on their experience, the designers can follow the traditional TRIZ procedures to discriminate the related suggested conditions that the improving feature is the 38th item, i.e. level of automation, the no-worsening feature is the 28th item, i.e. accuracy of measurement, and the inventive principle is the 28th item, i.e. replacement of mechanical system. After the related suggested conditions are achieved, the designers enter the TRIZ deciphering procedures constructed to carry out discrimination. It is known that the automation of the improving feature is in the control cluster of the improved feature cluster of the system. After using the control cluster, together with the improvement of the interface of the TRIZ deciphering system, a description of the procedures is made as follows:
Step 1: Having known that the improving cluster is the control cluster, the system interface is entered, as shown in Appendix 8.
Step 2: The control cluster is selected through the interface as the major considered improving cluster. The analysis button is pressed, and the priority order of the inventive principle clusters appear as shown in the table of Appendix 9. If the related numerical expressions of the priority order need to be known, the buttons of the statistical table on the number of times and the Bayes probability table are pressed. Then the Excel format as shown in Appendix 10 would appear.
Step 3: After referring to the experience principles of the researcher, it is discriminated that the adopted inventive principle is the replacement of the mechanical system. This inventive principle is in the cluster of mechanical system replacement in the inventive principle cluster of the system. Therefore, based on the priority order of the inventive principle clusters acquired by the system in Step 2, it is observed from the table in Appendix 9 that the 2nd inventive principle cluster being considered in the first priority is the cluster of mechanical system replacement. From the referential numerical values in Appendix 10, it can be clearly seen that the referential numerical values conform to the inventive principle cluster which is considered by designers, and they are not the same values whose difference can thus be perceived. The system also considers the cluster of mechanical system replacement to carry out the judgment of the no-worsening feature cluster.
Step 4: Knowing that the cluster of mechanical system replacement is the considered inventive principle cluster, the cluster of mechanical system replacement on the table of the interface is selected to acquire the priority of the no-worsening feature clusters, as shown in the table in Appendix 11. If the related numerical expressions of the priority order would like to be known, the buttons of the statistical table on the number of times and the Bayes probability table are pressed. Then the Excel format as shown in Appendix 12 would appear.
Step 5: The general table of the entire inventive principle cluster and the no-worsening feature cluster, as shown in Appendix 13, assists in making judgment on the acquired priority of no-worsening feature clusters. After referring to the experience principles of the researcher, it is discriminated that the adopted no-worsening feature is the accuracy of measurement. This no-worsening feature is in the cluster of manufacturing and measurement accuracy in the no-worsening feature cluster of the system. Therefore, based on the priority order of the no-worsening feature clusters acquired by the system in Step 4, it can be observed from the table in Appendix 12 that the 2nd no-worsening feature cluster being considered in the first priority is the cluster of mechanical system replacement, conforming with the consideration direction of designers.
Step 6: It is acquired from Step 3 that the inventive principle cluster is the cluster of mechanical system replacement and from Step 5 that the no-worsening feature cluster is the control cluster. Then a simplified TRIZ matrix as shown in Table 20 can be formed. By clustering, the improved feature cluster, no-worsening feature cluster and inventive principle cluster are filtered out. By using the clustering TRIZ matrix, together with the design concepts and according to level of automation of professional discrimination, the no-worsening feature as the accuracy of measurement, and the inventive principle as the replacement of mechanical system, it can be known that the improving feature, no-worsening feature and inventive principle filtered out from the clustering results are consistent with the results acquired from the traditional TRIZ procedures. For the automatic polishing pad changing structure based on this concept, the mechanical design is to cut the holding ring of polishing pad into two halves. The ring can grip the entire polishing pad and cover the edge of the polishing head, enabling the polishing pad to be firmly fixed on the polishing surface of the polishing head. The outer ring is attached with the track, which drives the machine to complete the automatic gripping action. The replacement of the entire polishing pad can be completely automated, saving mechanical work time.
While the invention has been described by way of example and in terms of preferred embodiment, it is to be understood that the invention is not limited thereto. To the contrary, it is intended to cover various modifications and similar arrangements (as would be apparent to those skilled in the art). Therefore, the scope of the appended claims should be accorded the broadest interpretation so as to encompass all such modifications and similar arrangements.







TABLE 1







Display times of each corresponding inventive


principle cluster of the moving object feature cluster










Inventive principle
Display



cluster
times














Object segmentation and
126



extraction cluster



Replacement of
92



mechanical system



Vibration and structural
52



dynamicity



Physical change cluster
47



Material cluster
34



Advanced processing
28



cluster



Partial action or
26



structural change cluster



System combination or
25



integration cluster



Balance object cluster
23



Rejection and
20



maintenance cluster



Counteraction cluster
14



Chemical cluster
13



Harmful factor cluster
7

















TABLE 2







Display times of the object segmentation and extraction inventive


principle clusters and the corresponding no-worsening feature clusters


by taking the moving object feature cluster as the considered


improving factor











Display



No-worsening feature cluster
times














Physical property cluster
30



Energy consumption cluster
26



Operation and recovery cluster
24



Moving object cluster
16



Control cluster
16



System efficiency and quality
15



cluster



Cluster of manufacturing and
13



measurement accuracy



Object consumption cluster
6



Cluster of substance amount
5



Non-moving object cluster
0

















TABLE 3







Probability value of each corresponding inventive principle cluster of the


improved feature cluster of moving object










Inventive principle
Moving object



cluster
P(C1|Ij)














Object segmentation and
24.85%



extraction cluster



Mechanical system
18.15%



replacement cluster



Vibration and structural
10.26%



dynamicity cluster



Physical change cluster
9.27%



Material cluster
6.71%



Advanced processing
5.52%



cluster



Cluster of partial
5.13%



action or structural change



System combination
4.93%



cluster



Balance object cluster
4.54%



Rejection and
3.94%



maintenance cluster



Counteraction cluster
2.76%



Chemical cluster
2.56%



Harmful factor cluster
1.38%

















TABLE 4







Probability values of the corresponding


object segmentation and extraction inventive principle


clusters and the corresponding no-worsening feature


clusters while taking the moving object feature cluster


as the considered improving factor











Object segmentation and



No-worsening feature cluster
extraction



cluster
P′(C′1|I′j)













Physical property cluster
19.9%



Energy consumption cluster
17.2%



Operation and recovery cluster
15.9%



Moving object cluster
10.6%



Control cluster
10.6%



Cluster of system efficiency
9.9%



and quality




Cluster of manufacturing and
8.6%



measurement accuracy




Object consumption cluster
4.0%



Cluster of substance amount
3.3%



Non-moving object cluster
0.0%
















TABLE 5







Fuzzy relationship values of moving object


feature cluster








Major
Fuzzy relationship value of feature factor











considered feature factor
F_value1
F_value2
F_value3
F_value1


category
of WMO
of LMO
of AMO
of VMO














WMO
1
0.6
0.7
0.8


LMO
0.6
1
0.8
0.7


AMO
0.6
0.8
1
0.7


VMO
0.8
0.6
0.7
1
















TABLE 6







Fuzzy relationship values of moving object


feature cluster








Major
Fuzzy relationship value of feature factor











considered feature factor
F_value1
F_value2
F_value3
F_value1


category
of WMO
of LMO
of AMO
of VMO














WMO
1
0.6
0.7
0.8


LMO
0.6
1
0.8
0.7


AMO
0.6
0.8
1
0.7


VMO
0.8
0.6
0.7
1
















TABLE 7







Display times of the corresponding


object segmentation and extraction cluster of each


feature factor in the moving object cluster










Feature Factor Category













WMO
LMO
AMO
VMO
















Display
20
37
34
35



Times (Ni)
















TABLE 8







Fuzzy relationship values that take


WMO as the major element in the moving object


cluster










Feature Factor Category













WMO
LMO
AMO
VMO
















Fuzzy
1
0.6
0.7
0.8



relationship







value







(F_valuei)
















TABLE 9







Display times of the added fuzzy


value of the corresponding object segmentation and


extraction cluster of each feature factor and the


total display times of the added fuzzy values of


the WMO-based object segmentation and extraction


cluster










Feature Factor Category













WMO
LMO
AMO
VMO
















I_F_valuei
20
22.2
23.8
28











S_F_value1
94
 
















TABLE 10







Representative values of the P(Cm) and


P(F_In|Cm) of the moving object cluster










Improving feature cluster










Inventive

P(F_In|Cm),


principle cluster
P(Cm)
n = 1, 2, . . . 13





F_I1




  396.1
  5317.1








  94
  396.1




















TABLE 11







Probability value of the added fuzzy value of


the corresponding object segmentation and


extraction cluster of the moving object cluster











Improving feature cluster




P(Cm|F_In),



Inventive principle cluster
n = 1, 2, . . . 13






Object segmentation and
23.73%



extraction cluster
















TABLE 12







Fuzzied probability value of each


corresponding inventive principle cluster of the


moving object improved feature cluster which takes


WMO as the consideration target.









Moving object improved feature cluster


Inventive principle cluster
P(Cm|F_In)











Object segmentation and
23.73%


extraction cluster



Mechanical system replacement
17.72%


cluster



Vibration and structural
10.22%


dynamicity cluster



Physical change cluster
9.90%


Material cluster
7.45%


Advanced processing cluster
5.50%


Cluster of partial action or
5.05%


structural change



System combination cluster
4.80%


Balance object cluster
4.65%


Rejection and maintenance
4.12%


cluster



Chemical cluster
2.75%


Counteraction cluster
2.58%


Harmful factor cluster
1.54%
















TABLE 13







Display times of the corresponding physical


property cluster of the feature factor in the TRIZ matrix










Corresponding no-worsening




feature cluster of physical




segmentation and extraction




cluster




Feature Factor Category













WMO
LMO
AMO
VMO
















Display
6
8
8
8



Times (N_Ni)
















TABLE 14







Fuzzy relationship values of the feature


factor in the moving object cluster that takes WMO as the


major consideration factor










Feature Factor Category













WMO
LMO
AMO
VMO
















Fuzzy
1
0.6
0.7
0.8



relationship value







(F_valuei)
















TABLE 15







Display times of the added fuzzy value of the


physical property cluster in each feature factor and the


total display times of the added fuzzy values of the


entire cluster










Corresponding no-worsening




feature cluster of physical




segmentation and




extraction cluster




Feature Factor Category













WMO
LMO
AMO
VMO
















N′_I_F_valuei
6
4.8
5.6
6.4











N′_S_F_valuej
22.8
 
















TABLE 16







Representative values of P′(Cm′) and


P′(F′_In|Cm′) of the object segmentation and extraction


inventive principle cluster










Inventive principle cluster










Worsening

P′(F′_In|Cl′)


feature cluster
P′(Cl′)
n = 1, 2, . . . 10





F′_I1




  112.4
  467.4








  22.8
  112.4




















TABLE 17







Probability value of the added fuzzy


value required by the system of the corresponding


physical property cluster of the moving object cluster











Inventive principle cluster



Worsening feature cluster
P′(C′1|F′_In)






Physical property cluster
20.28%



(F′_I1)
















TABLE 18







Probability value of the added fuzzy


value, which is matched with the Bayes probability


equation of the system of each corresponding no-


worsening feature cluster of the corresponding object


segmentation and extraction inventive principle cluster


of the moving object cluster











Inventive




principle cluster




Object




Segmentation




and Extraction



No-worsening feature cluster
Cluster













Physical property cluster
20.28%



Energy consumption cluster
17.70%



Operation and recovery cluster
15.93%



Moving object cluster
10.59%



Control cluster
10.23%



Cluster of system efficiency
10.14%



and quality




Cluster of manufacturing and
8.36%



measurement accuracy




Object consumption cluster
3.74%



Cluster of substance amount
3.02%



Non-moving object cluster
0.00%
















TABLE 19







TRIZ matrix









Improved



feature cluster













No worsening
Inventive



feature cluster
principle cluster
















TABLE 20







Simplified TRIZ matrix









No-worsening feature cluster










Cluster of




manufacturing
28 Accuracy of



and
measurement



measurement
29 Accuracy of



accuracy of
manufacturing



no-worsening
32



feature
Manufacturability


Improved feature cluster
cluster
39 Productivity













Control
35
Mechanical
17. Moving to a


cluster of
Conformity
system
new dimension


improved
36
replacement
26. Copying


feature
Complexity of
cluster of
28. Replacement of


cluster
device
inventive
a mechanical



37
principle
system



Complexity of
cluster
29. Use of a



control

pneumatic or



38 Level of

hydraulic



automation

construction



39

32. Color



Productivity

change

## Claims

1. A clustering TRIZ analysis method, comprising:
(1) constructing cluster elements according to features and inventive principles of a TRIZ matrix by associating items with similar physical meanings as one cluster;
(2) calculating display times of each cluster according to improved feature cluster and inventive principle cluster, calculating the display times of a corresponding inventive principle cluster and a no-worsening feature cluster according to a TRIZ contradiction matrix, and storing results of the calculation in a database;
(3) determining discrimination values of a model according to the display time results in step (2), and using the discrimination values to determine a priority order of the clusters.

2. The clustering TRIZ analysis method of claim 1, wherein the model comprises a display time model, Bayes probability model, fuzzy value model, and a combined fuzzy value and Bayes probability model, and the method determine discrimination values according to a fuzzy relation value defined by the models.

3. The clustering TRIZ analysis method of claim 1, further comprising:
providing a design direction;
selecting one of the improved feature clusters according to the design direction;
determining the priority of inventive principle cluster according to the selected improved feature cluster, and generating referential numerical values and discrimination values corresponding thereto;
determining the priority order of the no-worsening feature cluster according to the selected inventive principle clusters, and generating referential numerical values corresponding thereto;
determining a general table of discrimination values of the entire inventive principle cluster and the no-worsening feature cluster, and probability values corresponding to the display times, wherein determination is made as to whether the selected no-worsening feature clusters corresponding to the highest priority order is in the general table of discrimination values of the inventive principle cluster and the no-worsening feature cluster, whether the roll is the highest priority order through the vertical examination of the selected inventive principle clusters or whether the column is the best priority order when looking at the horizontal examination of the selected no-worsening feature clusters, and whether the result conforms with the design direction, limitation conditions and the technological requirements, and if so, deciding on a desired no-worsening feature cluster, otherwise, adopting the inventive principle cluster again;
selecting, from the selected improved feature clusters and the determined no-worsening feature clusters, a single improved feature and a single worsened feature conforming to the design direction and limitation conditions, and searching the original TRIZ matrix to identify a corresponding inventive principle.

4. The clustering TRIZ analysis method of claim 1, further constructing cluster elements associating similar items as one cluster.

5. The clustering TRIZ analysis method of claim 4, further associating 39 features of the TRIZ matrix into the following clusters—moving object cluster, non-moving object cluster, object service life cluster, energy consumption cluster, substance amount cluster, manufacturing and measurement accuracy cluster, control cluster, operation and recovery, system efficiency and quality cluster, physical property cluster, wherein:
the moving object cluster comprises features of weight of the moving object, length of the moving object, area of the moving object, and volume of the moving object;
the non-moving object cluster comprises features of weight of the non-moving object, length of the non-moving object, area of the non-moving object, and volume of the non-moving object;
the object service life cluster comprises features of durability of the moving object, durability of the non-moving object, and waste of the substance;
the system efficiency and quality cluster comprises features of loss of the information, reliability, harmful factors acting on the object, and harmful side effects; and
the physical property cluster comprises features of speed, force, tension/pressure, shape, stability of the object, and hardness.

6. The clustering TRIZ analysis method of claim 4, further associating 40 inventive principles of the TRIZ matrix into the following clusters—object segmentation and extraction cluster, prior handling cluster, counteraction cluster, cluster of partial action or structural change, balance object cluster, vibration and structural dynamicity cluster, harmful factor cluster, mechanical system replacement cluster, material cluster, physical change cluster, chemical action cluster, rejection and maintenance cluster, and system combination cluster, wherein:
object segmentation and extraction cluster comprises inventive principles of segmentation, extraction, asymmetry, prior action, cushion in advance, and dynamicity;
the cluster of partial action or structural change comprises inventive principles of local quality, spheroidality, partial, overdone or excessive action;
the mechanical system replacement cluster comprises inventive principles of moving to a new dimension, copying, replacement of a mechanical system, use of a pneumatic or hydraulic construction, and color change;
the material cluster comprises inventive principles of substituting an expensive, durable object by an inexpensive, non-durable one, flexible film or thin membrane, and use of porous material, homogeneity, and composite material.

7. The clustering TRIZ analysis method of claim 2, wherein the display time model comprises:
selecting the improved feature clusters and the inventive principle clusters having similar physical meanings;
calculating display times of each inventive principle cluster corresponding to each improved feature cluster according to the TRIZ matrix;
determining the priority order of the inventive principle clusters according to the calculated display times;
calculating display times of each of the no-worsening feature clusters according to the TRIZ matrix and the inventive principle cluster corresponding to the improved feature cluster; and
determining priority order of the no-worsening feature clusters according to the calculated display times.

8. The clustering TRIZ analysis method of claim 2, wherein the Bayes probability model comprises:
selecting the improved feature clusters and the inventive principle clusters having similar physical meanings;
determining display probability according to the contents of the TRIZ matrix, and the display times of each corresponding inventive principle cluster (Ij) made by each improved feature cluster, and the Bayes probability (P(Ci|Ij)) of each inventive principle cluster is determined according to the Bayes theorem equation as follows:





  
    
      P
      ⁡
      
        (
        
          
            C
            i
          
          |
          
            I
            j
          
        
        )
      
    
    =
    
      
        
          
            P
            ⁡
            
              (
              
                C
                i
              
              )
            
          
          ×
          
            P
            ⁡
            
              (
              
                
                  I
                  j
                
                |
                
                  C
                  i
                  
                    
                  
                
              
              )
            
          
        
        
          P
          ⁡
          
            (
            
              I
              j
            
            )
          
        
      
      =
      
        
          
            P
            ⁡
            
              (
              
                C
                i
              
              )
            
          
          ×
          
            P
            ⁡
            
              (
              
                
                  I
                  j
                
                |
                
                  C
                  i
                  
                    
                  
                
              
              )
            
          
        
        
          
            ∑
            
              j
              =
              1
            
            a
          
          ⁢
          
            [
            
              
                P
                ⁡
                
                  (
                  
                    C
                    i
                  
                  )
                
              
              ×
              
                P
                ⁡
                
                  (
                  
                    
                      I
                      j
                    
                    |
                    
                      C
                      i
                    
                  
                  )
                
              
            
            ]
          
        
      
    
  
  ⁢
  
    
  
  ,
  wherein
  ,



denotes the total number of inventive principle clusters,
i denotes the number of improved feature clusters, and i=1, 2, . . . , 10,
j denotes number of inventive principle clusters, and j=1, 2, . . . , 13,
P(Ci) denotes the display probability of improved feature cluster (Ci) in the entire TRIZ table, and
P(Ij|Ci) denotes the display probability of inventive principle cluster (Ij) in the improved feature cluster;
determining the priority order according to the calculated Bayes probability value, which is used as a reference in determining priority order in the no-worsening feature clusters;
determining display probability according to the TRIZ matrix and the display times of each corresponding no-worsening feature cluster (I′j) made by each corresponding inventive principle cluster (C′i) of each improved feature cluster, the Bayes probability value P′(C′i|I′j) of each no-worsening feature cluster is determined according to the Bayes theorem equation as follows:





  
    
      
        
          
            
              P
              ′
            
            ⁡
            
              (
              
                
                  C
                  i
                  ′
                
                |
                
                  I
                  j
                  ′
                
              
              )
            
          
          =
          
            
              
                
                  
                    P
                    ′
                  
                  ⁡
                  
                    (
                    
                      C
                      i
                      ′
                    
                    )
                  
                
                ×
                
                  
                    P
                    ′
                  
                  ⁡
                  
                    (
                    
                      
                        I
                        j
                        ′
                      
                      |
                      
                        C
                        i
                        
                          ′
                          ⁢
                          
                            
                          
                        
                      
                    
                    )
                  
                
              
              
                
                  P
                  ′
                
                ⁡
                
                  (
                  
                    I
                    j
                    ′
                  
                  )
                
              
            
            =
            
              
                
                  
                    P
                    ′
                  
                  ⁡
                  
                    (
                    
                      C
                      i
                      ′
                    
                    )
                  
                
                ×
                
                  
                    P
                    ′
                  
                  ⁡
                  
                    (
                    
                      
                        I
                        j
                        ′
                      
                      |
                      
                        C
                        i
                        
                          ′
                          ⁢
                          
                            
                          
                        
                      
                    
                    )
                  
                
              
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  b
                
                ⁢
                
                  [
                  
                    
                      
                        P
                        ′
                      
                      ⁡
                      
                        (
                        
                          C
                          i
                          ′
                        
                        )
                      
                    
                    ×
                    
                      
                        P
                        ′
                      
                      ⁡
                      
                        (
                        
                          
                            I
                            j
                            ′
                          
                          |
                          
                            C
                            i
                            ′
                          
                        
                        )
                      
                    
                  
                  ]
                
              
            
          
        
        ,
        wherein
        ,
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          2
        
        )
      
    
  



b denotes the total number of no-worsening feature clusters,
i denotes the number of inventive principle clusters, and i=1, 2, . . . , 13,
j denotes number of no-worsening feature clusters, and j=1, 2, . . . , 10,
P′(C′i) denotes the display probability of improved feature cluster (C′i) in the inventive feature cluster, and
P′(I′j|C′i) denotes the display probability of no-worsening feature cluster (I′j) in the inventive principle cluster; and
determining priority order of the no-worsening feature cluster according to the calculated Bayes probability value, and using it as a reference for determining priority order in the no-worsening feature cluster.

9. The clustering TRIZ analysis method of claim 2, wherein the fuzzy value model comprises:
selecting the improved feature clusters and the inventive principle clusters having similar physical meanings;
defining the fuzzy relationship value of each element in each feature cluster by 10 feature clusters having similar physical meanings and using a feature in the cluster as a major consideration factor for defining the fuzzy relationship value (F_value) between the major considered feature factor and other related features in accordance with the concept of the fuzzy object oriented model;
determining the display times (I_F_valuei) of the added fuzzy value of each cluster and the total display times (S_F_valuej) of the added fuzzy values of the entire cluster required by the system in accordance with the TRIZ matrix and the display times (Ni) of each corresponding inventive principle cluster made by the improved feature cluster, and from the fuzzy relationship value (F_valuei) between the display times (Ni) and the elements in the improved feature cluster acquired through the fuzzy object oriented model, as follows:





  
    
      
        
          
            I_F
            ⁢
            
              _value
              i
            
          
          =
          
            
              N
              i
            
            ×
            
              F_value
              i
            
          
        
        ,
        
          
        
        ⁢
        
          i
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        a
      
    
  
  
    
      
        
          
            S_F
            ⁢
            
              _value
              j
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              a
            
            ⁢
            
              (
              
                I_F
                ⁢
                
                  _value
                  i
                
              
              )
            
          
        
        ,
        
          
        
        ⁢
        
          j
          =
          1
        
        ,
        2
        ,
        ...
        ⁢
        
          
        
        ,
        13
      
    
  



wherein ‘a’ is the total number of feature factors contained in the cluster;
designating total display times of the added fuzzy values of the entire cluster as the priority order;
determining the display times (N_I_F_valuei) of the added fuzzy value of each cluster and the total display times (N_S_F_valuej) of the added fuzzy values of the entire cluster in accordance with the TRIZ matrix and the display times (N_Ni) of each corresponding no-worsening feature cluster made by each corresponding inventive principle cluster of the elements in each improved feature cluster, and from the fuzzy relationship value (F_valuei) between the display times (N_Ni) and the elements in the improved feature clusters acquired through the fuzzy object oriented model, as follows:





  
    
      
        
          
            N_I
            ⁢
            _F
            ⁢
            
              _value
              i
            
          
          =
          
            
              N_N
              i
            
            ×
            
              F_value
              i
            
          
        
        ,
        
          
        
        ⁢
        
          i
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        a
      
    
  
  
    
      
        
          
            N_S
            ⁢
            _F
            ⁢
            
              _value
              j
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              a
            
            ⁢
            
              N_I
              ⁢
              _F
              ⁢
              
                _value
                i
              
            
          
        
        ,
        
          
        
        ⁢
        
          j
          =
          1
        
        ,
        2
        ,
        ...
        ⁢
        
          
        
        ,
        10
      
    
  



wherein ‘a’ is the total number of feature factors contained in the cluster; and
designating the total display times of the added fuzzy values of the entire cluster as the priority order in the no-worsening feature cluster.

10. The clustering TRIZ analysis method of claim 1, wherein the combined fuzzy value and Bayes probability model comprises:
selecting the improved feature clusters and the inventive principle clusters having similar physical meanings;
defining the fuzzy relationship value of each element in each cluster by 10 feature clusters having similar physical meanings and designating a feature in the cluster as a major consideration factor for defining the fuzzy relationship value (F_value) between the major considered feature factor and other related features in accordance with the fuzzy object oriented model;
determining the display times (I_F_valuei) of the added fuzzy value of each feature factor and the total display times (S_F_valuei) of the added fuzzy values of the entire cluster in accordance with the TRIZ matrix and the display times (Ni) of each corresponding inventive principle cluster made by the improved feature cluster (Cm), and from the fuzzy relationship value (F_valuei) between the display times and the elements in the improved feature cluster acquired through the fuzzy object oriented model, as follows:





  
    
      
        
          
            I_F
            ⁢
            
              _value
              i
            
          
          =
          
            
              N
              i
            
            ×
            
              F_value
              i
            
          
        
        ,
        
          
        
        ⁢
        
          i
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        a
      
    
  
  
    
      
        
          
            S_F
            ⁢
            
              _value
              j
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              a
            
            ⁢
            
              (
              
                I_F
                ⁢
                
                  _value
                  i
                
              
              )
            
          
        
        ,
        
          
        
        ⁢
        
          j
          =
          1
        
        ,
        2
        ,
        ...
        ⁢
        
          
        
        ,
        13
        ,
      
    
  



wherein ‘a’ is the total number of feature factors contained in the cluster; and
determining the display probability (P(F_In|Cm)) of the added fuzzy value according to the total display times (S_F_valuei) of the added fuzzy values of the entire cluster, as follows:





  
    
      
        
          P
          ⁡
          
            (
            
              
                F_I
                n
              
              |
              
                C
                m
              
            
            )
          
        
        =
        
          
            S_F
            ⁢
            
              _value
              i
            
          
          
            
              ∑
              
                i
                =
                1
              
              13
            
            ⁢
            
              S_F
              ⁢
              
                _value
                j
              
            
          
        
      
    
  
  
    
      
        
          
            P
            ⁡
            
              (
              
                
                  C
                  m
                
                |
                
                  F_I
                  n
                
              
              )
            
          
          =
          
            
              
                P
                ⁡
                
                  (
                  
                    C
                    m
                  
                  )
                
              
              ×
              
                P
                ⁡
                
                  (
                  
                    
                      F_I
                      n
                    
                    |
                    
                      C
                      m
                    
                  
                  )
                
              
            
            
              
                ∑
                
                  n
                  =
                  1
                
                13
              
              ⁢
              
                [
                
                  
                    P
                    ⁡
                    
                      (
                      
                        C
                        m
                      
                      )
                    
                  
                  ×
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          F_I
                          n
                        
                        |
                        
                          C
                          m
                        
                      
                      )
                    
                  
                
                ]
              
            
          
        
        ,
        wherein
        ,
      
    
  




m is the number of improved feature clusters, and m=1, 2, . . . , 10,
n is the number of inventive principle clusters, and n=1, 2, . . . , 13,
P(Cm) is the display probability of the added fuzzy value of the improved feature cluster (Cm) in the entire TRIZ matrix, and
P(F_In|Cm) is the display probability of the added fuzzy value of the inventive principle cluster (F_In) in the improved feature cluster;

designating the probability value of the added fuzzy value as the priority order in the inventive principle cluster;
determining the display times (N′_I_F_valuei) of the added fuzzy value of each cluster and the total display times (N′_S_F_valuej) of the added fuzzy values of the entire cluster in accordance with the TRIZ matrix, the display times (N′_Ni) of each corresponding no-worsening feature cluster (C′m) made by each corresponding inventive principle cluster of the element in each improved feature cluster, and the fuzzy relationship value (F_valuei) between the display times (N′_Ni) and the elements in the improved feature cluster determined by the fuzzy object oriented model, as follows:





  
    
      
        
          
            
              N
              ′
            
            ⁢
            _I
            ⁢
            _F
            ⁢
            
              _value
              i
            
          
          =
          
            
              N
              ′
            
            ⁢
            
              _N
              i
            
            ×
            
              F_value
              i
            
          
        
        ,
        
          
        
        ⁢
        
          i
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        a
      
    
  
  
    
      
        
          
            
              N
              ′
            
            ⁢
            _S
            ⁢
            _F
            ⁢
            
              _value
              j
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              a
            
            ⁢
            
              
                N
                ′
              
              ⁢
              _I
              ⁢
              _F
              ⁢
              
                _value
                i
              
            
          
        
        ,
        
          
        
        ⁢
        
          j
          =
          1
        
        ,
        2
        ,
        ...
        ⁢
        
          
        
        ,
        10
        ,
      
    
  



wherein ‘a’ is the total number of feature factors contained in the cluster;
determining the display probability (P′(F′_In|C′m)) of the added fuzzy value according to the total display times (N′_S_F_valuej) of the added fuzzy values of the entire cluster, as follows:





  
    
      
        
          
            P
            ′
          
          ⁡
          
            (
            
              
                
                  F
                  ′
                
                ⁢
                
                  _I
                  n
                
              
              |
              
                C
                m
                ′
              
            
            )
          
        
        =
        
          
            
              N
              ′
            
            ⁢
            _S
            ⁢
            _F
            ⁢
            
              _value
              j
            
          
          
            
              ∑
              
                j
                =
                1
              
              10
            
            ⁢
            
              
                N
                ′
              
              ⁢
              _S
              ⁢
              _F
              ⁢
              
                _value
                j
              
            
          
        
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          13
        
        )
      
    
  
  
    
      
        
          
            
              P
              ′
            
            ⁡
            
              (
              
                
                  C
                  m
                  ′
                
                |
                
                  
                    F
                    ′
                  
                  ⁢
                  
                    _I
                    n
                  
                
              
              )
            
          
          =
          
            
              
                
                  P
                  ′
                
                ⁡
                
                  (
                  
                    C
                    m
                    ′
                  
                  )
                
              
              ×
              
                
                  P
                  ′
                
                ⁡
                
                  (
                  
                    
                      
                        F
                        ′
                      
                      ⁢
                      
                        _I
                        n
                      
                    
                    |
                    
                      C
                      m
                      ′
                    
                  
                  )
                
              
            
            
              
                ∑
                
                  n
                  =
                  1
                
                10
              
              ⁢
              
                [
                
                  
                    
                      P
                      ′
                    
                    ⁡
                    
                      (
                      
                        C
                        m
                        ′
                      
                      )
                    
                  
                  ×
                  
                    
                      P
                      ′
                    
                    ⁡
                    
                      (
                      
                        
                          
                            F
                            ′
                          
                          ⁢
                          
                            _I
                            n
                          
                        
                        |
                        
                          C
                          m
                          ′
                        
                      
                      )
                    
                  
                
                ]
              
            
          
        
        ,
        wherein
        ,
      
    
    
      
        (
        
          3
          ⁢
          
            -
          
          ⁢
          14
        
        )
      
    
  



m is the number of inventive principle clusters, and m=1, 2, . . . , 13,
n is number of worsening feature clusters, and n=1, 2, . . . , 10,
P′(C′m) is the display probability of the added fuzzy value of the improved feature cluster (C′m) in the improved feature cluster,
P′(F′In|C′m) is the display probability of the added fuzzy value of the no-worsening feature cluster (F′_In) in the inventive principle cluster; and
designating the probability value of the added fuzzy value as the priority order in the no-worsening feature cluster.