By M. Kochen
Communications of the ACM,
July 1961,
Vol. 4 No. 7, Page 323
10.1145/366622.366653
Comments
An algorithm for finding the characterization of a class of objects on the basis of a randomly ordered sequence of labeled individual objects—some members of the class, some not—is described. The class is characterized as a disjunction of terms, each term being a conjunction of attributes. “All red, round objects or all square, small objects” is an example. Mechanisms based on this algorithm are described in terms of such properties as the amount of storage available for recording instances and the number of instances which had to be examined until the class was first guessed.
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.
