Supervised box clustering

DOI10.1007/s11634-016-0233-2zbMath1414.62275OpenAlexW2256159160MaRDI QIDQ2418297

Vincenzo Spinelli

Publication date: 3 June 2019

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-016-0233-2

zbMATH Keywords

classification problemsincompatibility graphssupervised clusteringhomogeneous boxes

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Extended box clustering for classification problems

Uses Software

• UCI-ml

Cites Work

• The maximum box problem for moving points in the plane
• Hypergraph families with bounded edge cover or transversal number
• Logic classification and feature selection for biomedical data
• Separating pairs of points of standard boxes
• Covering with Euclidean boxes
• On movable separability and isotheticity
• Toward efficient agnostic learning
• Logical analysis of numerical data
• Finding essential attributes from binary data
• The maximum box problem and its application to data analysis
• Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
• Saturated systems of homogeneous boxes and the logical analysis of numerical data
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging
• Classifying negative and positive points by optimal box clustering
• A graph coloring algorithm for large scheduling problems
• The Erdos-Szekeres problem on points in convex position – a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Supervised box clustering