TY - GEN
T1 - Latent interest-group discovery and management by peer-to-peer online social networks
AU - He, Jianping
AU - Miller, David J.
AU - Kesidis, George
PY - 2013
Y1 - 2013
N2 - We address management of latent, emerging interest groups (IGs), spanning both unsupervised, distributed IG discovery and anycast-query forwarding, in dynamic peer-to-peer (P2P) on-line social networks. The P2P network has at least one layer of super-peers (Diaspora pods) that support a group of ordinary peers/clients. There are a number of challenges here, including: i) semantic processing at scale to disambiguate word meanings in queries; ii) unsupervised estimation of the number of active IGs; iii) detection of IG churn and emergent IGs; iv) design of optimal query forwarding to maximize query resolution and minimize the required number of hops, while achieving practical local cache searching and network communications. In this preliminary study, we assume a common, fixed keyword lexicon for query formation and latent IG characterization. We propose unsupervised, dynamic, on-line clustering that mines the super-peers' query caches in a distributed fashion. Customized Bayesian Information Criterion based model-order selection is employed, independently by each super-peer, to estimate the set of active IGs and to help achieve efficient query forwarding. The proposed method is numerically evaluated against both exhaustive cache search and a random walk strategy.
AB - We address management of latent, emerging interest groups (IGs), spanning both unsupervised, distributed IG discovery and anycast-query forwarding, in dynamic peer-to-peer (P2P) on-line social networks. The P2P network has at least one layer of super-peers (Diaspora pods) that support a group of ordinary peers/clients. There are a number of challenges here, including: i) semantic processing at scale to disambiguate word meanings in queries; ii) unsupervised estimation of the number of active IGs; iii) detection of IG churn and emergent IGs; iv) design of optimal query forwarding to maximize query resolution and minimize the required number of hops, while achieving practical local cache searching and network communications. In this preliminary study, we assume a common, fixed keyword lexicon for query formation and latent IG characterization. We propose unsupervised, dynamic, on-line clustering that mines the super-peers' query caches in a distributed fashion. Customized Bayesian Information Criterion based model-order selection is employed, independently by each super-peer, to estimate the set of active IGs and to help achieve efficient query forwarding. The proposed method is numerically evaluated against both exhaustive cache search and a random walk strategy.
UR - http://www.scopus.com/inward/record.url?scp=84893602457&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893602457&partnerID=8YFLogxK
U2 - 10.1109/SocialCom.2013.31
DO - 10.1109/SocialCom.2013.31
M3 - Conference contribution
AN - SCOPUS:84893602457
SN - 9780769551371
T3 - Proceedings - SocialCom/PASSAT/BigData/EconCom/BioMedCom 2013
SP - 162
EP - 167
BT - Proceedings - SocialCom/PASSAT/BigData/EconCom/BioMedCom 2013
T2 - 2013 ASE/IEEE Int. Conf. on Social Computing, SocialCom 2013, the 2013 ASE/IEEE Int. Conf. on Big Data, BigData 2013, the 2013 Int. Conf. on Economic Computing, EconCom 2013, the 2013 PASSAT 2013, and the 2013 ASE/IEEE Int. Conf. on BioMedCom 2013
Y2 - 8 September 2013 through 14 September 2013
ER -