Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Some types of clustering with relational constraints

From MaRDI portal
Publication:789129
Jump to:navigation, search

DOI10.1007/BF02293878zbMath0532.62038MaRDI QIDQ789129

Anuška Ferligoj, Vladimir Batagelj

Publication date: 1983

Published in: Psychometrika (Search for Journal in Brave)


zbMATH Keywords

hierarchical clusteringoriented graphrelational constraints


Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Connectivity (05C40)


Related Items (6)

A survey of constrained classification ⋮ Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data ⋮ Mixtures of (constrained) ultrametric trees ⋮ Direct multicriteria clustering algorithms ⋮ A constrained \(k\)-means clustering algorithm for classifying spatial units ⋮ A fuzzy clustering model for multivariate spatial time series




This page was built for publication: Some types of clustering with relational constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:789129&oldid=12729034"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 12:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki