The Haar Wavelet Transform of a Dendrogram
Fionn Murtagh
Abstract
We describe a new wavelet transform, for use on hierarchies or binary rooted trees. The theoretical framework of this approach to data analysis is described. Case studies are used to further exemplify this approach. A first set of application studies deals with data array smoothing, or filtering. A second set of application studies relates to hierarchical tree condensation. Finally, a third study explores the wavelet decomposition, and the reproducibility of data sets such as text, including a new perspective on the generation or computability of such data objects.
Create a lesson
Related papers
Faithful Query Resolution for Conversational Search
Saber Zerhoudi, Ivica Kostric, Jelena Mitrovic
What Drives AI Citations? Content, Retrieval and Model Knowledge in Generative Engine Optimization (GEO)
Mahe Chen, Nick Koudas
Data Curation and Model Souping: Unlocking Qwen3-0.6B for MS MARCO Passage Ranking
Shuguang Han
Self-improving data synthesis can scale embedding models across domains and tasks
Zucan Lyu, Rui Tang, Jianlyu Chen et al.
The Company a Question Keeps: Auditing Open Jev-Style Models for Retrieval
Jianbo Chen
Fine-Tuning Strategy, Not Just Data: A Statistically Rigorous Audit of Gender and Stereotypical Bias in Embedding Models for HR Recommendation Systems
Ekta Yadav