Influence Maximization Based on Network Motifs in Mobile Social Networks
Published 2022 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Influence Maximization Based on Network Motifs in Mobile Social Networks
Authors
Keywords
-
Journal
IEEE Transactions on Network Science and Engineering
Volume 9, Issue 4, Pages 2353-2363
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Online
2022-03-30
DOI
10.1109/tnse.2022.3163203
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Motif discovery in networks: A survey
- (2020) Shuo Yu et al. Computer Science Review
- An Efficient Multiresolution Clustering for Motif Discovery in Complex Networks
- (2020) Mahdi Pursalim et al. IEEE-ACM Transactions on Computational Biology and Bioinformatics
- A reversed node ranking approach for influence maximization in social networks
- (2019) Xiaobin Rui et al. APPLIED INTELLIGENCE
- A most influential node group discovery method for influence maximization in social networks: A trust-based perspective
- (2019) Bo Zhang et al. DATA & KNOWLEDGE ENGINEERING
- Grassroots VS elites: Which ones are better candidates for influence maximization in social networks?
- (2019) Dong Li et al. NEUROCOMPUTING
- Motif-based functional backbone extraction of complex networks
- (2019) Jie Cao et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Opinion Behavior Analysis in Social Networks Under the Influence of Coopetitive Media
- (2019) Dong Xue et al. IEEE Transactions on Network Science and Engineering
- Link Prediction in Signed Social Networks: From Status Theory to Motif Families
- (2019) Si-Yuan Liu et al. IEEE Transactions on Network Science and Engineering
- Influence Maximization on Social Graphs: A Survey
- (2018) Yuchen Li et al. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
- Profit Maximization with Sufficient Customer Satisfactions
- (2018) Cheng Long et al. ACM Transactions on Knowledge Discovery from Data
- Efficient Distance-Aware Influence Maximization in Geo-Social Networks
- (2017) Xiaoyang Wang et al. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
- Efficient Algorithms for the Identification of Top-$k$ Structural Hole Spanners in Large Social Networks
- (2017) Wenzheng Xu et al. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
- An Efficient Sampling Algorithm for Network Motif Detection
- (2017) Yinghan Chen et al. JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS
- A Fast and Efficient Algorithm for Mining Top-k Nodes in Complex Networks
- (2017) Dong Liu et al. Scientific Reports
- Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method
- (2015) Guojie Song et al. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
- Influence maximization in complex networks through optimal percolation
- (2015) Flaviano Morone et al. NATURE
- Participant Selection for Offline Event Marketing Leveraging Location-Based Social Networks
- (2015) Zhiyong Yu et al. IEEE Transactions on Systems Man Cybernetics-Systems
- Social influence in group recommender systems
- (2014) Ingrid Alina Christensen et al. ONLINE INFORMATION REVIEW
- QuateXelero: An Accelerated Exact Network Motif Detection Algorithm
- (2013) Sahand Khakabimamaghani et al. PLoS One
- MODA: An efficient algorithm for network motif discovery in biological networks
- (2010) Saeed Omidi et al. GENES & GENETIC SYSTEMS
- Kavosh: a new algorithm for finding network motifs
- (2009) Zahra Kashani et al. BMC BIOINFORMATICS
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started