Dasgupta
PulseAugur coverage of Dasgupta — every cluster mentioning Dasgupta across labs, papers, and developer communities, ranked by signal.
-
New algorithms approximate hierarchical clustering into trees and bounded-diameter graphs
Researchers have developed new approximation algorithms for hierarchical clustering problems, specifically when the goal is to partition data into trees or graphs with bounded diameter. The proposed framework leverages …
-
New clustering method targets trees and bounded-diameter graphs
Researchers have introduced Hierarchical $\mathcal{F}$-Clustering, a variation on hierarchical clustering that stops partitioning data when clusters meet specific graph class criteria, such as trees or bounded diameter …
-
New algorithm learns halfspaces without synthetic data
Researchers have developed a new algorithm for learning halfspaces without relying on synthetic data, addressing a long-standing challenge in computational geometry. The algorithm achieves tight bounds of $\Theta(D + \l…
-
New research characterizes objective functions for hierarchical clustering
Researchers have introduced new theoretical insights into objective functions for hierarchical clustering. They characterized admissible sum-type objective functions under specific polynomial conditions and proposed a n…