{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T17:20:08Z","timestamp":1792171208396,"version":"4.4.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T00:00:00Z","timestamp":1246233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,29]]},"DOI":"10.1145\/1557914.1557959","type":"proceedings-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:54Z","timestamp":1246367454000},"page":"261-270","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Social recommender systems for web 2.0 folksonomies"],"prefix":"10.1145","author":[{"given":"Stefan","family":"Siersdorfer","sequence":"first","affiliation":[{"name":"University of Hannover, Hannover, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergej","family":"Sizov","sequence":"additional","affiliation":[{"name":"University of Koblenz, Koblenz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021240730564"},{"issue":"1","key":"e_1_3_2_1_5_1","first-page":"641","article-title":"Pranking with ranking","volume":"14","author":"Crammer K.","year":"2002","unstructured":"K. Crammer and Y. Singer . Pranking with ranking . Advances in Neural Information Processing Systems , 14 ( 1 ): 641 -- 647 , 2002 . K. Crammer and Y. Singer. Pranking with ranking. Advances in Neural Information Processing Systems, 14(1):641--647, 2002.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135810"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/32206.32212"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/550737"},{"issue":"4","key":"e_1_3_2_1_10_1","article-title":"Social Bookmarking Tools (I)","volume":"11","author":"Hammond T.","year":"2005","unstructured":"T. Hammond , T. Hannay , B. Lund , and J. Scott . Social Bookmarking Tools (I) : A General Review. D-Lib Magazine , 11 ( 4 ), April 2005 . T. Hammond, T. Hannay, B. Lund, and J. Scott. Social Bookmarking Tools (I): A General Review. D-Lib Magazine, 11(4), April 2005.","journal-title":"A General Review. D-Lib Magazine"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11762256_31"},{"key":"e_1_3_2_1_14_1","volume-title":"Data Stream Management: Processing High-Speed Data Streams","author":"Kleinberg J.","year":"2006","unstructured":"J. Kleinberg . Temporal dynamics of on-line information streams. In M. Garofalakis, J. Gehrke, and R. Rastogi, editors, Data Stream Management: Processing High-Speed Data Streams . Springer , 2006 . J. Kleinberg. Temporal dynamics of on-line information streams. In M. Garofalakis, J. Gehrke, and R. Rastogi, editors, Data Stream Management: Processing High-Speed Data Streams. Springer, 2006."},{"key":"e_1_3_2_1_16_1","volume-title":"Dec.","author":"Lambiotte R.","year":"2005","unstructured":"R. Lambiotte and M. Ausloos . Collaborative tagging as a tripartite network. ArXiv Computer Science e-prints , Dec. 2005 . R. Lambiotte and M. Ausloos. Collaborative tagging as a tripartite network. ArXiv Computer Science e-prints, Dec. 2005."},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","volume-title":"Conceptual Structures: Applications, Implementation and Theory","author":"Lehmann F.","year":"1995","unstructured":"F. Lehmann and R. Wille . A triadic approach to formal concept analysis . In Conceptual Structures: Applications, Implementation and Theory , volume 954 of Lecture Notes in Computer Science . Springer , 1995 . F. Lehmann and R. Wille. A triadic approach to formal concept analysis. In Conceptual Structures: Applications, Implementation and Theory, volume 954 of Lecture Notes in Computer Science. Springer, 1995."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1045\/april2005-lund"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963773"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11574620_38"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_3_2_1_22_1","first-page":"61","volume-title":"Workshop on Machine Learning for Information Filtering, IJCAI'99","author":"Nigam K.","year":"1999","unstructured":"K. Nigam , J. Lafferty , and A. McCallum . Using maximum entropy for text classification . Workshop on Machine Learning for Information Filtering, IJCAI'99 , pages 61 -- 67 , 1999 . K. Nigam, J. Lafferty, and A. McCallum. Using maximum entropy for text classification. Workshop on Machine Learning for Information Filtering, IJCAI'99, pages 61--67, 1999."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076357"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337035"},{"key":"e_1_3_2_1_25_1","first-page":"261","volume-title":"Mining Association Rules in Folksonomies","author":"Schmitz C.","year":"2006","unstructured":"C. Schmitz , A. Hotho , R. Jaeschke , and G. Stumme . Mining Association Rules in Folksonomies . pages 261 -- 270 , 2006 . C. Schmitz, A. Hotho, R. Jaeschke, and G. Stumme. Mining Association Rules in Folksonomies. pages 261--270, 2006."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32262-7_22"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150445"},{"key":"e_1_3_2_1_29_1","volume-title":"Statistical Learning Theory","author":"Vapnik V.","year":"1998","unstructured":"V. Vapnik . Statistical Learning Theory . Wiley , New York , 1998 . V. Vapnik. Statistical Learning Theory. Wiley, New York, 1998."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-7798-3_15"}],"event":{"name":"HT '09: 20th ACM Conference on Hypertext and Hypermedia","location":"Torino Italy","acronym":"HT '09","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 20th ACM conference on Hypertext and hypermedia"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557914.1557959","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557914.1557959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:37Z","timestamp":1750253917000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557914.1557959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,29]]},"references-count":28,"alternative-id":["10.1145\/1557914.1557959","10.1145\/1557914"],"URL":"https:\/\/doi.org\/10.1145\/1557914.1557959","relation":{},"subject":[],"published":{"date-parts":[[2009,6,29]]},"assertion":[{"value":"2009-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}