6 citations · 9 across the 13 of their papers we have counts for
3 papers · 1 filter
Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
Dorit S. Hochbaum, Ayleen Irribarra-Cortés, Olivier Goldschmidt +1
The Densest Subgraph Problem (DSP) is widely used to identify community structures and patterns in networks such as bioinformatics and social networks. While solvable in polynomial…
An Effective Flow-based Method for Positive-Unlabeled Learning: 2-HNC
Dorit Hochbaum, Torpong Nitayanont
In many scenarios of binary classification, only positive instances are provided in the training data, leaving the rest of the data unlabeled. This setup, known as positive-unlabel…
Confidence HNC: A Network Flow Technique for Binary Classification with Noisy Labels
Dorit Hochbaum, Torpong Nitayanont
We consider here a classification method that balances two objectives: large similarity within the samples in the cluster, and large dissimilarity between the cluster and its compl…