dc.contributor.author | Dubec, Patrik | |
dc.contributor.author | Plucar, Jan | |
dc.contributor.author | Rapant, Lukáš | |
dc.date.accessioned | 2013-09-24T10:59:36Z | |
dc.date.available | 2013-09-24T10:59:36Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | DZIECH, A. a A. CZYŻEWSKI, eds. Multimedia Communications, Services and Security: 6th International Conference, MCSS 2013: Krakow, Poland, June 6-7, 2013: proceedings. Berlin: Springer, c2013. s. 194-203. Communications in Computer and Information Science, v. 368. | cs |
dc.identifier.isbn | 978-3-642-38558-2 | |
dc.identifier.isbn | 978-3-642-38559-9 | |
dc.identifier.issn | 1865-0929 | |
dc.identifier.uri | http://hdl.handle.net/10084/100689 | |
dc.description.abstract | We present bio-inspired approach in a process of finding global minimum
of an energetic function that is used in force directed layout algorithms.
We have been faced with the issue of displaying large graphs. These graphs
arise in the analysis of social networks with the need to view social relationships
between entities. In order to find global minimum of an energetic function
we employ two bio-inspired algorithms: Differential Evolution and Self-
Organizing Migration Algorithm (SOMA). Differential evolution is inspired by
crossbreeding of population whereas SOMA is inspired by migration of some
species. In this article we will present basics of these algorithms, their results
and comparison. | cs |
dc.format.extent | 5036995 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | Neuvedeno | cs |
dc.publisher | Springer | cs |
dc.relation.ispartofseries | Multimedia Communications, Services and Security: 6th International Conference, MCSS 2013: Krakow, Poland, June 6-7, 2013: proceedings | cs |
dc.relation.uri | http://dx.doi.org/10.1007/978-3-642-38559-9_17 | cs |
dc.rights | © Springer | cs |
dc.subject | force-based layout algorithm | cs |
dc.subject | differential evolution | cs |
dc.subject | SOMA | cs |
dc.title | Use of the bio-inspired algorithms to find global minimum in force directed layout algorithms | cs |
dc.type | article | cs |
dc.identifier.location | Není ve fondu ÚK | cs |
dc.identifier.doi | 10.1007/978-3-642-38559-9_17 | |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/FP7/218086 | cs |
dc.rights.access | closedAccess | |
dc.type.version | publishedVersion | cs |
dc.type.status | Peer-reviewed | cs |