On the public citation graph

On-Line Learning of Rectangles and Unions of Rectangles

https://doi.org/10.1007/bf00993471
0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
inferredcites →https://doi.org/10.1007/bf00992674openalex-snapshot
Lower Bound Methods and Separation Results for On-Line Learning Models
inferredcites →https://doi.org/10.1007/bf00993976openalex-snapshot
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts
inferredcites →https://doi.org/10.1016/c2013-0-07692-xopenalex-snapshot
The Handbook of Artificial Intelligence
inferredcites →https://doi.org/10.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1109/sfcs.1987.37openalex-snapshot
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
inferredcites →https://doi.org/10.1109/sfcs.1989.63488openalex-snapshot
On the complexity of learning from counterexamples
inferredcites →https://doi.org/10.1145/167088.167129openalex-snapshot
Comparison-based search in the presence of errors
inferredcites →https://doi.org/10.1145/168304.168342openalex-snapshot
Learning unions of two rectangles in the plane with equivalence queries
inferredcites →https://doi.org/10.1145/168304.168345openalex-snapshot
On-line learning of rectangles in noisy environments
inferredcites →https://doi.org/10.1145/1968.1972openalex-snapshot
A theory of the learnable
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.1145/48014.63140openalex-snapshot
Computational limitations on learning from examples

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.1999.1621openalex-snapshot
The Learnability of Unions of Two Rectangles in the Two-Dimensional Discretized Space
inferred← citeshttps://doi.org/10.1007/11894841_7openalex-snapshot
Learning Unions of ω(1)-Dimensional Rectangles
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_12openalex-snapshot
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
inferred← citeshttps://doi.org/10.1007/3-540-45435-7_20openalex-snapshot
On the Proper Learning of Axis Parallel Concepts
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_2openalex-snapshot
Learning boxes in high dimension
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_57openalex-snapshot
Learning disjunctions of features
inferred← citeshttps://doi.org/10.1007/bf00114009openalex-snapshot
Classic learning
inferred← citeshttps://doi.org/10.1007/bfb0030848openalex-snapshot
An optimal algorithm for proper learning of unions of two rectangles with queries
inferred← citeshttps://doi.org/10.1007/pl00013834openalex-snapshot
PAC Learning Intersections of Halfspaces with Membership Queries
inferred← citeshttps://doi.org/10.1007/pl00013835openalex-snapshot
Learning Boxes in High Dimension
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00019-4openalex-snapshot
The bounded injury priority method and the learnability of unions of rectangles
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.036openalex-snapshot
Learning unions of ω(1) -dimensional rectangles
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00067-9openalex-snapshot
Intrinsic complexity of learning geometrical concepts from positive data
inferred← citeshttps://doi.org/10.1023/a:1007465907571openalex-snapshot
Online Learning versus Offline Learning
inferred← citeshttps://doi.org/10.1023/a:1007510732151openalex-snapshot
Self-Directed Learning and Its Relation to the VC-Dimension and to Teacher-Directed Learning
inferred← citeshttps://doi.org/10.1023/a:1026443024002openalex-snapshot
Classic Learning
inferred← citeshttps://doi.org/10.1061/(asce)0899-1561(2005)17:5(570)openalex-snapshot
Model for Simulating Carbonation of Fly Ash Concrete
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365705openalex-snapshot
On learning discretized geometric concepts
inferred← citeshttps://doi.org/10.1137/s0097539794274246openalex-snapshot
Exact Learning of Discretized Geometric Concepts
inferred← citeshttps://doi.org/10.1145/168304.168342openalex-snapshot
Learning unions of two rectangles in the plane with equivalence queries
inferred← citeshttps://doi.org/10.1145/238061.238109openalex-snapshot
PAC learning intersections of halfspaces with membership queries (extended abstract)
inferred← citeshttps://doi.org/10.1162/153244304322972676openalex-snapshot
10.1162/153244304322972676
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.