Spatial representation of dissimilarity data via lower-complexity linear and nonlinear mappings

DOI10.1007/3-540-70659-3_51MaRDI QIDQ4808989zbMATH OpenFDO

Authors Elżbieta Pȩkalska, Robert P. W. Duin

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2396/23960488.htm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Recommendations

• On dissimilarity measurement in visualization of multidimensional data
• Dissimilarity representations allow for building good classifiers
• Topographic mapping of large dissimilarity data sets
• Fast algorithm and implementation of dissimilarity self-organizing maps
• Extension of classical MDS to treat dissimilarities not satisfying axioms of distance

Cited in

(2)

• A novel data representation based on dissimilarity increments
• Low discrepancy allocation of two-dimensional data

This page was built for publication: Spatial representation of dissimilarity data via lower-complexity linear and nonlinear mappings

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