Extended box clustering for classification problems
From MaRDI portal
Recommendations
Cites work
- A graph coloring algorithm for large scheduling problems
- Abstract Voronoi diagrams revisited
- Approximate coloring of uniform hypergraphs
- Beyond Fano's inequality: bounds on the optimal F-score, BER, and cost-sensitive risk and their implications
- Comparison of convex hulls and box hulls.
- Convex hulls of finite sets of points in two and three dimensions
- Covering with Euclidean boxes
- Curved Voronoi diagrams
- Domination in hypergraphs
- Hereditary properties of hypergraphs
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4164874 (Why is no real title available?)
- scientific article; zbMATH DE number 2209732 (Why is no real title available?)
- Metric learning: a survey
- Pruning boxes in a box-based classification method
- Similarity-based methods: A general framework for classification, approximation and association
- Supervised box clustering
- The hardness of 3-uniform hypergraph coloring
- The maximum box problem and its application to data analysis
Cited in
(3)
This page was built for publication: Extended box clustering for classification problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724605)