@proceedings{doerfel2014discovery, editor = {Doerfel, Stephan and Hotho, Andreas and Jäschke, Robert and Mitzlaff, Folke and Mueller, Juergen}, interhash = {8bd54825049be406247b91fe1721a322}, intrahash = {ec51992c492a2b4bf96d8e5719645639}, publisher = {CEUR-WS}, title = {ECML PKDD Discovery Challenge - Recommending Given Names}, url = {http://ceur-ws.org/Vol-1120/}, volume = 1120, year = 2014 } @inproceedings{mitzlaff2014summary, abstract = {The 15th ECML PKDD Discovery Challenge centered around the recommendation of given names. Participants of the challenge implemented algorithms that were tested both offline - on data collected by the name search engine Nameling - and online within Nameling. Here, we describe both tasks in detail and discuss the publicly available datasets. We motivate and explain the chosen evaluation of the challenge, and we summarize the different approaches applied to the name recommendation tasks. Finally, we present the rankings and winners of the offline and the online phase.}, address = {Aachen, Germany}, author = {Mitzlaff, Folke and Doerfel, Stephan and Hotho, Andreas and Jäschke, Robert and Mueller, Juergen}, booktitle = {15th Discovery Challenge of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2013, Prague, Czech Republic - Sctober 27, 2013. Proceedings}, interhash = {6945009ac2fd770a84c47f2a0e192802}, intrahash = {e279965dffa803ee660e4026fe48340a}, issn = {1613-0073}, pages = {7--24}, publisher = {CEUR-WS}, title = {Summary of the 15th Discovery Challenge: Recommending Given Names}, url = {http://ceur-ws.org/Vol-1120/}, volume = 1120, year = 2014 } @article{mitzlaff2012relatedness, author = {Mitzlaff, Folke and Stumme, G}, interhash = {31f7605431c35592afa50e7a377ce999}, intrahash = {072c87ef744216d0245f28c5f29ce851}, journal = {Human Journal}, number = 4, pages = {205--217}, title = {Relatedness of given names}, volume = 1, year = 2012 } @misc{mitzlaff2013recommending, abstract = {All over the world, future parents are facing the task of finding a suitable given name for their child. This choice is influenced by different factors, such as the social context, language, cultural background and especially personal taste. Although this task is omnipresent, little research has been conducted on the analysis and application of interrelations among given names from a data mining perspective. The present work tackles the problem of recommending given names, by firstly mining for inter-name relatedness in data from the Social Web. Based on these results, the name search engine "Nameling" was built, which attracted more than 35,000 users within less than six months, underpinning the relevance of the underlying recommendation task. The accruing usage data is then used for evaluating different state-of-the-art recommendation systems, as well our new \NR algorithm which we adopted from our previous work on folksonomies and which yields the best results, considering the trade-off between prediction accuracy and runtime performance as well as its ability to generate personalized recommendations. We also show, how the gathered inter-name relationships can be used for meaningful result diversification of PageRank-based recommendation systems. As all of the considered usage data is made publicly available, the present work establishes baseline results, encouraging other researchers to implement advanced recommendation systems for given names.}, author = {Mitzlaff, Folke and Stumme, Gerd}, interhash = {545658b6e337858f7865b51e46d1c7a6}, intrahash = {41f92650f0f7d78366febc1832cedba9}, note = {cite arxiv:1302.4412Comment: Baseline results for the ECML PKDD Discovery Challenge 2013}, title = {Recommending Given Names}, url = {http://arxiv.org/abs/1302.4412}, year = 2013 }