Clustering with a new distance measure based on a dual-rooted tree
Authors:
- Laurent GalluccioLGLaurent Galluccio
- Olivier MichelOMOlivier Michel
- Pierre ComonPCPierre Comon
- Mark KligerMKMark Kliger
- Alfred O. HeroAHAlfred O. Hero
Open Access
- 1 December 2013
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 251, 96-113
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- A tree-structured framework for purifying “complex” clusters with structural roles of individual dataPattern Recognition, 2010
- On clustering tree structured data with categorical naturePattern Recognition, 2008
- Cumulative Voting Consensus Method for Partitions with Variable Number of ClustersIEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
- Visualizing Proximity DataField Methods, 2007
- Combining multiple clusterings using evidence accumulationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Bagging to improve the accuracy of a clustering procedureBioinformatics, 2003
- An information-theoretic approach to spectral variability, similarity, and discrimination for hyperspectral image analysisIEEE Transactions on Information Theory, 2000
- Bagging predictorsMachine Learning, 1996
- Distance measures for signal processing and pattern recognitionSignal Processing, 1989
- Clustering algorithms based on minimum and maximum spanning trees1988