Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables

DOI10.1016/J.IJAR.2024.109133MaRDI QIDQ6548456FDOQ6548456

Authors: Shuai Wang, Lizhu Hao, Xiao Fei Wang, Jianhua Guo 

Publication date: 1 June 2024

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Recommendations

• Agglomerative hierarchical clustering via distance correlation
• Pairwise Variable Selection for High-Dimensional Model-Based Clustering
• Hierarchical clustering of continuous variables based on the empirical copula process and permutation linkages
• Agglomerative hierarchical clustering of continuous variables based on mutual information
• Model assisted variable clustering: minimax-optimal recovery and algorithms

zbMATH Keywords

variable clusteringlatent tree modelparalinear distance

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Estimating the number of clusters in a data set via the gap statistic
• Model-based multidimensional clustering of categorical data
• Approximating discrete probability distributions with dependence trees
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• 10.1162/jmlr.2003.3.4-5.993
• Association Pattern Discovery Via Theme Dictionary Models
• Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
• The Elements of Statistical Learning
• Hierarchical latent class models for cluster analysis
• A few logs suffice to build (almost) all trees (I)
• Learning latent tree graphical models
• Decomposition of structural learning about directed acyclic graphs
• Model-based clustering of high-dimensional data: variable selection versus facet determination
• Title not available (Why is that?)
• Collapsibility and response variables in contingency tables
• A survey on latent tree models and applications
• Latent tree models for hierarchical topic detection
• Greedy learning of latent tree models for multidimensional clustering
• Spectral methods for learning discrete latent tree models
• Finding the minimal set for collapsible graphical models
• Title not available (Why is that?)
• The classical groups, their invariants and representations.

This page was built for publication: Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548456)