Issue No. 10 - October (1992 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.159907
<p>An important aspect of human learning is the ability to select effective samples to learn and utilize the experience to infer the outcomes of new events. This type of learning is characterized as partially supervised learning. A learning algorithm of this type is suggested for linearly separable systems. The algorithm selects a subset S from a finite set X of linearly separable vectors to construct a linear classifier that can correctly classify all the vectors in X. The sample set S is chosen without any prior knowledge of how the vectors in X-S are classified. The computational complexity of the algorithm is analyzed, and the lower bound on the size of the sample set is established.</p>
partially supervised learning; linearly separable systems; computational complexity; lower bound; computational complexity; learning (artificial intelligence)
S. Wong and S. Wan, "A Partially Supervised Learning Algorithm for Linearly Separable Systems," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 14, no. , pp. 1052-1056, 1992.