157 | | double conv = getValueForConvergence(classLinks[j].getNumOfOriginInstances(), |
158 | | classLinks[j].getNumOfLinkedInstances(), |
159 | | classLinks[j].getNumOfLinks()); |
160 | | //double divv = getValueForDivergence(classLinks[j].getNumOfOriginInstances(), |
161 | | // classLinks[j].getNumOfLinkedInstances(), |
162 | | // classLinks[j].getNumOfLinks()); |
163 | | if ( conv > concut ){ // convergence |
| 157 | if ( decideConvergence(classLinks[j]) ){ // convergence |
| 177 | private boolean decideConvergence(ClassLink classLink){ |
| 178 | double con = getValueForConvergence(classLink.getNumOfOriginInstances(), |
| 179 | classLink.getNumOfLinkedInstances(), |
| 180 | classLink.getNumOfLinks()); |
| 181 | if ( con > concut ){ |
| 182 | return true; |
| 183 | } |
| 184 | return false; |
| 185 | } |
| 186 | |
| 187 | private boolean decideDivergence(ClassLink classLink){ |
| 188 | double con = getValueForConvergence(classLink.getNumOfOriginInstances(), |
| 189 | classLink.getNumOfLinkedInstances(), |
| 190 | classLink.getNumOfLinks()); |
| 191 | if ( con < divcut ){ |
| 192 | return true; |
| 193 | } |
| 194 | return false; |
| 195 | } |
| 196 | |