Cubic Analysis of Social Bookmarking for Personalized Recommendation
Y. Xu, L. Zhang, und W. Liu.
APWeb, Volume 3841 von Lecture Notes in Computer Science, Seite 733--738. Springer, (2006)

Personalized recommendation is used to conquer the information overload problem, and collaborative filtering recommendation (CF) is one of the most successful recommendation techniques to date. However, CF becomes less effective when users have multiple interests, because users have similar taste in one aspect may behave quite different in other aspects. Information got from social bookmarking websites not only tells what a user likes, but also why he or she likes it. This paper proposes a division algorithm and a CubeSVD algorithm to analysis this information, distill the interrelations between different usersâ various interests, and make better personalized recommendation based on them. Experiment reveals the superiority of our method over traditional CF methods. ER -

URL

http://dx.doi.org/10.1007/11610113_66

Suchen auf

Diese Publikation wurde noch nicht bewertet.

Bewertungsverteilung

Durchschnittliche Benutzerbewertung0,0 von 5.0 auf Grundlage von 0 Rezensionen

Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.

@inproceedings{yanfei2006cubic,
  abstract = {Personalized recommendation is used to conquer the information overload problem, and collaborative filtering recommendation (CF) is one of the most successful recommendation techniques to date. However, CF becomes less effective when users have multiple interests, because users have similar taste in one aspect may behave quite different in other aspects. Information got from social bookmarking websites not only tells what a user likes, but also why he or she likes it. This paper proposes a division algorithm and a CubeSVD algorithm to analysis this information, distill the interrelations between different usersâ various interests, and make better personalized recommendation based on them. Experiment reveals the superiority of our method over traditional CF methods.
ER  -},
  added-at = {2008-11-05T11:19:04.000+0100},
  author = {Xu, Yanfei and Zhang, Liang and Liu, Wei},
  biburl = {https://puma.uni-kassel.de/bibtex/298dd99b5f4189c8427163fd5a7568e1d/jaeschke},
  booktitle = {APWeb},
  editor = {Zhou, Xiaofang and Li, Jianzhong and Shen, Heng Tao and Kitsuregawa, Masaru and Zhang, Yanchun},
  ee = {http://dx.doi.org/10.1007/11610113_66},
  interhash = {edf999afa5a0ff81e53b0c859b466659},
  intrahash = {98dd99b5f4189c8427163fd5a7568e1d},
  isbn = {3-540-31142-4},
  journal = {Frontiers of WWW Research and Development - APWeb 2006},
  keywords = {folksonomy recommender tag},
  pages = {733--738},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2008-11-05T11:19:04.000+0100},
  title = {Cubic Analysis of Social Bookmarking for Personalized Recommendation},
  url = {http://dx.doi.org/10.1007/11610113_66},
  volume = 3841,
  year = 2006
}

%0 Conference Paper
%1 yanfei2006cubic
%A Xu, Yanfei
%A Zhang, Liang
%A Liu, Wei
%B APWeb
%D 2006
%E Zhou, Xiaofang
%E Li, Jianzhong
%E Shen, Heng Tao
%E Kitsuregawa, Masaru
%E Zhang, Yanchun
%I Springer
%J Frontiers of WWW Research and Development - APWeb 2006
%K folksonomy recommender tag
%P 733--738
%T Cubic Analysis of Social Bookmarking for Personalized Recommendation
%U http://dx.doi.org/10.1007/11610113_66
%V 3841
%X Personalized recommendation is used to conquer the information overload problem, and collaborative filtering recommendation (CF) is one of the most successful recommendation techniques to date. However, CF becomes less effective when users have multiple interests, because users have similar taste in one aspect may behave quite different in other aspects. Information got from social bookmarking websites not only tells what a user likes, but also why he or she likes it. This paper proposes a division algorithm and a CubeSVD algorithm to analysis this information, distill the interrelations between different usersâ various interests, and make better personalized recommendation based on them. Experiment reveals the superiority of our method over traditional CF methods.
ER  -
%@ 3-540-31142-4

PUMA

Cubic Analysis of Social Bookmarking for Personalized Recommendation
Y. Xu, L. Zhang, und W. Liu.
APWeb, Volume 3841 von Lecture Notes in Computer Science, Seite 733--738. Springer, (2006)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

PUMA

Cubic Analysis of Social Bookmarking for Personalized RecommendationY. Xu, L. Zhang, und W. Liu. APWeb, Volume 3841 von Lecture Notes in Computer Science, Seite 733--738. Springer, (2006)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

Cubic Analysis of Social Bookmarking for Personalized Recommendation
Y. Xu, L. Zhang, und W. Liu.
APWeb, Volume 3841 von Lecture Notes in Computer Science, Seite 733--738. Springer, (2006)