Sciweavers

227 search results - page 45 / 46
» Data and Structural k-Anonymity in Social Networks
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
13 years 10 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
INFOCOM
2007
IEEE
13 years 11 months ago
Analysis of the Reliability of a Nationwide Short Message Service
—SMS has been arguably the most popular wireless data service for cellular networks. Due to its ubiquitous availability and universal support by mobile handsets and cellular carr...
Xiaoqiao Meng, Petros Zerfos, Vidyut Samanta, Star...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 5 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
WSDM
2012
ACM
290views Data Mining» more  WSDM 2012»
12 years 26 days ago
Online selection of diverse results
The phenomenal growth in the volume of easily accessible information via various web-based services has made it essential for service providers to provide users with personalized ...
Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwa...
WWW
2009
ACM
14 years 6 months ago
Collaborative filtering for orkut communities: discovery of user latent behavior
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...
WenYen Chen, Jon-Chyuan Chu, Junyi Luan, Hongjie B...