Top-down induction of clustering trees

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.

9 pages, 3 figures

Cited by in corpus (19)

• Efficient algorithms for decision tree cross-validation
• Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs
• Interpretable Clustering using Unsupervised Binary Trees
• A hybrid algorithm for Bayesian network structure learning with application to multi-label learning
• Multi-Target Regression via Random Linear Target Combinations
• Multi-Label Learning with Deep Forest
• Random forests with random projections of the output space for high dimensional multi-label classification
• Machine learning for predicting thermal power consumption of the Mars Express Spacecraft
• Scaling Up Inductive Logic Programming by Learning from Interpretations
• Unsupervised Feature Construction for Improving Data Representation and Semantics
• Approaches For Multi-View Redescription Mining
• XAI for Self-supervised Clustering of Wireless Spectrum Activity
• Robust Neural Routing Through Space Partitions for Camera Relocalization in Dynamic Indoor Environments
• Preventing the Generation of Inconsistent Sets of Classification Rules
• On the price of explainability for some clustering problems
• Belief propagation for minimum weight many-to-one matchings in the random complete graph
• Application of distances between terms for flat and hierarchical data
• Clustering using Unsupervised Binary Trees: CUBT
• Classifying pairs with trees for supervised biological network inference