On the public citation graph

Learning boolean functions in an infinite attribute space

https://doi.org/10.1007/bf00994112
0 signed · 35 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.1006/jcss.1995.1004openalex-snapshot
Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes
inferredcites →https://doi.org/10.1016/b978-0-934613-41-5.50037-4openalex-snapshot
Recent Results on Boolean Concept Learning
inferredcites →https://doi.org/10.1016/b978-1-55860-213-7.50018-3openalex-snapshot
Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes
inferredcites →https://doi.org/10.1145/100216.100224openalex-snapshot
Learning boolean functions in an infinite attribute space
inferredcites →https://doi.org/10.1145/1968.1972openalex-snapshot
A theory of the learnable

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.1998.1571openalex-snapshot
Attribute-Efficient Learning in Query and Mistake-Bound Models
inferred← citeshttps://doi.org/10.1007/978-3-030-30484-3_3openalex-snapshot
Discrete Stochastic Search and Its Application to Feature-Selection for Deep Relational Machines
inferred← citeshttps://doi.org/10.1007/bf00993470openalex-snapshot
The Learnability of Description Logics with Equality Constraints
inferred← citeshttps://doi.org/10.1007/bfb0027312openalex-snapshot
Stochastic propositionalization of non-determinate background knowledge
inferred← citeshttps://doi.org/10.1007/s10994-005-0914-0openalex-snapshot
Online Multiclass Learning with k-Way Limited Feedback and an Application to Utterance Classification
inferred← citeshttps://doi.org/10.1016/b978-1-55860-377-6.50017-7openalex-snapshot
Empirical support for Winnow and Weighted-Majority based algorithms: results on a calendar scheduling domain
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00048-9openalex-snapshot
Knowing what doesn't matter: exploiting the omission of irrelevant data
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00063-5openalex-snapshot
Selection of relevant features and examples in machine learning
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00021-5openalex-snapshot
On learning multivariate polynomials under the uniform distribution
inferred← citeshttps://doi.org/10.1023/a:1007335615132openalex-snapshot
Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain
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:1007581123604openalex-snapshot
Learning to Reason with a Restricted View
inferred← citeshttps://doi.org/10.1023/a:1007616604496openalex-snapshot
Adaptive Versus Nonadaptive Attribute-Efficient Learning
inferred← citeshttps://doi.org/10.1023/a:1007678005361openalex-snapshot
Projection Learning
inferred← citeshttps://doi.org/10.1023/a:1018098129371openalex-snapshot
On Learning Visual Concepts and DNF Formulae
inferred← citeshttps://doi.org/10.1023/a:1022653502461openalex-snapshot
Learning Boolean Functions in an Infinite Attribute Space
inferred← citeshttps://doi.org/10.1109/cvpr.2000.855892openalex-snapshot
Learning to recognize objects
inferred← citeshttps://doi.org/10.1109/icpr.2006.906openalex-snapshot
Online Learning of Discriminative Patterns from Unlimited Sequences of Candidates
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492486openalex-snapshot
Simple learning algorithms for decision trees and multivariate polynomials
inferred← citeshttps://doi.org/10.1111/1467-8640.00213openalex-snapshot
HIGH‐DIMENSIONAL LEARNING FRAMEWORK FOR ADAPTIVE DOCUMENT FILTERING*
inferred← citeshttps://doi.org/10.1145/225298.225299openalex-snapshot
Rationality
inferred← citeshttps://doi.org/10.1145/225298.225314openalex-snapshot
On self-directed learning
inferred← citeshttps://doi.org/10.1145/238061.238101openalex-snapshot
Analysis of greedy expert hiring and an application to memory-based learning (extended abstract)
inferred← citeshttps://doi.org/10.1145/276698.276874openalex-snapshot
Adaptive versus nonadaptive attribute-efficient learning
inferred← citeshttps://doi.org/10.1162/089976602753633394openalex-snapshot
Learning to Recognize Three-Dimensional Objects
inferred← citeshttps://doi.org/10.3115/1220175.1220278openalex-snapshot
Weakly supervised named entity transliteration and discovery from multilingual comparable corpora
inferred← citeshttps://doi.org/10.3115/1220835.1220846openalex-snapshot
Named entity transliteration and discovery from multilingual comparable corpora
inferred← citeshttps://doi.org/10.3115/1596374.1596388openalex-snapshot
Interactive feature space construction using semantic information
inferred← citeshttps://doi.org/10.3115/1705475.1705485openalex-snapshot
Comparing learners for Boolean partitions
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.