Abstract:
So far, abstraction has been mainly investigated in problem solving tasks. In this paper, we are interested in the role of abstraction in representing and learning concepts (i.e., intensional descriptions of classes of objects). We propose a novel perspective on abstraction, originating from the observation that a conceptualization of a domain involves entities belonging to at least three levels. The fundamental level is the perception of the world, where concrete objects reside. For memorizing objects, some kind of structure, which describes objects and relations perceived in the world, is needed. Finally, to communicate with others, and also to perform reasoning, a language has to be used; the language allows both the world and theories about the world to be described intensionally. In previous approaches, abstraction has been frequently defined as a mapping between languages. Our main departure from this view is that abstraction is, originally, a mapping between views of the world, and that the modifications of the structure and of the language are side-effects, necessary to describe what happens at the level of the perceived world. Within the defined framework, we show how the abstraction process can be realized by means of a set of operators, and we formalize a constraint that abstraction mappings should satisfy in order to be useful for Machine Learning, i.e. preserving the generality relation among hypotheses. 1.
Citations
|
625
|
A theory and methodology of inductive learning
– Michalski
- 1983
|
|
536
|
Rough Sets: Theoretical Aspects of Reasoning about Data
– Pawlak
- 1991
|
|
490
|
Generalization as search
– MITCHELL
- 1982
|
|
478
|
A Mathematical Introduction to Logic
– Enderton
- 1972
|
|
388
|
Planning in a hierarchy of abstraction spaces
– Sacerdoti
- 1974
|
|
190
|
Data Abstraction: Aggregation and Generalization
– Smith, Smith
- 1977
|
|
154
|
A Theory of Abstraction
– Giunchiglia, Walsh
- 1992
|
|
154
|
Machine invention of first-order predicates by inverting resolution
– Muggleton, Buntine
- 1988
|
|
113
|
Shift of bias for inductive concept-learning
– Utgoff
- 1986
|
|
93
|
Logic and Structure
– Dalen
- 1994
|
|
82
|
Constructive Induction on Decision Trees
– Matheus, Rendell
- 1989
|
|
69
|
Theorem proving with abstraction
– Plaisted
- 1981
|
|
46
|
Granularity
– Hobbs
- 1985
|
|
31
|
Speeding up problem solving by abstraction: A graph oriented approach
– Holte, Mkadmi, et al.
- 1996
|
|
29
|
Toward a model of representation changes
– KORF
- 1980
|
|
27
|
On the connection between the complexity and credibility of inferred models
– Pearl
- 1978
|
|
21
|
A Theory of Justified Reformulations
– Subramanian
- 1989
|
|
20
|
Domain abstraction and limited reasoning
– Imielinski
- 1987
|
|
14
|
Synthesis of abstraction hierarchies for constraint satisfaction by clustering approximately equivalent objects
– Ellman
- 1993
|
|
13
|
A semantic theory of abstractions
– Nayak, Levy
- 1995
|
|
12
|
Preserving Consistency across Abstraction Mappings
– Tenenberg
- 1987
|
|
12
|
Hypothesis-Driven Constructive Induction in AQ17-HCI: A Method and Experiments
– Michalski
- 1994
|
|
9
|
Approximation in Mathematical Domains
– Bennett
- 1987
|
|
8
|
Representation in problem solving
– Amarel
- 1983
|
|
7
|
Induction in an abstraction space
– Drastal, Czako
- 1989
|
|
5
|
Abstracting Concepts with Inverse Resolution
– Giordana, Saitta, et al.
- 1991
|
|
5
|
The Abstraction/Implementation Model of Problem Reformulation
– Lowry
- 1987
|
|
4
|
Abstraction: a general framework for learning. Working notes
– Giordana, Saitta
- 1990
|
|
3
|
Selective Reformulation of Examples
– Zucker, Ganascia
- 1994
|
|
2
|
Towards Automatic Generation of Hierarchical Knowledge Bases
– Yoshida, Motoda
- 1990
|
|
1
|
Reasoning with Multiple Abstraction Models
– Iwasaski
- 1990
|
|
1
|
Automatic Generation of Abstraction for
– Knoblock
- 1992
|