Recently, group recommendation becomes substantially significant when it frequently happens that a group of users need to determine which item (e.g. movie, music, restaurant, etc.) to choose. In this paper we employ t...Recently, group recommendation becomes substantially significant when it frequently happens that a group of users need to determine which item (e.g. movie, music, restaurant, etc.) to choose. In this paper we employ the information of friend network to propose a Community-Oriented Group Recommendation framework (CoGrec) consisting of non-negative matrix factorization based user profile generation, community detection based group identification, and overlapping community membership based group decision. Along with four inherent aggregation and allocation strategies, our proposed framework is evaluated through extensive experiments on real-world datasets. The experimental results show that the proposed framework is promising and more accurate when the given friend network is much denser, which is suitable for modern review and rating systems.展开更多
Local community detection aims to find a cluster of nodes by exploring a small region of the network.Local community detection methods are faster than traditional global community detection methods because their runti...Local community detection aims to find a cluster of nodes by exploring a small region of the network.Local community detection methods are faster than traditional global community detection methods because their runtime does not depend on the size of the entire network. However, most existing methods do not take the higher-order connectivity patterns crucial to the network into consideration. In this paper, we develop a new Local Community Detection method based on network Motif(LCD-Motif) which incorporates the higher-order network information. LCD-Motif adopts the local expansion of a seed set to identify the local community with minimal motif conductance, representing a generalization of the conductance metric for network motifs. In contrast to PageRanklike diffusion methods, LCD-Motif finds the community by seeking a sparse vector in the span of the local spectra,such that the seeds are in its support vector. We evaluate our approach using real-world datasets across various domains and synthetic networks. The experimental results show that LCD-Motif can achieve a higher performance than state-of-the-art methods.展开更多
基金This research is supported by the National Natural Science Foundation of China (No. 71231002).
文摘Recently, group recommendation becomes substantially significant when it frequently happens that a group of users need to determine which item (e.g. movie, music, restaurant, etc.) to choose. In this paper we employ the information of friend network to propose a Community-Oriented Group Recommendation framework (CoGrec) consisting of non-negative matrix factorization based user profile generation, community detection based group identification, and overlapping community membership based group decision. Along with four inherent aggregation and allocation strategies, our proposed framework is evaluated through extensive experiments on real-world datasets. The experimental results show that the proposed framework is promising and more accurate when the given friend network is much denser, which is suitable for modern review and rating systems.
基金supported by the National Social Science Foundation of China (No. 16ZDA055)
文摘Local community detection aims to find a cluster of nodes by exploring a small region of the network.Local community detection methods are faster than traditional global community detection methods because their runtime does not depend on the size of the entire network. However, most existing methods do not take the higher-order connectivity patterns crucial to the network into consideration. In this paper, we develop a new Local Community Detection method based on network Motif(LCD-Motif) which incorporates the higher-order network information. LCD-Motif adopts the local expansion of a seed set to identify the local community with minimal motif conductance, representing a generalization of the conductance metric for network motifs. In contrast to PageRanklike diffusion methods, LCD-Motif finds the community by seeking a sparse vector in the span of the local spectra,such that the seeds are in its support vector. We evaluate our approach using real-world datasets across various domains and synthetic networks. The experimental results show that LCD-Motif can achieve a higher performance than state-of-the-art methods.
