Top-down induction of clustering trees
Hendrik Blockeel, Luc De Raedt, Jan Ramon

TL;DR
This paper introduces TIC, a novel top-down clustering method based on decision tree induction and instance-based learning, applicable to propositional and relational domains, with experimental validation.
Contribution
It adapts decision tree induction for clustering using inductive logic programming principles, creating a new system for first-order clustering.
Findings
Effective clustering in propositional and relational domains
Demonstrated the approach's viability through experiments
Integrates decision trees with inductive logic programming
Abstract
An approach to clustering is presented that adapts the basic top-down induction of decision trees method towards clustering. To this aim, it employs the principles of instance based learning. The resulting methodology is implemented in the TIC (Top down Induction of Clustering trees) system for first order clustering. The TIC system employs the first order logical decision tree representation of the inductive logic programming system Tilde. Various experiments with TIC are presented, in both propositional and relational domains.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Algorithms and Data Compression · Data Management and Algorithms
