39,714 Hits in 4.3 sec

Finding Top-r Influential Communities under Aggregation Functions [article]

You Peng, Song Bian, Rui Li, Sibo Wang, Jeffrey Xu Yu
2022 arXiv   pre-print
We consider the problem of identifying the top-r influential communities with/without size constraints while using more complicated aggregation functions such as sum or avg.  ...  The objective of the influential community search problem is to locate the top-r communities with the highest influence values while satisfying the topology constraints.  ...  By examining the top-r k-influential community search problem under various aggregation functions, we claim that the problem could be solved in polynomial time under some different aggregation functions  ... 
arXiv:2207.01029v1 fatcat:zco7tvhiavdqdfyqifoflygiwu

Keyword Aware Influential Community Search in Large Attributed Graphs [article]

Md. Saiful Islam, Mohammed Eunus Ali, Yong-Bin Kang, Timos Sellis, Farhana M. Choudhury
2019 arXiv   pre-print
We introduce a novel keyword-aware influential community query KICQ that finds the most influential communities from an attributed graph, where an influential community is defined as a closely connected  ...  Finally, we propose two efficient algorithms for searching influential communities in large attributed graphs.  ...  STEP 3 : Given the augmented query and the influential score function, our focus is now to retrieve top-r most influential communities relevant to the query.  ... 
arXiv:1912.02114v1 fatcat:x34g3dcspng7rojxuh32hxk7im

Social Network Influencer Rank Recommender Using Diverse Features from Topical Graph

Divyani Mittal, Pooja Suthar, Madhuri Patil, P.G.S. Pranaya, Dipti P. Rana, Bharat Tidke
2020 Procedia Computer Science  
Aggregation Consensus Rank Algorithm (ACRA) that combines various selected Twitter metrics to generate top-k influencer list.  ...  Aggregation Consensus Rank Algorithm (ACRA) that combines various selected Twitter metrics to generate top-k influencer list.  ...  Consider � � of top-k ranked influential nodes list for � (€), An aggregation function ∀, is applied to aggregate € ( � , ⋯ ⋯ , � ) into single unique rank list as follows, = ∀ (€[ � ]) (7) ℎ .   ... 
doi:10.1016/j.procs.2020.03.205 fatcat:muih5szhffhxjnvbntcnpj33r4

Identifying the influential spreaders in multilayer interactions of online social networks

Mohammed Ali Al-Garadi, Kasturi Dewi Varathan, Sri Devi Ravana, Ejaz Ahmed, Victor Chang, Zhihan Lv
2016 Journal of Intelligent & Fuzzy Systems  
Users communications facilitated by OSNs could confront the temporal and spatial limitations of traditional communications in an exceptional way, thereby presenting new layers of social interactions, which  ...  In this paper, the effects of different topological network structure on influential spreaders identification are investigated.  ...  In order to find out the reason for the poor performances of ranking algorithms under different network representation, the topological characteristics of the studied real networks are explored.  ... 
doi:10.3233/jifs-169112 fatcat:gombogsyqjhgtbjx5reiujuxm4

Streaming Networks Sampling using top-K Networks

Rui Sarmento, Mário Cordeiro, João Gama
2015 Proceedings of the 17th International Conference on Enterprise Information Systems  
The combination of top-K network representation of the data stream with community detection is a novel approach to streaming networks sampling.  ...  Keeping an always up-to-date sample of the full network, the advantage of this method, compared to previous, is that it preserves larger communities and original network distribution.  ...  Acknowledgments This work was supported by Sibila and Smartgrids research projects (NORTE-07-0124-FEDER-000056/59), financed by North Portugal Regional Operational Programme (ON.2 O Novo Norte), under  ... 
doi:10.5220/0005341402280234 dblp:conf/iceis/SarmentoCG15 fatcat:2ecfi4esovggreumxlnyg6jvv4

A Competitive Model of Ranking Agencies

Chun Qiu, Qianfeng Tang
2013 Social Science Research Network  
In equilibrium, both ranking agencies will choose the top-bottom approach, i.e., ranking the top-ranked performer on the competing list at the bottom of its own list, to maximize the biggest ranking difference  ...  Each agency decides on the rankings to maximize the aggregate promotion devoted to its own list.  ...  We find that, in order to maximize the aggregate promotion for their lists, the two agencies adopt a top-bottom approach, namely, ranking the top-ranked performer on the competing list at the bottom of  ... 
doi:10.2139/ssrn.2292547 fatcat:qxsjweno4nhphof2lmg276kigu

Identifying the Influential Bloggers: A modular approach based on Sentiment Analysis

Umer Ishfaq, Hikmat Ullah Khan, Khalid Iqbal
2017 Journal of Web Engineering  
The results confirm that sentiment expressed in blog content plays an important role in measuring a blogger's influence and should be considered as a feature for finding the top influential bloggers in  ...  The bloggers who influence other users in a blogging community are known as the influential bloggers.  ...  With module integration, we aim to find active and influential bloggers in a blogging community.  ... 
dblp:journals/jwe/IshfaqKI17 fatcat:j3dfkpdbmbhwro5j6k2l4xfgcu

Towards Best Region Search for Data Exploration

