Two New Methods for Network Analysis: Ant Colony Optimization and Reduction by Forgetting

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86080816" target="_blank" >RIV/61989100:27240/11:86080816 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-18029-3_23" target="_blank" >http://dx.doi.org/10.1007/978-3-642-18029-3_23</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-18029-3_23" target="_blank" >10.1007/978-3-642-18029-3_23</a>

Result language
angličtina
Original language name
Two New Methods for Network Analysis: Ant Colony Optimization and Reduction by Forgetting
Original language description
This paper presents two new methods for network analysis. Ant colony optimization is a nature inspired algorithm succesfull in graph traversal and network path finding whereas network reduction based on stability introduces two new properties of networkvertices based on their long-term behavior, their role in the network and the understanding of how memory works. We illustrate the algorithms on applications in social network analysis and information retrieval using the DBLP dataset and a small networkof hyperlinked documents.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GA201%2F09%2F0990" target="_blank" >GA201/09/0990: XML data processing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)