Conditional clusters, musters, and probability
From MaRDI portal
Publication:1169778
DOI10.1016/0025-5564(82)90130-4zbMath0495.62066OpenAlexW1965784238MaRDI QIDQ1169778
Publication date: 1982
Published in: Mathematical Biosciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0025-5564(82)90130-4
partitioningextensionsnumerical examplesmodificationsoptimal coveringmaximum-entropy principleconditional clustering procedureconnectedness of neighbourhoodsderivation of subset generating phase from extrem- value theorymustersprobability of membershipweak musters
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
- Strong consistency of k-means clustering
- Pattern recognition as a quest for minimum entropy
- Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- Conditional Clustering
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Greedy Heuristic for the Set-Covering Problem
- Entropy in linear programs
- The Length of a Generation
- Covering, Packing and Knapsack Problems
- Admissible clustering procedures