Please use this identifier to cite or link to this item:
http://idr.nitk.ac.in/jspui/handle/123456789/7588
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sinha, N. | |
dc.contributor.author | Annappa, B. | |
dc.date.accessioned | 2020-03-30T10:02:31Z | - |
dc.date.available | 2020-03-30T10:02:31Z | - |
dc.date.issued | 2016 | |
dc.identifier.citation | Smart Innovation, Systems and Technologies, 2016, Vol.44, , pp.51-61 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7588 | - |
dc.description.abstract | In a social network, the influence maximization is to find out the optimal set of seeds, by which influence can be maximized at the end of diffusion process. The approaches which are already existing are greedy approaches, genetic algorithm and ant colony optimization. Eventhough these existing algorithms take more time for diffusion, they are not able to generate a good number of influenced nodes. In this paper, a Cuckoo Search Diffusion Model (CSDM) is proposed which is based on a metaheuristic approach known as the Cuckoo Search Algorithm. It uses fewer parameters than any other metaheuristic approaches. Therefore parameter tuning is an easy task for this algorithm which is the main advantage of the Cuckoo Search algorithm. Experimental results show that this model gives better results than previous works. � Springer India 2016. | en_US |
dc.title | Cuckoo search for influence maximization in social networks | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.