摘要: Littlestone's WINNOW algorithm for learning disjunctions of Boolean attributes where most are irrelevant is one the fundamental results in theory. Because importance WINNOW, it natural to try extending learn features (i.e., concepts). In doing so, we may generalize some earlier applications WINNow. this paper, extend WiNNow k-disjunctions indicator-feature pairs each pair a conjunction attribute and feature (concept) from certain type class. (When all always set 1, then concept class features.)