8 citations · 11 across the 3 of their papers we have counts for
3 papers
cs.LG2022
Optimal Decision Diagrams for Classification
Alexandre M. Florio, Pedro Martins, Maximilian Schiffer +2
Decision diagrams for classification have some notable advantages over decision trees, as their internal connections can be determined at training time and their width is not bound…
cs.DM2017★ 3 cited
Goal Clustering: VNS based heuristics
Pedro Martins
Given a set V of n elements on m attributes, we want to find a partition of V on the minimum number of clusters such that the associated R-squared ratio is at least a given thresho…
math.CO2016★ 8 cited
Modeling the maximum edge-weight k-plex partitioning problem
Pedro Martins
Given a sparse undirected graph G with weights on the edges, a k-plex partition of G is a partition of its set of nodes such that each component is a k-plex. A subset of nodes S is…