|
|
|
|
|
|
|
|
|
Brute force algorithm
| Глоссарий по искусственному интеллекту |
Algorithms that exhaustively examine every option are often referred to as brute force algorithms. while this approach will always lead to the ``best" solution, it can also require unreasonable amounts of time or other resources when compared to techniques that use some other property of the problem to arrive at a solution, techniques that use a greedy approach or a limited look-ahead. an example would be the problem of finding a maximum of a function. a brute force step would divide the feasible region into small grids and then evaluate the results at every point over the grid. if the function is "well-behaved," a smarter algorithm would evaluate
|
|
Algorithms, английский
Complex mathematical formulae or rules used to solve complex problems in cctv they are used to achieve digital compression of a video picture.
Unreasonable, английский
Exhaustive, английский
- A collection of events {a1, a2, a3, … } exhausts the set a if, for the event a to occur, at least one of those sets must also occur; that is, if
- Полный; исчерпывающий
|
Greedy algorithm, английский
Algorithms are often described as being greedy when they attempt to solve a larger problem by taking short steps that are locally optimum but ignoring combinations of steps that might lead to a better overall solution. for example, decision trees are often constructed using greedy algorithms. at any particular node, the greedy program will choose the best single split as the next level in the tree, rather than looking for combinations of splits that could yield a better solution several steps later. greedy algorithms have the advantage that they are easier to implement and can be faster than global algorithms, and often yield a result that is "good enough." see also: look-ahead.
Alice, английский
Alice is a data mining toolkit based on decision trees. it is designed for end users and includes a graphical front-end. see also: ac2, http://www.alice-soft.com/products/alice.html
|
|
|
|
|
|
|
