BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Namur Institute For Complex Systems - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Namur Institute For Complex Systems
X-ORIGINAL-URL:https://www.naxys.be
X-WR-CALDESC:Events for Namur Institute For Complex Systems
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190502T130000
DTEND;TZID=Europe/Paris:20190502T140000
DTSTAMP:20260429T184159
CREATED:20190306T132149Z
LAST-MODIFIED:20190425T133454Z
UID:562-1556802000-1556805600@www.naxys.be
SUMMARY:Nathanaël Kasoro Mulenda (University of Kinshasa\, DRC)
DESCRIPTION:Title: PercoMCV: A hybrid approach of community detection in social networks \nAbstract: Knowledge extraction in social networks is a needful tool as it touches every aspect of our lives such as politic\, socio-economic\, scientific\, etc. Community detection is one of the objectives of this specific tool used for knowledge extraction in social networks. \nMany algorithms of knowledge extraction from social networks have been developed these last years. However\, many of them are not constant\, effective and accurate when facing these social networks with many edges. \nIn this paper\, we propose a new approach of community detection in social networks with many links between communities. The proposed approach has two steps. In the first step\, the algorithm attempts to determine all communities that the clique percolation algorithm may find. In the second step\, the algorithm computes the Eigenvector Centrality method on the output of the first step in order to measure the influence of network nodes and reduce the rate of the unclassified nodes. \nTo assess this new approach\, we test it on different types of networks. Relevant communities that have been detected testifies effectiveness and performance of the approach over other community detection algorithms. \n  \n 
URL:https://www.naxys.be/event/nathanael-kasoro-mulenda-university-of-kinshasa/
LOCATION:E25
CATEGORIES:NAXYS Seminar
END:VEVENT
END:VCALENDAR