Abstract
We study the problem of properly learning unions of two axis-parallel rectangles over the domain {0, n−1}2 in the on-line model with equivalence queries. When only O(logn) equivalence queries are allowed, this problem is one of the five interesting open problems proposed by W. Maass and G. Turán (Mach. Learning14, 1994, 251–269), regarding learning geometric concepts. In this paper, we design an efficient algorithm that properly learns unions of two rectangles over the domain {0, n−1}2 using O(log2n) equivalence queries.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
