Show simple item record

Socio-spatial influence maximization in location-based social networks

hal.structure.identifierKhajeh Nasir Toosi University of Technology [Téhéran] [KNTU]
dc.contributor.authorHOSSEINPOOR, Mohammad
hal.structure.identifierKhajeh Nasir Toosi University of Technology [Téhéran] [KNTU]
dc.contributor.authorMALEK, Mohammad Reza
hal.structure.identifierInstitut de Recherche de l'Ecole Navale [IRENAV]
dc.contributor.authorCLARAMUNT, Christophe
dc.date.accessioned2021-05-14T09:30:02Z
dc.date.available2021-05-14T09:30:02Z
dc.date.issued2019
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/75779
dc.description.abstractEnIdentifying influential nodes in social networks is a key issue in many domains such as sociology, economy, biology, and marketing. A common objective when studying such networks is to find the minimum number of nodes with the highest influence. One might for example, maximize information diffusion in social networks by selecting some appropriate nodes. This is known as the Influence Maximization Problem (IMP). Considering the social aspect, most of the current works are based on the number, intensity, and frequency of node relations. On the spatial side, the maximization problem is denoted as the Location-Aware Influence Maximization Problem (LAIMP). When advertising for a new product, having access to people who have the highest social status and their neighbors are distributed evenly across a given region is often a key issue to deal with. Another valuable issue is to inform the maximum number of users located around an event, denoted as a query point, as quickly as possible. The research presented in this paper, along with a new measure of centrality that both considers network and spatial properties, extends the influence maximization problem to the locationbased social networks and denotes it hereafter as the Socio-Spatial Influence Maximization Problem (SSIMP). The focus of this approach is on the neighbor nodes and the concept of line graph as a possible framework to reach and analyze these neighbor nodes. Furthermore, we introduce a series of local and global indexes that take into account both the graph and spatial properties of the nodes in a given network. Moreover, additional semantics are considered in order to represent the distance to a query point as well as the measure of weighted farness. Overall, these indexes act as the components of the feature vectors and using k-nearest neighbors, the closest nodes to the ‘ideal’ node are determined as top-k nodes. The node with maximum values for feature vectors is considered as the ‘ideal’ node. The experimental evaluation shows the performance of the proposed method in determining influential nodes to maximize the socio-spatial influence in location-based social networks.
dc.language.isoen
dc.subject.enSocial network
dc.title.enSocio-spatial influence maximization in location-based social networks
dc.typeArticle de revue
dc.identifier.doi10.1016/j.future.2019.06.024
dc.subject.halInformatique [cs]
bordeaux.journalFuture Generation Computer Systems
bordeaux.page304-314
bordeaux.hal.laboratoriesInstitut de Mécanique et d’Ingénierie de Bordeaux (I2M) - UMR 5295*
bordeaux.issue101
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.institutionINRAE
bordeaux.institutionArts et Métiers
bordeaux.peerReviewedoui
hal.identifierhal-03200358
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-03200358v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Future%20Generation%20Computer%20Systems&rft.date=2019&rft.issue=101&rft.spage=304-314&rft.epage=304-314&rft.au=HOSSEINPOOR,%20Mohammad&MALEK,%20Mohammad%20Reza&CLARAMUNT,%20Christophe&rft.genre=article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record