Communications of the ACM
Computational geometry: an introduction
Computational geometry: an introduction
Information Processing Letters
Computational limitations on learning from examples
Journal of the ACM (JACM)
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An analysis of vector space models based on computational geometry
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.15 |
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.