Abstract
Relaxation algorithms employ an initial stochastic classification and a probabilistic model for deferring final decision. In such algorithms it is desirable to evaluate a classification based on an initial stochastic classification and a probabilistic model. Such evaluation can monitor the classification and ensure reasonable results. Specific classifications are evaluated, rather than evaluating the intermediate probabilistic classifications as was considered in previous work. Since relaxation algorithms are not guaranteed to converge to a reasonable solution, monitoring them is useful as a stopping criterion.
Original language | English |
---|---|
Pages | 54-57 |
Number of pages | 4 |
State | Published - 1980 |
Event | Unknown conference - Miami Beach, FL, USA Duration: 1 Dec 1980 → 4 Dec 1980 |
Conference
Conference | Unknown conference |
---|---|
City | Miami Beach, FL, USA |
Period | 1/12/80 → 4/12/80 |