Loading...
Search for: network-topological-structure
0.006 seconds

    Centrality-based group formation in group recommender systems

    , Article 26th International World Wide Web Conference, WWW 2017 Companion, 3 April 2017 through 7 April 2017 ; 2019 , Pages 1187-1196 ; 9781450349147 (ISBN) Mahyar, H ; Khalili, S ; Elahe Ghalebi, K ; Grosu, R ; Mojde Morshedi, S ; Movaghar, A ; Sharif University of Technology
    International World Wide Web Conferences Steering Committee  2019
    Abstract
    Recommender Systems have become an attractive field within the recent decade because they facilitate users' selection process within limited time. Conventional recommender systems have proposed numerous methods focusing on recommendations to individual users. Recently, due to a significant increase in the number of users, studies in this field have shifted to properly identify groups of people with similar preferences and provide a list of recommendations for each group. Offering a recommendations list to each individual requires significant computational cost and it is therefore often not efficient. So far, most of the studies impose four restrictive assumptions: (1) limited number of... 

    Detection of top-K central nodes in social networks: A compressive sensing approach

    , Article Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, 25 August 2015 through 28 August 2015 ; 2015 , Pages 902-909 ; 9781450338547 (ISBN) Mahyar, H ; Pei, J ; Tang, J ; Silvestri, F ; Sharif University of Technology
    Association for Computing Machinery, Inc  2015
    Abstract
    In analysing the structural organization of a social network, identifying important nodes has been a fundamental problem. The concept of network centrality deals with the assessment of the relative importance of a particular node within the network. Most of the traditional network centrality definitions have a high computational cost and require full knowledge of network topological structure. On the one hand, in many applications we are only interested in detecting the top-k central nodes of the network with the largest values considering a specific centrality metric. On the other hand, it is not feasible to efficiently identify central nodes in a large real-world social network via... 

    HellRank: a hellinger-based centrality measure for bipartite social networks

    , Article Social Network Analysis and Mining ; Volume 7, Issue 22 , 2017 ; 18695450 (ISSN) Taheri, S. M ; Mahyar, H ; Firouzi, M ; Ghalebi, E ; Grosu, R ; Movaghar, A ; Sharif University of Technology
    Abstract
    Measuring centrality in a social network, especially in bipartite mode, poses many challenges, for example, the requirement of full knowledge of the network topology, and the lack of properly detecting top-kbehavioral representative users. To overcome the above mentioned challenges, we propose HellRank, an accurate centrality measure for identifying central nodes in bipartite social networks. HellRank is based on the Hellinger distance between two nodes on the same side of a bipartite network. We theoretically analyze the impact of this distance on a bipartite network and find upper and lower bounds for it. The computation of the HellRank centrality measure can be distributed, by letting...