• Published 1997

INDUCTION OF RELATIONAL DECISION TREES BY OP- TIMIZATION OF STRUCTURAL ATTRIBUTES

@inproceedings{Wysotzki1997INDUCTIONOR,
  title={INDUCTION OF RELATIONAL DECISION TREES BY OP- TIMIZATION OF STRUCTURAL ATTRIBUTES},
  author={Fritz Wysotzki},
  year={1997}
}
We present a logical approach to graph theoretical decision tree learning that is based on using alphabetic substitutions for modelling graph morphisms. A classiied graph is represented by a deenite clause possessing variables of the sort node for representing the nodes and atoms for representing the edges. In contrast to the standard logical semantics, diierent node variables are assumed to denote diierent objects. The use of an alphabetical subsumption relation (subsumption) implies that the… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Inductive Generalization: A Logical Framework

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

A note on inductive generaliza

G. D. Plotkin
  • 1970
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Re nement of datalog programs

F. Esposito
  • 1996

Structural Regression Trees

  • AAAI/IAAI, Vol. 1
  • 1996
VIEW 3 EXCERPTS

Applications of a logical discovery engine

L. Dehaspe
  • 1994

Inductionof decision trees from complex structured data

William J. Frawley, G. D. Plotkin
  • 1991