A Community Discovery and TrustRank based Approach for Spammer Ranking

Author(s):  
Yuejun Li ◽  
Shuwu Zhang
Keyword(s):  
2009 ◽  
Vol 20 (8) ◽  
pp. 2241-2254 ◽  
Author(s):  
Wen-Yan GAN ◽  
Nan HE ◽  
De-Yi LI ◽  
Jian-Min WANG

2020 ◽  
pp. 114536
Author(s):  
Weimin Li ◽  
Heng Zhu ◽  
Shaohua Li ◽  
Hao Wang ◽  
Hongning Dai ◽  
...  

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Ruiling Zhang ◽  
Shengwu Xiong

Leveraging network virtualization technologies, the community-based video systems rely on the measurement of common interests to define and steady relationship between community members, which promotes video sharing performance and improves scalability community structure. In this paper, we propose a novel mobile Video Community discovery scheme using ontology-based semantical interest capture (VCOSI). An ontology-based semantical extension approach is proposed, which describes video content and measures video similarity according to video key word selection methods. In order to reduce the calculation load of video similarity, VCOSI designs a prefix-filtering-based estimation algorithm to decrease energy consumption of mobile nodes. VCOSI further proposes a member relationship estimate method to construct scalable and resilient node communities, which promotes video sharing capacity of video systems with the flexible and economic community maintenance. Extensive tests show how VCOSI obtains better performance results in comparison with other state-of-the-art solutions.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jibing Wu ◽  
Lianfei Yu ◽  
Qun Zhang ◽  
Peiteng Shi ◽  
Lihua Liu ◽  
...  

The heterogeneous information networks are omnipresent in real-world applications, which consist of multiple types of objects with various rich semantic meaningful links among them. Community discovery is an effective method to extract the hidden structures in networks. Usually, heterogeneous information networks are time-evolving, whose objects and links are dynamic and varying gradually. In such time-evolving heterogeneous information networks, community discovery is a challenging topic and quite more difficult than that in traditional static homogeneous information networks. In contrast to communities in traditional approaches, which only contain one type of objects and links, communities in heterogeneous information networks contain multiple types of dynamic objects and links. Recently, some studies focus on dynamic heterogeneous information networks and achieve some satisfactory results. However, they assume that heterogeneous information networks usually follow some simple schemas, such as bityped network and star network schema. In this paper, we propose a multityped community discovery method for time-evolving heterogeneous information networks with general network schemas. A tensor decomposition framework, which integrates tensor CP factorization with a temporal evolution regularization term, is designed to model the multityped communities and address their evolution. Experimental results on both synthetic and real-world datasets demonstrate the efficiency of our framework.


2011 ◽  
Vol 267 ◽  
pp. 247-252
Author(s):  
Rui Xin Ma ◽  
Gui Shi Deng ◽  
Xiao Wang

SNS provides us with a brand new platform to communicate, interact and share. To better suit the need of scholars to get more authoritative and more satisfactory information about academic research, we construct a SNS scientific paper management platform. In this platform, scholars are divided into different virtual communities accord to their research field and their collaborative relationship with others. Ideas in CF are applied in the procedure of community division which helps us to find the accurate relation structures. At the end of this paper, we use compare the running results of normal platform and SNS to illustrate how useful it is.


Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 18
Author(s):  
Yan Li ◽  
Jing He ◽  
Youxi Wu ◽  
Rongjie Lv

The real world can be characterized as a complex network sto in symmetric matrix. Community discovery (or community detection) can effectively reveal the common features of network groups. The communities are overlapping since, in fact, one thing often belongs to multiple categories. Hence, overlapping community discovery has become a new research hotspot. Since the results of the existing community discovery algorithms are not robust enough, this paper proposes an effective algorithm, named Two Expansions of Seeds (TES). TES adopts the topological feature of network nodes to find the local maximum nodes as the seeds which are based on the gravitational degree, which makes the community discovery robust. Then, the seeds are expanded by the greedy strategy based on the fitness function, and the community cleaning strategy is employed to avoid the nodes with negative fitness so as to improve the accuracy of community discovery. After that, the gravitational degree is used to expand the communities for the second time. Thus, all nodes in the network belong to at least one community. Finally, we calculate the distance between the communities and merge similar communities to obtain a less- undant community structure. Experimental results demonstrate that our algorithm outperforms other state-of-the-art algorithms.


Sign in / Sign up

Export Citation Format

Share Document