Dynamic circle recommendation: A probabilistic model

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a novel framework for dynamic circle recommendation for a query user at a given time point from historical communication logs. We identify the fundamental factors that govern interactions and aim to automatically form dynamic circle for scenarios, such as, who should I dial to in the early morning? whose mail would I reply first at midnight? We develop a time-sensitive probabilistic model (TCircleRank) that not only captures temporal tendencies between the query user and candidate friends but also blends frequency and recency into group formation. We also utilize the model to support two types of dynamic circle recommendation: Seedset Generation: single-interaction suggestion and Circle Suggestion: multiple interactions suggestion. We further present approaches to infer relevant time interval in determining circles for a query user at a given time. Experimental results on Enron dataset, Call Detail Records and Reality Mining Data prove the effectiveness of dynamic circle recommendation using TCircleRank. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Chou, F. K., Chiang, M. F., Chen, Y. C., & Peng, W. C. (2014). Dynamic circle recommendation: A probabilistic model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8444 LNAI, pp. 25–37). Springer Verlag. https://doi.org/10.1007/978-3-319-06605-9_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free