Issue No. 01 - January/February (1999 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.755626
<p><b>Abstract</b>—In this paper, we define the generalization problem, summarize various approaches in generalization, identify the credit assignment problem, and present the problem and some solutions in measuring generalizability. We discuss anomalies in the ordering of hypotheses in a subdomain when performance is normalized and averaged, and show conditions under which anomalies can be eliminated. To generalize performance across subdomains, we present a measure called probability of win that measures the probability whether one hypothesis is better than another. Finally, we discuss some limitations in using probabilities of win and illustrate their application in finding new parameter values for TimberWolf, a package for VLSI cell placement and routing.</p>
Anomalies in generalization, credit assignment problem generalization, machine learning, subdomains, probability of win, VLSI cell placement and routing.
B. W. Wah, "Generalization and Generalizability Measures," in IEEE Transactions on Knowledge & Data Engineering, vol. 11, no. , pp. 175-186, 1999.