Sciweavers

147 search results - page 7 / 30
» Discovering Spammers in Social Networks
Sort
View
EPIA
2009
Springer
16 years 17 days ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
ICDM
2007
IEEE
153views Data Mining» more  ICDM 2007»
16 years 9 days ago
HSN-PAM: Finding Hierarchical Probabilistic Groups from Large-Scale Networks
Real-world social networks are often hierarchical, reflecting the fact that some communities are composed of a few smaller, sub-communities. This paper describes a hierarchical B...
Haizheng Zhang, Wei Li, Xuerui Wang, C. Lee Giles,...
ICDE
2009
IEEE
188views Database» more  ICDE 2009»
16 years 7 months ago
GuruMine: A Pattern Mining System for Discovering Leaders and Tribes
In this demo we introduce GuruMine, a pattern mining system for the discovery of leaders, i.e., influential users in social networks, and their tribes, i.e., a set of users usually...
Amit Goyal 0002, Byung-Won On, Francesco Bonchi, L...
CSE
2009
IEEE
16 years 23 days ago
Inferring the Maximum Likelihood Hierarchy in Social Networks
—Individuals in social networks are often organized under some hierarchy such as a command structure. In many cases, when this structure is unknown, there is a need to discover h...
Arun S. Maiya, Tanya Y. Berger-Wolf
SAC
2011
ACM
14 years 8 months ago
Towards discovering criminal communities from textual data
In many criminal cases, forensically collected data contain valuable information about a suspect’s social networks. An investigator often has to manually extract information fro...
Rabeah Al-Zaidy, Benjamin C. M. Fung, Amr M. Youss...