标题
ProfitLeader: identifying leaders in networks with profit capacity
作者
关键词
Network mining, Critical node identification, Profit capacity
出版物
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
Volume -, Issue -, Pages -
出版商
Springer Nature
发表日期
2018-05-21
DOI
10.1007/s11280-018-0537-6
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- Clustering coefficients of large networks
- (2017) Yusheng Li et al. INFORMATION SCIENCES
- Ranking influential nodes in social networks based on node position and neighborhood
- (2017) Zhixiao Wang et al. NEUROCOMPUTING
- Identification of influential nodes in complex networks: Method from spreading probability viewpoint
- (2017) Zhong-Kui Bao et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Identifying important nodes by adaptive LeaderRank
- (2017) Shuang Xu et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Identifying Influential Nodes in Complex Networks Based on Weighted Formal Concept Analysis
- (2017) Zejun Sun et al. IEEE Access
- Optimized Graph Learning Using Partial Tags and Multiple Features for Image and Video Annotation
- (2016) Jingkuan Song et al. IEEE TRANSACTIONS ON IMAGE PROCESSING
- Deep and fast: Deep learning hashing with semi-supervised graph construction
- (2016) Jingkuan Song et al. IMAGE AND VISION COMPUTING
- Synchronization-based scalable subspace clustering of high-dimensional data
- (2016) Junming Shao et al. KNOWLEDGE AND INFORMATION SYSTEMS
- Identifying social influence in complex networks: A novel conductance eigenvector centrality model
- (2016) Xujun Li et al. NEUROCOMPUTING
- Identify influential spreaders in complex networks, the role of neighborhood
- (2016) Ying Liu et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Vital nodes identification in complex networks
- (2016) Linyuan Lü et al. PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS
- The H-index of a network node and its relation to degree and coreness
- (2016) Linyuan Lü et al. Nature Communications
- Scalable Clustering by Iterative Partitioning and Point Attractor Representation
- (2016) Junming Shao et al. ACM Transactions on Knowledge Discovery from Data
- A low complexity real-time Internet traffic flows neuro-fuzzy classifier
- (2015) Antonello Rizzi et al. Computer Networks
- A fast algorithm for finding most influential people based on the linear threshold model
- (2015) Khadije Rahimkhani et al. EXPERT SYSTEMS WITH APPLICATIONS
- The node importance in actual complex networks based on a multi-attribute ranking method
- (2015) Zhonghua Liu et al. KNOWLEDGE-BASED SYSTEMS
- Learning in high-dimensional multimedia data: the state of the art
- (2015) Lianli Gao et al. MULTIMEDIA SYSTEMS
- Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics
- (2015) Ying Liu et al. Scientific Reports
- K-core-based attack to the internet: Is it more malicious than degree-based attack?
- (2014) Jichang Zhao et al. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
- Social event identification and ranking on flickr
- (2014) Xuefei Li et al. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
- Information diffusion model in modular microblogging networks
- (2014) Xiaobing Xiong et al. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
- Nature of the Epidemic Threshold for the Susceptible-Infected-Susceptible Dynamics in Networks
- (2013) Marian Boguñá et al. PHYSICAL REVIEW LETTERS
- Identifying influential nodes in complex networks
- (2011) Duanbing Chen et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Identification of influential spreaders in complex networks
- (2010) Maksim Kitsak et al. Nature Physics
- The state of h index research. Is the h index the ideal way to measure research performance?
- (2008) Lutz Bornmann et al. EMBO REPORTS
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now