4820 search results - page 46 / 964 » Clustering Social Networks |
122
click to vote
PERCOM
2010
ACM
15 years 2 months ago
2010
ACM
—Traditional approaches to K-anonymity provide privacy guarantees over publicly released data sets with specified quasi-identifiers. However, the most common public releases of...
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of automatically identifying“hotspots” on the real-time web. Concretely, we propose to identify highly-dynamic ad-hoc collections of users – what we ref...
152
Voted
EDBT
2012
ACM
13 years 6 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
113
click to vote
ITNG
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a multimodal social networking system aimed at sharing geographic information among proximate users. The system provides users with a traditional web-based int...
137
click to vote
CHI
2010
ACM
15 years 10 months ago
2010
ACM
Previous research has shown a relationship between use of social networking sites and feelings of social capital. However, most studies have relied on self-reports by college stud...