Finding groups with a simple genetic algorithm*

DOI10.1080/0022250X.1993.9990109MaRDI QIDQ4693219zbMATH OpenOpenAlexFDO

Authors Linton C. Freeman

Publication date 18 July 1993

Published in The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0022250x.1993.9990109

zbMATH Keywords

genetic algorithmpartitioning a matrix of social proximities

Mathematics Subject Classification ID

Models of societies, social and urban evolution (91D10) Mathematical sociology (including anthropology) (91D99) Computational methods for problems pertaining to biology (92-08)

Recommendations

• A genetic algorithm approach to cluster analysis.
• New genetic algorithm with greedy heuristic for clustering problems with unknown number of groups
• scientific article; zbMATH DE number 1703853
• scientific article; zbMATH DE number 1140603
• scientific article; zbMATH DE number 970353

Cited in

(8)

• Genetic clustering of social networks using random walks
• Grouping optimization based on social relationships
• Genetic algorithms as a tool for structuring collaborative groups
• scientific article; zbMATH DE number 558543 (Why is no real title available?)
• scientific article; zbMATH DE number 2101401 (Why is no real title available?)
• Social differentiation as the unfolding of dimensions of social systems
• Expert-analytical optimization of the formation of social groups
• Estimation in a binomial stochastic blockmodel for a weighted graph by a variational expectation maximization algorithm

This page was built for publication: Finding groups with a simple genetic algorithm*

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