activity
20182023
most citedGeneralized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statistics

33 citations · 54 across the 34 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2023

A 2-opt Algorithm for Locally Optimal Set Partition Optimization

Kaan Gokcesu, Hakan Gokcesu

Our research deals with the optimization version of the set partition problem, where the objective is to minimize the absolute difference between the sums of the two disjoint parti…

cs.DS2022

Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity

Kaan Gokcesu, Hakan Gokcesu

We propose a nearest neighbor based clustering algorithm that results in a naturally defined hierarchy of clusters. In contrast to the agglomerative and divisive hierarchical clust…

cs.DS2022

A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization

Kaan Gokcesu, Hakan Gokcesu

We study the problem of multiway number partition optimization, which has a myriad of applications in the decision, learning and optimization literature. Even though the original m…

cs.DS2021

A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization

Kaan Gokcesu, Hakan Gokcesu

We study the optimization version of the equal cardinality set partition problem (where the absolute difference between the equal sized partitions' sums are minimized). While this…

cs.DS2021★ 1 cited

Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection

Kaan Gokcesu, Hakan Gokcesu

We study the optimization version of the set partition problem (where the difference between the partition sums are minimized), which has numerous applications in decision theory l…