TY - GEN
T1 - GDC
T2 - 2nd IEEE International Conference on Social Computing, SocialCom 2010, 2nd IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2010
AU - Mardenfeld, Steve
AU - Boston, Daniel
AU - Pan, Susan Juan
AU - Jones, Quentin
AU - Iamntichi, Adriana
AU - Borcea, Cristian
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2010
Y1 - 2010
N2 - Smart phones can collect and share Bluetooth co-location traces to identify ad hoc or semi-permanent social groups. This information, known to group members but otherwise unavailable, can be leveraged in applications and protocols, such as recommender systems or delay-tolerant forwarding in ad hoc networks, to enhance the user experience. Group discovery using Bluetooth co-location is practical because: (i) Bluetooth is embedded in nearly every phone and has low battery consumption, (ii) the short wireless transmission range can lead to good group identification accuracy, and (iii) privacy-conscious users are more likely to share co-location data than absolute location data. This paper proposes the Group Discovery using Co-location traces (GDC) algorithm, which leverages user meeting frequency and duration to accurately detect groups. GDC is validated on one month of data collected from 141 smart phones carried by students on our campus. Users rated GDC's groups 30% better than groups discovered using the K-Clique algorithm. Additionally, GDC lends itself more easily to a distributed implementation, which achieves similar results with the centralized version while improving user's privacy.
AB - Smart phones can collect and share Bluetooth co-location traces to identify ad hoc or semi-permanent social groups. This information, known to group members but otherwise unavailable, can be leveraged in applications and protocols, such as recommender systems or delay-tolerant forwarding in ad hoc networks, to enhance the user experience. Group discovery using Bluetooth co-location is practical because: (i) Bluetooth is embedded in nearly every phone and has low battery consumption, (ii) the short wireless transmission range can lead to good group identification accuracy, and (iii) privacy-conscious users are more likely to share co-location data than absolute location data. This paper proposes the Group Discovery using Co-location traces (GDC) algorithm, which leverages user meeting frequency and duration to accurately detect groups. GDC is validated on one month of data collected from 141 smart phones carried by students on our campus. Users rated GDC's groups 30% better than groups discovered using the K-Clique algorithm. Additionally, GDC lends itself more easily to a distributed implementation, which achieves similar results with the centralized version while improving user's privacy.
KW - Colocation traces
KW - Group discovery
KW - Mobile social computing
KW - Smart phones
UR - http://www.scopus.com/inward/record.url?scp=78649246127&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78649246127&partnerID=8YFLogxK
U2 - 10.1109/SocialCom.2010.99
DO - 10.1109/SocialCom.2010.99
M3 - Conference contribution
AN - SCOPUS:78649246127
SN - 9780769542119
T3 - Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust
SP - 641
EP - 648
BT - Proceedings - SocialCom 2010
Y2 - 20 August 2010 through 22 August 2010
ER -