This Article 
 Bibliographic References 
 Add to: 
A Partially Supervised Learning Algorithm for Linearly Separable Systems
October 1992 (vol. 14 no. 10)
pp. 1052-1056

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.

[1] S. Baase,Computer Algorithms(2nd ed.). Reading, MA: Addison-Wesley, 1988.
[2] A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, "Occam's razor,"Inform. Processing Lett., vol. 24, pp. 377-380, 1987.
[3] R. O. Duda and P. E. Hart,Pattern Classification and Scene Analysis. New York: Wiley, 1973.
[4] L. G. Khachian, A polynomial algorithm for linear programming,Dokl. Akad. Nanka(USSR), vol. 224, no. 5, pp. 1093-1096, 1979.
[5] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[6] M. Minsky and S. Papert,Perceptrons. Cambridge, MA: MIT Press, 1988.
[7] S. Muroga,Threshold Logic and Its Applications. New York: Wiley, 1971.
[8] K. Murty,Linear and Combinatorial Programming. New York: Wiley, 1976.
[9] N. J. Nilsson,Learning Machines. New York: McGraw-Hill, 1965.
[10] L. Pitt, and L. G. Valiant, "Computational limitations on learning from examples,"J. ACM, vol. 33, no. 4, pp. 965-984, 1988.
[11] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: Springer-Verlag, 1985.
[12] J. J. Rocchio, Jr., "Relevance feedback in information retrieval," inThe SMART Retrieval System(G. Salton, Ed.). Englewood Cliffs, NJ: Prentice-Hall, 1971.
[13] D.E. Rumelhart and D. McClelland, eds.,Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Vols. 1-2, MIT Press, Cambridge, Mass., 1986.
[14] J. Stoer and C. Witzgall,Convexity and Optimization in Finite Dimension I. Berlin: Springer-Verlag, 1970.
[15] L. G. Valiant, "A theory of the learnable,"Comm. ACM, vol. 27, pp. 1134-1142, Nov. 1984.
[16] S. K. M. Wong and Y. Y. Yao, "Query formulation in linear retrieval models,"J. Amer. Soc. Inform. Sci., vol. 41, no. 5, pp. 334-341, 1990.

Index Terms:
partially supervised learning; linearly separable systems; computational complexity; lower bound; computational complexity; learning (artificial intelligence)
S.J. Wan, S.K.M. Wong, "A Partially Supervised Learning Algorithm for Linearly Separable Systems," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, no. 10, pp. 1052-1056, Oct. 1992, doi:10.1109/34.159907
Usage of this product signifies your acceptance of the Terms of Use.