Kaiyu Feng, Gao Cong, Sourav S. Bhowmick, Wen-Chih Peng, Chunyan Miao
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
Given a set O of spatial objects, a submodular monotone aggregate score function, and the size a × b of a query rectangle, the BRS problem aims to find a×b rectangular region such that the aggregate score  ...  We propose an efficient algorithm called SliceBRS to find the exact answer to the BRS problem.  ...  [New aggregate score function] We define the new aggregate score function fT as: fT : 2 T → R, which maps a subset of T to a real number such that for any Ti ⊆ T and Ti = {t1, . . . , tj} fT (Ti) = f (  ... 
doi:10.1145/2882903.2882960 dblp:conf/sigmod/FengCBPM16 fatcat:utzlq4aejbhe7c5z267ywt56a4

Discovering latent node Information by graph attention network

Weiwei Gu, Fei Gao, Xiaodan Lou, Jiang Zhang
2021 Scientific Reports  
GANR can identify the leading venture capital investors, discover highly cited papers and find the most influential nodes in Susceptible Infected Recovered Model.  ...  We find that the Attention Rank algorithm is not only able to find the most important nodes in VC and APS networks, but can also identify the most influential nodes during the disease spreading process  ...  An encoder encodes nodes to vector representations, F ′ ∈ R F ′ , a decoder then generates edge vectors by aggregating the vector representation of nodes.  ... 
doi:10.1038/s41598-021-85826-x pmid:33772048 fatcat:6p33zekhljd73awn62hjhhjyza

Evaluating geo-social influence in location-based social networks

Chao Zhang, Lidan Shou, Ke Chen, Gang Chen, Yijun Bei
2012 Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12  
We then adopt the sampling technique and the threshold algorithm to support efficient retrieval of top-K influential events.  ...  This metric combines a novel social proximity measure named penalized hitting time, with a geographical weight function modeled by power law distribution.  ...  the sampling and threshold techniques work effectively for discovering top-K influential events, with many interesting findings.  ... 
doi:10.1145/2396761.2398450 dblp:conf/cikm/ZhangS0CB12 fatcat:kay65rutujhkpm7pn3hfdanpzu

Supervised Rank Aggregation for Predicting Influence in Networks [article]

Karthik Subbian, Prem Melville
2011 arXiv   pre-print
Towards this end, we propose an approach to supervised rank aggregation, driven by techniques from Social Choice Theory.  ...  ., PageRank) are driven by intuitions based on an actors location in a network, asking for the "most influential" actors in itself is an ill-posed question, unless it is put in context with a specific  ...  Rank aggregation function ψ takes input orderings from r rankers and gives τ , which is an aggregated ranking order.  ... 
arXiv:1108.4801v1 fatcat:qhf4ewxudbb2no5cvpha7ulfca

Modeling and maximizing influence diffusion in social networks for viral marketing

Wenjun Wang, W. Nick Street
2018 Applied Network Science  
We propose a novel multiple-path asynchronous threshold (MAT) model, in which we quantify influence and track its diffusion and aggregation.  ...  One of the fundamental problems in viral marketing is to find a small set of initial adopters who can trigger the most further adoptions through word-of-mouth-based influence propagation in the network  ...  Top-K is just the first round in MC-Greedy finding the first seed. This process has to repeat K rounds to find the K-node seed set.  ... 
doi:10.1007/s41109-018-0062-7 pmid:30839789 pmcid:PMC6214284 fatcat:aofsl4brs5dwlhnfqdvu7mpque

GRACE: A Compressed Communication Framework for Distributed Machine Learning

Hang Xu, Chen-Yu Ho, Ahmed M. Abdelmoniem, Aritra Dutta, El Houcine Bergou, Konstantinos Karatsenidis, Marco Canini, Panos Kalnis
2021 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)  
In this paper, we present a comprehensive survey of the most influential compressed communication methods for DNN training, together with an intuitive classification (i.e., quantization, sparsification  ...  Distributed training increasingly becomes communication bound. For this reason, many lossy compression techniques have been proposed to reduce the volume of transferred data.  ...  We survey the most influential methods on gradient compression for distributed, data-parallel DNN training.  ... 
doi:10.1109/icdcs51616.2021.00060 fatcat:zui5zowikvgchnfqrsppn4u22y

Location Analytics for Location-Based Social Networks [article]

Muhammad Aamir Saleem
2018 PhD series, Technical Faculty of IT and Design, ˜Aalborg=ålborgœ University  
The top-k related aggregated queries such as finding top-k visitors and nearest locations are termed aggregate primitives.  ...  We study the computation time for finding top-k influential locations under both the with-friends and the without-friends influence models.  ...  a top-k set of influential locations.  ... 
doi:10.5278/ fatcat:wwovvw4mnjbe5fqno7xn4qqo4e

Consensus Opinion Model in Online Social Networks based on Influential Users

Amir Mohammadinejad, Reza Farahbakhsh, Noel Crespi
2019 IEEE Access  
In this paper, we investigate a consensus opinion model in social groups based on the impact of influential users and aggregation methods.  ...  Then, we proposed the opinion aggregation of the group induced by the weighted averaging operator and fuzzy techniques.  ...  : finding the influential users, propagating the opinions to reach the common opinion and aggregating the opinions.  ... 
doi:10.1109/access.2019.2894954 fatcat:n2wyzsxqjraxxlkeasa25mkbh4
« Previous Showing results 1 — 15 out of 39,714 results