Imagen de Portada

On the cohesion and separability of average-link for hierarchical agglomerative clustering

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Laber, Eduardo Sany, Bastista, Miguel
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Data Structures and Algorithms F.2.2; I.5.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Correlation Clustering with Vertex Splitting
por: Bentert, Matthias, et al.
Publicado: (2024)

The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
por: Gila, Ofek, et al.
Publicado: (2025)

Contraction Clustering (RASTER): A Very Fast Big Data Algorithm for Sequential and Parallel Density-Based Clustering in Linear Time, Constant Memory, and a Single Pass
por: Ulm, Gregor, et al.
Publicado: (2019)

Ancestry Tree Clustering for Particle Filter Diversity Maintenance
por: Vallivaara, Ilari, et al.
Publicado: (2025)

CART-ELC: Oblique Decision Tree Induction via Exhaustive Search
por: Laack, Andrew D.
Publicado: (2025)

The Presort Hierarchy for Geometric Problems
por: van der Hoog, Ivor, et al.
Publicado: (2026)

New bounds on the cohesion of complete-link and other linkage methods for agglomeration clustering
por: Dasgupta, Sanjoy, et al.
Publicado: (2024)

Multiplication of 0-1 matrices via clustering
por: Jansson, Jesper, et al.
Publicado: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
por: Kowaluk, Mirosław, et al.
Publicado: (2025)

Chameleon2++: An Efficient and Scalable Variant Of Chameleon Clustering
por: Singh, Priyanshu, et al.
Publicado: (2025)

A Simple yet Exact Analysis of the MultiQueue
por: Walzer, Stefan, et al.
Publicado: (2024)

U-index: A Universal Indexing Framework for Matching Long Patterns
por: Ayad, Lorraine A. K., et al.
Publicado: (2025)

The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles
por: Schmidt, Sebastian, et al.
Publicado: (2026)

Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation
por: Peterseim, Benedikt, et al.
Publicado: (2026)

The Maximum Clique Problem in a Disk Graph Made Easy
por: Keil, J. Mark, et al.
Publicado: (2024)

Min-CSPs on Complete Instances
por: Anand, Aditya, et al.
Publicado: (2024)

Online $b$-Matching with Stochastic Rewards
por: Albers, Susanne, et al.
Publicado: (2024)

Scheduling with Obligatory Tests
por: Dogeas, Konstantinos, et al.
Publicado: (2024)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
por: DeHaan, Ian, et al.
Publicado: (2024)

Revisiting Path Contraction and Cycle Contraction
por: Krithika, R., et al.
Publicado: (2024)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
por: Chakrabarti, Amit, et al.
Publicado: (2024)

A faster algorithm for the construction of optimal factoring automata
por: Erlebach, Thomas, et al.
Publicado: (2024)

Online Combinatorial Optimization with Graphical Dependencies
por: Gao, Zhimeng, et al.
Publicado: (2025)

Offline green bin packing and its constrained variant
por: Gong, Mingyang, et al.
Publicado: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
por: Bruchhold, Sebastian, et al.
Publicado: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
por: Awofeso, Christine, et al.
Publicado: (2025)

Online computation of normalized substring complexity
por: Kucherov, Gregory, et al.
Publicado: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
por: Gong, Mingyang, et al.
Publicado: (2025)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
por: Blomer, Valentin, et al.
Publicado: (2026)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
por: Mosenzon, Ron
Publicado: (2025)

A Faster Directed Single-Source Shortest Path Algorithm
por: Duan, Ran, et al.
Publicado: (2026)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
por: Lindermayr, Alexander, et al.
Publicado: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
por: Emmerich, Michael
Publicado: (2025)

Connected Components in Linear Work and Near-Optimal Time
por: Farhadi, Alireza, et al.
Publicado: (2023)

Hierarchical Exponential Search Via K-Spines
por: Dong, Bob
Publicado: (2025)

On the satisfability of random k-Horn formulae
por: Istrate, Gabriel
Publicado: (2000)

Search and evacuation with a near majority of faulty agents
por: Czyzowicz, J., et al.
Publicado: (2026)

Approximation algorithms for Job Scheduling with reconfigurable resources
por: Bergé, Pierre, et al.
Publicado: (2023)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
por: Antoniadis, Antonios, et al.
Publicado: (2020)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
por: Bergougnoux, Benjamin, et al.
Publicado: (2026)