ndCurveMaster

Heuristic techniques

ndCurveMaster uses heuristic techniques for curve fitting and implements scientific algorithms.

Finding the best combinations in 3D/4D/5D/6D/..nD models and selecting the best-fitting functions from the function set results in a large number of possible variants. Searching through all possible variants by using an exact algorithm is computationally expensive and time consuming. A heuristic approach has been implemented in ndCurveMaster software to solve this problem.

The best nonlinear functions and variable combinations are selected through randomization and looped searching through the use of the following methods:

These methods improve the discovery of better models. The disadvantage of these heuristic techniques is that the solution is not as optimal as the exact approach. But multiple searches allow the user to find a solution which is closer to an optimal result.

The effect of using the heuristic algorithm is that even when you use the same data set each time:

Therefore it would be advisable to try to repeatedly fit models to the same data.

Back to Contents