@inproceedings{38f37522c2904003881b5c4ff43ccbf9,

title = "Learning binary relations and total orders",

abstract = "The problem of designing polynomial prediction algorithms for learning binary relations is studied for an online model in which the instances are drawn by the learner, by a helpful teacher, by an adversary, or according to a probability distribution on the instance space. The relation is represented as an n × m binary matrix, and results are presented when the matrix is restricted to have at most k distinct row types, and when it is constrained by requiring that the predicate form a total order.",

author = "Goldman, {Sally A.} and Rivest, {Ronald L.} and Schapire, {Robert E.}",

year = "1989",

doi = "10.1109/sfcs.1989.63454",

language = "English (US)",

isbn = "0818619821",

series = "Annual Symposium on Foundations of Computer Science (Proceedings)",

publisher = "Publ by IEEE",

pages = "46--51",

booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

note = "30th Annual Symposium on Foundations of Computer Science ; Conference date: 30-10-1989 Through 01-11-1989",

}