No label defined (Q4527191)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1560340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1560340 |
Statements
5 June 2001
0 references
logical analysis of data
0 references
0.8387483358383179
0 references
0.8387483358383179
0 references
0.7745155096054077
0 references
0.7706064581871033
0 references
The author is concerned with the following problem: Given a partially defined Boolean function, determine the ``best'' completely defined extension of it. The meaning of ``best'' depends on the context in which the question is asked. For instance, in oil exploration, if vectors are the results of well logs and a mapping to 1 (to 0) means that oil is found (is not found), and if relatively few vectors have been assigned values to date, then the best completely specified Boolean function is the one that minimizes the probability of error in assigning values to new vectors. Such probabilities depend on the distribution of data and determining distributions would be easier if there exists some natural underlying law governing the generation of data. Some new theories of data generation are proposed, based on Hamming distances between vectors and using mixed-integer programming techniques. Computer implementation is discussed in some detail. A few examples are given and computational experience is reported. For the entire collection see [Zbl 0949.00027].
0 references
