Using Logical Decision Trees for Clustering

@inproceedings{Raedt1997UsingLD,
  title={Using Logical Decision Trees for Clustering},
  author={Luc De Raedt and Hendrik Blockeel},
  booktitle={ILP},
  year={1997}
}
A novel first order clustering system, called C 0.5, is presented. It inherits its logical decision tree formalism from the TILDE system, but instead of using class information to guide the search, it employs the principles of instance based learning in order to perform clustering. Various experiments are discussed, which show the promise of the approach. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 41 CITATIONS

Relational Distance-Based Clustering

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Induction as a Search Procedure

VIEW 1 EXCERPT
CITES METHODS
HIGHLY INFLUENCED

Relational Reinforcement Learning

VIEW 4 EXCERPTS
CITES METHODS

Recursive Neural Networks for Density Estimation Over Generalized Random Graphs

References

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

De Raedt and L . Dehaspe . Clausal discovery

  • L.
  • Machine Learning
  • 1997

Metrics on Terms and Clauses

Induction in logic

De Raedt . Experiments with top - down induction of logical decision trees

  • L. H.Blockeeland
  • Technical Report CW
  • 1992

Apolynomial approach to the constructive induction ofstructural knowledge

  • S. Kramer
  • Machine Learning