Online communities have recently become a popular tool for publishing and searching content, as well as for finding and connecting to other users that share common interests. The content is typically user-generated and includes, for example, personal blogs, bookmarks, and digital photos. A particularly intriguing type of content is user-generated annotations (tags) for content items, as these concise string descriptions allow for reasonings about the interests of the user who created the content, but also about the user who generated the annotations. This paper presents a framework to cast the different entities of such networks into a unified graph model representing the mutual relationships of users, content, and tags. It derives scoring functions for each of the entities and relations. We have performed an experimental evaluation on two real-world datasets (crawled from deli.cio.us and Flickr) where manual user assessments of the query result quality show that our unified graph framework delivers high-quality results on social networks.
%0 Conference Paper
%1 citeulike:5435677
%A Bender, Matthias
%A Crecelius, Tom
%A Kacimi, Mouna
%A Michel, Sebastian
%A Neumann, Thomas
%A Parreira, Josiane X.
%A Schenkel, Ralf
%A Weikum, Gerhard
%B Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on
%D 2008
%I IEEE
%J Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on
%K query-expansion ranking social-network social-search
%P 501--506
%R 10.1109/icdew.2008.4498369
%T Exploiting social relations for query expansion and result ranking
%U http://dx.doi.org/10.1109/icdew.2008.4498369
%X Online communities have recently become a popular tool for publishing and searching content, as well as for finding and connecting to other users that share common interests. The content is typically user-generated and includes, for example, personal blogs, bookmarks, and digital photos. A particularly intriguing type of content is user-generated annotations (tags) for content items, as these concise string descriptions allow for reasonings about the interests of the user who created the content, but also about the user who generated the annotations. This paper presents a framework to cast the different entities of such networks into a unified graph model representing the mutual relationships of users, content, and tags. It derives scoring functions for each of the entities and relations. We have performed an experimental evaluation on two real-world datasets (crawled from deli.cio.us and Flickr) where manual user assessments of the query result quality show that our unified graph framework delivers high-quality results on social networks.
%@ 978-1-4244-2161-9
@inproceedings{citeulike:5435677,
abstract = {{Online communities have recently become a popular tool for publishing and searching content, as well as for finding and connecting to other users that share common interests. The content is typically user-generated and includes, for example, personal blogs, bookmarks, and digital photos. A particularly intriguing type of content is user-generated annotations (tags) for content items, as these concise string descriptions allow for reasonings about the interests of the user who created the content, but also about the user who generated the annotations. This paper presents a framework to cast the different entities of such networks into a unified graph model representing the mutual relationships of users, content, and tags. It derives scoring functions for each of the entities and relations. We have performed an experimental evaluation on two real-world datasets (crawled from deli.cio.us and Flickr) where manual user assessments of the query result quality show that our unified graph framework delivers high-quality results on social networks.}},
added-at = {2018-03-19T12:24:51.000+0100},
author = {Bender, Matthias and Crecelius, Tom and Kacimi, Mouna and Michel, Sebastian and Neumann, Thomas and Parreira, Josiane X. and Schenkel, Ralf and Weikum, Gerhard},
biburl = {https://www.bibsonomy.org/bibtex/2f9464b33bdb2d049eada69a5e7ccf548/aho},
booktitle = {Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on},
citeulike-article-id = {5435677},
citeulike-linkout-0 = {http://dx.doi.org/10.1109/icdew.2008.4498369},
citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4498369},
doi = {10.1109/icdew.2008.4498369},
institution = {Max-Planck Institute for Informatics, Saarbr\&\#252;cken, Germany},
interhash = {1b38900e233febb35ed82fbe205b763d},
intrahash = {f9464b33bdb2d049eada69a5e7ccf548},
isbn = {978-1-4244-2161-9},
journal = {Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on},
keywords = {query-expansion ranking social-network social-search},
month = apr,
pages = {501--506},
posted-at = {2016-08-05 22:41:25},
priority = {2},
publisher = {IEEE},
timestamp = {2018-03-19T12:24:51.000+0100},
title = {{Exploiting social relations for query expansion and result ranking}},
url = {http://dx.doi.org/10.1109/icdew.2008.4498369},
year = 2008
}