Extended box clustering for classification problems

DOI10.1007/s00357-018-9253-2zbMath1392.68429OpenAlexW2791453963MaRDI QIDQ724605

Vincenzo Spinelli

Publication date: 26 July 2018

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-018-9253-2

zbMATH Keywords

Voronoi diagramsbox clustersbox-based classifierincompatibility hypergraphs

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abstract Voronoi diagrams revisited
• Hereditary properties of hypergraphs
• Covering with Euclidean boxes
• The maximum box problem and its application to data analysis
• The hardness of 3-uniform hypergraph coloring
• Pruning boxes in a box-based classification method
• Supervised box clustering
• Domination in hypergraphs
• Metric Learning: A Survey
• A graph coloring algorithm for large scheduling problems
• Convex hulls of finite sets of points in two and three dimensions
• Approximate coloring of uniform hypergraphs

This page was built for publication: Extended box clustering for classification problems