On-line learning of binary and n-ary relations over multi-dimensional clusters

Authors:
Atsuyoshi Nakamura;Naoki Abe
Affiliations:
Theory NEC Laboratory, RWCP, c/o C & C Research Laboratories, NEC Corporation, 4-1-1 Miyazaki Miyamae-ku, Kawasaki 216, Japan;Theory NEC Laboratory, RWCP, c/o C & C Research Laboratories, NEC Corporation, 4-1-1 Miyazaki Miyamae-ku, Kawasaki 216, Japan
Venue:
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Year:
1995

Learning complicated concepts reliably and usefully

COLT '88 Proceedings of the first annual workshop on Computational learning theory
Learning binary relations and total orders

SIAM Journal on Computing
Learning binary relations using weighted majority voting

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

Machine Learning
Distributional clustering of English words

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics

Empirical Comparison of Competing Query Learning Methods

DS '98 Proceedings of the First International Conference on Discovery Science

Hi-index	0.00