AI Chat AI Image Generator AI Video Text to Speech

Weakest link pruning of a dendrogram

12/10/2022

∙

by Jiacheng Ge, et al.

∙

∙

Hierarchical clustering is a popular method for identifying distinct groups in a dataset. The most commonly used method for pruning a dendrogram is via a single horizontal cut. In this paper, we propose a new technique "weakest link optimal pruning". We prove its superiority over horizontal pruning and provide some examples illustrating how the two methods can behave quite differently.

Jiacheng Ge
1 publication
Robert Tibshirani
39 publications

page 1

page 2

page 3

page 4

research

∙ 10/28/2019

Layer Pruning for Accelerating Very Deep Neural Networks

In this paper, we propose an adaptive pruning method. This method can cu...

0 Weiwei Zhang, et al. ∙

research

∙ 04/12/2022

Neural Network Pruning by Cooperative Coevolution

Neural network pruning is a popular model compression method which can s...

0 Haopu Shang, et al. ∙

research

∙ 07/30/2020

Hierarchical Action Classification with Network Pruning

Research on human action classification has made significant progresses ...

0 Mahdi Davoodikakhki, et al. ∙

research

∙ 06/08/2020

A Framework for Neural Network Pruning Using Gibbs Distributions

Neural network pruning is an important technique for creating efficient ...

0 Alex Labach, et al. ∙

research

∙ 09/21/2023

Cluster-based pruning techniques for audio data

Deep learning models have become widely adopted in various domains, but ...

0 Boris Bergsma, et al. ∙

research

∙ 11/10/2018

Using NonBacktracking Expansion to Analyze k-core Pruning Process

We induce the NonBacktracking Expansion Branch method to analyze the k-c...

0 Rui-jie Wu, et al. ∙

research

∙ 02/14/2023

Data pruning and neural scaling laws: fundamental limitations of score-based algorithms

Data pruning algorithms are commonly used to reduce the memory and compu...

0 Fadhel Ayed, et al. ∙