 | |
Entropy and Quantity of Information
comp.databases.theory comp.databases.theory
 |
| | Thread Tools | Display Modes |
#11
 
| |||
| |||
|
Re: Entropy and Quantity of Information -
01-12-2008
, 03:17 AM
|
I vaguely recall that some of the more theoretical machine learning results (like learnability and optimality results) rely on a notion entropy. |
I once wrote a little program to play Mastermind (a code guessing game)
using entropy to measure a move's worth. Mastermind can be played using a
brute force tree search. But my program tried out only about 10 moves, and
picked the one with the best entropy. Its play was only slightly inferior
to the play of a brute force tree searcher.
#12
| |||
| |||
|
|
I vaguely recall that some of the more theoretical machine learning results (like learnability and optimality results) rely on a notion entropy. |
I once wrote a little program to play Mastermind (a code guessing game)
using entropy to measure a move's worth. Mastermind can be played using a
brute force tree search. But my program tried out only about 10 moves, and
picked the one with the best entropy. Its play was only slightly inferior
to the play of a brute force tree searcher.
#13
| |||
| |||
|
|
I vaguely recall that some of the more theoretical machine learning results (like learnability and optimality results) rely on a notion entropy. |
I once wrote a little program to play Mastermind (a code guessing game)
using entropy to measure a move's worth. Mastermind can be played using a
brute force tree search. But my program tried out only about 10 moves, and
picked the one with the best entropy. Its play was only slightly inferior
to the play of a brute force tree searcher.
#14
| |||
| |||
|
|
I vaguely recall that some of the more theoretical machine learning results (like learnability and optimality results) rely on a notion entropy. |
I once wrote a little program to play Mastermind (a code guessing game)
using entropy to measure a move's worth. Mastermind can be played using a
brute force tree search. But my program tried out only about 10 moves, and
picked the one with the best entropy. Its play was only slightly inferior
to the play of a brute force tree searcher.
#15
| |||
| |||
|
|
I vaguely recall that some of the more theoretical machine learning results (like learnability and optimality results) rely on a notion entropy. |
I once wrote a little program to play Mastermind (a code guessing game)
using entropy to measure a move's worth. Mastermind can be played using a
brute force tree search. But my program tried out only about 10 moves, and
picked the one with the best entropy. Its play was only slightly inferior
to the play of a brute force tree searcher.
#16
| |||
| |||
|
|
I vaguely recall that some of the more theoretical machine learning results (like learnability and optimality results) rely on a notion entropy. |
I once wrote a little program to play Mastermind (a code guessing game)
using entropy to measure a move's worth. Mastermind can be played using a
brute force tree search. But my program tried out only about 10 moves, and
picked the one with the best entropy. Its play was only slightly inferior
to the play of a brute force tree searcher.
#17
| |||
| |||
|
|
I vaguely recall that some of the more theoretical machine learning results (like learnability and optimality results) rely on a notion entropy. |
I once wrote a little program to play Mastermind (a code guessing game)
using entropy to measure a move's worth. Mastermind can be played using a
brute force tree search. But my program tried out only about 10 moves, and
picked the one with the best entropy. Its play was only slightly inferior
to the play of a brute force tree searcher.
|
« Previous Thread
|
Next Thread »
| Thread Tools | |
| Display Modes | |
Linear Mode
| |
Powered by vBulletin Version 3.5.3
Copyright ©2000 - 2012, Jelsoft Enterprises Ltd.
Copyright ©2000 - 2012, Jelsoft Enterprises Ltd.