Sciweavers

274 search results - page 38 / 55
» Identifying sets of key players in a social network
Sort
View
SIGMOD
2011
ACM
270views Database» more  SIGMOD 2011»
12 years 10 months ago
Automatic discovery of attributes in relational databases
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
Meihui Zhang, Marios Hadjieleftheriou, Beng Chin O...
IEAAIE
2010
Springer
13 years 5 months ago
Strategies for Incorporating Knowledge Defects and Path Length in Trust Aggregation
The ability for a user to accurately estimate the amount of trust to be placed in a peer user is gaining more and more attention in social network applications. Trust aggregation p...
Nele Verbiest, Chris Cornelis, Patricia Victor, En...
WWW
2008
ACM
14 years 8 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
ACSAC
2004
IEEE
13 years 11 months ago
Alert Correlation through Triggering Events and Common Resources
Complementary security systems are widely deployed in networks to protect digital assets. Alert correlation is essential to understanding the security threats and taking appropria...
Dingbang Xu, Peng Ning
WWW
2010
ACM
14 years 2 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney