Web search engines have changed our lives - enabling instant access to information about subjects that are both deeply important to us, as well as passing whims. The search engines that provide answers to our search queries also log those queries, in order to improve their algorithms. Academic research on search queries has shown that they can provide valuable information on diverse topics including word and phrase similarity, topical seasonality and may even have potential for sociology, as well as providing a barometer of the popularity of many subjects. At the same time, individuals are rightly concerned about what the consequences of accidental leaking or deliberate sharing of this information may mean for their privacy. In this talk I will cover the applications which have benefited from mining query logs, the risks that privacy can be breached by sharing query logs, and current algorithms for mining logs in a way to prevent privacy breaches.
mendation service which can be called via HTTP by BibSonomy's recommender when a user posts a bookmark or publication. All participating recommenders are called on each posting process, one of them is choosen to actually deliver the results to the user. We can then measure
R. Jäschke, F. Eisterlehner, A. Hotho, and G. Stumme. RecSys '09: Proceedings of the third ACM Conference on Recommender Systems, page 369--372. New York, NY, USA, ACM, (2009)
M. Atzmueller, F. Lemmerich, B. Krause, and A. Hotho. Proc. LeGo-09: From Local Patterns to Global Models, Workshop at the 2009 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, (2009)accepted.
D. Benz, B. Krause, G. Kumar, A. Hotho, and G. Stumme. Proceedings of the 1st Workshop on Explorative Analytics of Information Networks (EIN2009), Bled, Slovenia, (September 2009)
D. Benz, B. Krause, G. Kumar, A. Hotho, and G. Stumme. Proceedings of the 1st Workshop on Explorative Analytics of Information Networks (EIN2009), Bled, Slovenia, (September 2009)