Pages that link to "Item:Q354178"
From MaRDI portal
The following pages link to Interpretable clustering using unsupervised binary trees (Q354178):
Displaying 10 items.
- Assessing variable importance in clustering: a new method based on unsupervised binary decision trees (Q1729346) (← links)
- Interpretable clustering: an optimization approach (Q2051231) (← links)
- Clustering multivariate functional data using unsupervised binary trees (Q2076137) (← links)
- Functional data clustering via hypothesis testing \(k\)-means (Q2418054) (← links)
- Nearly tight bounds on the price of explainability for the \(k\)-center and the maximum-spacing clustering problems (Q2686110) (← links)
- Interpretable taxonomy extraction from digital assets metadata using automated unsupervised decision tree learning (Q6040336) (← links)
- On clustering and interpreting with rules by means of mathematical optimization (Q6109555) (← links)
- The computational complexity of some explainable clustering problems (Q6121425) (← links)
- How to find a good explanation for clustering? (Q6136087) (← links)
- Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate (Q6601549) (← links)
