抄録
We propose an algorithm to predict users' future bookmarking using social bookmarking data. It is a problem that primitive collaborative filtering cannot exactly catch users' preferences in social bookmarkings containing enormous items (URLs) because in many cases user's adoption data is sparse. There can be various influences on bookmarking such as effects from the environment and changes in user preference. We use temporal sequence among the bookmarking-users to represent word-of-mouth and among the bookmarked-URLs to represent user's interest, and model each sequential order as a continuous-time Markov chain. This idea comes from diffusion of innovation theory. A transition probability from a state (user/URL) to another state is defined by the transition rate calculated from the time taken for the transition. We predicted user's preferences through a combination of estimating the most likely transition between users using URLs as input and between URLs using users as input. We conducted evaluation experiments with a social bookmarking service in Japan called Hatena bookmark. The proposed algorithm predicts users' preferences with higher accuracy than collaborative filtering or simple transition models based on either user or URL.
本文言語 | English |
---|---|
ホスト出版物のタイトル | Proceedings of the ACM Symposium on Applied Computing |
ページ | 1741-1747 |
ページ数 | 7 |
DOI | |
出版ステータス | Published - 2010 |
外部発表 | はい |
イベント | 25th Annual ACM Symposium on Applied Computing, SAC 2010 - Sierre 継続期間: 2010 3月 22 → 2010 3月 26 |
Other
Other | 25th Annual ACM Symposium on Applied Computing, SAC 2010 |
---|---|
City | Sierre |
Period | 10/3/22 → 10/3/26 |
ASJC Scopus subject areas
- ソフトウェア