Learning representations from dendrograms

DOI10.1007/s10994-020-05895-3OpenAlexW3049472892MaRDI QIDQ2217438

Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani

Publication date: 29 December 2020

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.09225

zbMATH Keywords

feature extractionunsupervised learningdendrogramrepresentation learningensemble method

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Sublinear update time randomized algorithms for dynamic graph regression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive trajectory analysis of replicator dynamics for data clustering
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• A fast minimum spanning tree algorithm based on \(K\)-means
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Correlation clustering
• Kernel methods in machine learning
• Application of cut polyhedra. I
• Robust path-based spectral clustering
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• Factor graphs and the sum-product algorithm