{"id":45,"date":"2016-02-09T09:44:32","date_gmt":"2016-02-09T08:44:32","guid":{"rendered":"https:\/\/www.kde.cs.uni-kassel.de\/?page_id=45"},"modified":"2023-05-04T11:09:08","modified_gmt":"2023-05-04T09:09:08","slug":"pub","status":"publish","type":"page","link":"https:\/\/www.kde.cs.uni-kassel.de\/en\/pub","title":{"rendered":"Publications of the Knowledge &amp; Data Engineering Group"},"content":{"rendered":"<div id=\"trailimageid\"><img decoding=\"async\" id=\"ttimg\" src=\"https:\/\/www.kde.cs.uni-kassel.de\/wp-content\/plugins\/bibsonomy-csl\/img\/loading.gif\"><\/div> <p><a href=\"https:\/\/tgdk.org\/\"><\/a><\/p>\n<p><strong>The list is generated automatically by <\/strong><a href=\"http:\/\/www.bibsonomy.org\/\"><u><span style=\"color: #0066cc;\"><strong>BibSonomy<\/strong><\/span><\/u><\/a><strong>. For more details and BibTeX entries, please click on the titles.<\/strong><\/p>\n<div>\n<ul>\n<li>All publications in <a href=\"http:\/\/www.bibsonomy.org\/bib\/group\/kde\/myown?items=1000\"><u><span style=\"color: #0066cc;\">BibTeX<\/span><\/u><\/a>.<\/li>\n<li>All publications in one <a href=\"http:\/\/www.bibsonomy.org\/publ\/group\/kde\/myown?items=1000\"><u><span style=\"color: #0066cc;\">list<\/span><\/u><\/a>.<\/li>\n<li>All publications in the <a href=\"http:\/\/www.bibsonomy.org\/swrc\/group\/kde\/myown?items=1000\"><u><span style=\"color: #0066cc;\">SWRC ontology<\/span><\/u><\/a>.<\/li>\n<li>All publications as <a href=\"http:\/\/www.bibsonomy.org\/publrss\/group\/kde\/myown?items=1000\"><u><span style=\"color: #0066cc;\">rss feed<\/span><\/u><\/a>.<\/li>\n<li>All publications in <a href=\"http:\/\/www.bibsonomy.org\/endnote\/group\/kde\/myown?items=1000\"><u><span style=\"color: #0066cc;\">EndNote<\/span><\/u><\/a>.<\/li>\n<\/ul>\n<\/div>\n \n <ul class=\"bibsonomycsl_publications\">\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2026\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2026<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Tolzin, A., Hille, T., Knoth, N., Janson, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mining Hidden Prompt Engineering Patterns with Formal Concept Analysis and Association Rules<\/span>.<\/span> In: Bui, T.X. (ed.) 59th Hawaii International Conference on System Sciences, {HICSS} 2026. ScholarSpace (2026).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/hdl.handle.net\/10125\/111529\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0d6d25b8c55b72539c299993a4f8bbc3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0d6d25b8c55b72539c299993a4f8bbc3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0d6d25b8c55b72539c299993a4f8bbc3\/thille\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0d6d25b8c55b72539c299993a4f8bbc3\"><p>@inproceedings{Tolzin2026Jan,<br\/>  author = {Tolzin, Antonia and Hille, Tobias and Knoth, Nils and Janson, Andreas},<br\/>  booktitle = {59th Hawaii International Conference on System Sciences, {HICSS} 2026},<br\/>  editor = {Bui, Tung X.},<br\/>  keywords = {itegpub},<br\/>  month = {01},<br\/>  publisher = {ScholarSpace},<br\/>  title = {Mining Hidden Prompt Engineering Patterns with Formal Concept Analysis and Association Rules},<br\/>  year = 2026<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0d6d25b8c55b72539c299993a4f8bbc3\"><p>%0 Conference Paper<br\/>%1 Tolzin2026Jan<br\/>%A Tolzin, Antonia<br\/>%A Hille, Tobias<br\/>%A Knoth, Nils<br\/>%A Janson, Andreas<br\/>%B 59th Hawaii International Conference on System Sciences, {HICSS} 2026<br\/>%D 2026<br\/>%E Bui, Tung X.<br\/>%I ScholarSpace<br\/>%T Mining Hidden Prompt Engineering Patterns with Formal Concept Analysis and Association Rules<br\/>%U https:\/\/hdl.handle.net\/10125\/111529<br\/>%@ 978-0-9981331-9-5<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2025\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2025<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Abdulla, M., Hille, T., D\u00fcrrschnabel, D., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Rises for Measuring Local Distributivity in Lattices<\/span>.<\/span> In: Cellier, P., Ganter, B., and Missaoui, R. (eds.) SpringerLink. pp. 392\u2013407. Springer, Cham, Switzerland (2025). https:\/\/doi.org\/10.1007\/978-3-032-03364-2_25.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dblp.uni-trier.de\/rec\/conf\/concepts\/AbdullaHDS25.html\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f5593f0c181305a82f4440727d0be68d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f5593f0c181305a82f4440727d0be68d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-032-03364-2_25\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f5593f0c181305a82f4440727d0be68d\/thille\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f5593f0c181305a82f4440727d0be68d\"><p>@incollection{Abdulla2025Sep,<br\/>  address = {Cham, Switzerland},<br\/>  author = {Abdulla, Mohammad and Hille, Tobias and D\u00fcrrschnabel, Dominik and Stumme, Gerd},<br\/>  booktitle = {Conceptual Knowledge Structures},<br\/>  editor = {Cellier, Peggy and Ganter, Bernhard and Missaoui, Rokia},<br\/>  journal = {SpringerLink},<br\/>  keywords = {itegpub},<br\/>  month = {09},<br\/>  pages = {392--407},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Rises for Measuring Local Distributivity in Lattices},<br\/>  type = {Publication},<br\/>  volume = 15941,<br\/>  year = 2025<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f5593f0c181305a82f4440727d0be68d\"><p>%0 Book Section<br\/>%1 Abdulla2025Sep<br\/>%A Abdulla, Mohammad<br\/>%A Hille, Tobias<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Stumme, Gerd<br\/>%B Conceptual Knowledge Structures<br\/>%C Cham, Switzerland<br\/>%D 2025<br\/>%E Cellier, Peggy<br\/>%E Ganter, Bernhard<br\/>%E Missaoui, Rokia<br\/>%I Springer<br\/>%J SpringerLink<br\/>%P 392--407<br\/>%R 10.1007\/978-3-032-03364-2_25<br\/>%T Rises for Measuring Local Distributivity in Lattices<br\/>%U https:\/\/dblp.uni-trier.de\/rec\/conf\/concepts\/AbdullaHDS25.html<br\/>%V 15941<br\/>%@ 978-3-032-03364-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Abdulla, M., Hille, T., D{\u00fc}rrschnabel, D., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Rises for\u00a0Measuring Local Distributivity in\u00a0Lattices<\/span>.<\/span> In: Cellier, P., Ganter, B., and Missaoui, R. (eds.) Conceptual Knowledge Structures. pp. 392\u2013407. Springer Nature Switzerland, Cham (2025).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0a44beba3a682e34db37c9506345a57d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0a44beba3a682e34db37c9506345a57d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0a44beba3a682e34db37c9506345a57d\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-0a44beba3a682e34db37c9506345a57d\">Distributivity is a well-established and extensively studied notion in lattice theory. In the context of data analysis, particularly within Formal Concept Analysis (FCA), lattices\u00a0are often observed to exhibit a high degree of distributivity. However, no standardized measure exists to quantify this property. In\u00a0this paper, we introduce the notion of rises in (concept) lattices as\u00a0a means to assess distributivity. Rises capture how the number\u00a0of attributes or objects in covering concepts change within the concept lattice. We show that a lattice is distributive if and only if\u00a0no non-unit rises occur. Furthermore, we relate rises to the classical notion of meet- and join distributivity. We observe that concept lattices from real-world data are to a high degree join-distributive, but much less meet-distributive. We additionally study how join-distributivity manifests on the level of ordered sets.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0a44beba3a682e34db37c9506345a57d\"><p>@inproceedings{10.1007\/978-3-032-03364-2_25,<br\/>  abstract = {Distributivity is a well-established and extensively studied notion in lattice theory. In the context of data analysis, particularly within Formal Concept Analysis (FCA), lattices\u00a0are often observed to exhibit a high degree of distributivity. However, no standardized measure exists to quantify this property. In\u00a0this paper, we introduce the notion of rises in (concept) lattices as\u00a0a means to assess distributivity. Rises capture how the number\u00a0of attributes or objects in covering concepts change within the concept lattice. We show that a lattice is distributive if and only if\u00a0no non-unit rises occur. Furthermore, we relate rises to the classical notion of meet- and join distributivity. We observe that concept lattices from real-world data are to a high degree join-distributive, but much less meet-distributive. We additionally study how join-distributivity manifests on the level of ordered sets.},<br\/>  address = {Cham},<br\/>  author = {Abdulla, Mohammad and Hille, Tobias and D{\u00fc}rrschnabel, Dominik and Stumme, Gerd},<br\/>  booktitle = {Conceptual Knowledge Structures},<br\/>  editor = {Cellier, Peggy and Ganter, Bernhard and Missaoui, Rokia},<br\/>  keywords = {itegpub},<br\/>  pages = {392--407},<br\/>  publisher = {Springer Nature Switzerland},<br\/>  title = {Rises for\u00a0Measuring Local Distributivity in\u00a0Lattices},<br\/>  year = 2025<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0a44beba3a682e34db37c9506345a57d\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-032-03364-2_25<br\/>%A Abdulla, Mohammad<br\/>%A Hille, Tobias<br\/>%A D{\u00fc}rrschnabel, Dominik<br\/>%A Stumme, Gerd<br\/>%B Conceptual Knowledge Structures<br\/>%C Cham<br\/>%D 2025<br\/>%E Cellier, Peggy<br\/>%E Ganter, Bernhard<br\/>%E Missaoui, Rokia<br\/>%I Springer Nature Switzerland<br\/>%P 392--407<br\/>%T Rises for\u00a0Measuring Local Distributivity in\u00a0Lattices<br\/>%X Distributivity is a well-established and extensively studied notion in lattice theory. In the context of data analysis, particularly within Formal Concept Analysis (FCA), lattices\u00a0are often observed to exhibit a high degree of distributivity. However, no standardized measure exists to quantify this property. In\u00a0this paper, we introduce the notion of rises in (concept) lattices as\u00a0a means to assess distributivity. Rises capture how the number\u00a0of attributes or objects in covering concepts change within the concept lattice. We show that a lattice is distributive if and only if\u00a0no non-unit rises occur. Furthermore, we relate rises to the classical notion of meet- and join distributivity. We observe that concept lattices from real-world data are to a high degree join-distributive, but much less meet-distributive. We additionally study how join-distributivity manifests on the level of ordered sets.<br\/>%@ 978-3-032-03364-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Gutekunst, K.M., D{\u00fc}rrschnabel, D., Hirth, J., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Topic Aggregation<\/span>.<\/span> In: Cellier, P., Ganter, B., and Missaoui, R. (eds.) Conceptual Knowledge Structures. pp. 3\u201318. Springer Nature Switzerland, Cham (2025).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bcbce894e8ec248711d45231e3497d18\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bcbce894e8ec248711d45231e3497d18\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bcbce894e8ec248711d45231e3497d18\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-bcbce894e8ec248711d45231e3497d18\">The vast growth of data has rendered traditional manual inspection infeasible, necessitating the adoption of computational methods for efficient data exploration. Topic modeling has emerged as a powerful tool for analyzing large-scale textual datasets, enabling the extraction of latent semantic structures. However, existing methods for topic modeling often struggle to provide interpretable representations that facilitate deeper insights into data structure and content.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bcbce894e8ec248711d45231e3497d18\"><p>@inproceedings{10.1007\/978-3-032-03364-2_1,<br\/>  abstract = {The vast growth of data has rendered traditional manual inspection infeasible, necessitating the adoption of computational methods for efficient data exploration. Topic modeling has emerged as a powerful tool for analyzing large-scale textual datasets, enabling the extraction of latent semantic structures. However, existing methods for topic modeling often struggle to provide interpretable representations that facilitate deeper insights into data structure and content.},<br\/>  address = {Cham},<br\/>  author = {Gutekunst, Klara M. and D{\u00fc}rrschnabel, Dominik and Hirth, Johannes and Stumme, Gerd},<br\/>  booktitle = {Conceptual Knowledge Structures},<br\/>  editor = {Cellier, Peggy and Ganter, Bernhard and Missaoui, Rokia},<br\/>  keywords = {topic_aggregation},<br\/>  pages = {3--18},<br\/>  publisher = {Springer Nature Switzerland},<br\/>  title = {Conceptual Topic Aggregation},<br\/>  year = 2025<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bcbce894e8ec248711d45231e3497d18\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-032-03364-2_1<br\/>%A Gutekunst, Klara M.<br\/>%A D{\u00fc}rrschnabel, Dominik<br\/>%A Hirth, Johannes<br\/>%A Stumme, Gerd<br\/>%B Conceptual Knowledge Structures<br\/>%C Cham<br\/>%D 2025<br\/>%E Cellier, Peggy<br\/>%E Ganter, Bernhard<br\/>%E Missaoui, Rokia<br\/>%I Springer Nature Switzerland<br\/>%P 3--18<br\/>%T Conceptual Topic Aggregation<br\/>%X The vast growth of data has rendered traditional manual inspection infeasible, necessitating the adoption of computational methods for efficient data exploration. Topic modeling has emerged as a powerful tool for analyzing large-scale textual datasets, enabling the extraction of latent semantic structures. However, existing methods for topic modeling often struggle to provide interpretable representations that facilitate deeper insights into data structure and content.<br\/>%@ 978-3-032-03364-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hirth, J., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Geometric Structure of Topic Models.<\/span><\/span> In: Cellier, P., Ganter, B., and Missaoui, R. (eds.) CONCEPTS. pp. 19\u201334. Springer (2025).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/concepts\/concepts2025.html#HirthH25\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5a44b915173530788e3275222e5292f1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5a44b915173530788e3275222e5292f1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5a44b915173530788e3275222e5292f1\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5a44b915173530788e3275222e5292f1\"><p>@inproceedings{conf\/concepts\/HirthH25,<br\/>  author = {Hirth, Johannes and Hanika, Tom},<br\/>  booktitle = {CONCEPTS},<br\/>  crossref = {conf\/concepts\/2025},<br\/>  editor = {Cellier, Peggy and Ganter, Bernhard and Missaoui, Rokia},<br\/>  keywords = {itegpub},<br\/>  pages = {19-34},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {The Geometric Structure of Topic Models.},<br\/>  volume = 15941,<br\/>  year = 2025<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5a44b915173530788e3275222e5292f1\"><p>%0 Conference Paper<br\/>%1 conf\/concepts\/HirthH25<br\/>%A Hirth, Johannes<br\/>%A Hanika, Tom<br\/>%B CONCEPTS<br\/>%D 2025<br\/>%E Cellier, Peggy<br\/>%E Ganter, Bernhard<br\/>%E Missaoui, Rokia<br\/>%I Springer<br\/>%P 19-34<br\/>%T The Geometric Structure of Topic Models.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/concepts\/concepts2025.html#HirthH25<br\/>%V 15941<br\/>%@ 978-3-032-03364-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">de Portugal Mecke, D.C., Alyoussef, H., Stubbemann, M., Koloiarov, I., Hanika, T., Schmidt-Thieme, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">STADE: Standard Deviation as a Pruning Metric<\/span><\/span>, https:\/\/arxiv.org\/abs\/2503.22451, (2025).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/2503.22451\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1b15dca83b745781584df0d24d410145\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1b15dca83b745781584df0d24d410145\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1b15dca83b745781584df0d24d410145\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1b15dca83b745781584df0d24d410145\"><p>@misc{mecke2025stadestandarddeviationpruning,<br\/>  author = {de Portugal Mecke, Diego Coello and Alyoussef, Haya and Stubbemann, Maximilian and Koloiarov, Ilia and Hanika, Tom and Schmidt-Thieme, Lars},<br\/>  keywords = {itegpub},<br\/>  title = {STADE: Standard Deviation as a Pruning Metric},<br\/>  year = 2025<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1b15dca83b745781584df0d24d410145\"><p>%0 Generic<br\/>%1 mecke2025stadestandarddeviationpruning<br\/>%A de Portugal Mecke, Diego Coello<br\/>%A Alyoussef, Haya<br\/>%A Stubbemann, Maximilian<br\/>%A Koloiarov, Ilia<br\/>%A Hanika, Tom<br\/>%A Schmidt-Thieme, Lars<br\/>%D 2025<br\/>%T STADE: Standard Deviation as a Pruning Metric<br\/>%U https:\/\/arxiv.org\/abs\/2503.22451<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Hille, T., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Unsupervised Selection of Features by Their Resilience to the Curse of Dimensionality.<\/span><\/span> In: Braun, T., Paa\u00dfen, B., and Stolzenburg, F. (eds.) KI. pp. 161\u2013174. Springer (2025).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/ki\/ki2025.html#StubbemannHH25\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-97af07f500a68aca0114d1c0020b201b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-97af07f500a68aca0114d1c0020b201b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/97af07f500a68aca0114d1c0020b201b\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-97af07f500a68aca0114d1c0020b201b\"><p>@inproceedings{conf\/ki\/StubbemannHH25,<br\/>  author = {Stubbemann, Maximilian and Hille, Tobias and Hanika, Tom},<br\/>  booktitle = {KI},<br\/>  crossref = {conf\/ki\/2025},<br\/>  editor = {Braun, Tanya and Paa\u00dfen, Benjamin and Stolzenburg, Frieder},<br\/>  keywords = {itegpub},<br\/>  pages = {161-174},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Unsupervised Selection of Features by Their Resilience to the Curse of Dimensionality.},<br\/>  volume = 15956,<br\/>  year = 2025<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-97af07f500a68aca0114d1c0020b201b\"><p>%0 Conference Paper<br\/>%1 conf\/ki\/StubbemannHH25<br\/>%A Stubbemann, Maximilian<br\/>%A Hille, Tobias<br\/>%A Hanika, Tom<br\/>%B KI<br\/>%D 2025<br\/>%E Braun, Tanya<br\/>%E Paa\u00dfen, Benjamin<br\/>%E Stolzenburg, Frieder<br\/>%I Springer<br\/>%P 161-174<br\/>%T Unsupervised Selection of Features by Their Resilience to the Curse of Dimensionality.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/ki\/ki2025.html#StubbemannHH25<br\/>%V 15956<br\/>%@ 978-3-032-02813-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hille, T., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Incomplete Formal Contexts and Their Intrinsic Dimension<\/span>.<\/span> In: Cellier, P., Ganter, B., and Missaoui, R. (eds.) SpringerLink. pp. 342\u2013358. Springer, Cham, Switzerland (2025). https:\/\/doi.org\/10.1007\/978-3-032-03364-2_22.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dblp.uni-trier.de\/rec\/conf\/concepts\/HilleH25.html\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-68a8cf80b683dcbae5968b57759274f3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-68a8cf80b683dcbae5968b57759274f3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-032-03364-2_22\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/68a8cf80b683dcbae5968b57759274f3\/thille\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-68a8cf80b683dcbae5968b57759274f3\"><p>@incollection{Hille2025Sep,<br\/>  address = {Cham, Switzerland},<br\/>  author = {Hille, Tobias and Hanika, Tom},<br\/>  booktitle = {Conceptual Knowledge Structures},<br\/>  editor = {Cellier, Peggy and Ganter, Bernhard and Missaoui, Rokia},<br\/>  journal = {SpringerLink},<br\/>  keywords = {itegpub},<br\/>  month = {09},<br\/>  pages = {342--358},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Incomplete Formal Contexts and Their Intrinsic Dimension},<br\/>  type = {Publication},<br\/>  volume = 15941,<br\/>  year = 2025<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-68a8cf80b683dcbae5968b57759274f3\"><p>%0 Book Section<br\/>%1 Hille2025Sep<br\/>%A Hille, Tobias<br\/>%A Hanika, Tom<br\/>%B Conceptual Knowledge Structures<br\/>%C Cham, Switzerland<br\/>%D 2025<br\/>%E Cellier, Peggy<br\/>%E Ganter, Bernhard<br\/>%E Missaoui, Rokia<br\/>%I Springer<br\/>%J SpringerLink<br\/>%P 342--358<br\/>%R 10.1007\/978-3-032-03364-2_22<br\/>%T Incomplete Formal Contexts and Their Intrinsic Dimension<br\/>%U https:\/\/dblp.uni-trier.de\/rec\/conf\/concepts\/HilleH25.html<br\/>%V 15941<br\/>%@ 978-3-032-03364-2<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2024\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2024<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Horn, V., Hirth, J., Holfeld, J., Behmenburg, J.H., Draude, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Disclosing Diverse Perspectives of News Articles for Navigating between Online Journalism Content<\/span>.<\/span> In: Nordic Conference on Human-Computer Interaction. Association for Computing Machinery, Uppsala, Sweden (2024). https:\/\/doi.org\/10.1145\/3679318.3685414.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1145\/3679318.3685414\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6fd27e97604d62808e8e60e7d0eb049f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6fd27e97604d62808e8e60e7d0eb049f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/3679318.3685414\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6fd27e97604d62808e8e60e7d0eb049f\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-6fd27e97604d62808e8e60e7d0eb049f\">Today, exposure to journalistic online content is predominantly controlled by news recommender systems, which often suggest content that matches user\u2019s interests or is selected according to non-transparent recommendation criteria. To circumvent resulting trade-offs like polarisation or fragmentation whilst ensuring user\u2019s autonomy, we explore how different perspectives within online news can be disclosed instead for guiding navigation. To do so, we developed an interactive prototype that displays article titles in correspondence to their argumentative orientation. In order to investigate how the usage of our novel navigation structure impacts the choice of news articles and user experience, we conducted an exploratory user study assessing the impact of the design parameters chosen. Implications are drawn from the study results and the development of the interactive prototype for the exposure to diversity in the context of navigating news content online.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6fd27e97604d62808e8e60e7d0eb049f\"><p>@inproceedings{hci-lattice,<br\/>  abstract = {Today, exposure to journalistic online content is predominantly controlled by news recommender systems, which often suggest content that matches user\u2019s interests or is selected according to non-transparent recommendation criteria. To circumvent resulting trade-offs like polarisation or fragmentation whilst ensuring user\u2019s autonomy, we explore how different perspectives within online news can be disclosed instead for guiding navigation. To do so, we developed an interactive prototype that displays article titles in correspondence to their argumentative orientation. In order to investigate how the usage of our novel navigation structure impacts the choice of news articles and user experience, we conducted an exploratory user study assessing the impact of the design parameters chosen. Implications are drawn from the study results and the development of the interactive prototype for the exposure to diversity in the context of navigating news content online.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Horn, Viktoria and Hirth, Johannes and Holfeld, Julian and Behmenburg, Jens Hendrik and Draude, Claude and Stumme, Gerd},<br\/>  booktitle = {Nordic Conference on Human-Computer Interaction},<br\/>  keywords = {itegpub},<br\/>  publisher = {Association for Computing Machinery},<br\/>  series = {NordiCHI 2024},<br\/>  title = {Disclosing Diverse Perspectives of News Articles for Navigating between Online Journalism Content},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6fd27e97604d62808e8e60e7d0eb049f\"><p>%0 Conference Paper<br\/>%1 hci-lattice<br\/>%A Horn, Viktoria<br\/>%A Hirth, Johannes<br\/>%A Holfeld, Julian<br\/>%A Behmenburg, Jens Hendrik<br\/>%A Draude, Claude<br\/>%A Stumme, Gerd<br\/>%B Nordic Conference on Human-Computer Interaction<br\/>%C New York, NY, USA<br\/>%D 2024<br\/>%I Association for Computing Machinery<br\/>%R 10.1145\/3679318.3685414<br\/>%T Disclosing Diverse Perspectives of News Articles for Navigating between Online Journalism Content<br\/>%U https:\/\/doi.org\/10.1145\/3679318.3685414<br\/>%X Today, exposure to journalistic online content is predominantly controlled by news recommender systems, which often suggest content that matches user\u2019s interests or is selected according to non-transparent recommendation criteria. To circumvent resulting trade-offs like polarisation or fragmentation whilst ensuring user\u2019s autonomy, we explore how different perspectives within online news can be disclosed instead for guiding navigation. To do so, we developed an interactive prototype that displays article titles in correspondence to their argumentative orientation. In order to investigate how the usage of our novel navigation structure impacts the choice of news articles and user experience, we conducted an exploratory user study assessing the impact of the design parameters chosen. Implications are drawn from the study results and the development of the interactive prototype for the exposure to diversity in the context of navigating news content online.<br\/>%@ 9798400709661<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Priss, U., D\u00fcrrschnabel, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Rectangular Euler Diagrams and\u00a0Order Theory<\/span>.<\/span> In: Lemanski, J., Johansen, M.W., Manalo, E., Viana, P., Bhattacharjee, R., and Burns, R. (eds.) Diagrammatic Representation and Inference. pp. 165\u2013181. Springer Nature Switzerland, Cham (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f4725c3e0b008b6ed5ce92cd99571634\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f4725c3e0b008b6ed5ce92cd99571634\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f4725c3e0b008b6ed5ce92cd99571634\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-f4725c3e0b008b6ed5ce92cd99571634\">This paper discusses the relevance of order-theoretical properties, such as order dimension, for determining properties of Euler diagrams, such as whether a given poset can be represented with or without shading. The focus is on linear, tabular and rectangular Euler diagrams with shading and without split attributes and constructions with subdiagrams and embeddings. Euler diagrams are distinguished from geometric containment orders. Basic layout strategies are suggested.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f4725c3e0b008b6ed5ce92cd99571634\"><p>@inproceedings{10.1007\/978-3-031-71291-3_14,<br\/>  abstract = {This paper discusses the relevance of order-theoretical properties, such as order dimension, for determining properties of Euler diagrams, such as whether a given poset can be represented with or without shading. The focus is on linear, tabular and rectangular Euler diagrams with shading and without split attributes and constructions with subdiagrams and embeddings. Euler diagrams are distinguished from geometric containment orders. Basic layout strategies are suggested.},<br\/>  address = {Cham},<br\/>  author = {Priss, Uta and D\u00fcrrschnabel, Dominik},<br\/>  booktitle = {Diagrammatic Representation and Inference},<br\/>  editor = {Lemanski, Jens and Johansen, Mikkel Willum and Manalo, Emmanuel and Viana, Petrucio and Bhattacharjee, Reetu and Burns, Richard},<br\/>  keywords = {itegpub},<br\/>  pages = {165--181},<br\/>  publisher = {Springer Nature Switzerland},<br\/>  title = {Rectangular Euler Diagrams and\u00a0Order Theory},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f4725c3e0b008b6ed5ce92cd99571634\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-031-71291-3_14<br\/>%A Priss, Uta<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%B Diagrammatic Representation and Inference<br\/>%C Cham<br\/>%D 2024<br\/>%E Lemanski, Jens<br\/>%E Johansen, Mikkel Willum<br\/>%E Manalo, Emmanuel<br\/>%E Viana, Petrucio<br\/>%E Bhattacharjee, Reetu<br\/>%E Burns, Richard<br\/>%I Springer Nature Switzerland<br\/>%P 165--181<br\/>%T Rectangular Euler Diagrams and\u00a0Order Theory<br\/>%X This paper discusses the relevance of order-theoretical properties, such as order dimension, for determining properties of Euler diagrams, such as whether a given poset can be represented with or without shading. The focus is on linear, tabular and rectangular Euler diagrams with shading and without split attributes and constructions with subdiagrams and embeddings. Euler diagrams are distinguished from geometric containment orders. Basic layout strategies are suggested.<br\/>%@ 978-3-031-71291-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Priss, U., D{\u00fc}rrschnabel, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Rectangular Euler Diagrams and\u00a0Order Theory<\/span>.<\/span> In: Lemanski, J., Johansen, M.W., Manalo, E., Viana, P., Bhattacharjee, R., and Burns, R. (eds.) Diagrammatic Representation and Inference. pp. 165\u2013181. Springer Nature Switzerland, Cham (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4a55d998e7d22807ed9206f184f5cb51\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4a55d998e7d22807ed9206f184f5cb51\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4a55d998e7d22807ed9206f184f5cb51\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-4a55d998e7d22807ed9206f184f5cb51\">This paper discusses the relevance of order-theoretical properties, such as order dimension, for determining properties of Euler diagrams, such as whether a given poset can be represented with or without shading. The focus is on linear, tabular and rectangular Euler diagrams with shading and without split attributes and constructions with subdiagrams and embeddings. Euler diagrams are distinguished from geometric containment orders. Basic layout strategies are suggested.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4a55d998e7d22807ed9206f184f5cb51\"><p>@inproceedings{10.1007\/978-3-031-71291-3_14,<br\/>  abstract = {This paper discusses the relevance of order-theoretical properties, such as order dimension, for determining properties of Euler diagrams, such as whether a given poset can be represented with or without shading. The focus is on linear, tabular and rectangular Euler diagrams with shading and without split attributes and constructions with subdiagrams and embeddings. Euler diagrams are distinguished from geometric containment orders. Basic layout strategies are suggested.},<br\/>  address = {Cham},<br\/>  author = {Priss, Uta and D{\u00fc}rrschnabel, Dominik},<br\/>  booktitle = {Diagrammatic Representation and Inference},<br\/>  editor = {Lemanski, Jens and Johansen, Mikkel Willum and Manalo, Emmanuel and Viana, Petrucio and Bhattacharjee, Reetu and Burns, Richard},<br\/>  keywords = {order_theory},<br\/>  pages = {165--181},<br\/>  publisher = {Springer Nature Switzerland},<br\/>  title = {Rectangular Euler Diagrams and\u00a0Order Theory},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4a55d998e7d22807ed9206f184f5cb51\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-031-71291-3_14<br\/>%A Priss, Uta<br\/>%A D{\u00fc}rrschnabel, Dominik<br\/>%B Diagrammatic Representation and Inference<br\/>%C Cham<br\/>%D 2024<br\/>%E Lemanski, Jens<br\/>%E Johansen, Mikkel Willum<br\/>%E Manalo, Emmanuel<br\/>%E Viana, Petrucio<br\/>%E Bhattacharjee, Reetu<br\/>%E Burns, Richard<br\/>%I Springer Nature Switzerland<br\/>%P 165--181<br\/>%T Rectangular Euler Diagrams and\u00a0Order Theory<br\/>%X This paper discusses the relevance of order-theoretical properties, such as order dimension, for determining properties of Euler diagrams, such as whether a given poset can be represented with or without shading. The focus is on linear, tabular and rectangular Euler diagrams with shading and without split attributes and constructions with subdiagrams and embeddings. Euler diagrams are distinguished from geometric containment orders. Basic layout strategies are suggested.<br\/>%@ 978-3-031-71291-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ganter, B., Hanika, T., Hirth, J., Obiedkov, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Collaborative Hybrid Human {AI} Learning through Conceptual Exploration<\/span>.<\/span> In: Ericson, P., Khairova, N., and Vos, M.D. (eds.) Proceedings of the Workshops at the Third International Conference on Hybrid Human-Artificial Intelligence co-located with (HHAI) 2024), Malm\u00f6, Sweden, June 10-11, 2024. pp. 1\u20138. CEUR-WS.org (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/ceur-ws.org\/Vol-3825\/tutorial.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5850bd6b4c1c6946a58995605ed1e6d0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5850bd6b4c1c6946a58995605ed1e6d0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5850bd6b4c1c6946a58995605ed1e6d0\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5850bd6b4c1c6946a58995605ed1e6d0\"><p>@inproceedings{DBLP:conf\/hhai\/GanterHHO24,<br\/>  author = {Ganter, Bernhard and Hanika, Tom and Hirth, Johannes and Obiedkov, Sergei},<br\/>  booktitle = {Proceedings of the Workshops at the Third International Conference on Hybrid Human-Artificial Intelligence co-located with (HHAI) 2024), Malm\u00f6, Sweden, June 10-11, 2024},<br\/>  editor = {Ericson, Petter and Khairova, Nina and Vos, Marina De},<br\/>  keywords = {itegpub},<br\/>  pages = {1--8},<br\/>  publisher = {CEUR-WS.org},<br\/>  series = {{CEUR} Workshop Proceedings},<br\/>  title = {Collaborative Hybrid Human {AI} Learning through Conceptual Exploration},<br\/>  volume = 3825,<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5850bd6b4c1c6946a58995605ed1e6d0\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/hhai\/GanterHHO24<br\/>%A Ganter, Bernhard<br\/>%A Hanika, Tom<br\/>%A Hirth, Johannes<br\/>%A Obiedkov, Sergei<br\/>%B Proceedings of the Workshops at the Third International Conference on Hybrid Human-Artificial Intelligence co-located with (HHAI) 2024), Malm\u00f6, Sweden, June 10-11, 2024<br\/>%D 2024<br\/>%E Ericson, Petter<br\/>%E Khairova, Nina<br\/>%E Vos, Marina De<br\/>%I CEUR-WS.org<br\/>%P 1--8<br\/>%T Collaborative Hybrid Human {AI} Learning through Conceptual Exploration<br\/>%U https:\/\/ceur-ws.org\/Vol-3825\/tutorial.pdf<br\/>%V 3825<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Budde, K.B., Rellstab, C., Heuertz, M., Gugerli, F., Hanika, T., Verd\u00fa, M., Pausas, J.G., Gonz\u00e1lez-Mart\u00ednez, S.C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Divergent selection in a Mediterranean pine on local spatial scales<\/span>.<\/span> Journal of Ecology. 112, (2024). https:\/\/doi.org\/https:\/\/doi.org\/10.1111\/1365-2745.14231.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/besjournals.onlinelibrary.wiley.com\/doi\/abs\/10.1111\/1365-2745.14231\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-64cdb512638b967b2d03a82ad77bcbfe\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-64cdb512638b967b2d03a82ad77bcbfe\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1111\/1365-2745.14231\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/64cdb512638b967b2d03a82ad77bcbfe\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-64cdb512638b967b2d03a82ad77bcbfe\">Abstract The effects of selection on an organism's genome are hard to detect on small spatial scales, as gene flow can swamp signatures of local adaptation. Therefore, most genome scans to detect signatures of environmental selection are performed on large spatial scales; however, divergent selection on the local scale (e.g. between contrasting soil conditions) has also been demonstrated, in particular for herbaceous plants. Here, we hypothesised that in topographically complex landscapes, microenvironment variability is strong enough to leave a selective footprint in the genomes of long-lived organisms. To test this, we investigated paired south- versus north-facing Pinus pinaster stands on the local scale, with trees growing in close vicinity (\u2264820\u2009m distance between paired south- and north-facing stands), in a Mediterranean mountain area. While trees on north-facing slopes experience less radiation, trees on south-facing slopes suffer from especially harsh conditions, particularly during the dry summer season. Two outlier analyses consistently revealed five putatively adaptive loci (out of 4034), in candidate genes two of which encoded non-synonymous substitutions. Additionally, one locus showed consistent allele frequency differences in all three stand pairs indicating divergent selection despite high gene flow on the local scale. Permutation tests demonstrated that our findings were robust. Functional annotation of these candidate genes revealed biological functions related to abiotic stress response, such as water availability, in other plant species. Synthesis. Our study highlights how divergent selection in heterogeneous microenvironments shapes and maintains the functional genetic variation within populations of long-lived forest tree species, being the first to focus on adaptive genetic divergence between south- and north-facing slopes within continuous forest stands. This is especially relevant in the current context of climate change, as this variation is at the base of plant population responses to future climate.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-64cdb512638b967b2d03a82ad77bcbfe\"><p>@article{https:\/\/doi.org\/10.1111\/1365-2745.14231,<br\/>  abstract = {Abstract The effects of selection on an organism's genome are hard to detect on small spatial scales, as gene flow can swamp signatures of local adaptation. Therefore, most genome scans to detect signatures of environmental selection are performed on large spatial scales; however, divergent selection on the local scale (e.g. between contrasting soil conditions) has also been demonstrated, in particular for herbaceous plants. Here, we hypothesised that in topographically complex landscapes, microenvironment variability is strong enough to leave a selective footprint in the genomes of long-lived organisms. To test this, we investigated paired south- versus north-facing Pinus pinaster stands on the local scale, with trees growing in close vicinity (\u2264820\u2009m distance between paired south- and north-facing stands), in a Mediterranean mountain area. While trees on north-facing slopes experience less radiation, trees on south-facing slopes suffer from especially harsh conditions, particularly during the dry summer season. Two outlier analyses consistently revealed five putatively adaptive loci (out of 4034), in candidate genes two of which encoded non-synonymous substitutions. Additionally, one locus showed consistent allele frequency differences in all three stand pairs indicating divergent selection despite high gene flow on the local scale. Permutation tests demonstrated that our findings were robust. Functional annotation of these candidate genes revealed biological functions related to abiotic stress response, such as water availability, in other plant species. Synthesis. Our study highlights how divergent selection in heterogeneous microenvironments shapes and maintains the functional genetic variation within populations of long-lived forest tree species, being the first to focus on adaptive genetic divergence between south- and north-facing slopes within continuous forest stands. This is especially relevant in the current context of climate change, as this variation is at the base of plant population responses to future climate.},<br\/>  author = {Budde, Katharina B. and Rellstab, Christian and Heuertz, Myriam and Gugerli, Felix and Hanika, Tom and Verd\u00fa, Miguel and Pausas, Juli G. and Gonz\u00e1lez-Mart\u00ednez, Santiago C.},<br\/>  journal = {Journal of Ecology},<br\/>  keywords = {itegpub},<br\/>  number = 2,<br\/>  title = {Divergent selection in a Mediterranean pine on local spatial scales},<br\/>  volume = 112,<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-64cdb512638b967b2d03a82ad77bcbfe\"><p>%0 Journal Article<br\/>%1 https:\/\/doi.org\/10.1111\/1365-2745.14231<br\/>%A Budde, Katharina B.<br\/>%A Rellstab, Christian<br\/>%A Heuertz, Myriam<br\/>%A Gugerli, Felix<br\/>%A Hanika, Tom<br\/>%A Verd\u00fa, Miguel<br\/>%A Pausas, Juli G.<br\/>%A Gonz\u00e1lez-Mart\u00ednez, Santiago C.<br\/>%D 2024<br\/>%J Journal of Ecology<br\/>%N 2<br\/>%R https:\/\/doi.org\/10.1111\/1365-2745.14231<br\/>%T Divergent selection in a Mediterranean pine on local spatial scales<br\/>%U https:\/\/besjournals.onlinelibrary.wiley.com\/doi\/abs\/10.1111\/1365-2745.14231<br\/>%V 112<br\/>%X Abstract The effects of selection on an organism's genome are hard to detect on small spatial scales, as gene flow can swamp signatures of local adaptation. Therefore, most genome scans to detect signatures of environmental selection are performed on large spatial scales; however, divergent selection on the local scale (e.g. between contrasting soil conditions) has also been demonstrated, in particular for herbaceous plants. Here, we hypothesised that in topographically complex landscapes, microenvironment variability is strong enough to leave a selective footprint in the genomes of long-lived organisms. To test this, we investigated paired south- versus north-facing Pinus pinaster stands on the local scale, with trees growing in close vicinity (\u2264820\u2009m distance between paired south- and north-facing stands), in a Mediterranean mountain area. While trees on north-facing slopes experience less radiation, trees on south-facing slopes suffer from especially harsh conditions, particularly during the dry summer season. Two outlier analyses consistently revealed five putatively adaptive loci (out of 4034), in candidate genes two of which encoded non-synonymous substitutions. Additionally, one locus showed consistent allele frequency differences in all three stand pairs indicating divergent selection despite high gene flow on the local scale. Permutation tests demonstrated that our findings were robust. Functional annotation of these candidate genes revealed biological functions related to abiotic stress response, such as water availability, in other plant species. Synthesis. Our study highlights how divergent selection in heterogeneous microenvironments shapes and maintains the functional genetic variation within populations of long-lived forest tree species, being the first to focus on adaptive genetic divergence between south- and north-facing slopes within continuous forest stands. This is especially relevant in the current context of climate change, as this variation is at the base of plant population responses to future climate.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Priss, U.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Realizability of Rectangular Euler Diagrams<\/span><\/span>, (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-55895b01a3404db14e85c7f3cb44e1dd\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-55895b01a3404db14e85c7f3cb44e1dd\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/55895b01a3404db14e85c7f3cb44e1dd\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-55895b01a3404db14e85c7f3cb44e1dd\"><p>@misc{d\u00fcrrschnabel2024realizability,<br\/>  author = {D\u00fcrrschnabel, Dominik and Priss, Uta},<br\/>  keywords = {itegpub},<br\/>  title = {Realizability of Rectangular Euler Diagrams},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-55895b01a3404db14e85c7f3cb44e1dd\"><p>%0 Generic<br\/>%1 d\u00fcrrschnabel2024realizability<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Priss, Uta<br\/>%D 2024<br\/>%T Realizability of Rectangular Euler Diagrams<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Hille, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">What is the intrinsic dimension of your binary data? -- and how to compute it quickly<\/span>.<\/span> In: CONCEPTS. pp. 97\u2013112. Springer (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/concepts\/concepts2024.html#HanikaH24\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a471a70ccdc4473f3300fa74969b43e8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a471a70ccdc4473f3300fa74969b43e8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a471a70ccdc4473f3300fa74969b43e8\/thille\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a471a70ccdc4473f3300fa74969b43e8\"><p>@inproceedings{hanika2024intrinsic,<br\/>  author = {Hanika, Tom and Hille, Tobias},<br\/>  booktitle = {CONCEPTS},<br\/>  keywords = {itegpub},<br\/>  pages = {97--112},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {What is the intrinsic dimension of your binary data? -- and how to compute it quickly},<br\/>  volume = 14914,<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a471a70ccdc4473f3300fa74969b43e8\"><p>%0 Conference Paper<br\/>%1 hanika2024intrinsic<br\/>%A Hanika, Tom<br\/>%A Hille, Tobias<br\/>%B CONCEPTS<br\/>%D 2024<br\/>%I Springer<br\/>%P 97--112<br\/>%T What is the intrinsic dimension of your binary data? -- and how to compute it quickly<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/concepts\/concepts2024.html#HanikaH24<br\/>%V 14914<br\/>%@ 978-3-031-67868-4<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hirth, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Data Scaling in Machine Learning<\/span><\/span>, (2024). https:\/\/doi.org\/10.17170\/kobra-2024100910940.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ee1e60a9f300cfca6f746491d4a9d445\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ee1e60a9f300cfca6f746491d4a9d445\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.17170\/kobra-2024100910940\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ee1e60a9f300cfca6f746491d4a9d445\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-ee1e60a9f300cfca6f746491d4a9d445\">Information that is intended for human interpretation is frequently represented in a structured manner. This allows for a navigation between individual pieces to find, connect or combine information to gain new insights. Within a structure, we derive knowledge from inference of hierarchical or logical relations between data objects. For unstructured data there are numerous methods to define a data schema based on user interpretations. Afterward, data objects can be aggregated to derive (hierarchical) structures based on common properties. There are four main challenges with respect to the explainability of the derived structures. First, formal procedures are needed to infer knowledge about the data set, or parts of it, from hierarchical structures. Second, what does knowledge inferred from a structure imply for the data set it was derived from? Third, structures may be incomprehensibly large for human interpretation. Methods are needed to reduce structures to smaller representations in a consistent, comprehensible manner that provides control over possibly introduced error. Forth, the original data set does not need to have interpretable features and thus only allow for the inference of structural properties. In order to extract information based on real world properties, we need methods that are able to add such properties. With the presented work, we address these challenges using and extending the rich tool-set of Formal Concept Analysis. Here, data objects are aggregated to closed sets called formal concepts based on (unary) symbolic attributes that they have in common. The process of deriving symbolic attributes is called conceptual scaling and depends on the interpretation of the data by the analyst. The resulting hierarchical structure of concepts is called concept lattice. To infer knowledge from the concept lattice structures we introduce new methods based on sub-structures that are of standardized shape, called ordinal motifs. This novel method allows us to explain the structure of a concept lattice based on geometric aspects. Throughout our work, we focus on data representations from multiple state-of-the-art machine learning algorithms. In all cases, we elaborate extensively on how to interpret these models through derived concept lattices and develop scaling procedures specific to each algorithm. Some of the considered models are black-box models whose internal data representations are numeric with no clear real world semantics. For these, we present a method to link background knowledge to the concept lattice structure. To reduce the complexity of concept lattices we provide a new theoretical framework that allows us to generate (small) views on a concept lattice. These enable more selective and comprehensibly sized explanations for data parts that are of interest. In addition to that, we introduce methods to combine and subtract views from each other, and to identify missing or incorrect parts.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ee1e60a9f300cfca6f746491d4a9d445\"><p>@phdthesis{doi:10.17170\/kobra-2024100910940,<br\/>  abstract = {Information that is intended for human interpretation is frequently represented in a structured manner. This allows for a navigation between individual pieces to find, connect or combine information to gain new insights. Within a structure, we derive knowledge from inference of hierarchical or logical relations between data objects. For unstructured data there are numerous methods to define a data schema based on user interpretations. Afterward, data objects can be aggregated to derive (hierarchical) structures based on common properties. There are four main challenges with respect to the explainability of the derived structures. First, formal procedures are needed to infer knowledge about the data set, or parts of it, from hierarchical structures. Second, what does knowledge inferred from a structure imply for the data set it was derived from? Third, structures may be incomprehensibly large for human interpretation. Methods are needed to reduce structures to smaller representations in a consistent, comprehensible manner that provides control over possibly introduced error. Forth, the original data set does not need to have interpretable features and thus only allow for the inference of structural properties. In order to extract information based on real world properties, we need methods that are able to add such properties. With the presented work, we address these challenges using and extending the rich tool-set of Formal Concept Analysis. Here, data objects are aggregated to closed sets called formal concepts based on (unary) symbolic attributes that they have in common. The process of deriving symbolic attributes is called conceptual scaling and depends on the interpretation of the data by the analyst. The resulting hierarchical structure of concepts is called concept lattice. To infer knowledge from the concept lattice structures we introduce new methods based on sub-structures that are of standardized shape, called ordinal motifs. This novel method allows us to explain the structure of a concept lattice based on geometric aspects. Throughout our work, we focus on data representations from multiple state-of-the-art machine learning algorithms. In all cases, we elaborate extensively on how to interpret these models through derived concept lattices and develop scaling procedures specific to each algorithm. Some of the considered models are black-box models whose internal data representations are numeric with no clear real world semantics. For these, we present a method to link background knowledge to the concept lattice structure. To reduce the complexity of concept lattices we provide a new theoretical framework that allows us to generate (small) views on a concept lattice. These enable more selective and comprehensibly sized explanations for data parts that are of interest. In addition to that, we introduce methods to combine and subtract views from each other, and to identify missing or incorrect parts.},<br\/>  author = {Hirth, Johannes},<br\/>  keywords = {Knowldege~Representation},<br\/>  school = {Kassel, Universit\u00e4t Kassel, Fachbereich Elektrotechnik\/Informatik},<br\/>  title = {Conceptual Data Scaling in Machine Learning},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ee1e60a9f300cfca6f746491d4a9d445\"><p>%0 Thesis<br\/>%1 doi:10.17170\/kobra-2024100910940<br\/>%A Hirth, Johannes<br\/>%D 2024<br\/>%R 10.17170\/kobra-2024100910940<br\/>%T Conceptual Data Scaling in Machine Learning<br\/>%X Information that is intended for human interpretation is frequently represented in a structured manner. This allows for a navigation between individual pieces to find, connect or combine information to gain new insights. Within a structure, we derive knowledge from inference of hierarchical or logical relations between data objects. For unstructured data there are numerous methods to define a data schema based on user interpretations. Afterward, data objects can be aggregated to derive (hierarchical) structures based on common properties. There are four main challenges with respect to the explainability of the derived structures. First, formal procedures are needed to infer knowledge about the data set, or parts of it, from hierarchical structures. Second, what does knowledge inferred from a structure imply for the data set it was derived from? Third, structures may be incomprehensibly large for human interpretation. Methods are needed to reduce structures to smaller representations in a consistent, comprehensible manner that provides control over possibly introduced error. Forth, the original data set does not need to have interpretable features and thus only allow for the inference of structural properties. In order to extract information based on real world properties, we need methods that are able to add such properties. With the presented work, we address these challenges using and extending the rich tool-set of Formal Concept Analysis. Here, data objects are aggregated to closed sets called formal concepts based on (unary) symbolic attributes that they have in common. The process of deriving symbolic attributes is called conceptual scaling and depends on the interpretation of the data by the analyst. The resulting hierarchical structure of concepts is called concept lattice. To infer knowledge from the concept lattice structures we introduce new methods based on sub-structures that are of standardized shape, called ordinal motifs. This novel method allows us to explain the structure of a concept lattice based on geometric aspects. Throughout our work, we focus on data representations from multiple state-of-the-art machine learning algorithms. In all cases, we elaborate extensively on how to interpret these models through derived concept lattices and develop scaling procedures specific to each algorithm. Some of the considered models are black-box models whose internal data representations are numeric with no clear real world semantics. For these, we present a method to link background knowledge to the concept lattice structure. To reduce the complexity of concept lattices we provide a new theoretical framework that allows us to generate (small) views on a concept lattice. These enable more selective and comprehensibly sized explanations for data parts that are of interest. In addition to that, we introduce methods to combine and subtract views from each other, and to identify missing or incorrect parts.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hirth, J., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Geometric Structure of Topic Models<\/span><\/span>, (2024). https:\/\/doi.org\/10.48550\/arxiv.2403.03607.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1b0ed3ebbff2d484aea73656a8c15398\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1b0ed3ebbff2d484aea73656a8c15398\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.48550\/arxiv.2403.03607\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1b0ed3ebbff2d484aea73656a8c15398\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1b0ed3ebbff2d484aea73656a8c15398\"><p>@misc{hirth2024geometric,<br\/>  author = {Hirth, Johannes and Hanika, Tom},<br\/>  keywords = {selected},<br\/>  publisher = {arXiv},<br\/>  title = {The Geometric Structure of Topic Models},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1b0ed3ebbff2d484aea73656a8c15398\"><p>%0 Generic<br\/>%1 hirth2024geometric<br\/>%A Hirth, Johannes<br\/>%A Hanika, Tom<br\/>%D 2024<br\/>%I arXiv<br\/>%R 10.48550\/arxiv.2403.03607<br\/>%T The Geometric Structure of Topic Models<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Repository for Formal Contexts<\/span>.<\/span> In: Proceedings of the 1st International Joint Conference on Conceptual Knowledge Structures (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/2404.04344\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9cd9667ebadfba3a36f95fd901e32724\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9cd9667ebadfba3a36f95fd901e32724\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9cd9667ebadfba3a36f95fd901e32724\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9cd9667ebadfba3a36f95fd901e32724\">Data is always at the center of the theoretical development and investigation of the applicability of formal concept analysis. It is therefore not surprising that a large number of data sets are repeatedly used in scholarly articles and software tools, acting as de facto standard data sets. However, the distribution of the data sets poses a problem for the sustainable development of the research field. There is a lack of a central location that provides and describes FCA data sets and links them to already known analysis results. This article analyses the current state of the dissemination of FCA data sets, presents the requirements for a central FCA repository, and highlights the challenges for this.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9cd9667ebadfba3a36f95fd901e32724\"><p>@inproceedings{hanika2024repository,<br\/>  abstract = {Data is always at the center of the theoretical development and investigation of the applicability of formal concept analysis. It is therefore not surprising that a large number of data sets are repeatedly used in scholarly articles and software tools, acting as de facto standard data sets. However, the distribution of the data sets poses a problem for the sustainable development of the research field. There is a lack of a central location that provides and describes FCA data sets and links them to already known analysis results. This article analyses the current state of the dissemination of FCA data sets, presents the requirements for a central FCA repository, and highlights the challenges for this.},<br\/>  author = {Hanika, Tom and J\u00e4schke, Robert},<br\/>  booktitle = {Proceedings of the 1st International Joint Conference on Conceptual Knowledge Structures},<br\/>  keywords = {repository},<br\/>  title = {A Repository for Formal Contexts},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9cd9667ebadfba3a36f95fd901e32724\"><p>%0 Conference Paper<br\/>%1 hanika2024repository<br\/>%A Hanika, Tom<br\/>%A J\u00e4schke, Robert<br\/>%B Proceedings of the 1st International Joint Conference on Conceptual Knowledge Structures<br\/>%D 2024<br\/>%T A Repository for Formal Contexts<br\/>%U https:\/\/arxiv.org\/abs\/2404.04344<br\/>%X Data is always at the center of the theoretical development and investigation of the applicability of formal concept analysis. It is therefore not surprising that a large number of data sets are repeatedly used in scholarly articles and software tools, acting as de facto standard data sets. However, the distribution of the data sets poses a problem for the sustainable development of the research field. There is a lack of a central location that provides and describes FCA data sets and links them to already known analysis results. This article analyses the current state of the dissemination of FCA data sets, presents the requirements for a central FCA repository, and highlights the challenges for this.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hille, T., Stubbemann, M., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Reproducibility and Geometric Intrinsic Dimensionality: An Investigation on Graph Neural Network Research<\/span><\/span>, (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9059cba53f21648c1cf1a69e71ff5248\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9059cba53f21648c1cf1a69e71ff5248\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9059cba53f21648c1cf1a69e71ff5248\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9059cba53f21648c1cf1a69e71ff5248\"><p>@preprint{hille2024reproducibility,<br\/>  author = {Hille, Tobias and Stubbemann, Maximilian and Hanika, Tom},<br\/>  keywords = {intrinsic},<br\/>  title = {Reproducibility and Geometric Intrinsic Dimensionality: An Investigation on Graph Neural Network Research},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9059cba53f21648c1cf1a69e71ff5248\"><p>%0 Generic<br\/>%1 hille2024reproducibility<br\/>%A Hille, Tobias<br\/>%A Stubbemann, Maximilian<br\/>%A Hanika, Tom<br\/>%D 2024<br\/>%T Reproducibility and Geometric Intrinsic Dimensionality: An Investigation on Graph Neural Network Research<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Abdulla, M., Hirth, J., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Birkhoff Completion of Finite Lattices<\/span>.<\/span> In: Cabrera, I.P., Ferr\u00e9, S., and Obiedkov, S. (eds.) Conceptual Knowledge Structures. pp. 20\u201335. Springer Nature Switzerland, Cham (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c01899b8872e0d7588c719596b8b007c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c01899b8872e0d7588c719596b8b007c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c01899b8872e0d7588c719596b8b007c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-c01899b8872e0d7588c719596b8b007c\">We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's simply-implicational theories. By an example, we show how the Birkhoff completion can be used as a tool for ordinal data science.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c01899b8872e0d7588c719596b8b007c\"><p>@inproceedings{10.1007\/978-3-031-67868-4_2,<br\/>  abstract = {We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's simply-implicational theories. By an example, we show how the Birkhoff completion can be used as a tool for ordinal data science.},<br\/>  address = {Cham},<br\/>  author = {Abdulla, Mohammad and Hirth, Johannes and Stumme, Gerd},<br\/>  booktitle = {Conceptual Knowledge Structures},<br\/>  editor = {Cabrera, Inma P. and Ferr\u00e9, S\u00e9bastien and Obiedkov, Sergei},<br\/>  keywords = {itegpub},<br\/>  pages = {20--35},<br\/>  publisher = {Springer Nature Switzerland},<br\/>  title = {The Birkhoff Completion of Finite Lattices},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c01899b8872e0d7588c719596b8b007c\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-031-67868-4_2<br\/>%A Abdulla, Mohammad<br\/>%A Hirth, Johannes<br\/>%A Stumme, Gerd<br\/>%B Conceptual Knowledge Structures<br\/>%C Cham<br\/>%D 2024<br\/>%E Cabrera, Inma P.<br\/>%E Ferr\u00e9, S\u00e9bastien<br\/>%E Obiedkov, Sergei<br\/>%I Springer Nature Switzerland<br\/>%P 20--35<br\/>%T The Birkhoff Completion of Finite Lattices<br\/>%X We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's simply-implicational theories. By an example, we show how the Birkhoff completion can be used as a tool for ordinal data science.<br\/>%@ 978-3-031-67868-4<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Draude, C., D\u00fcrrschnabel, D., Hirth, J., Horn, V., Kropf, J., Lamla, J., Stumme, G., Uhlmann, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Mapping of Controversies<\/span>.<\/span> In: Cabrera, I.P., Ferr\u00e9, S., and Obiedkov, S. (eds.) Conceptual Knowledge Structures. pp. 201\u2013216. Springer Nature Switzerland, Cham (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-be9662c3d87277a36c4253857cb305ed\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-be9662c3d87277a36c4253857cb305ed\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/be9662c3d87277a36c4253857cb305ed\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-be9662c3d87277a36c4253857cb305ed\">With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-be9662c3d87277a36c4253857cb305ed\"><p>@inproceedings{10.1007\/978-3-031-67868-4_14,<br\/>  abstract = {With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles.},<br\/>  address = {Cham},<br\/>  author = {Draude, Claude and D\u00fcrrschnabel, Dominik and Hirth, Johannes and Horn, Viktoria and Kropf, Jonathan and Lamla, J{\u00f6}rn and Stumme, Gerd and Uhlmann, Markus},<br\/>  booktitle = {Conceptual Knowledge Structures},<br\/>  editor = {Cabrera, Inma P. and Ferr\u00e9, S\u00e9bastien and Obiedkov, Sergei},<br\/>  keywords = {itegpub},<br\/>  pages = {201--216},<br\/>  publisher = {Springer Nature Switzerland},<br\/>  title = {Conceptual Mapping of Controversies},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-be9662c3d87277a36c4253857cb305ed\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-031-67868-4_14<br\/>%A Draude, Claude<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Hirth, Johannes<br\/>%A Horn, Viktoria<br\/>%A Kropf, Jonathan<br\/>%A Lamla, J{\u00f6}rn<br\/>%A Stumme, Gerd<br\/>%A Uhlmann, Markus<br\/>%B Conceptual Knowledge Structures<br\/>%C Cham<br\/>%D 2024<br\/>%E Cabrera, Inma P.<br\/>%E Ferr\u00e9, S\u00e9bastien<br\/>%E Obiedkov, Sergei<br\/>%I Springer Nature Switzerland<br\/>%P 201--216<br\/>%T Conceptual Mapping of Controversies<br\/>%X With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles.<br\/>%@ 978-3-031-67868-4<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hirth, J., Horn, V., Stumme, G., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ordinal motifs in lattices<\/span>.<\/span> Information Sciences. 659, 120009 (2024). https:\/\/doi.org\/https:\/\/doi.org\/10.1016\/j.ins.2023.120009.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025523015943\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cfce342df6fc34ebd60a9dbbddb0e540\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cfce342df6fc34ebd60a9dbbddb0e540\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1016\/j.ins.2023.120009\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cfce342df6fc34ebd60a9dbbddb0e540\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cfce342df6fc34ebd60a9dbbddb0e540\"><p>@article{HIRTH2024120009,<br\/>  author = {Hirth, Johannes and Horn, Viktoria and Stumme, Gerd and Hanika, Tom},<br\/>  journal = {Information Sciences},<br\/>  keywords = {itegpub},<br\/>  pages = 120009,<br\/>  title = {Ordinal motifs in lattices},<br\/>  volume = 659,<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cfce342df6fc34ebd60a9dbbddb0e540\"><p>%0 Journal Article<br\/>%1 HIRTH2024120009<br\/>%A Hirth, Johannes<br\/>%A Horn, Viktoria<br\/>%A Stumme, Gerd<br\/>%A Hanika, Tom<br\/>%D 2024<br\/>%J Information Sciences<br\/>%P 120009<br\/>%R https:\/\/doi.org\/10.1016\/j.ins.2023.120009<br\/>%T Ordinal motifs in lattices<br\/>%U https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025523015943<br\/>%V 659<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Draude, C., D{\u00fc}rrschnabel, D., Hirth, J., Horn, V., Kropf, J., Lamla, J., Stumme, G., Uhlmann, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Mapping of\u00a0Controversies<\/span>.<\/span> In: Cabrera, I.P., Ferr{\u00e9}, S., and Obiedkov, S. (eds.) Conceptual Knowledge Structures. pp. 201\u2013216. Springer Nature Switzerland, Cham (2024).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3abeb0caaa10474d1fe1d48be89bb176\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3abeb0caaa10474d1fe1d48be89bb176\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3abeb0caaa10474d1fe1d48be89bb176\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-3abeb0caaa10474d1fe1d48be89bb176\">With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3abeb0caaa10474d1fe1d48be89bb176\"><p>@inproceedings{10.1007\/978-3-031-67868-4_14,<br\/>  abstract = {With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles.},<br\/>  address = {Cham},<br\/>  author = {Draude, Claude and D{\u00fc}rrschnabel, Dominik and Hirth, Johannes and Horn, Viktoria and Kropf, Jonathan and Lamla, J{\u00f6}rn and Stumme, Gerd and Uhlmann, Markus},<br\/>  booktitle = {Conceptual Knowledge Structures},<br\/>  editor = {Cabrera, Inma P. and Ferr{\u00e9}, S{\u00e9}bastien and Obiedkov, Sergei},<br\/>  keywords = {formal_concept_analysis},<br\/>  pages = {201--216},<br\/>  publisher = {Springer Nature Switzerland},<br\/>  title = {Conceptual Mapping of\u00a0Controversies},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3abeb0caaa10474d1fe1d48be89bb176\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-031-67868-4_14<br\/>%A Draude, Claude<br\/>%A D{\u00fc}rrschnabel, Dominik<br\/>%A Hirth, Johannes<br\/>%A Horn, Viktoria<br\/>%A Kropf, Jonathan<br\/>%A Lamla, J{\u00f6}rn<br\/>%A Stumme, Gerd<br\/>%A Uhlmann, Markus<br\/>%B Conceptual Knowledge Structures<br\/>%C Cham<br\/>%D 2024<br\/>%E Cabrera, Inma P.<br\/>%E Ferr{\u00e9}, S{\u00e9}bastien<br\/>%E Obiedkov, Sergei<br\/>%I Springer Nature Switzerland<br\/>%P 201--216<br\/>%T Conceptual Mapping of\u00a0Controversies<br\/>%X With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles.<br\/>%@ 978-3-031-67868-4<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Draude, C., Engert, S., Hess, T., Hirth, J., Horn, V., Kropf, J., Lamla, J., Stumme, G., Uhlmann, M., Zwingmann, N.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Verrechnung \u2013 Design \u2013 Kultivierung: Instrumentenkasten f\u00fcr die Gestaltung fairer Gesch\u00e4ftsmodelle durch Ko-Valuation<\/span><\/span>, https:\/\/plattform-privatheit.de\/p-prv-wAssets\/Assets\/Veroeffentlichungen_WhitePaper_PolicyPaper\/whitepaper\/WP_2024_FAIRDIENSTE_1.0.pdf, (2024). https:\/\/doi.org\/10.24406\/publica-2497.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/plattform-privatheit.de\/p-prv-wAssets\/Assets\/Veroeffentlichungen_WhitePaper_PolicyPaper\/whitepaper\/WP_2024_FAIRDIENSTE_1.0.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-be31cee0b76f9489f6d607a17bd881e6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-be31cee0b76f9489f6d607a17bd881e6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.24406\/publica-2497\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/be31cee0b76f9489f6d607a17bd881e6\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-be31cee0b76f9489f6d607a17bd881e6\"><p>@misc{claude2024verrechnung,<br\/>  address = {Karlsruhe},<br\/>  author = {Draude, Claude and Engert, Simon and Hess, Thomas and Hirth, Johannes and Horn, Viktoria and Kropf, Jonathan and Lamla, J\u00f6rn and Stumme, Gerd and Uhlmann, Markus and Zwingmann, Nina},<br\/>  edition = 1,<br\/>  editor = {Friedewald, Michael and Ro\u00dfnagel, Alexander and Geminn, Christian and Karaboga, Murat},<br\/>  howpublished = {White Paper},<br\/>  keywords = {itegpub},<br\/>  month = {03},<br\/>  publisher = {Fraunhofer-Institut f\u00fcr System- und Innovationsforschung ISI},<br\/>  series = {Plattform Privatheit},<br\/>  title = {Verrechnung \u2013 Design \u2013 Kultivierung: Instrumentenkasten f\u00fcr die Gestaltung fairer Gesch\u00e4ftsmodelle durch Ko-Valuation},<br\/>  year = 2024<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-be31cee0b76f9489f6d607a17bd881e6\"><p>%0 Generic<br\/>%1 claude2024verrechnung<br\/>%A Draude, Claude<br\/>%A Engert, Simon<br\/>%A Hess, Thomas<br\/>%A Hirth, Johannes<br\/>%A Horn, Viktoria<br\/>%A Kropf, Jonathan<br\/>%A Lamla, J\u00f6rn<br\/>%A Stumme, Gerd<br\/>%A Uhlmann, Markus<br\/>%A Zwingmann, Nina<br\/>%B Plattform Privatheit<br\/>%C Karlsruhe<br\/>%D 2024<br\/>%E Friedewald, Michael<br\/>%E Ro\u00dfnagel, Alexander<br\/>%E Geminn, Christian<br\/>%E Karaboga, Murat<br\/>%I Fraunhofer-Institut f\u00fcr System- und Innovationsforschung ISI<br\/>%R 10.24406\/publica-2497<br\/>%T Verrechnung \u2013 Design \u2013 Kultivierung: Instrumentenkasten f\u00fcr die Gestaltung fairer Gesch\u00e4ftsmodelle durch Ko-Valuation<br\/>%U https:\/\/plattform-privatheit.de\/p-prv-wAssets\/Assets\/Veroeffentlichungen_WhitePaper_PolicyPaper\/whitepaper\/WP_2024_FAIRDIENSTE_1.0.pdf<br\/>%7 1<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2023\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2023<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Hille, T., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Selecting Features by their Resilience to the Curse of Dimensionality<\/span>.<\/span> (2023).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-226d9608a2279971502570f1c18c5fa4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-226d9608a2279971502570f1c18c5fa4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/226d9608a2279971502570f1c18c5fa4\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-226d9608a2279971502570f1c18c5fa4\"><p>@article{stubbemann2023selecting,<br\/>  author = {Stubbemann, Maximilian and Hille, Tobias and Hanika, Tom},<br\/>  keywords = {selecting},<br\/>  title = {Selecting Features by their Resilience to the Curse of Dimensionality},<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-226d9608a2279971502570f1c18c5fa4\"><p>%0 Journal Article<br\/>%1 stubbemann2023selecting<br\/>%A Stubbemann, Maximilian<br\/>%A Hille, Tobias<br\/>%A Hanika, Tom<br\/>%D 2023<br\/>%T Selecting Features by their Resilience to the Curse of Dimensionality<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Explaining and Visualizing Structural Knowledge in Bipartite Graphs<\/span><\/span>, https:\/\/kobra.uni-kassel.de\/handle\/123456789\/14847, (2023). https:\/\/doi.org\/10.17170\/KOBRA-202306048157.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/kobra.uni-kassel.de\/handle\/123456789\/14847\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-dac7bd03e1f6a9d0fd5f0e8a6e87dd09\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-dac7bd03e1f6a9d0fd5f0e8a6e87dd09\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.17170\/KOBRA-202306048157\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/dac7bd03e1f6a9d0fd5f0e8a6e87dd09\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-dac7bd03e1f6a9d0fd5f0e8a6e87dd09\"><p>@phdthesis{https:\/\/doi.org\/10.17170\/kobra-202306048157,<br\/>  author = {D\u00fcrrschnabel, Dominik},<br\/>  keywords = {itegpub},<br\/>  publisher = {Universit\u00e4t Kassel},<br\/>  title = {Explaining and Visualizing Structural Knowledge in Bipartite Graphs},<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-dac7bd03e1f6a9d0fd5f0e8a6e87dd09\"><p>%0 Thesis<br\/>%1 https:\/\/doi.org\/10.17170\/kobra-202306048157<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%D 2023<br\/>%I Universit\u00e4t Kassel<br\/>%R 10.17170\/KOBRA-202306048157<br\/>%T Explaining and Visualizing Structural Knowledge in Bipartite Graphs<br\/>%U https:\/\/kobra.uni-kassel.de\/handle\/123456789\/14847<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Maximal Ordinal Two-Factorizations<\/span><\/span>, http:\/\/arxiv.org\/abs\/2304.03338, (2023).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/2304.03338\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9dcf7585ac17738cf869999490083a41\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9dcf7585ac17738cf869999490083a41\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9dcf7585ac17738cf869999490083a41\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9dcf7585ac17738cf869999490083a41\">Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the incidence relation. In this work, we investigate such ordinal two-factorizations. First, we investigate for formal contexts that omit ordinal two-factorizations the disjointness of the two factors. Then, we show that deciding on the existence of two-factorizations of a given size is an NP-complete problem which makes computing maximal factorizations computationally expensive. Finally, we provide the algorithm Ord2Factor that allows us to compute large ordinal two-factorizations.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9dcf7585ac17738cf869999490083a41\"><p>@misc{durrschnabel2023maximal,<br\/>  abstract = {Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the incidence relation. In this work, we investigate such ordinal two-factorizations. First, we investigate for formal contexts that omit ordinal two-factorizations the disjointness of the two factors. Then, we show that deciding on the existence of two-factorizations of a given size is an NP-complete problem which makes computing maximal factorizations computationally expensive. Finally, we provide the algorithm Ord2Factor that allows us to compute large ordinal two-factorizations.},<br\/>  author = {D\u00fcrrschnabel, Dominik and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  note = {cite arxiv:2304.03338Comment: 14 pages, 6 figures, 2 algorithms},<br\/>  title = {Maximal Ordinal Two-Factorizations},<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9dcf7585ac17738cf869999490083a41\"><p>%0 Generic<br\/>%1 durrschnabel2023maximal<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Stumme, Gerd<br\/>%D 2023<br\/>%T Maximal Ordinal Two-Factorizations<br\/>%U http:\/\/arxiv.org\/abs\/2304.03338<br\/>%X Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the incidence relation. In this work, we investigate such ordinal two-factorizations. First, we investigate for formal contexts that omit ordinal two-factorizations the disjointness of the two factors. Then, we show that deciding on the existence of two-factorizations of a given size is an NP-complete problem which makes computing maximal factorizations computationally expensive. Finally, we provide the algorithm Ord2Factor that allows us to compute large ordinal two-factorizations.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ganter, B., Hanika, T., Hirth, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Scaling Dimension<\/span>.<\/span> In: D\u00fcrrschnabel, D. and L\u00f3pez-Rodr\u00edguez, D. (eds.) Formal Concept Analysis - 17th International Conference, ICFCA 2023, Kassel, Germany, July 17-21, 2023, Proceedings. pp. 64\u201377. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-35949-1_5.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-031-35949-1_5\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ae364c1012bb099c906b24ecdc7f688d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ae364c1012bb099c906b24ecdc7f688d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-35949-1_5\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ae364c1012bb099c906b24ecdc7f688d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ae364c1012bb099c906b24ecdc7f688d\"><p>@inproceedings{DBLP:conf\/icfca\/GanterHH23,<br\/>  author = {Ganter, Bernhard and Hanika, Tom and Hirth, Johannes},<br\/>  booktitle = {Formal Concept Analysis - 17th International Conference, ICFCA 2023, Kassel, Germany, July 17-21, 2023, Proceedings},<br\/>  editor = {D\u00fcrrschnabel, Dominik and L\u00f3pez-Rodr\u00edguez, Domingo},<br\/>  keywords = {itegpub},<br\/>  pages = {64--77},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Scaling Dimension},<br\/>  volume = 13934,<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ae364c1012bb099c906b24ecdc7f688d\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/icfca\/GanterHH23<br\/>%A Ganter, Bernhard<br\/>%A Hanika, Tom<br\/>%A Hirth, Johannes<br\/>%B Formal Concept Analysis - 17th International Conference, ICFCA 2023, Kassel, Germany, July 17-21, 2023, Proceedings<br\/>%D 2023<br\/>%E D\u00fcrrschnabel, Dominik<br\/>%E L\u00f3pez-Rodr\u00edguez, Domingo<br\/>%I Springer<br\/>%P 64--77<br\/>%R 10.1007\/978-3-031-35949-1_5<br\/>%T Scaling Dimension<br\/>%U https:\/\/doi.org\/10.1007\/978-3-031-35949-1_5<br\/>%V 13934<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Hirth, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Views on Tree Ensemble Classifiers<\/span>.<\/span> International Journal of Approximate Reasoning. 108930 (2023). https:\/\/doi.org\/https:\/\/doi.org\/10.1016\/j.ijar.2023.108930.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0888613X23000610\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-42b778646bbde71a9383f30e710f9a98\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-42b778646bbde71a9383f30e710f9a98\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1016\/j.ijar.2023.108930\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/42b778646bbde71a9383f30e710f9a98\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-42b778646bbde71a9383f30e710f9a98\">Random Forests and related tree-based methods are popular for supervised learning from table based data. Apart from their ease of parallelization, their classification performance is also superior. However, this performance, especially parallelizability, is offset by the loss of explainability. Statistical methods are often used to compensate for this disadvantage. Yet, their ability for local explanations, and in particular for global explanations, is limited. In the present work we propose an algebraic method, rooted in lattice theory, for the (global) explanation of tree ensembles. In detail, we introduce two novel conceptual views on tree ensemble classifiers and demonstrate their explanatory capabilities on Random Forests that were trained with standard parameters.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-42b778646bbde71a9383f30e710f9a98\"><p>@article{https:\/\/doi.org\/10.48550\/arxiv.2302.05270,<br\/>  abstract = {Random Forests and related tree-based methods are popular for supervised learning from table based data. Apart from their ease of parallelization, their classification performance is also superior. However, this performance, especially parallelizability, is offset by the loss of explainability. Statistical methods are often used to compensate for this disadvantage. Yet, their ability for local explanations, and in particular for global explanations, is limited. In the present work we propose an algebraic method, rooted in lattice theory, for the (global) explanation of tree ensembles. In detail, we introduce two novel conceptual views on tree ensemble classifiers and demonstrate their explanatory capabilities on Random Forests that were trained with standard parameters.},<br\/>  author = {Hanika, Tom and Hirth, Johannes},<br\/>  journal = {International Journal of Approximate Reasoning},<br\/>  keywords = {itegpub},<br\/>  pages = 108930,<br\/>  title = {Conceptual Views on Tree Ensemble Classifiers},<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-42b778646bbde71a9383f30e710f9a98\"><p>%0 Journal Article<br\/>%1 https:\/\/doi.org\/10.48550\/arxiv.2302.05270<br\/>%A Hanika, Tom<br\/>%A Hirth, Johannes<br\/>%D 2023<br\/>%J International Journal of Approximate Reasoning<br\/>%P 108930<br\/>%R https:\/\/doi.org\/10.1016\/j.ijar.2023.108930<br\/>%T Conceptual Views on Tree Ensemble Classifiers<br\/>%U https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0888613X23000610<br\/>%X Random Forests and related tree-based methods are popular for supervised learning from table based data. Apart from their ease of parallelization, their classification performance is also superior. However, this performance, especially parallelizability, is offset by the loss of explainability. Statistical methods are often used to compensate for this disadvantage. Yet, their ability for local explanations, and in particular for global explanations, is limited. In the present work we propose an algebraic method, rooted in lattice theory, for the (global) explanation of tree ensembles. In detail, we introduce two novel conceptual views on tree ensemble classifiers and demonstrate their explanatory capabilities on Random Forests that were trained with standard parameters.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hirth, J., Horn, V., Stumme, G., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Automatic Textual Explanations of Concept Lattices<\/span>.<\/span> In: Ojeda{-}Aciego, M., Sauerwald, K., and J\u00e4schke, R. (eds.) Graph-Based Representation and Reasoning - 28th International Conference on Conceptual Structures, {ICCS} 2023, Berlin, Germany, September 11-13, 2023, Proceedings. pp. 138\u2013152 (2023). https:\/\/doi.org\/doi.org\/10.1007\/978-3-031-40960-8_12.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/2304.08093\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3ed37734b0dc428a7cd8ff803cd4e924\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3ed37734b0dc428a7cd8ff803cd4e924\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"doi.org\/10.1007\/978-3-031-40960-8_12\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3ed37734b0dc428a7cd8ff803cd4e924\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-3ed37734b0dc428a7cd8ff803cd4e924\">Lattices and their order diagrams are an essential tool for communicating knowledge and insights about data. This is in particular true when applying Formal Concept Analysis. Such representations, however, are difficult to comprehend by untrained users and in general in cases where lattices are large. We tackle this problem by automatically generating textual explanations for lattices using standard scales. Our method is based on the general notion of ordinal motifs in lattices for the special case of standard scales. We show the computational complexity of identifying a small number of standard scales that cover most of the lattice structure. For these, we provide textual explanation templates, which can be applied to any occurrence of a scale in any data domain. These templates are derived using principles from human-computer interaction and allow for a comprehensive textual explanation of lattices. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard scales.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3ed37734b0dc428a7cd8ff803cd4e924\"><p>@inproceedings{hirth2023automatic,<br\/>  abstract = {Lattices and their order diagrams are an essential tool for communicating knowledge and insights about data. This is in particular true when applying Formal Concept Analysis. Such representations, however, are difficult to comprehend by untrained users and in general in cases where lattices are large. We tackle this problem by automatically generating textual explanations for lattices using standard scales. Our method is based on the general notion of ordinal motifs in lattices for the special case of standard scales. We show the computational complexity of identifying a small number of standard scales that cover most of the lattice structure. For these, we provide textual explanation templates, which can be applied to any occurrence of a scale in any data domain. These templates are derived using principles from human-computer interaction and allow for a comprehensive textual explanation of lattices. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard scales.},<br\/>  author = {Hirth, Johannes and Horn, Viktoria and Stumme, Gerd and Hanika, Tom},<br\/>  booktitle = {Graph-Based Representation and Reasoning - 28th International Conference on Conceptual Structures, {ICCS} 2023, Berlin, Germany, September 11-13, 2023, Proceedings},<br\/>  editor = {Ojeda{-}Aciego, Manuel and Sauerwald, Kai and J\u00e4schke, Robert},<br\/>  keywords = {itegpub},<br\/>  pages = {138--152},<br\/>  title = {Automatic Textual Explanations of Concept Lattices},<br\/>  volume = 14133,<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3ed37734b0dc428a7cd8ff803cd4e924\"><p>%0 Conference Paper<br\/>%1 hirth2023automatic<br\/>%A Hirth, Johannes<br\/>%A Horn, Viktoria<br\/>%A Stumme, Gerd<br\/>%A Hanika, Tom<br\/>%B Graph-Based Representation and Reasoning - 28th International Conference on Conceptual Structures, {ICCS} 2023, Berlin, Germany, September 11-13, 2023, Proceedings<br\/>%D 2023<br\/>%E Ojeda{-}Aciego, Manuel<br\/>%E Sauerwald, Kai<br\/>%E J\u00e4schke, Robert<br\/>%P 138--152<br\/>%R doi.org\/10.1007\/978-3-031-40960-8_12<br\/>%T Automatic Textual Explanations of Concept Lattices<br\/>%U http:\/\/arxiv.org\/abs\/2304.08093<br\/>%V 14133<br\/>%X Lattices and their order diagrams are an essential tool for communicating knowledge and insights about data. This is in particular true when applying Formal Concept Analysis. Such representations, however, are difficult to comprehend by untrained users and in general in cases where lattices are large. We tackle this problem by automatically generating textual explanations for lattices using standard scales. Our method is based on the general notion of ordinal motifs in lattices for the special case of standard scales. We show the computational complexity of identifying a small number of standard scales that cover most of the lattice structure. For these, we provide textual explanation templates, which can be applied to any occurrence of a scale in any data domain. These templates are derived using principles from human-computer interaction and allow for a comprehensive textual explanation of lattices. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard scales.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., D\u00fcrrschnabel, D., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Ordinal Data Science<\/span>.<\/span> Transactions on Graph Data and Knowledge. 1, 6:1\u20136:39 (2023). https:\/\/doi.org\/10.4230\/TGDK.1.1.6.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.4230\/TGDK.1.1.6\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2a81e1a16f19a49828043bca146c41c8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2a81e1a16f19a49828043bca146c41c8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.4230\/TGDK.1.1.6\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2a81e1a16f19a49828043bca146c41c8\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2a81e1a16f19a49828043bca146c41c8\"><p>@article{DBLP:journals\/tgdk\/StummeDH23,<br\/>  author = {Stumme, Gerd and D\u00fcrrschnabel, Dominik and Hanika, Tom},<br\/>  journal = {Transactions on Graph Data and Knowledge},<br\/>  keywords = {itegpub},<br\/>  number = 1,<br\/>  pages = {6:1--6:39},<br\/>  title = {Towards Ordinal Data Science},<br\/>  volume = 1,<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2a81e1a16f19a49828043bca146c41c8\"><p>%0 Journal Article<br\/>%1 DBLP:journals\/tgdk\/StummeDH23<br\/>%A Stumme, Gerd<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Hanika, Tom<br\/>%D 2023<br\/>%J Transactions on Graph Data and Knowledge<br\/>%N 1<br\/>%P 6:1--6:39<br\/>%R 10.4230\/TGDK.1.1.6<br\/>%T Towards Ordinal Data Science<br\/>%U https:\/\/doi.org\/10.4230\/TGDK.1.1.6<br\/>%V 1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Greedy Discovery of Ordinal Factors<\/span><\/span>, http:\/\/arxiv.org\/abs\/2302.11554, (2023).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/2302.11554\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5187cd8ecdb39f7e42117f524c8ca092\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5187cd8ecdb39f7e42117f524c8ca092\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5187cd8ecdb39f7e42117f524c8ca092\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5187cd8ecdb39f7e42117f524c8ca092\">In large datasets, it is hard to discover and analyze structure. It is thus common to introduce tags or keywords for the items. In applications, such datasets are then filtered based on these tags. Still, even medium-sized datasets with a few tags result in complex and for humans hard-to-navigate systems. In this work, we adopt the method of ordinal factor analysis to address this problem. An ordinal factor arranges a subset of the tags in a linear order based on their underlying structure. A complete ordinal factorization, which consists of such ordinal factors, precisely represents the original dataset. Based on such an ordinal factorization, we provide a way to discover and explain relationships between different items and attributes in the dataset. However, computing even just one ordinal factor of high cardinality is computationally complex. We thus propose the greedy algorithm in this work. This algorithm extracts ordinal factors using already existing fast algorithms developed in formal concept analysis. Then, we leverage to propose a comprehensive way to discover relationships in the dataset. We furthermore introduce a distance measure based on the representation emerging from the ordinal factorization to discover similar items. To evaluate the method, we conduct a case study on different datasets.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5187cd8ecdb39f7e42117f524c8ca092\"><p>@misc{durrschnabel2023greedy,<br\/>  abstract = {In large datasets, it is hard to discover and analyze structure. It is thus common to introduce tags or keywords for the items. In applications, such datasets are then filtered based on these tags. Still, even medium-sized datasets with a few tags result in complex and for humans hard-to-navigate systems. In this work, we adopt the method of ordinal factor analysis to address this problem. An ordinal factor arranges a subset of the tags in a linear order based on their underlying structure. A complete ordinal factorization, which consists of such ordinal factors, precisely represents the original dataset. Based on such an ordinal factorization, we provide a way to discover and explain relationships between different items and attributes in the dataset. However, computing even just one ordinal factor of high cardinality is computationally complex. We thus propose the greedy algorithm in this work. This algorithm extracts ordinal factors using already existing fast algorithms developed in formal concept analysis. Then, we leverage to propose a comprehensive way to discover relationships in the dataset. We furthermore introduce a distance measure based on the representation emerging from the ordinal factorization to discover similar items. To evaluate the method, we conduct a case study on different datasets.},<br\/>  author = {D\u00fcrrschnabel, Dominik and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  note = {cite arxiv:2302.11554Comment: 11 pages, 6 figures, 2 tables, 3 algorithms},<br\/>  title = {Greedy Discovery of Ordinal Factors},<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5187cd8ecdb39f7e42117f524c8ca092\"><p>%0 Generic<br\/>%1 durrschnabel2023greedy<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Stumme, Gerd<br\/>%D 2023<br\/>%T Greedy Discovery of Ordinal Factors<br\/>%U http:\/\/arxiv.org\/abs\/2302.11554<br\/>%X In large datasets, it is hard to discover and analyze structure. It is thus common to introduce tags or keywords for the items. In applications, such datasets are then filtered based on these tags. Still, even medium-sized datasets with a few tags result in complex and for humans hard-to-navigate systems. In this work, we adopt the method of ordinal factor analysis to address this problem. An ordinal factor arranges a subset of the tags in a linear order based on their underlying structure. A complete ordinal factorization, which consists of such ordinal factors, precisely represents the original dataset. Based on such an ordinal factorization, we provide a way to discover and explain relationships between different items and attributes in the dataset. However, computing even just one ordinal factor of high cardinality is computationally complex. We thus propose the greedy algorithm in this work. This algorithm extracts ordinal factors using already existing fast algorithms developed in formal concept analysis. Then, we leverage to propose a comprehensive way to discover relationships in the dataset. We furthermore introduce a distance measure based on the representation emerging from the ordinal factorization to discover similar items. To evaluate the method, we conduct a case study on different datasets.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Koyda, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Factorizing Lattices by Interval Relations<\/span>.<\/span> Int. J. Approx. Reason. 157, 70\u201387 (2023).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/journals\/ijar\/ijar157.html#KoydaS23\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-954abf723d6f9bf0546416fa037feb17\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-954abf723d6f9bf0546416fa037feb17\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/954abf723d6f9bf0546416fa037feb17\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-954abf723d6f9bf0546416fa037feb17\"><p>@article{koyda2023factorizing,<br\/>  author = {Koyda, Maren and Stumme, Gerd},<br\/>  journal = {Int. J. Approx. Reason.},<br\/>  keywords = {itegpub},<br\/>  pages = {70-87},<br\/>  title = {Factorizing Lattices by Interval Relations},<br\/>  volume = 157,<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-954abf723d6f9bf0546416fa037feb17\"><p>%0 Journal Article<br\/>%1 koyda2023factorizing<br\/>%A Koyda, Maren<br\/>%A Stumme, Gerd<br\/>%D 2023<br\/>%J Int. J. Approx. Reason.<br\/>%P 70-87<br\/>%T Factorizing Lattices by Interval Relations<br\/>%U http:\/\/dblp.uni-trier.de\/db\/journals\/ijar\/ijar157.html#KoydaS23<br\/>%V 157<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hirth, J., Horn, V., Stumme, G., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ordinal Motifs in Lattices<\/span><\/span>, https:\/\/arxiv.org\/abs\/2304.04827, (2023).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/2304.04827\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b1434de2be43b97abd1c908a0ebaccdd\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b1434de2be43b97abd1c908a0ebaccdd\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b1434de2be43b97abd1c908a0ebaccdd\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-b1434de2be43b97abd1c908a0ebaccdd\">Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose \/ordinal motifs\/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b1434de2be43b97abd1c908a0ebaccdd\"><p>@misc{hirth2023ordinal,<br\/>  abstract = {Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose \/ordinal motifs\/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set.},<br\/>  author = {Hirth, Johannes and Horn, Viktoria and Stumme, Gerd and Hanika, Tom},<br\/>  keywords = {itegpub},<br\/>  title = {Ordinal Motifs in Lattices},<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b1434de2be43b97abd1c908a0ebaccdd\"><p>%0 Generic<br\/>%1 hirth2023ordinal<br\/>%A Hirth, Johannes<br\/>%A Horn, Viktoria<br\/>%A Stumme, Gerd<br\/>%A Hanika, Tom<br\/>%D 2023<br\/>%T Ordinal Motifs in Lattices<br\/>%U https:\/\/arxiv.org\/abs\/2304.04827<br\/>%X Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose \/ordinal motifs\/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Hanika, T., Schneider, F.M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Intrinsic Dimension for Large-Scale Geometric Learning<\/span>.<\/span> Transactions on Machine Learning Research. (2023).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/openreview.net\/forum?id=85BfDdYMBY\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-292ea436563609314995751c9edb3c43\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-292ea436563609314995751c9edb3c43\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/292ea436563609314995751c9edb3c43\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-292ea436563609314995751c9edb3c43\"><p>@article{stubbemann2022intrinsic,<br\/>  author = {Stubbemann, Maximilian and Hanika, Tom and Schneider, Friedrich Martin},<br\/>  journal = {Transactions on Machine Learning Research},<br\/>  keywords = {itegpub},<br\/>  title = {Intrinsic Dimension for Large-Scale Geometric Learning},<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-292ea436563609314995751c9edb3c43\"><p>%0 Journal Article<br\/>%1 stubbemann2022intrinsic<br\/>%A Stubbemann, Maximilian<br\/>%A Hanika, Tom<br\/>%A Schneider, Friedrich Martin<br\/>%D 2023<br\/>%J Transactions on Machine Learning Research<br\/>%T Intrinsic Dimension for Large-Scale Geometric Learning<br\/>%U https:\/\/openreview.net\/forum?id=85BfDdYMBY<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Felde, M., Koyda, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Interval-dismantling for lattices<\/span>.<\/span> International Journal of Approximate Reasoning. 159, 108931 (2023). https:\/\/doi.org\/10.1016\/j.ijar.2023.108931.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0888613X23000622\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5a88357f3c6b8e71274c65f04cc41cc7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5a88357f3c6b8e71274c65f04cc41cc7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1016\/j.ijar.2023.108931\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5a88357f3c6b8e71274c65f04cc41cc7\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5a88357f3c6b8e71274c65f04cc41cc7\">Dismantling allows for the removal of elements from a poset, or in our case lattice, without disturbing the remaining structure. In this paper we have extended the notion of dismantling by single elements to the dismantling by intervals in a lattice. We utilize theory from Formal Concept Analysis (FCA) to show that lattices dismantled by intervals correspond to closed subrelations in the respective formal context, and that there exists a unique core with respect to dismantling by intervals. Furthermore, we show that dismantling intervals can be identified directly in the formal context utilizing a characterization via arrow relations and provide an algorithm to compute all dismantling intervals.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5a88357f3c6b8e71274c65f04cc41cc7\"><p>@article{FELDE2023108931,<br\/>  abstract = {Dismantling allows for the removal of elements from a poset, or in our case lattice, without disturbing the remaining structure. In this paper we have extended the notion of dismantling by single elements to the dismantling by intervals in a lattice. We utilize theory from Formal Concept Analysis (FCA) to show that lattices dismantled by intervals correspond to closed subrelations in the respective formal context, and that there exists a unique core with respect to dismantling by intervals. Furthermore, we show that dismantling intervals can be identified directly in the formal context utilizing a characterization via arrow relations and provide an algorithm to compute all dismantling intervals.},<br\/>  author = {Felde, Maximilian and Koyda, Maren},<br\/>  journal = {International Journal of Approximate Reasoning},<br\/>  keywords = {Concept_lattice},<br\/>  pages = 108931,<br\/>  title = {Interval-dismantling for lattices},<br\/>  volume = 159,<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5a88357f3c6b8e71274c65f04cc41cc7\"><p>%0 Journal Article<br\/>%1 FELDE2023108931<br\/>%A Felde, Maximilian<br\/>%A Koyda, Maren<br\/>%D 2023<br\/>%J International Journal of Approximate Reasoning<br\/>%P 108931<br\/>%R 10.1016\/j.ijar.2023.108931<br\/>%T Interval-dismantling for lattices<br\/>%U https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0888613X23000622<br\/>%V 159<br\/>%X Dismantling allows for the removal of elements from a poset, or in our case lattice, without disturbing the remaining structure. In this paper we have extended the notion of dismantling by single elements to the dismantling by intervals in a lattice. We utilize theory from Formal Concept Analysis (FCA) to show that lattices dismantled by intervals correspond to closed subrelations in the respective formal context, and that there exists a unique core with respect to dismantling by intervals. Furthermore, we show that dismantling intervals can be identified directly in the formal context utilizing a characterization via arrow relations and provide an algorithm to compute all dismantling intervals.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Sch\u00e4fermeier, B., Hirth, J., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Research Topic Flows in Co-Authorship Networks<\/span>.<\/span> Scientometrics. 128, 5051\u20135078 (2023). https:\/\/doi.org\/10.1007\/s11192-022-04529-w.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3688d07e1cd8318ef9665336665825b5\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3688d07e1cd8318ef9665336665825b5\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s11192-022-04529-w\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3688d07e1cd8318ef9665336665825b5\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-3688d07e1cd8318ef9665336665825b5\">In scientometrics, scientific collaboration is often analyzed by means of co-authorships. An aspect which is often overlooked and more difficult to quantify is the flow of expertise between authors from different research topics, which is an important part of scientific progress. With the Topic Flow Network (TFN) we propose a graph structure for the analysis of research topic flows between scientific authors and their respective research fields. Based on a multi-graph and a topic model, our proposed network structure accounts for intratopic as well as intertopic flows. Our method requires for the construction of a TFN solely a corpus of publications (i.e., author and abstract information). From this, research topics are discovered automatically through non-negative matrix factorization. The thereof derived TFN allows for the application of social network analysis techniques, such as common metrics and community detection. Most importantly, it allows for the analysis of intertopic flows on a large, macroscopic scale, i.e., between research topic, as well as on a microscopic scale, i.e., between certain sets of authors. We demonstrate the utility of TFNs by applying our method to two comprehensive corpora of altogether 20 Mio. publications spanning more than 60 years of research in the fields computer science and mathematics. Our results give evidence that TFNs are suitable, e.g., for the analysis of topical communities, the discovery of important authors in different fields, and, most notably, the analysis of intertopic flows, i.e., the transfer of topical expertise. Besides that, our method opens new directions for future research, such as the investigation of influence relationships between research fields.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3688d07e1cd8318ef9665336665825b5\"><p>@article{schafermeier2022research,<br\/>  abstract = {In scientometrics, scientific collaboration is often analyzed by means of co-authorships. An aspect which is often overlooked and more difficult to quantify is the flow of expertise between authors from different research topics, which is an important part of scientific progress. With the Topic Flow Network (TFN) we propose a graph structure for the analysis of research topic flows between scientific authors and their respective research fields. Based on a multi-graph and a topic model, our proposed network structure accounts for intratopic as well as intertopic flows. Our method requires for the construction of a TFN solely a corpus of publications (i.e., author and abstract information). From this, research topics are discovered automatically through non-negative matrix factorization. The thereof derived TFN allows for the application of social network analysis techniques, such as common metrics and community detection. Most importantly, it allows for the analysis of intertopic flows on a large, macroscopic scale, i.e., between research topic, as well as on a microscopic scale, i.e., between certain sets of authors. We demonstrate the utility of TFNs by applying our method to two comprehensive corpora of altogether 20 Mio. publications spanning more than 60 years of research in the fields computer science and mathematics. Our results give evidence that TFNs are suitable, e.g., for the analysis of topical communities, the discovery of important authors in different fields, and, most notably, the analysis of intertopic flows, i.e., the transfer of topical expertise. Besides that, our method opens new directions for future research, such as the investigation of influence relationships between research fields.},<br\/>  author = {Sch\u00e4fermeier, Bastian and Hirth, Johannes and Hanika, Tom},<br\/>  journal = {Scientometrics},<br\/>  keywords = {co-authorships},<br\/>  month = {09},<br\/>  number = 9,<br\/>  pages = {5051--5078},<br\/>  title = {Research Topic Flows in Co-Authorship Networks},<br\/>  volume = 128,<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3688d07e1cd8318ef9665336665825b5\"><p>%0 Journal Article<br\/>%1 schafermeier2022research<br\/>%A Sch\u00e4fermeier, Bastian<br\/>%A Hirth, Johannes<br\/>%A Hanika, Tom<br\/>%D 2023<br\/>%J Scientometrics<br\/>%N 9<br\/>%P 5051--5078<br\/>%R 10.1007\/s11192-022-04529-w<br\/>%T Research Topic Flows in Co-Authorship Networks<br\/>%V 128<br\/>%X In scientometrics, scientific collaboration is often analyzed by means of co-authorships. An aspect which is often overlooked and more difficult to quantify is the flow of expertise between authors from different research topics, which is an important part of scientific progress. With the Topic Flow Network (TFN) we propose a graph structure for the analysis of research topic flows between scientific authors and their respective research fields. Based on a multi-graph and a topic model, our proposed network structure accounts for intratopic as well as intertopic flows. Our method requires for the construction of a TFN solely a corpus of publications (i.e., author and abstract information). From this, research topics are discovered automatically through non-negative matrix factorization. The thereof derived TFN allows for the application of social network analysis techniques, such as common metrics and community detection. Most importantly, it allows for the analysis of intertopic flows on a large, macroscopic scale, i.e., between research topic, as well as on a microscopic scale, i.e., between certain sets of authors. We demonstrate the utility of TFNs by applying our method to two comprehensive corpora of altogether 20 Mio. publications spanning more than 60 years of research in the fields computer science and mathematics. Our results give evidence that TFNs are suitable, e.g., for the analysis of topical communities, the discovery of important authors in different fields, and, most notably, the analysis of intertopic flows, i.e., the transfer of topical expertise. Besides that, our method opens new directions for future research, such as the investigation of influence relationships between research fields.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks<\/span>.<\/span> In: Machine Learning and Knowledge Discovery in Databases: Research Track - European Conference, {ECML} {PKDD} 2023, Turin, Italy, September 18-22, 2023, Proceedings, Part {III}. pp. 177\u2013192. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-43418-1\\_11.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-031-43418-1_11\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fb8ae709902d30541a60fda1fef3992a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fb8ae709902d30541a60fda1fef3992a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-43418-1\\_11\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fb8ae709902d30541a60fda1fef3992a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fb8ae709902d30541a60fda1fef3992a\"><p>@inproceedings{DBLP:conf\/pkdd\/StubbemannS23,<br\/>  author = {Stubbemann, Maximilian and Stumme, Gerd},<br\/>  booktitle = {Machine Learning and Knowledge Discovery in Databases: Research Track - European Conference, {ECML} {PKDD} 2023, Turin, Italy, September 18-22, 2023, Proceedings, Part {III}},<br\/>  keywords = {itegpub},<br\/>  pages = {177--192},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks},<br\/>  volume = 14171,<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fb8ae709902d30541a60fda1fef3992a\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/pkdd\/StubbemannS23<br\/>%A Stubbemann, Maximilian<br\/>%A Stumme, Gerd<br\/>%B Machine Learning and Knowledge Discovery in Databases: Research Track - European Conference, {ECML} {PKDD} 2023, Turin, Italy, September 18-22, 2023, Proceedings, Part {III}<br\/>%D 2023<br\/>%I Springer<br\/>%P 177--192<br\/>%R 10.1007\/978-3-031-43418-1\\_11<br\/>%T The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks<br\/>%U https:\/\/doi.org\/10.1007\/978-3-031-43418-1_11<br\/>%V 14171<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Felde, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Interactive collaborative exploration using incomplete contexts<\/span>.<\/span> Data &amp; Knowledge Engineering. 143, 102104 (2023). https:\/\/doi.org\/10.1016\/j.datak.2022.102104.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1016%2Fj.datak.2022.102104\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d40e6e17ef74ae0ba782f151d7a15de1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d40e6e17ef74ae0ba782f151d7a15de1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1016\/j.datak.2022.102104\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d40e6e17ef74ae0ba782f151d7a15de1\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d40e6e17ef74ae0ba782f151d7a15de1\"><p>@article{Felde_2023,<br\/>  author = {Felde, Maximilian and Stumme, Gerd},<br\/>  journal = {Data & Knowledge Engineering},<br\/>  keywords = {itegpub},<br\/>  month = {01},<br\/>  pages = 102104,<br\/>  publisher = {Elsevier {BV}},<br\/>  title = {Interactive collaborative exploration using incomplete contexts},<br\/>  volume = 143,<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d40e6e17ef74ae0ba782f151d7a15de1\"><p>%0 Journal Article<br\/>%1 Felde_2023<br\/>%A Felde, Maximilian<br\/>%A Stumme, Gerd<br\/>%D 2023<br\/>%I Elsevier {BV}<br\/>%J Data & Knowledge Engineering<br\/>%P 102104<br\/>%R 10.1016\/j.datak.2022.102104<br\/>%T Interactive collaborative exploration using incomplete contexts<br\/>%U https:\/\/doi.org\/10.1016%2Fj.datak.2022.102104<br\/>%V 143<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Drawing Order Diagrams Through Two-Dimension Extension<\/span>.<\/span> Journal of Graph Algorithms and Applications. 27, 783\u2013802 (2023). https:\/\/doi.org\/10.7155\/jgaa.00645.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.7155\/jgaa.00645\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fd95bbf455a80e1e2c5995e57496ce44\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fd95bbf455a80e1e2c5995e57496ce44\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.7155\/jgaa.00645\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fd95bbf455a80e1e2c5995e57496ce44\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fd95bbf455a80e1e2c5995e57496ce44\"><p>@article{drrschnabel2023drawing,<br\/>  author = {D\u00fcrrschnabel, Dominik and Hanika, Tom and Stumme, Gerd},<br\/>  journal = {Journal of Graph Algorithms and Applications},<br\/>  keywords = {linear_extension},<br\/>  number = 9,<br\/>  pages = {783\u2013802},<br\/>  publisher = {Journal of Graph Algorithms and Applications},<br\/>  title = {Drawing Order Diagrams Through Two-Dimension Extension},<br\/>  volume = 27,<br\/>  year = 2023<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fd95bbf455a80e1e2c5995e57496ce44\"><p>%0 Journal Article<br\/>%1 drrschnabel2023drawing<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%D 2023<br\/>%I Journal of Graph Algorithms and Applications<br\/>%J Journal of Graph Algorithms and Applications<br\/>%N 9<br\/>%P 783\u2013802<br\/>%R 10.7155\/jgaa.00645<br\/>%T Drawing Order Diagrams Through Two-Dimension Extension<br\/>%U http:\/\/dx.doi.org\/10.7155\/jgaa.00645<br\/>%V 27<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2022\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2022<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Felde, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Attribute Exploration with Multiple Contradicting Partial Experts<\/span>.<\/span> In: Braun, T., Cristea, D., and J{\u00e4}schke, R. (eds.) Graph-Based Representation and Reasoning. pp. 51\u201365. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-16663-1_5.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-aeb8cbd9bed2e073695486d55e85b171\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-aeb8cbd9bed2e073695486d55e85b171\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-16663-1_5\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/aeb8cbd9bed2e073695486d55e85b171\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-aeb8cbd9bed2e073695486d55e85b171\">Attribute exploration is a method from Formal Concept Analysis (FCA) that helps a domain expert discover structural dependencies in knowledge domains which can be represented as formal contexts (cross tables of objects and attributes). In this paper we present an extension of attribute exploration that allows for a group of domain experts and explores their shared views. Each expert has their own view of the domain and the views of multiple experts may contain contradicting information.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-aeb8cbd9bed2e073695486d55e85b171\"><p>@inproceedings{10.1007\/978-3-031-16663-1_5,<br\/>  abstract = {Attribute exploration is a method from Formal Concept Analysis (FCA) that helps a domain expert discover structural dependencies in knowledge domains which can be represented as formal contexts (cross tables of objects and attributes). In this paper we present an extension of attribute exploration that allows for a group of domain experts and explores their shared views. Each expert has their own view of the domain and the views of multiple experts may contain contradicting information.},<br\/>  address = {Cham},<br\/>  author = {Felde, Maximilian and Stumme, Gerd},<br\/>  booktitle = {Graph-Based Representation and Reasoning},<br\/>  editor = {Braun, Tanya and Cristea, Diana and J{\u00e4}schke, Robert},<br\/>  keywords = {attribute-exploration},<br\/>  pages = {51--65},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {Attribute Exploration with Multiple Contradicting Partial Experts},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-aeb8cbd9bed2e073695486d55e85b171\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-031-16663-1_5<br\/>%A Felde, Maximilian<br\/>%A Stumme, Gerd<br\/>%B Graph-Based Representation and Reasoning<br\/>%C Cham<br\/>%D 2022<br\/>%E Braun, Tanya<br\/>%E Cristea, Diana<br\/>%E J{\u00e4}schke, Robert<br\/>%I Springer International Publishing<br\/>%P 51--65<br\/>%R 10.1007\/978-3-031-16663-1_5<br\/>%T Attribute Exploration with Multiple Contradicting Partial Experts<br\/>%X Attribute exploration is a method from Formal Concept Analysis (FCA) that helps a domain expert discover structural dependencies in knowledge domains which can be represented as formal contexts (cross tables of objects and attributes). In this paper we present an extension of attribute exploration that allows for a group of domain experts and explores their shared views. Each expert has their own view of the domain and the views of multiple experts may contain contradicting information.<br\/>%@ 978-3-031-16663-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Hanika, T., Schneider, F.M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Intrinsic Dimension for Large-Scale Geometric Learning<\/span><\/span>, https:\/\/arxiv.org\/abs\/2210.05301, (2022).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/2210.05301\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d1cdb269c51959c9595ced057c431d25\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d1cdb269c51959c9595ced057c431d25\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d1cdb269c51959c9595ced057c431d25\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d1cdb269c51959c9595ced057c431d25\"><p>@misc{stubbemann2022intrinsic,<br\/>  author = {Stubbemann, Maximilian and Hanika, Tom and Schneider, Friedrich Martin},<br\/>  keywords = {outdated},<br\/>  title = {Intrinsic Dimension for Large-Scale Geometric Learning},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d1cdb269c51959c9595ced057c431d25\"><p>%0 Generic<br\/>%1 stubbemann2022intrinsic<br\/>%A Stubbemann, Maximilian<br\/>%A Hanika, Tom<br\/>%A Schneider, Friedrich Martin<br\/>%D 2022<br\/>%T Intrinsic Dimension for Large-Scale Geometric Learning<br\/>%U https:\/\/arxiv.org\/abs\/2210.05301<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Hirth, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On the lattice of conceptual measurements<\/span>.<\/span> Information Sciences. 613, 453\u2013468 (2022). https:\/\/doi.org\/https:\/\/doi.org\/10.1016\/j.ins.2022.09.005.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025522010489\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-752bc4553487e6472b22faf56e744cad\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-752bc4553487e6472b22faf56e744cad\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1016\/j.ins.2022.09.005\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/752bc4553487e6472b22faf56e744cad\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-752bc4553487e6472b22faf56e744cad\">We present a novel approach for data set scaling based on scale-measures from formal concept analysis, i.e., continuous maps between closure systems, for which we derive a canonical representation. Moreover, we prove that scale-measures can be lattice ordered using the canonical representation. This enables exploring the set of scale-measures by the use of meet and join operations. Furthermore we show that the lattice of scale-measures is isomorphic to the lattice of sub-closure systems that arises from the original data. Finally, we provide another representation of scale-measures using propositional logic in terms of data set features. Our theoretical findings are discussed by means of examples.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-752bc4553487e6472b22faf56e744cad\"><p>@article{hanika2020lattice,<br\/>  abstract = {We present a novel approach for data set scaling based on scale-measures from formal concept analysis, i.e., continuous maps between closure systems, for which we derive a canonical representation. Moreover, we prove that scale-measures can be lattice ordered using the canonical representation. This enables exploring the set of scale-measures by the use of meet and join operations. Furthermore we show that the lattice of scale-measures is isomorphic to the lattice of sub-closure systems that arises from the original data. Finally, we provide another representation of scale-measures using propositional logic in terms of data set features. Our theoretical findings are discussed by means of examples.},<br\/>  author = {Hanika, Tom and Hirth, Johannes},<br\/>  journal = {Information Sciences},<br\/>  keywords = {selected},<br\/>  pages = {453-468},<br\/>  title = {On the lattice of conceptual measurements},<br\/>  volume = 613,<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-752bc4553487e6472b22faf56e744cad\"><p>%0 Journal Article<br\/>%1 hanika2020lattice<br\/>%A Hanika, Tom<br\/>%A Hirth, Johannes<br\/>%D 2022<br\/>%J Information Sciences<br\/>%P 453-468<br\/>%R https:\/\/doi.org\/10.1016\/j.ins.2022.09.005<br\/>%T On the lattice of conceptual measurements<br\/>%U https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025522010489<br\/>%V 613<br\/>%X We present a novel approach for data set scaling based on scale-measures from formal concept analysis, i.e., continuous maps between closure systems, for which we derive a canonical representation. Moreover, we prove that scale-measures can be lattice ordered using the canonical representation. This enables exploring the set of scale-measures by the use of meet and join operations. Furthermore we show that the lattice of scale-measures is isomorphic to the lattice of sub-closure systems that arises from the original data. Finally, we provide another representation of scale-measures using propositional logic in terms of data set features. Our theoretical findings are discussed by means of examples.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Schneider, F.M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Intrinsic dimension of geometric data sets}<\/span>.<\/span> Tohoku Mathematical Journal. 74, 23\u201352 (2022). https:\/\/doi.org\/10.2748\/tmj.20201015a.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.2748\/tmj.20201015a\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-34cd317c997745ba26b40684b702987a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-34cd317c997745ba26b40684b702987a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.2748\/tmj.20201015a\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/34cd317c997745ba26b40684b702987a\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-34cd317c997745ba26b40684b702987a\">The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML\/KD-algorithms, as illustrated by various experiments.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-34cd317c997745ba26b40684b702987a\"><p>@article{10.2748\/tmj.20201015a,<br\/>  abstract = {The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML\/KD-algorithms, as illustrated by various experiments.},<br\/>  author = {Hanika, Tom and Schneider, Friedrich Martin and Stumme, Gerd},<br\/>  journal = {Tohoku Mathematical Journal},<br\/>  keywords = {itegpub},<br\/>  number = 1,<br\/>  pages = {23 -- 52},<br\/>  publisher = {Tohoku University, Mathematical Institute},<br\/>  title = {{Intrinsic dimension of geometric data sets}},<br\/>  volume = 74,<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-34cd317c997745ba26b40684b702987a\"><p>%0 Journal Article<br\/>%1 10.2748\/tmj.20201015a<br\/>%A Hanika, Tom<br\/>%A Schneider, Friedrich Martin<br\/>%A Stumme, Gerd<br\/>%D 2022<br\/>%I Tohoku University, Mathematical Institute<br\/>%J Tohoku Mathematical Journal<br\/>%N 1<br\/>%P 23 -- 52<br\/>%R 10.2748\/tmj.20201015a<br\/>%T {Intrinsic dimension of geometric data sets}<br\/>%U https:\/\/doi.org\/10.2748\/tmj.20201015a<br\/>%V 74<br\/>%X The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML\/KD-algorithms, as illustrated by various experiments.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Discovering Locally Maximal Bipartite Subgraphs<\/span><\/span>, http:\/\/arxiv.org\/abs\/2211.10446, (2022).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/2211.10446\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fc9773815aa51c5aa3f70f440314e48d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fc9773815aa51c5aa3f70f440314e48d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fc9773815aa51c5aa3f70f440314e48d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-fc9773815aa51c5aa3f70f440314e48d\">Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of this problem, where we discard the maximality constraint in favor of inclusion maximality. Thus, we aim to discover locally maximal bipartite subgraphs. For this, we present three heuristic approaches to extract such subgraphs and compare their results to the solutions of the global problem. For the latter, we employ the algorithmic strength of fast SAT-solvers. Our three proposed heuristics are based on a greedy strategy, a simulated annealing approach, and a genetic algorithm, respectively. We evaluate all four algorithms with respect to their time requirement and the vertex cardinality of the discovered bipartite subgraphs on several benchmark datasets<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fc9773815aa51c5aa3f70f440314e48d\"><p>@misc{durrschnabel2022discovering,<br\/>  abstract = {Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of this problem, where we discard the maximality constraint in favor of inclusion maximality. Thus, we aim to discover locally maximal bipartite subgraphs. For this, we present three heuristic approaches to extract such subgraphs and compare their results to the solutions of the global problem. For the latter, we employ the algorithmic strength of fast SAT-solvers. Our three proposed heuristics are based on a greedy strategy, a simulated annealing approach, and a genetic algorithm, respectively. We evaluate all four algorithms with respect to their time requirement and the vertex cardinality of the discovered bipartite subgraphs on several benchmark datasets},<br\/>  author = {D\u00fcrrschnabel, Dominik and Hanika, Tom and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  note = {cite arxiv:2211.10446Comment: 12 pages, 3 figures, 3 tables},<br\/>  title = {Discovering Locally Maximal Bipartite Subgraphs},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fc9773815aa51c5aa3f70f440314e48d\"><p>%0 Generic<br\/>%1 durrschnabel2022discovering<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%D 2022<br\/>%T Discovering Locally Maximal Bipartite Subgraphs<br\/>%U http:\/\/arxiv.org\/abs\/2211.10446<br\/>%X Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of this problem, where we discard the maximality constraint in favor of inclusion maximality. Thus, we aim to discover locally maximal bipartite subgraphs. For this, we present three heuristic approaches to extract such subgraphs and compare their results to the solutions of the global problem. For the latter, we employ the algorithmic strength of fast SAT-solvers. Our three proposed heuristics are based on a greedy strategy, a simulated annealing approach, and a genetic algorithm, respectively. We evaluate all four algorithms with respect to their time requirement and the vertex cardinality of the discovered bipartite subgraphs on several benchmark datasets<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Hanika, T., Stubbemann, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">FCA2VEC: Embedding Techniques for Formal Concept Analysis<\/span>.<\/span> In: Missaoui, R., Kwuida, L., and Abdessalem, T. (eds.) Complex Data Analytics with Formal Concept Analysis. pp. 47\u201374. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-93278-7_3.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-030-93278-7_3\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cec583ac8e44dca6390b54f6166d5fcf\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cec583ac8e44dca6390b54f6166d5fcf\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-93278-7_3\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cec583ac8e44dca6390b54f6166d5fcf\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-cec583ac8e44dca6390b54f6166d5fcf\">Embedding large and high dimensional data into low dimensional vector spaces is a necessary task to computationally cope with contemporary data sets. Superseding `latent semantic analysis' recent approaches like `word2vec' or `node2vec' are well established tools in this realm. In the present paper we add to this line of research by introducing `fca2vec', a family of embedding techniques for formal concept analysis (FCA). Our investigation contributes to two distinct lines of research. First, we enable the application of FCA notions to large data sets. In particular, we demonstrate how the cover relation of a concept lattice can be retrieved from a computationally feasible embedding. Secondly, we show an enhancement for the classical node2vec approach in low dimension. For both directions the overall constraint of FCA of explainable results is preserved. We evaluate our novel procedures by computing fca2vec on different data sets like, wiki44 (a dense part of the Wikidata knowledge graph), the Mushroom data set and a publication network derived from the FCA community.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cec583ac8e44dca6390b54f6166d5fcf\"><p>@inbook{D\u00fcrrschnabel2022,<br\/>  abstract = {Embedding large and high dimensional data into low dimensional vector spaces is a necessary task to computationally cope with contemporary data sets. Superseding `latent semantic analysis' recent approaches like `word2vec' or `node2vec' are well established tools in this realm. In the present paper we add to this line of research by introducing `fca2vec', a family of embedding techniques for formal concept analysis (FCA). Our investigation contributes to two distinct lines of research. First, we enable the application of FCA notions to large data sets. In particular, we demonstrate how the cover relation of a concept lattice can be retrieved from a computationally feasible embedding. Secondly, we show an enhancement for the classical node2vec approach in low dimension. For both directions the overall constraint of FCA of explainable results is preserved. We evaluate our novel procedures by computing fca2vec on different data sets like, wiki44 (a dense part of the Wikidata knowledge graph), the Mushroom data set and a publication network derived from the FCA community.},<br\/>  address = {Cham},<br\/>  author = {D\u00fcrrschnabel, Dominik and Hanika, Tom and Stubbemann, Maximilian},<br\/>  booktitle = {Complex Data Analytics with Formal Concept Analysis},<br\/>  editor = {Missaoui, Rokia and Kwuida, L{\u00e9}onard and Abdessalem, Talel},<br\/>  keywords = {fca2vec},<br\/>  pages = {47--74},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {FCA2VEC: Embedding Techniques for Formal Concept Analysis},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cec583ac8e44dca6390b54f6166d5fcf\"><p>%0 Book Section<br\/>%1 D\u00fcrrschnabel2022<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Hanika, Tom<br\/>%A Stubbemann, Maximilian<br\/>%B Complex Data Analytics with Formal Concept Analysis<br\/>%C Cham<br\/>%D 2022<br\/>%E Missaoui, Rokia<br\/>%E Kwuida, L{\u00e9}onard<br\/>%E Abdessalem, Talel<br\/>%I Springer International Publishing<br\/>%P 47--74<br\/>%R 10.1007\/978-3-030-93278-7_3<br\/>%T FCA2VEC: Embedding Techniques for Formal Concept Analysis<br\/>%U https:\/\/doi.org\/10.1007\/978-3-030-93278-7_3<br\/>%X Embedding large and high dimensional data into low dimensional vector spaces is a necessary task to computationally cope with contemporary data sets. Superseding `latent semantic analysis' recent approaches like `word2vec' or `node2vec' are well established tools in this realm. In the present paper we add to this line of research by introducing `fca2vec', a family of embedding techniques for formal concept analysis (FCA). Our investigation contributes to two distinct lines of research. First, we enable the application of FCA notions to large data sets. In particular, we demonstrate how the cover relation of a concept lattice can be retrieved from a computationally feasible embedding. Secondly, we show an enhancement for the classical node2vec approach in low dimension. For both directions the overall constraint of FCA of explainable results is preserved. We evaluate our novel procedures by computing fca2vec on different data sets like, wiki44 (a dense part of the Wikidata knowledge graph), the Mushroom data set and a publication network derived from the FCA community.<br\/>%@ 978-3-030-93278-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hirth, J., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Formal Conceptual Views in Neural Networks<\/span><\/span>, http:\/\/arxiv.org\/abs\/2209.13517, (2022).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/2209.13517\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d40a5033ba022c8f88208c8ec83eb171\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d40a5033ba022c8f88208c8ec83eb171\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d40a5033ba022c8f88208c8ec83eb171\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-d40a5033ba022c8f88208c8ec83eb171\">Explaining neural network models is a challenging task that remains unsolved in its entirety to this day. This is especially true for high dimensional and complex data. With the present work, we introduce two notions for conceptual views of a neural network, specifically a many-valued and a symbolic view. Both provide novel analysis methods to enable a human AI analyst to grasp deeper insights into the knowledge that is captured by the neurons of a network. We test the conceptual expressivity of our novel views through different experiments on the ImageNet and Fruit-360 data sets. Furthermore, we show to which extent the views allow to quantify the conceptual similarity of different learning architectures. Finally, we demonstrate how conceptual views can be applied for abductive learning of human comprehensible rules from neurons. In summary, with our work, we contribute to the most relevant task of globally explaining neural networks models.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d40a5033ba022c8f88208c8ec83eb171\"><p>@misc{hirth2022formal,<br\/>  abstract = {Explaining neural network models is a challenging task that remains unsolved in its entirety to this day. This is especially true for high dimensional and complex data. With the present work, we introduce two notions for conceptual views of a neural network, specifically a many-valued and a symbolic view. Both provide novel analysis methods to enable a human AI analyst to grasp deeper insights into the knowledge that is captured by the neurons of a network. We test the conceptual expressivity of our novel views through different experiments on the ImageNet and Fruit-360 data sets. Furthermore, we show to which extent the views allow to quantify the conceptual similarity of different learning architectures. Finally, we demonstrate how conceptual views can be applied for abductive learning of human comprehensible rules from neurons. In summary, with our work, we contribute to the most relevant task of globally explaining neural networks models.},<br\/>  author = {Hirth, Johannes and Hanika, Tom},<br\/>  keywords = {NN},<br\/>  note = {cite arxiv:2209.13517Comment: 17 pages, 8 figures, 9 tables},<br\/>  title = {Formal Conceptual Views in Neural Networks},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d40a5033ba022c8f88208c8ec83eb171\"><p>%0 Generic<br\/>%1 hirth2022formal<br\/>%A Hirth, Johannes<br\/>%A Hanika, Tom<br\/>%D 2022<br\/>%T Formal Conceptual Views in Neural Networks<br\/>%U http:\/\/arxiv.org\/abs\/2209.13517<br\/>%X Explaining neural network models is a challenging task that remains unsolved in its entirety to this day. This is especially true for high dimensional and complex data. With the present work, we introduce two notions for conceptual views of a neural network, specifically a many-valued and a symbolic view. Both provide novel analysis methods to enable a human AI analyst to grasp deeper insights into the knowledge that is captured by the neurons of a network. We test the conceptual expressivity of our novel views through different experiments on the ImageNet and Fruit-360 data sets. Furthermore, we show to which extent the views allow to quantify the conceptual similarity of different learning architectures. Finally, we demonstrate how conceptual views can be applied for abductive learning of human comprehensible rules from neurons. In summary, with our work, we contribute to the most relevant task of globally explaining neural networks models.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Felde, M., Koyda, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Interval-Dismantling for Lattices<\/span><\/span>, https:\/\/arxiv.org\/abs\/2208.01479, (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.01479.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/2208.01479\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3cd2993bfff6d11a7c48d4b57895b953\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3cd2993bfff6d11a7c48d4b57895b953\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.48550\/arXiv.2208.01479\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3cd2993bfff6d11a7c48d4b57895b953\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-3cd2993bfff6d11a7c48d4b57895b953\">Dismantling allows for the removal of elements of a set, or in our case lattice, without disturbing the remaining structure. In this paper we have extended the notion of dismantling by single elements to the dismantling by intervals in a lattice. We utilize theory from Formal Concept Analysis (FCA) to show that lattices dismantled by intervals correspond to closed subrelations in the respective formal context, and that there exists a unique kernel with respect to dismantling by intervals. Furthermore, we show that dismantling intervals can be identified directly in the formal context utilizing a characterization via arrow relations and provide an algorithm to compute all dismantling intervals.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3cd2993bfff6d11a7c48d4b57895b953\"><p>@preprint{felde2022intervaldismantling,<br\/>  abstract = {Dismantling allows for the removal of elements of a set, or in our case lattice, without disturbing the remaining structure. In this paper we have extended the notion of dismantling by single elements to the dismantling by intervals in a lattice. We utilize theory from Formal Concept Analysis (FCA) to show that lattices dismantled by intervals correspond to closed subrelations in the respective formal context, and that there exists a unique kernel with respect to dismantling by intervals. Furthermore, we show that dismantling intervals can be identified directly in the formal context utilizing a characterization via arrow relations and provide an algorithm to compute all dismantling intervals.},<br\/>  author = {Felde, Maximilian and Koyda, Maren},<br\/>  keywords = {myown},<br\/>  note = {cite arxiv:2208.01479Comment: 12 pages, 5 figures, 1 algorithm},<br\/>  title = {Interval-Dismantling for Lattices},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3cd2993bfff6d11a7c48d4b57895b953\"><p>%0 Generic<br\/>%1 felde2022intervaldismantling<br\/>%A Felde, Maximilian<br\/>%A Koyda, Maren<br\/>%D 2022<br\/>%R 10.48550\/arXiv.2208.01479<br\/>%T Interval-Dismantling for Lattices<br\/>%U https:\/\/arxiv.org\/abs\/2208.01479<br\/>%X Dismantling allows for the removal of elements of a set, or in our case lattice, without disturbing the remaining structure. In this paper we have extended the notion of dismantling by single elements to the dismantling by intervals in a lattice. We utilize theory from Formal Concept Analysis (FCA) to show that lattices dismantled by intervals correspond to closed subrelations in the respective formal context, and that there exists a unique kernel with respect to dismantling by intervals. Furthermore, we show that dismantling intervals can be identified directly in the formal context utilizing a characterization via arrow relations and provide an algorithm to compute all dismantling intervals.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D{{\u00fc}}rrschnabel, D., Hanika, T., Stubbemann, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{FCA2VEC:} Embedding Techniques for Formal Concept Analysis<\/span>.<\/span> In: Missaoui, R., Kwuida, L., and Abdessalem, T. (eds.) Complex Data Analytics with Formal Concept Analysis. pp. 47\u201374. Springer International Publishing (2022). https:\/\/doi.org\/10.1007\/978-3-030-93278-7_3.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-030-93278-7_3\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e127e1457fc3ea1df732f8cc594915a5\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e127e1457fc3ea1df732f8cc594915a5\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-93278-7_3\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e127e1457fc3ea1df732f8cc594915a5\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e127e1457fc3ea1df732f8cc594915a5\"><p>@incollection{DBLP:books\/sp\/missaoui2022\/DurrschnabelHS22,<br\/>  author = {D{{\u00fc}}rrschnabel, Dominik and Hanika, Tom and Stubbemann, Maximilian},<br\/>  booktitle = {Complex Data Analytics with Formal Concept Analysis},<br\/>  editor = {Missaoui, Rokia and Kwuida, L{{\u00e9}}onard and Abdessalem, Talel},<br\/>  keywords = {itegpub},<br\/>  pages = {47--74},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {{FCA2VEC:} Embedding Techniques for Formal Concept Analysis},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e127e1457fc3ea1df732f8cc594915a5\"><p>%0 Book Section<br\/>%1 DBLP:books\/sp\/missaoui2022\/DurrschnabelHS22<br\/>%A D{{\u00fc}}rrschnabel, Dominik<br\/>%A Hanika, Tom<br\/>%A Stubbemann, Maximilian<br\/>%B Complex Data Analytics with Formal Concept Analysis<br\/>%D 2022<br\/>%E Missaoui, Rokia<br\/>%E Kwuida, L{{\u00e9}}onard<br\/>%E Abdessalem, Talel<br\/>%I Springer International Publishing<br\/>%P 47--74<br\/>%R 10.1007\/978-3-030-93278-7_3<br\/>%T {FCA2VEC:} Embedding Techniques for Formal Concept Analysis<br\/>%U https:\/\/doi.org\/10.1007\/978-3-030-93278-7_3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">LG4AV: Combining Language Models and Graph Neural Networks for Author Verification<\/span>.<\/span> In: Bouadi, T., Fromont, E., and H{\u00fc}llermeier, E. (eds.) Advances in Intelligent Data Analysis XX. pp. 315\u2013326. Springer International Publishing, Cham (2022).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/link.springer.com\/chapter\/10.1007\/978-3-031-01333-1_25\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-eb5cdf718b65cf848d9e9fc6d508c614\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-eb5cdf718b65cf848d9e9fc6d508c614\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/eb5cdf718b65cf848d9e9fc6d508c614\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-eb5cdf718b65cf848d9e9fc6d508c614\">The verification of document authorships is important in various settings. Researchers are for example judged and compared by the amount and impact of their publications and public figures are confronted by their posts on social media. Therefore, it is important that authorship information in frequently used data sets is correct. The question whether a given document is written by a given author is commonly referred to as authorship verification (AV). While AV is a widely investigated problem in general, only few works consider settings where the documents are short and written in a rather uniform style. This makes most approaches impractical for bibliometric data. Here, authorships of scientific publications have to be verified, often with just abstracts and titles available. To this point, we present LG4AV which combines language models and graph neural networks for authorship verification. By directly feeding the available texts in a pre-trained transformer architecture, our model does not need any hand-crafted stylometric features that are not meaningful in scenarios where the writing style is, at least to some extent, standardized. By the incorporation of a graph neural network structure, our model can benefit from relations between authors that are meaningful with respect to the verification process.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-eb5cdf718b65cf848d9e9fc6d508c614\"><p>@inproceedings{10.1007\/978-3-031-01333-1_25,<br\/>  abstract = {The verification of document authorships is important in various settings. Researchers are for example judged and compared by the amount and impact of their publications and public figures are confronted by their posts on social media. Therefore, it is important that authorship information in frequently used data sets is correct. The question whether a given document is written by a given author is commonly referred to as authorship verification (AV). While AV is a widely investigated problem in general, only few works consider settings where the documents are short and written in a rather uniform style. This makes most approaches impractical for bibliometric data. Here, authorships of scientific publications have to be verified, often with just abstracts and titles available. To this point, we present LG4AV which combines language models and graph neural networks for authorship verification. By directly feeding the available texts in a pre-trained transformer architecture, our model does not need any hand-crafted stylometric features that are not meaningful in scenarios where the writing style is, at least to some extent, standardized. By the incorporation of a graph neural network structure, our model can benefit from relations between authors that are meaningful with respect to the verification process.},<br\/>  address = {Cham},<br\/>  author = {Stubbemann, Maximilian and Stumme, Gerd},<br\/>  booktitle = {Advances in Intelligent Data Analysis XX},<br\/>  editor = {Bouadi, Tassadit and Fromont, Elisa and H{\u00fc}llermeier, Eyke},<br\/>  keywords = {itegpub},<br\/>  pages = {315--326},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {LG4AV: Combining Language Models and Graph Neural Networks for Author Verification},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-eb5cdf718b65cf848d9e9fc6d508c614\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-031-01333-1_25<br\/>%A Stubbemann, Maximilian<br\/>%A Stumme, Gerd<br\/>%B Advances in Intelligent Data Analysis XX<br\/>%C Cham<br\/>%D 2022<br\/>%E Bouadi, Tassadit<br\/>%E Fromont, Elisa<br\/>%E H{\u00fc}llermeier, Eyke<br\/>%I Springer International Publishing<br\/>%P 315--326<br\/>%T LG4AV: Combining Language Models and Graph Neural Networks for Author Verification<br\/>%U https:\/\/link.springer.com\/chapter\/10.1007\/978-3-031-01333-1_25<br\/>%X The verification of document authorships is important in various settings. Researchers are for example judged and compared by the amount and impact of their publications and public figures are confronted by their posts on social media. Therefore, it is important that authorship information in frequently used data sets is correct. The question whether a given document is written by a given author is commonly referred to as authorship verification (AV). While AV is a widely investigated problem in general, only few works consider settings where the documents are short and written in a rather uniform style. This makes most approaches impractical for bibliometric data. Here, authorships of scientific publications have to be verified, often with just abstracts and titles available. To this point, we present LG4AV which combines language models and graph neural networks for authorship verification. By directly feeding the available texts in a pre-trained transformer architecture, our model does not need any hand-crafted stylometric features that are not meaningful in scenarios where the writing style is, at least to some extent, standardized. By the incorporation of a graph neural network structure, our model can benefit from relations between authors that are meaningful with respect to the verification process.<br\/>%@ 978-3-031-01333-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Sch\u00e4fermeier, B., Stumme, G., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mapping Research Trajectories<\/span><\/span>, https:\/\/arxiv.org\/abs\/2204.11859, (2022). https:\/\/doi.org\/10.48550\/ARXIV.2204.11859.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/2204.11859\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-156354a19a4fadcf64beaf678ff4c44e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-156354a19a4fadcf64beaf678ff4c44e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.48550\/ARXIV.2204.11859\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/156354a19a4fadcf64beaf678ff4c44e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-156354a19a4fadcf64beaf678ff4c44e\"><p>@misc{https:\/\/doi.org\/10.48550\/arxiv.2204.11859,<br\/>  author = {Sch\u00e4fermeier, Bastian and Stumme, Gerd and Hanika, Tom},<br\/>  keywords = {trajectory_mapping},<br\/>  publisher = {arXiv},<br\/>  title = {Mapping Research Trajectories},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-156354a19a4fadcf64beaf678ff4c44e\"><p>%0 Generic<br\/>%1 https:\/\/doi.org\/10.48550\/arxiv.2204.11859<br\/>%A Sch\u00e4fermeier, Bastian<br\/>%A Stumme, Gerd<br\/>%A Hanika, Tom<br\/>%D 2022<br\/>%I arXiv<br\/>%R 10.48550\/ARXIV.2204.11859<br\/>%T Mapping Research Trajectories<br\/>%U https:\/\/arxiv.org\/abs\/2204.11859<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Hirth, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Knowledge cores in large formal contexts<\/span>.<\/span> Annals of Mathematics and Artificial Intelligence. 90, 537\u2013567 (2022). https:\/\/doi.org\/10.1007\/s10472-022-09790-6.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/s10472-022-09790-6\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0a621f4c0749385cfebf7b44efdf3a03\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0a621f4c0749385cfebf7b44efdf3a03\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s10472-022-09790-6\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0a621f4c0749385cfebf7b44efdf3a03\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-0a621f4c0749385cfebf7b44efdf3a03\">Knowledge computation tasks, such as computing a base of valid implications, are often infeasible for large data sets. This is in particular true when deriving canonical bases in formal concept analysis (FCA). Therefore, it is necessary to find techniques that on the one hand reduce the data set size, but on the other hand preserve enough structure to extract useful knowledge. Many successful methods are based on random processes to reduce the size of the investigated data set. This, however, makes them hardly interpretable with respect to the discovered knowledge. Other approaches restrict themselves to highly supported subsets and omit rare and (maybe) interesting patterns. An essentially different approach is used in network science, called k-cores. These cores are able to reflect rare patterns, as long as they are well connected within the data set. In this work, we study k-cores in the realm of FCA by exploiting the natural correspondence of bi-partite graphs and formal contexts. This structurally motivated approach leads to a comprehensible extraction of knowledge cores from large formal contexts.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0a621f4c0749385cfebf7b44efdf3a03\"><p>@article{Hanika2022,<br\/>  abstract = {Knowledge computation tasks, such as computing a base of valid implications, are often infeasible for large data sets. This is in particular true when deriving canonical bases in formal concept analysis (FCA). Therefore, it is necessary to find techniques that on the one hand reduce the data set size, but on the other hand preserve enough structure to extract useful knowledge. Many successful methods are based on random processes to reduce the size of the investigated data set. This, however, makes them hardly interpretable with respect to the discovered knowledge. Other approaches restrict themselves to highly supported subsets and omit rare and (maybe) interesting patterns. An essentially different approach is used in network science, called k-cores. These cores are able to reflect rare patterns, as long as they are well connected within the data set. In this work, we study k-cores in the realm of FCA by exploiting the natural correspondence of bi-partite graphs and formal contexts. This structurally motivated approach leads to a comprehensible extraction of knowledge cores from large formal contexts.},<br\/>  author = {Hanika, Tom and Hirth, Johannes},<br\/>  journal = {Annals of Mathematics and Artificial Intelligence},<br\/>  keywords = {itegpub},<br\/>  month = {04},<br\/>  number = 6,<br\/>  pages = {537--567},<br\/>  title = {Knowledge cores in large formal contexts},<br\/>  volume = 90,<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0a621f4c0749385cfebf7b44efdf3a03\"><p>%0 Journal Article<br\/>%1 Hanika2022<br\/>%A Hanika, Tom<br\/>%A Hirth, Johannes<br\/>%D 2022<br\/>%J Annals of Mathematics and Artificial Intelligence<br\/>%N 6<br\/>%P 537--567<br\/>%R 10.1007\/s10472-022-09790-6<br\/>%T Knowledge cores in large formal contexts<br\/>%U https:\/\/doi.org\/10.1007\/s10472-022-09790-6<br\/>%V 90<br\/>%X Knowledge computation tasks, such as computing a base of valid implications, are often infeasible for large data sets. This is in particular true when deriving canonical bases in formal concept analysis (FCA). Therefore, it is necessary to find techniques that on the one hand reduce the data set size, but on the other hand preserve enough structure to extract useful knowledge. Many successful methods are based on random processes to reduce the size of the investigated data set. This, however, makes them hardly interpretable with respect to the discovered knowledge. Other approaches restrict themselves to highly supported subsets and omit rare and (maybe) interesting patterns. An essentially different approach is used in network science, called k-cores. These cores are able to reflect rare patterns, as long as they are well connected within the data set. In this work, we study k-cores in the realm of FCA by exploiting the natural correspondence of bi-partite graphs and formal contexts. This structurally motivated approach leads to a comprehensible extraction of knowledge cores from large formal contexts.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Sch\u00e4fermeier, B., Hirth, J., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Research Topic Flows in Co-Authorship Networks<\/span><\/span>, https:\/\/doi.org\/10.1007\/s11192-022-04529-w, (2022). https:\/\/doi.org\/10.1007\/s11192-022-04529-w.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/s11192-022-04529-w\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-903fb1efd9cb32d0826463188b78d475\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-903fb1efd9cb32d0826463188b78d475\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s11192-022-04529-w\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/903fb1efd9cb32d0826463188b78d475\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-903fb1efd9cb32d0826463188b78d475\">In scientometrics, scientific collaboration is often analyzed by means of co-authorships. An aspect which is often overlooked and more difficult to quantify is the flow of expertise between authors from different research topics, which is an important part of scientific progress. With the Topic Flow Network (TFN) we propose a graph structure for the analysis of research topic flows between scientific authors and their respective research fields. Based on a multi-graph and a topic model, our proposed network structure accounts for intratopic as well as intertopic flows. Our method requires for the construction of a TFN solely a corpus of publications (i.e., author and abstract information). From this, research topics are discovered automatically through non-negative matrix factorization. The thereof derived TFN allows for the application of social network analysis techniques, such as common metrics and community detection. Most importantly, it allows for the analysis of intertopic flows on a large, macroscopic scale, i.e., between research topic, as well as on a microscopic scale, i.e., between certain sets of authors. We demonstrate the utility of TFNs by applying our method to two comprehensive corpora of altogether 20 Mio. publications spanning more than 60 years of research in the fields computer science and mathematics. Our results give evidence that TFNs are suitable, e.g., for the analysis of topical communities, the discovery of important authors in different fields, and, most notably, the analysis of intertopic flows, i.e., the transfer of topical expertise. Besides that, our method opens new directions for future research, such as the investigation of influence relationships between research fields.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-903fb1efd9cb32d0826463188b78d475\"><p>@misc{schafermeier2022research,<br\/>  abstract = {In scientometrics, scientific collaboration is often analyzed by means of co-authorships. An aspect which is often overlooked and more difficult to quantify is the flow of expertise between authors from different research topics, which is an important part of scientific progress. With the Topic Flow Network (TFN) we propose a graph structure for the analysis of research topic flows between scientific authors and their respective research fields. Based on a multi-graph and a topic model, our proposed network structure accounts for intratopic as well as intertopic flows. Our method requires for the construction of a TFN solely a corpus of publications (i.e., author and abstract information). From this, research topics are discovered automatically through non-negative matrix factorization. The thereof derived TFN allows for the application of social network analysis techniques, such as common metrics and community detection. Most importantly, it allows for the analysis of intertopic flows on a large, macroscopic scale, i.e., between research topic, as well as on a microscopic scale, i.e., between certain sets of authors. We demonstrate the utility of TFNs by applying our method to two comprehensive corpora of altogether 20 Mio. publications spanning more than 60 years of research in the fields computer science and mathematics. Our results give evidence that TFNs are suitable, e.g., for the analysis of topical communities, the discovery of important authors in different fields, and, most notably, the analysis of intertopic flows, i.e., the transfer of topical expertise. Besides that, our method opens new directions for future research, such as the investigation of influence relationships between research fields.},<br\/>  author = {Sch\u00e4fermeier, Bastian and Hirth, Johannes and Hanika, Tom},<br\/>  journal = {Scientometrics},<br\/>  keywords = {co-authorships},<br\/>  month = 10,<br\/>  title = {Research Topic Flows in Co-Authorship Networks},<br\/>  year = 2022<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-903fb1efd9cb32d0826463188b78d475\"><p>%0 Generic<br\/>%1 schafermeier2022research<br\/>%A Sch\u00e4fermeier, Bastian<br\/>%A Hirth, Johannes<br\/>%A Hanika, Tom<br\/>%D 2022<br\/>%J Scientometrics<br\/>%R 10.1007\/s11192-022-04529-w<br\/>%T Research Topic Flows in Co-Authorship Networks<br\/>%U https:\/\/doi.org\/10.1007\/s11192-022-04529-w<br\/>%X In scientometrics, scientific collaboration is often analyzed by means of co-authorships. An aspect which is often overlooked and more difficult to quantify is the flow of expertise between authors from different research topics, which is an important part of scientific progress. With the Topic Flow Network (TFN) we propose a graph structure for the analysis of research topic flows between scientific authors and their respective research fields. Based on a multi-graph and a topic model, our proposed network structure accounts for intratopic as well as intertopic flows. Our method requires for the construction of a TFN solely a corpus of publications (i.e., author and abstract information). From this, research topics are discovered automatically through non-negative matrix factorization. The thereof derived TFN allows for the application of social network analysis techniques, such as common metrics and community detection. Most importantly, it allows for the analysis of intertopic flows on a large, macroscopic scale, i.e., between research topic, as well as on a microscopic scale, i.e., between certain sets of authors. We demonstrate the utility of TFNs by applying our method to two comprehensive corpora of altogether 20 Mio. publications spanning more than 60 years of research in the fields computer science and mathematics. Our results give evidence that TFNs are suitable, e.g., for the analysis of topical communities, the discovery of important authors in different fields, and, most notably, the analysis of intertopic flows, i.e., the transfer of topical expertise. Besides that, our method opens new directions for future research, such as the investigation of influence relationships between research fields.<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2021\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2021<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Braun, T., Gehrke, M., Hanika, T., Hernandez, N. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Graph-Based Representation and Reasoning - 26th International Conference on Conceptual Structures, {ICCS} 2021, Virtual Event, September 20-22, 2021, Proceedings<\/span>.<\/span> Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-86982-3.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-030-86982-3\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-31038bd7ccf83ec063c645daffcbe899\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-31038bd7ccf83ec063c645daffcbe899\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-86982-3\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/31038bd7ccf83ec063c645daffcbe899\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-31038bd7ccf83ec063c645daffcbe899\"><p>@proceedings{DBLP:conf\/iccs\/2021,<br\/>  editor = {Braun, Tanya and Gehrke, Marcel and Hanika, Tom and Hernandez, Nathalie},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Graph-Based Representation and Reasoning - 26th International Conference on Conceptual Structures, {ICCS} 2021, Virtual Event, September 20-22, 2021, Proceedings},<br\/>  volume = 12879,<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-31038bd7ccf83ec063c645daffcbe899\"><p>%0 Conference Proceedings<br\/>%1 DBLP:conf\/iccs\/2021<br\/>%B Lecture Notes in Computer Science<br\/>%D 2021<br\/>%E Braun, Tanya<br\/>%E Gehrke, Marcel<br\/>%E Hanika, Tom<br\/>%E Hernandez, Nathalie<br\/>%I Springer<br\/>%R 10.1007\/978-3-030-86982-3<br\/>%T Graph-Based Representation and Reasoning - 26th International Conference on Conceptual Structures, {ICCS} 2021, Virtual Event, September 20-22, 2021, Proceedings<br\/>%U https:\/\/doi.org\/10.1007\/978-3-030-86982-3<br\/>%V 12879<br\/>%@ 978-3-030-86981-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Koyda, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Boolean Substructures in Formal Concept Analysis<\/span>.<\/span> In: ICFCA: International Conference on Formal Concept Analysis. pp. 38\u201353. Springer (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6859d9c9923db8e36938914d19eadf2f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6859d9c9923db8e36938914d19eadf2f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6859d9c9923db8e36938914d19eadf2f\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6859d9c9923db8e36938914d19eadf2f\"><p>@conference{koyda2021boolean,<br\/>  author = {Koyda, Maren and Stumme, Gerd},<br\/>  booktitle = {Formal Concept Analysis - 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 \u2013 July 2, 2021, Proceedings},<br\/>  journal = {ICFCA: International Conference on Formal Concept Analysis},<br\/>  keywords = {itegpub},<br\/>  pages = {38-53},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Boolean Substructures in Formal Concept Analysis},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6859d9c9923db8e36938914d19eadf2f\"><p>%0 Generic<br\/>%1 koyda2021boolean<br\/>%A Koyda, Maren<br\/>%A Stumme, Gerd<br\/>%B Formal Concept Analysis - 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 \u2013 July 2, 2021, Proceedings<br\/>%D 2021<br\/>%I Springer<br\/>%J ICFCA: International Conference on Formal Concept Analysis<br\/>%P 38-53<br\/>%T Boolean Substructures in Formal Concept Analysis<br\/>%@ 978-3-030-77866-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, L., D\u00fcrrschnabel, D., Refflinghaus, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Neural Networks for Semantic Gaze Analysis in XR Settings<\/span>.<\/span> In: Bulling, A., Huckauf, A., Gellersen, H., Weiskopf, D., Bace, M., Hirzle, T., Alt, F., Pfeiffer, T., Bednarik, R., Krejtz, K., Blascheck, T., Burch, M., Kiefer, P., Dodd, M.D., and Sharif, B. (eds.) ETRA \u201921 Full Papers: ACM Symposium on Eye Tracking Research and Applications. {ACM} (2021). https:\/\/doi.org\/10.1145\/3448017.3457380.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1145%2F3448017.3457380\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6e9be4231f6693149ae14b64b860f022\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6e9be4231f6693149ae14b64b860f022\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/3448017.3457380\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6e9be4231f6693149ae14b64b860f022\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6e9be4231f6693149ae14b64b860f022\"><p>@inproceedings{Stubbemann_2021,<br\/>  author = {Stubbemann, Lena and D\u00fcrrschnabel, Dominik and Refflinghaus, Robert},<br\/>  booktitle = {ETRA '21 Full Papers: ACM Symposium on Eye Tracking Research and Applications},<br\/>  editor = {Bulling, Andreas and Huckauf, Anke and Gellersen, Hans and Weiskopf, Daniel and Bace, Mihai and Hirzle, Teresa and Alt, Florian and Pfeiffer, Thies and Bednarik, Roman and Krejtz, Krzysztof and Blascheck, Tanja and Burch, Michael and Kiefer, Peter and Dodd, Michael D. and Sharif, Bonita},<br\/>  keywords = {itegpub},<br\/>  month = {05},<br\/>  publisher = {{ACM}},<br\/>  title = {Neural Networks for Semantic Gaze Analysis in XR Settings},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6e9be4231f6693149ae14b64b860f022\"><p>%0 Conference Paper<br\/>%1 Stubbemann_2021<br\/>%A Stubbemann, Lena<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Refflinghaus, Robert<br\/>%B ETRA '21 Full Papers: ACM Symposium on Eye Tracking Research and Applications<br\/>%D 2021<br\/>%E Bulling, Andreas<br\/>%E Huckauf, Anke<br\/>%E Gellersen, Hans<br\/>%E Weiskopf, Daniel<br\/>%E Bace, Mihai<br\/>%E Hirzle, Teresa<br\/>%E Alt, Florian<br\/>%E Pfeiffer, Thies<br\/>%E Bednarik, Roman<br\/>%E Krejtz, Krzysztof<br\/>%E Blascheck, Tanja<br\/>%E Burch, Michael<br\/>%E Kiefer, Peter<br\/>%E Dodd, Michael D.<br\/>%E Sharif, Bonita<br\/>%I {ACM}<br\/>%R 10.1145\/3448017.3457380<br\/>%T Neural Networks for Semantic Gaze Analysis in XR Settings<br\/>%U https:\/\/doi.org\/10.1145%2F3448017.3457380<br\/>%@ 978-1-4503-8344-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Koopmann, T., Stubbemann, M., Kapa, M., Paris, M., Buenstorf, G., Hanika, T., Hotho, A., J\u00e4schke, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proximity Dimensions and the Emergence of Collaboration: A HypTrails Study on German AI Research<\/span>.<\/span> Scientometrics. 126, 9847\u20139868 (2021). https:\/\/doi.org\/https:\/\/doi.org\/10.1007\/s11192-021-03922-1.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s11192-021-03922-1\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d32948bf6731b12a2418e572e39d7165\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d32948bf6731b12a2418e572e39d7165\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/s11192-021-03922-1\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d32948bf6731b12a2418e572e39d7165\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d32948bf6731b12a2418e572e39d7165\"><p>@article{koopmann2021proximity,<br\/>  author = {Koopmann, T. and Stubbemann, M. and Kapa, M. and Paris, M. and Buenstorf, G. and Hanika, T. and Hotho, A. and J\u00e4schke, R. and Stumme, G.},<br\/>  journal = {Scientometrics},<br\/>  keywords = {itegpub},<br\/>  month = {03},<br\/>  number = 12,<br\/>  pages = {9847\u20139868},<br\/>  title = {Proximity Dimensions and the Emergence of Collaboration: A HypTrails Study on German AI Research},<br\/>  volume = 126,<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d32948bf6731b12a2418e572e39d7165\"><p>%0 Journal Article<br\/>%1 koopmann2021proximity<br\/>%A Koopmann, T.<br\/>%A Stubbemann, M.<br\/>%A Kapa, M.<br\/>%A Paris, M.<br\/>%A Buenstorf, G.<br\/>%A Hanika, T.<br\/>%A Hotho, A.<br\/>%A J\u00e4schke, R.<br\/>%A Stumme, G.<br\/>%D 2021<br\/>%J Scientometrics<br\/>%N 12<br\/>%P 9847\u20139868<br\/>%R https:\/\/doi.org\/10.1007\/s11192-021-03922-1<br\/>%T Proximity Dimensions and the Emergence of Collaboration: A HypTrails Study on German AI Research<br\/>%U https:\/\/link.springer.com\/article\/10.1007\/s11192-021-03922-1<br\/>%V 126<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schaefermeier, B., Stumme, G., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Topological Indoor Mapping through WiFi Signals<\/span>.<\/span> (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/2106.09789\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-319304ff625ee98746f680b13cf3c6d7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-319304ff625ee98746f680b13cf3c6d7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/319304ff625ee98746f680b13cf3c6d7\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-319304ff625ee98746f680b13cf3c6d7\">The ubiquitous presence of WiFi access points and mobile devices capable of measuring WiFi signal strengths allow for real-world applications in indoor localization and mapping. In particular, no additional infrastructure is required. Previous approaches in this field were, however, often hindered by problems such as effortful map-building processes, changing environments and hardware differences. We tackle these problems focussing on topological maps. These represent discrete locations, such as rooms, and their relations, e.g., distances and transition frequencies. In our unsupervised method, we employ WiFi signal strength distributions, dimension reduction and clustering. It can be used in settings where users carry mobile devices and follow their normal routine. We aim for applications in short-lived indoor events such as conferences.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-319304ff625ee98746f680b13cf3c6d7\"><p>@article{schaefermeier2021topological,<br\/>  abstract = {The ubiquitous presence of WiFi access points and mobile devices capable of measuring WiFi signal strengths allow for real-world applications in indoor localization and mapping. In particular, no additional infrastructure is required. Previous approaches in this field were, however, often hindered by problems such as effortful map-building processes, changing environments and hardware differences. We tackle these problems focussing on topological maps. These represent discrete locations, such as rooms, and their relations, e.g., distances and transition frequencies. In our unsupervised method, we employ WiFi signal strength distributions, dimension reduction and clustering. It can be used in settings where users carry mobile devices and follow their normal routine. We aim for applications in short-lived indoor events such as conferences.},<br\/>  author = {Schaefermeier, Bastian and Stumme, Gerd and Hanika, Tom},<br\/>  keywords = {wifi},<br\/>  note = {cite arxiv:2106.09789Comment: 18 pages},<br\/>  title = {Topological Indoor Mapping through WiFi Signals},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-319304ff625ee98746f680b13cf3c6d7\"><p>%0 Journal Article<br\/>%1 schaefermeier2021topological<br\/>%A Schaefermeier, Bastian<br\/>%A Stumme, Gerd<br\/>%A Hanika, Tom<br\/>%D 2021<br\/>%T Topological Indoor Mapping through WiFi Signals<br\/>%U http:\/\/arxiv.org\/abs\/2106.09789<br\/>%X The ubiquitous presence of WiFi access points and mobile devices capable of measuring WiFi signal strengths allow for real-world applications in indoor localization and mapping. In particular, no additional infrastructure is required. Previous approaches in this field were, however, often hindered by problems such as effortful map-building processes, changing environments and hardware differences. We tackle these problems focussing on topological maps. These represent discrete locations, such as rooms, and their relations, e.g., distances and transition frequencies. In our unsupervised method, we employ WiFi signal strength distributions, dimension reduction and clustering. It can be used in settings where users carry mobile devices and follow their normal routine. We aim for applications in short-lived indoor events such as conferences.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D{\u00fc}rrschnabel, D., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Force-Directed Layout of Order Diagrams Using Dimensional Reduction<\/span>.<\/span> In: Braud, A., Buzmakov, A., Hanika, T., and Le Ber, F. (eds.) Formal Concept Analysis. pp. 224\u2013240. Springer International Publishing, Cham (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1eaf0454498928d5f9a304597bb9c9d6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1eaf0454498928d5f9a304597bb9c9d6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1eaf0454498928d5f9a304597bb9c9d6\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-1eaf0454498928d5f9a304597bb9c9d6\">Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one step optimizes the distances of nodes and the other one the distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1eaf0454498928d5f9a304597bb9c9d6\"><p>@inproceedings{10.1007\/978-3-030-77867-5_14,<br\/>  abstract = {Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one step optimizes the distances of nodes and the other one the distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.},<br\/>  address = {Cham},<br\/>  author = {D{\u00fc}rrschnabel, Dominik and Stumme, Gerd},<br\/>  booktitle = {Formal Concept Analysis},<br\/>  editor = {Braud, Agn{\u00e8}s and Buzmakov, Aleksey and Hanika, Tom and Le Ber, Florence},<br\/>  keywords = {itegpub},<br\/>  pages = {224--240},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {Force-Directed Layout of Order Diagrams Using Dimensional Reduction},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1eaf0454498928d5f9a304597bb9c9d6\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-030-77867-5_14<br\/>%A D{\u00fc}rrschnabel, Dominik<br\/>%A Stumme, Gerd<br\/>%B Formal Concept Analysis<br\/>%C Cham<br\/>%D 2021<br\/>%E Braud, Agn{\u00e8}s<br\/>%E Buzmakov, Aleksey<br\/>%E Hanika, Tom<br\/>%E Le Ber, Florence<br\/>%I Springer International Publishing<br\/>%P 224--240<br\/>%T Force-Directed Layout of Order Diagrams Using Dimensional Reduction<br\/>%X Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one step optimizes the distances of nodes and the other one the distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.<br\/>%@ 978-3-030-77867-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks<\/span>.<\/span> arXiv preprint arXiv:2110.13774. (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-99a94d52df1e795da06ecef83774a418\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-99a94d52df1e795da06ecef83774a418\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/99a94d52df1e795da06ecef83774a418\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-99a94d52df1e795da06ecef83774a418\"><p>@article{stubbemann2021mont,<br\/>  author = {Stubbemann, Maximilian and Stumme, Gerd},<br\/>  journal = {arXiv preprint arXiv:2110.13774},<br\/>  keywords = {itegpub},<br\/>  title = {The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-99a94d52df1e795da06ecef83774a418\"><p>%0 Journal Article<br\/>%1 stubbemann2021mont<br\/>%A Stubbemann, Maximilian<br\/>%A Stumme, Gerd<br\/>%D 2021<br\/>%J arXiv preprint arXiv:2110.13774<br\/>%T The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D{\u00fc}rrschnabel, D., Koyda, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Attribute Selection Using Contranominal Scales<\/span>.<\/span> In: Braun, T., Gehrke, M., Hanika, T., and Hernandez, N. (eds.) Graph-Based Representation and Reasoning. pp. 127\u2013141. Springer International Publishing, Cham (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b1725dbe8fe5c797ed261be4e078d79f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b1725dbe8fe5c797ed261be4e078d79f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b1725dbe8fe5c797ed261be4e078d79f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-b1725dbe8fe5c797ed261be4e078d79f\">Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b1725dbe8fe5c797ed261be4e078d79f\"><p>@inproceedings{10.1007\/978-3-030-86982-3_10,<br\/>  abstract = {Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.},<br\/>  address = {Cham},<br\/>  author = {D{\u00fc}rrschnabel, Dominik and Koyda, Maren and Stumme, Gerd},<br\/>  booktitle = {Graph-Based Representation and Reasoning},<br\/>  editor = {Braun, Tanya and Gehrke, Marcel and Hanika, Tom and Hernandez, Nathalie},<br\/>  keywords = 2021,<br\/>  pages = {127--141},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {Attribute Selection Using Contranominal Scales},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b1725dbe8fe5c797ed261be4e078d79f\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-030-86982-3_10<br\/>%A D{\u00fc}rrschnabel, Dominik<br\/>%A Koyda, Maren<br\/>%A Stumme, Gerd<br\/>%B Graph-Based Representation and Reasoning<br\/>%C Cham<br\/>%D 2021<br\/>%E Braun, Tanya<br\/>%E Gehrke, Marcel<br\/>%E Hanika, Tom<br\/>%E Hernandez, Nathalie<br\/>%I Springer International Publishing<br\/>%P 127--141<br\/>%T Attribute Selection Using Contranominal Scales<br\/>%X Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.<br\/>%@ 978-3-030-86982-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Felde, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Triadic Exploration and Exploration with Multiple Experts<\/span>.<\/span> In: Braud, A., Buzmakov, A., Hanika, T., and Le Ber, F. (eds.) Formal Concept Analysis. pp. 175\u2013191. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77867-5_11.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0dd5cd77298c87ef93b7ee999b093a80\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0dd5cd77298c87ef93b7ee999b093a80\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-77867-5_11\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0dd5cd77298c87ef93b7ee999b093a80\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-0dd5cd77298c87ef93b7ee999b093a80\">Formal Concept Analysis (FCA) provides a method called attribute exploration which helps a domain expert discover structural dependencies in knowledge domains that can be represented by a formal context (a cross table of objects and attributes). Triadic Concept Analysis is an extension of FCA that incorporates the notion of conditions. Many extensions and variants of attribute exploration have been studied but only few attempts at incorporating multiple experts have been made. In this paper we present triadic exploration based on Triadic Concept Analysis to explore conditional attribute implications in a triadic domain. We then adapt this approach to formulate attribute exploration with multiple experts that have different views on a domain.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0dd5cd77298c87ef93b7ee999b093a80\"><p>@inproceedings{10.1007\/978-3-030-77867-5_11,<br\/>  abstract = {Formal Concept Analysis (FCA) provides a method called attribute exploration which helps a domain expert discover structural dependencies in knowledge domains that can be represented by a formal context (a cross table of objects and attributes). Triadic Concept Analysis is an extension of FCA that incorporates the notion of conditions. Many extensions and variants of attribute exploration have been studied but only few attempts at incorporating multiple experts have been made. In this paper we present triadic exploration based on Triadic Concept Analysis to explore conditional attribute implications in a triadic domain. We then adapt this approach to formulate attribute exploration with multiple experts that have different views on a domain.},<br\/>  address = {Cham},<br\/>  author = {Felde, Maximilian and Stumme, Gerd},<br\/>  booktitle = {Formal Concept Analysis},<br\/>  editor = {Braud, Agn{\u00e8}s and Buzmakov, Aleksey and Hanika, Tom and Le Ber, Florence},<br\/>  keywords = 2021,<br\/>  pages = {175--191},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {Triadic Exploration and Exploration with Multiple Experts},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0dd5cd77298c87ef93b7ee999b093a80\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-030-77867-5_11<br\/>%A Felde, Maximilian<br\/>%A Stumme, Gerd<br\/>%B Formal Concept Analysis<br\/>%C Cham<br\/>%D 2021<br\/>%E Braud, Agn{\u00e8}s<br\/>%E Buzmakov, Aleksey<br\/>%E Hanika, Tom<br\/>%E Le Ber, Florence<br\/>%I Springer International Publishing<br\/>%P 175--191<br\/>%R 10.1007\/978-3-030-77867-5_11<br\/>%T Triadic Exploration and Exploration with Multiple Experts<br\/>%X Formal Concept Analysis (FCA) provides a method called attribute exploration which helps a domain expert discover structural dependencies in knowledge domains that can be represented by a formal context (a cross table of objects and attributes). Triadic Concept Analysis is an extension of FCA that incorporates the notion of conditions. Many extensions and variants of attribute exploration have been studied but only few attempts at incorporating multiple experts have been made. In this paper we present triadic exploration based on Triadic Concept Analysis to explore conditional attribute implications in a triadic domain. We then adapt this approach to formulate attribute exploration with multiple experts that have different views on a domain.<br\/>%@ 978-3-030-77867-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Draude, C., Gruhl, C., Hornung, G., Kropf, J., Lamla, J., Leimeister, J.M., Sick, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Social Machines<\/span>.<\/span> Informatik Spektrum. (2021). https:\/\/doi.org\/10.1007\/s00287-021-01421-4.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007%2Fs00287-021-01421-4\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-14ff96a13e3c3523d3b2d7065744517a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-14ff96a13e3c3523d3b2d7065744517a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s00287-021-01421-4\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/14ff96a13e3c3523d3b2d7065744517a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-14ff96a13e3c3523d3b2d7065744517a\"><p>@article{2021,<br\/>  author = {Draude, Claude and Gruhl, Christian and Hornung, Gerrit and Kropf, Jonathan and Lamla, J\u00f6rn and Leimeister, Jan Marco and Sick, Bernhard and Stumme, Gerd},<br\/>  journal = {Informatik Spektrum},<br\/>  keywords = {itegpub},<br\/>  month = 11,<br\/>  title = {Social Machines},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-14ff96a13e3c3523d3b2d7065744517a\"><p>%0 Journal Article<br\/>%1 2021<br\/>%A Draude, Claude<br\/>%A Gruhl, Christian<br\/>%A Hornung, Gerrit<br\/>%A Kropf, Jonathan<br\/>%A Lamla, J\u00f6rn<br\/>%A Leimeister, Jan Marco<br\/>%A Sick, Bernhard<br\/>%A Stumme, Gerd<br\/>%D 2021<br\/>%J Informatik Spektrum<br\/>%R 10.1007\/s00287-021-01421-4<br\/>%T Social Machines<br\/>%U https:\/\/doi.org\/10.1007%2Fs00287-021-01421-4<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Koyda, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Attribute Selection Using Contranominal Scales<\/span>.<\/span> In: Braun, T., Gehrke, M., Hanika, T., and Hernandez, N. (eds.) Graph-Based Representation and Reasoning. pp. 127\u2013141. Springer International Publishing, Cham (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9e7f48447bb65214147def814adec93d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9e7f48447bb65214147def814adec93d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9e7f48447bb65214147def814adec93d\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9e7f48447bb65214147def814adec93d\">Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9e7f48447bb65214147def814adec93d\"><p>@inproceedings{10.1007\/978-3-030-86982-3_10,<br\/>  abstract = {Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.},<br\/>  address = {Cham},<br\/>  author = {D\u00fcrrschnabel, Dominik and Koyda, Maren and Stumme, Gerd},<br\/>  booktitle = {Graph-Based Representation and Reasoning},<br\/>  editor = {Braun, Tanya and Gehrke, Marcel and Hanika, Tom and Hernandez, Nathalie},<br\/>  keywords = {itegpub},<br\/>  pages = {127--141},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {Attribute Selection Using Contranominal Scales},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9e7f48447bb65214147def814adec93d\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-030-86982-3_10<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Koyda, Maren<br\/>%A Stumme, Gerd<br\/>%B Graph-Based Representation and Reasoning<br\/>%C Cham<br\/>%D 2021<br\/>%E Braun, Tanya<br\/>%E Gehrke, Marcel<br\/>%E Hanika, Tom<br\/>%E Hernandez, Nathalie<br\/>%I Springer International Publishing<br\/>%P 127--141<br\/>%T Attribute Selection Using Contranominal Scales<br\/>%X Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\\$}{\\$}{\\backslash}delta {\\$}{\\$}$\\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.<br\/>%@ 978-3-030-86982-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Sch\u00e4fermeier, B., Stumme, G., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Explainable Scientific Venue Recommendations<\/span><\/span>, http:\/\/arxiv.org\/abs\/2109.11343, (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/2109.11343\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-79a9e82152e6416811ddb2b2f6887b75\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-79a9e82152e6416811ddb2b2f6887b75\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/79a9e82152e6416811ddb2b2f6887b75\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-79a9e82152e6416811ddb2b2f6887b75\">Selecting the best scientific venue (i.e., conference\/journal) for the submission of a research article constitutes a multifaceted challenge. Important aspects to consider are the suitability of research topics, a venue's prestige, and the probability of acceptance. The selection problem is exacerbated through the continuous emergence of additional venues. Previously proposed approaches for supporting authors in this process rely on complex recommender systems, e.g., based on Word2Vec or TextCNN. These, however, often elude an explanation for their recommendations. In this work, we propose an unsophisticated method that advances the state-of-the-art in two aspects: First, we enhance the interpretability of recommendations through non-negative matrix factorization based topic models; Second, we surprisingly can obtain competitive recommendation performance while using simpler learning methods.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-79a9e82152e6416811ddb2b2f6887b75\"><p>@misc{schafermeier2021towards,<br\/>  abstract = {Selecting the best scientific venue (i.e., conference\/journal) for the submission of a research article constitutes a multifaceted challenge. Important aspects to consider are the suitability of research topics, a venue's prestige, and the probability of acceptance. The selection problem is exacerbated through the continuous emergence of additional venues. Previously proposed approaches for supporting authors in this process rely on complex recommender systems, e.g., based on Word2Vec or TextCNN. These, however, often elude an explanation for their recommendations. In this work, we propose an unsophisticated method that advances the state-of-the-art in two aspects: First, we enhance the interpretability of recommendations through non-negative matrix factorization based topic models; Second, we surprisingly can obtain competitive recommendation performance while using simpler learning methods.},<br\/>  author = {Sch\u00e4fermeier, Bastian and Stumme, Gerd and Hanika, Tom},<br\/>  keywords = {venue_recommendations},<br\/>  note = {cite arxiv:2109.11343},<br\/>  title = {Towards Explainable Scientific Venue Recommendations},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-79a9e82152e6416811ddb2b2f6887b75\"><p>%0 Generic<br\/>%1 schafermeier2021towards<br\/>%A Sch\u00e4fermeier, Bastian<br\/>%A Stumme, Gerd<br\/>%A Hanika, Tom<br\/>%D 2021<br\/>%T Towards Explainable Scientific Venue Recommendations<br\/>%U http:\/\/arxiv.org\/abs\/2109.11343<br\/>%X Selecting the best scientific venue (i.e., conference\/journal) for the submission of a research article constitutes a multifaceted challenge. Important aspects to consider are the suitability of research topics, a venue's prestige, and the probability of acceptance. The selection problem is exacerbated through the continuous emergence of additional venues. Previously proposed approaches for supporting authors in this process rely on complex recommender systems, e.g., based on Word2Vec or TextCNN. These, however, often elude an explanation for their recommendations. In this work, we propose an unsophisticated method that advances the state-of-the-art in two aspects: First, we enhance the interpretability of recommendations through non-negative matrix factorization based topic models; Second, we surprisingly can obtain competitive recommendation performance while using simpler learning methods.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Hirth, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Exploring Scale-Measures of Data Sets<\/span>.<\/span> In: Braud, A., Buzmakov, A., Hanika, T., and Ber, F.L. (eds.) Formal Concept Analysis - 16th International Conference, {ICFCA} 2021, Strasbourg, France, June 29 - July 2, 2021, Proceedings. pp. 261\u2013269. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77867-5_17.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-030-77867-5_17\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6ddf8be80b973b6693c80c1b7b3bfd91\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6ddf8be80b973b6693c80c1b7b3bfd91\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-77867-5_17\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6ddf8be80b973b6693c80c1b7b3bfd91\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6ddf8be80b973b6693c80c1b7b3bfd91\"><p>@inproceedings{DBLP:conf\/icfca\/HanikaH21,<br\/>  author = {Hanika, Tom and Hirth, Johannes},<br\/>  booktitle = {Formal Concept Analysis - 16th International Conference, {ICFCA} 2021, Strasbourg, France, June 29 - July 2, 2021, Proceedings},<br\/>  editor = {Braud, Agn{{\u00e8}}s and Buzmakov, Aleksey and Hanika, Tom and Ber, Florence Le},<br\/>  keywords = {itegpub},<br\/>  pages = {261--269},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Exploring Scale-Measures of Data Sets},<br\/>  volume = 12733,<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6ddf8be80b973b6693c80c1b7b3bfd91\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/icfca\/HanikaH21<br\/>%A Hanika, Tom<br\/>%A Hirth, Johannes<br\/>%B Formal Concept Analysis - 16th International Conference, {ICFCA} 2021, Strasbourg, France, June 29 - July 2, 2021, Proceedings<br\/>%D 2021<br\/>%E Braud, Agn{{\u00e8}}s<br\/>%E Buzmakov, Aleksey<br\/>%E Hanika, Tom<br\/>%E Ber, Florence Le<br\/>%I Springer<br\/>%P 261--269<br\/>%R 10.1007\/978-3-030-77867-5_17<br\/>%T Exploring Scale-Measures of Data Sets<br\/>%U https:\/\/doi.org\/10.1007\/978-3-030-77867-5_17<br\/>%V 12733<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Hirth, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Quantifying the Conceptual Error in Dimensionality Reduction<\/span>.<\/span> In: Braun, T., Gehrke, M., Hanika, T., and Hernandez, N. (eds.) Graph-Based Representation and Reasoning - 26th International Conference on Conceptual Structures, ICCS 2021, Virtual Event, September 20-22, 2021, Proceedings. pp. 105\u2013118. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-86982-3_8.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-030-86982-3_8\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bccd47524af1f4528212c2b971ed9c54\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bccd47524af1f4528212c2b971ed9c54\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-86982-3_8\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bccd47524af1f4528212c2b971ed9c54\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bccd47524af1f4528212c2b971ed9c54\"><p>@inproceedings{DBLP:conf\/iccs\/HanikaH21,<br\/>  author = {Hanika, Tom and Hirth, Johannes},<br\/>  booktitle = {Graph-Based Representation and Reasoning - 26th International Conference on Conceptual Structures, ICCS 2021, Virtual Event, September 20-22, 2021, Proceedings},<br\/>  editor = {Braun, Tanya and Gehrke, Marcel and Hanika, Tom and Hernandez, Nathalie},<br\/>  keywords = {selected},<br\/>  pages = {105--118},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Quantifying the Conceptual Error in Dimensionality Reduction},<br\/>  volume = 12879,<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bccd47524af1f4528212c2b971ed9c54\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/iccs\/HanikaH21<br\/>%A Hanika, Tom<br\/>%A Hirth, Johannes<br\/>%B Graph-Based Representation and Reasoning - 26th International Conference on Conceptual Structures, ICCS 2021, Virtual Event, September 20-22, 2021, Proceedings<br\/>%D 2021<br\/>%E Braun, Tanya<br\/>%E Gehrke, Marcel<br\/>%E Hanika, Tom<br\/>%E Hernandez, Nathalie<br\/>%I Springer<br\/>%P 105--118<br\/>%R 10.1007\/978-3-030-86982-3_8<br\/>%T Quantifying the Conceptual Error in Dimensionality Reduction<br\/>%U https:\/\/doi.org\/10.1007\/978-3-030-86982-3_8<br\/>%V 12879<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Force-Directed Layout of Order Diagrams Using Dimensional Reduction<\/span>.<\/span> In: Braud, A., Buzmakov, A., Hanika, T., and Le Ber, F. (eds.) Formal Concept Analysis. pp. 224\u2013240. Springer International Publishing, Cham (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-10e7fb5b27933ae104787e1d6fe81f4a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-10e7fb5b27933ae104787e1d6fe81f4a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/10e7fb5b27933ae104787e1d6fe81f4a\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-10e7fb5b27933ae104787e1d6fe81f4a\">Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one step optimizes the distances of nodes and the other one the distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-10e7fb5b27933ae104787e1d6fe81f4a\"><p>@inproceedings{10.1007\/978-3-030-77867-5_14,<br\/>  abstract = {Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one step optimizes the distances of nodes and the other one the distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.},<br\/>  address = {Cham},<br\/>  author = {D\u00fcrrschnabel, Dominik and Stumme, Gerd},<br\/>  booktitle = {Formal Concept Analysis},<br\/>  editor = {Braud, Agn{\u00e8}s and Buzmakov, Aleksey and Hanika, Tom and Le Ber, Florence},<br\/>  keywords = {itegpub},<br\/>  pages = {224--240},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {Force-Directed Layout of Order Diagrams Using Dimensional Reduction},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-10e7fb5b27933ae104787e1d6fe81f4a\"><p>%0 Conference Paper<br\/>%1 10.1007\/978-3-030-77867-5_14<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Stumme, Gerd<br\/>%B Formal Concept Analysis<br\/>%C Cham<br\/>%D 2021<br\/>%E Braud, Agn{\u00e8}s<br\/>%E Buzmakov, Aleksey<br\/>%E Hanika, Tom<br\/>%E Le Ber, Florence<br\/>%I Springer International Publishing<br\/>%P 224--240<br\/>%T Force-Directed Layout of Order Diagrams Using Dimensional Reduction<br\/>%X Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one step optimizes the distances of nodes and the other one the distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.<br\/>%@ 978-3-030-77867-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">LG4AV: Combining Language Models and Graph Neural Networks for Author Verification<\/span>.<\/span> (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/2109.01479\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-dadb44967c6b8cf8686e6d1f01dcac44\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-dadb44967c6b8cf8686e6d1f01dcac44\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/dadb44967c6b8cf8686e6d1f01dcac44\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-dadb44967c6b8cf8686e6d1f01dcac44\"><p>@article{stubbemann2021lg4av,<br\/>  author = {Stubbemann, Maximilian and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  title = {LG4AV: Combining Language Models and Graph Neural Networks for Author Verification},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-dadb44967c6b8cf8686e6d1f01dcac44\"><p>%0 Journal Article<br\/>%1 stubbemann2021lg4av<br\/>%A Stubbemann, Maximilian<br\/>%A Stumme, Gerd<br\/>%D 2021<br\/>%T LG4AV: Combining Language Models and Graph Neural Networks for Author Verification<br\/>%U https:\/\/arxiv.org\/abs\/2109.01479<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Braud, A., Buzmakov, A., Hanika, T., Ber, F.L. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Formal Concept Analysis - 16th International Conference, {ICFCA} 2021, Strasbourg, France, June 29 - July 2, 2021, Proceedings<\/span>.<\/span> Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77867-5.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-030-77867-5\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2800bb018f9e09ad5efdc51dadcb7e0c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2800bb018f9e09ad5efdc51dadcb7e0c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-77867-5\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2800bb018f9e09ad5efdc51dadcb7e0c\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2800bb018f9e09ad5efdc51dadcb7e0c\"><p>@proceedings{DBLP:conf\/icfca\/2021,<br\/>  editor = {Braud, Agn{{\u00e8}}s and Buzmakov, Aleksey and Hanika, Tom and Ber, Florence Le},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Formal Concept Analysis - 16th International Conference, {ICFCA} 2021, Strasbourg, France, June 29 - July 2, 2021, Proceedings},<br\/>  volume = 12733,<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2800bb018f9e09ad5efdc51dadcb7e0c\"><p>%0 Conference Proceedings<br\/>%1 DBLP:conf\/icfca\/2021<br\/>%B Lecture Notes in Computer Science<br\/>%D 2021<br\/>%E Braud, Agn{{\u00e8}}s<br\/>%E Buzmakov, Aleksey<br\/>%E Hanika, Tom<br\/>%E Ber, Florence Le<br\/>%I Springer<br\/>%R 10.1007\/978-3-030-77867-5<br\/>%T Formal Concept Analysis - 16th International Conference, {ICFCA} 2021, Strasbourg, France, June 29 - July 2, 2021, Proceedings<br\/>%U https:\/\/doi.org\/10.1007\/978-3-030-77867-5<br\/>%V 12733<br\/>%@ 978-3-030-77866-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Hanika, T., Stubbemann, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">FCA2VEC: Embedding Techniques for Formal Concept Analysis<\/span>.<\/span> Presented at the (2021).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-698494c39f717e5002685b941560426f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-698494c39f717e5002685b941560426f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/698494c39f717e5002685b941560426f\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-698494c39f717e5002685b941560426f\"><p>@inbook{durrschnabel2021fca2vec,<br\/>  author = {D\u00fcrrschnabel, Dominik and Hanika, Tom and Stubbemann, Maximilian},<br\/>  keywords = {fca2vec},<br\/>  title = {FCA2VEC: Embedding Techniques for Formal Concept Analysis},<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-698494c39f717e5002685b941560426f\"><p>%0 Book Section<br\/>%1 durrschnabel2021fca2vec<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Hanika, Tom<br\/>%A Stubbemann, Maximilian<br\/>%D 2021<br\/>%T FCA2VEC: Embedding Techniques for Formal Concept Analysis<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schaefermeier, B., Stumme, G., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Topic space trajectories<\/span>.<\/span> Scientometrics. 126, 5759\u20135795 (2021). https:\/\/doi.org\/10.1007\/s11192-021-03931-0.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/s11192-021-03931-0\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9472cccf5ce51f6faaead874d76fc216\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9472cccf5ce51f6faaead874d76fc216\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s11192-021-03931-0\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9472cccf5ce51f6faaead874d76fc216\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9472cccf5ce51f6faaead874d76fc216\">The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers it becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present topic space trajectories, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50\u00a0years of machine learning research from 32 publication venues. In addition to a thorough introduction of our method, our focus is on an extensive analysis of the results we achieved. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work. An advantage in these applications over previous methods lies in the good interpretability of the results obtained through our methods.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9472cccf5ce51f6faaead874d76fc216\"><p>@article{schafermeier2020topic,<br\/>  abstract = {The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers it becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present topic space trajectories, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50\u00a0years of machine learning research from 32 publication venues. In addition to a thorough introduction of our method, our focus is on an extensive analysis of the results we achieved. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work. An advantage in these applications over previous methods lies in the good interpretability of the results obtained through our methods.},<br\/>  author = {Schaefermeier, Bastian and Stumme, Gerd and Hanika, Tom},<br\/>  journal = {Scientometrics},<br\/>  keywords = 2021,<br\/>  month = {07},<br\/>  number = 7,<br\/>  pages = {5759-5795},<br\/>  publisher = {Springer},<br\/>  title = {Topic space trajectories},<br\/>  volume = 126,<br\/>  year = 2021<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9472cccf5ce51f6faaead874d76fc216\"><p>%0 Journal Article<br\/>%1 schafermeier2020topic<br\/>%A Schaefermeier, Bastian<br\/>%A Stumme, Gerd<br\/>%A Hanika, Tom<br\/>%D 2021<br\/>%I Springer<br\/>%J Scientometrics<br\/>%N 7<br\/>%P 5759-5795<br\/>%R 10.1007\/s11192-021-03931-0<br\/>%T Topic space trajectories<br\/>%U https:\/\/doi.org\/10.1007\/s11192-021-03931-0<br\/>%V 126<br\/>%X The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers it becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present topic space trajectories, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50\u00a0years of machine learning research from 32 publication venues. In addition to a thorough introduction of our method, our focus is on an extensive analysis of the results we achieved. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work. An advantage in these applications over previous methods lies in the good interpretability of the results obtained through our methods.<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2020\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2020<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Borchmann, D., Hanika, T., Obiedkov, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Probably approximately correct learning of Horn envelopes from queries<\/span>.<\/span> Discrete Applied Mathematics. 273, 30\u201342 (2020). https:\/\/doi.org\/https:\/\/doi.org\/10.1016\/j.dam.2019.02.036.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X19301295\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-be121e13826f0ad3699d2629f08cc77f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-be121e13826f0ad3699d2629f08cc77f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1016\/j.dam.2019.02.036\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/be121e13826f0ad3699d2629f08cc77f\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-be121e13826f0ad3699d2629f08cc77f\">We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attribute exploration from formal concept analysis is a procedure that solves this problem, but the number of queries it may ask is exponential in the size of the resulting Horn formula in the worst case. We recall a well-known polynomial-time algorithm for learning Horn formulas with membership and equivalence queries and modify it to obtain a polynomial-time probably approximately correct algorithm for learning the Horn envelope of an arbitrary domain.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-be121e13826f0ad3699d2629f08cc77f\"><p>@article{BORCHMANN202030,<br\/>  abstract = {We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attribute exploration from formal concept analysis is a procedure that solves this problem, but the number of queries it may ask is exponential in the size of the resulting Horn formula in the worst case. We recall a well-known polynomial-time algorithm for learning Horn formulas with membership and equivalence queries and modify it to obtain a polynomial-time probably approximately correct algorithm for learning the Horn envelope of an arbitrary domain.},<br\/>  author = {Borchmann, Daniel and Hanika, Tom and Obiedkov, Sergei},<br\/>  journal = {Discrete Applied Mathematics},<br\/>  keywords = {itegpub},<br\/>  note = {Advances in Formal Concept Analysis: Traces of CLA 2016},<br\/>  pages = {30 - 42},<br\/>  title = {Probably approximately correct learning of Horn envelopes from queries},<br\/>  volume = 273,<br\/>  year = 2020<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-be121e13826f0ad3699d2629f08cc77f\"><p>%0 Journal Article<br\/>%1 BORCHMANN202030<br\/>%A Borchmann, Daniel<br\/>%A Hanika, Tom<br\/>%A Obiedkov, Sergei<br\/>%D 2020<br\/>%J Discrete Applied Mathematics<br\/>%P 30 - 42<br\/>%R https:\/\/doi.org\/10.1016\/j.dam.2019.02.036<br\/>%T Probably approximately correct learning of Horn envelopes from queries<br\/>%U http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X19301295<br\/>%V 273<br\/>%X We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attribute exploration from formal concept analysis is a procedure that solves this problem, but the number of queries it may ask is exponential in the size of the resulting Horn formula in the worst case. We recall a well-known polynomial-time algorithm for learning Horn formulas with membership and equivalence queries and modify it to obtain a polynomial-time probably approximately correct algorithm for learning the Horn envelope of an arbitrary domain.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Sch\u00e4fermeier, B., Stumme, G., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Topic Space Trajectories: A case study on machine learning literature<\/span><\/span>, http:\/\/arxiv.org\/abs\/2010.12294, (2020).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/2010.12294\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c64bda3a0de0dbf26c8438430b89203f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c64bda3a0de0dbf26c8438430b89203f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c64bda3a0de0dbf26c8438430b89203f\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-c64bda3a0de0dbf26c8438430b89203f\">The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present \\emph{topic space trajectories}, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50 years of machine learning research from 32 publication venues. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c64bda3a0de0dbf26c8438430b89203f\"><p>@misc{schafermeier2020topic,<br\/>  abstract = {The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present \\emph{topic space trajectories}, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50 years of machine learning research from 32 publication venues. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work.},<br\/>  author = {Sch\u00e4fermeier, Bastian and Stumme, Gerd and Hanika, Tom},<br\/>  keywords = {itegpub},<br\/>  note = {cite arxiv:2010.12294Comment: 36 pages, 8 figures},<br\/>  title = {Topic Space Trajectories: A case study on machine learning literature},<br\/>  year = 2020<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c64bda3a0de0dbf26c8438430b89203f\"><p>%0 Generic<br\/>%1 schafermeier2020topic<br\/>%A Sch\u00e4fermeier, Bastian<br\/>%A Stumme, Gerd<br\/>%A Hanika, Tom<br\/>%D 2020<br\/>%T Topic Space Trajectories: A case study on machine learning literature<br\/>%U http:\/\/arxiv.org\/abs\/2010.12294<br\/>%X The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present \\emph{topic space trajectories}, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50 years of machine learning research from 32 publication venues. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Schneider, F.M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Intrinsic Dimension of Geometric Data Sets<\/span>.<\/span> Accepted for publication in: Tohoku Mathematical Journal. (2020).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1801.07985\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3be366138968b0b1762585fe1aa7aecc\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3be366138968b0b1762585fe1aa7aecc\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3be366138968b0b1762585fe1aa7aecc\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-3be366138968b0b1762585fe1aa7aecc\">The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML\/KD-algorithms, as illustrated by various experiments.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3be366138968b0b1762585fe1aa7aecc\"><p>@article{hanika2018intrinsic,<br\/>  abstract = {The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML\/KD-algorithms, as illustrated by various experiments.},<br\/>  author = {Hanika, Tom and Schneider, Friedrich Martin and Stumme, Gerd},<br\/>  journal = {Accepted for publication in: Tohoku Mathematical Journal},<br\/>  keywords = {itegpub},<br\/>  note = {cite arxiv:1801.07985Comment: v2: completely rewritten 28 pages, 3 figures, 2 tables},<br\/>  title = {Intrinsic Dimension of Geometric Data Sets},<br\/>  year = 2020<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3be366138968b0b1762585fe1aa7aecc\"><p>%0 Journal Article<br\/>%1 hanika2018intrinsic<br\/>%A Hanika, Tom<br\/>%A Schneider, Friedrich Martin<br\/>%A Stumme, Gerd<br\/>%D 2020<br\/>%J Accepted for publication in: Tohoku Mathematical Journal<br\/>%T Intrinsic Dimension of Geometric Data Sets<br\/>%U http:\/\/arxiv.org\/abs\/1801.07985<br\/>%X The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML\/KD-algorithms, as illustrated by various experiments.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On Ordinal Data Science and its role in Socially Acceptable ICTDesign<\/span>.<\/span> In: Hentschel, A., Hornung, G., and Jandt, S. (eds.) Mensch \u2013 Technik \u2013 Umwelt: Verantwortung f\u00fcr eine sozialvertr\u00e4gliche Zukunft, Festschrift f\u00fcr Alexander Ro\u00dfnagel zum 70. Geburtstag. pp. 181\u2013198. Nomos, Baden-Baden (2020).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7564ad3ff52d8e24077cf0e6be13d054\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7564ad3ff52d8e24077cf0e6be13d054\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7564ad3ff52d8e24077cf0e6be13d054\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-7564ad3ff52d8e24077cf0e6be13d054\">Comparing and ordering things is a basal ability of mankind for organizing its physical and social environment. While many hierarchical relationships can be derived from numerical measures like length or voltage, many others cannot appropriately be captured this way. We argue that the newly emerging field of data science up to now lacks engagement in developing analysis methods for such ordinal data. By the example of an already existing approach in this domain, Formal Concept Analysis, we will discuss its capabilities as a knowledge representation and argue \u2013 based on its philosophical foundations \u2013 why it is an important building block for socially acceptable IT design.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7564ad3ff52d8e24077cf0e6be13d054\"><p>@inbook{stumme2020ordinal,<br\/>  abstract = {Comparing and ordering things is a basal ability of mankind for organizing its physical and social environment. While many hierarchical relationships can be derived from numerical measures like length or voltage, many others cannot appropriately be captured this way. We argue that the newly emerging field of data science up to now lacks engagement in developing analysis methods for such ordinal data. By the example of an already existing approach in this domain, Formal Concept Analysis, we will discuss its capabilities as a knowledge representation and argue \u2013 based on its philosophical foundations \u2013 why it is an important building block for socially acceptable IT design.},<br\/>  address = {Baden-Baden},<br\/>  author = {Stumme, G.},<br\/>  booktitle = {Mensch \u2013 Technik \u2013 Umwelt: Verantwortung f\u00fcr eine sozialvertr\u00e4gliche Zukunft, Festschrift f\u00fcr Alexander Ro\u00dfnagel zum 70. Geburtstag},<br\/>  editor = {Hentschel, A. and Hornung, G. and Jandt, S.},<br\/>  keywords = {itegpub},<br\/>  pages = {181-198},<br\/>  publisher = {Nomos},<br\/>  title = {On Ordinal Data Science and its role in Socially Acceptable ICTDesign},<br\/>  year = 2020<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7564ad3ff52d8e24077cf0e6be13d054\"><p>%0 Book Section<br\/>%1 stumme2020ordinal<br\/>%A Stumme, G.<br\/>%B Mensch \u2013 Technik \u2013 Umwelt: Verantwortung f\u00fcr eine sozialvertr\u00e4gliche Zukunft, Festschrift f\u00fcr Alexander Ro\u00dfnagel zum 70. Geburtstag<br\/>%C Baden-Baden<br\/>%D 2020<br\/>%E Hentschel, A.<br\/>%E Hornung, G.<br\/>%E Jandt, S.<br\/>%I Nomos<br\/>%P 181-198<br\/>%T On Ordinal Data Science and its role in Socially Acceptable ICTDesign<br\/>%X Comparing and ordering things is a basal ability of mankind for organizing its physical and social environment. While many hierarchical relationships can be derived from numerical measures like length or voltage, many others cannot appropriately be captured this way. We argue that the newly emerging field of data science up to now lacks engagement in developing analysis methods for such ordinal data. By the example of an already existing approach in this domain, Formal Concept Analysis, we will discuss its capabilities as a knowledge representation and argue \u2013 based on its philosophical foundations \u2013 why it is an important building block for socially acceptable IT design.<br\/>%@ 978-3-8487-7014-4<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Felde, M., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Null Models for Formal Contexts<\/span>.<\/span> Information. 11, 135 (2020).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.mdpi.com\/2078-2489\/11\/3\/135\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5af4dfd0c1a213f76e3b4a265c680846\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5af4dfd0c1a213f76e3b4a265c680846\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5af4dfd0c1a213f76e3b4a265c680846\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5af4dfd0c1a213f76e3b4a265c680846\"><p>@article{felde2020null,<br\/>  author = {Felde, Maximilian and Hanika, Tom and Stumme, Gerd},<br\/>  journal = {Information},<br\/>  keywords = {itegpub},<br\/>  number = 3,<br\/>  pages = 135,<br\/>  publisher = {Multidisciplinary Digital Publishing Institute},<br\/>  title = {Null Models for Formal Contexts},<br\/>  volume = 11,<br\/>  year = 2020<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5af4dfd0c1a213f76e3b4a265c680846\"><p>%0 Journal Article<br\/>%1 felde2020null<br\/>%A Felde, Maximilian<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%D 2020<br\/>%I Multidisciplinary Digital Publishing Institute<br\/>%J Information<br\/>%N 3<br\/>%P 135<br\/>%T Null Models for Formal Contexts<br\/>%U https:\/\/www.mdpi.com\/2078-2489\/11\/3\/135<br\/>%V 11<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Orometric Methods in Bounded Metric Data<\/span>.<\/span> In: Berthold, M.R., Feelders, A., and Krempl, G. (eds.) Advances in Intelligent Data Analysis {XVIII} - 18th International Symposium on Intelligent Data Analysis, {IDA} 2020, Konstanz, Germany, April 27-29, 2020, Proceedings. pp. 496\u2013508. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-44584-3_39.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-030-44584-3\\_39\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-46473c28ad59dcf47f2dbe1427740370\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-46473c28ad59dcf47f2dbe1427740370\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-44584-3_39\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/46473c28ad59dcf47f2dbe1427740370\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-46473c28ad59dcf47f2dbe1427740370\"><p>@inproceedings{DBLP:conf\/ida\/StubbemannHS20,<br\/>  author = {Stubbemann, Maximilian and Hanika, Tom and Stumme, Gerd},<br\/>  booktitle = {Advances in Intelligent Data Analysis {XVIII} - 18th International Symposium on Intelligent Data Analysis, {IDA} 2020, Konstanz, Germany, April 27-29, 2020, Proceedings},<br\/>  editor = {Berthold, Michael R. and Feelders, Ad and Krempl, Georg},<br\/>  keywords = {itegpub},<br\/>  pages = {496--508},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Orometric Methods in Bounded Metric Data},<br\/>  volume = 12080,<br\/>  year = 2020<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-46473c28ad59dcf47f2dbe1427740370\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/ida\/StubbemannHS20<br\/>%A Stubbemann, Maximilian<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%B Advances in Intelligent Data Analysis {XVIII} - 18th International Symposium on Intelligent Data Analysis, {IDA} 2020, Konstanz, Germany, April 27-29, 2020, Proceedings<br\/>%D 2020<br\/>%E Berthold, Michael R.<br\/>%E Feelders, Ad<br\/>%E Krempl, Georg<br\/>%I Springer<br\/>%P 496--508<br\/>%R 10.1007\/978-3-030-44584-3_39<br\/>%T Orometric Methods in Bounded Metric Data<br\/>%U https:\/\/doi.org\/10.1007\/978-3-030-44584-3\\_39<br\/>%V 12080<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2019\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2019<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Drawing Order Diagrams Through Two-Dimension Extension<\/span><\/span>, http:\/\/arxiv.org\/abs\/1906.06208, (2019).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1906.06208\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a33b056dcfcf90c67f1c183ed4664501\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a33b056dcfcf90c67f1c183ed4664501\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a33b056dcfcf90c67f1c183ed4664501\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-a33b056dcfcf90c67f1c183ed4664501\">Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work we present the novel algorithm DimDraw to draw order diagrams. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a33b056dcfcf90c67f1c183ed4664501\"><p>@misc{durrschnabel2019drawing,<br\/>  abstract = {Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work we present the novel algorithm DimDraw to draw order diagrams. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph.},<br\/>  author = {D\u00fcrrschnabel, Dominik and Hanika, Tom and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  note = {cite arxiv:1906.06208Comment: 16 pages, 12 Figures},<br\/>  title = {Drawing Order Diagrams Through Two-Dimension Extension},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a33b056dcfcf90c67f1c183ed4664501\"><p>%0 Generic<br\/>%1 durrschnabel2019drawing<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%D 2019<br\/>%T Drawing Order Diagrams Through Two-Dimension Extension<br\/>%U http:\/\/arxiv.org\/abs\/1906.06208<br\/>%X Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work we present the novel algorithm DimDraw to draw order diagrams. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Kibanov, M., Kropf, J., Laser, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ich denke, es ist wichtig zu verstehen, warum die Netzwerkanalyse jetzt popul{\u00e4}r und besonders interessant f{\u00fc}r die Forschung geworden ist.<\/span><\/span> In: Kropf, J. and Laser, S. (eds.) Digitale Bewertungspraktiken. pp. 165\u2013188. Springer (2019).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1676016925aa18edb753d477bc8be2e9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1676016925aa18edb753d477bc8be2e9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1676016925aa18edb753d477bc8be2e9\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1676016925aa18edb753d477bc8be2e9\"><p>@incollection{hanika2019denke,<br\/>  author = {Hanika, Tom and Kibanov, Mark and Kropf, Jonathan and Laser, Stefan},<br\/>  booktitle = {Digitale Bewertungspraktiken},<br\/>  editor = {Kropf, Jonathan and Laser, Stefan},<br\/>  keywords = {bewertungspraktiken},<br\/>  pages = {165--188},<br\/>  publisher = {Springer},<br\/>  title = {Ich denke, es ist wichtig zu verstehen, warum die Netzwerkanalyse jetzt popul{\u00e4}r und besonders interessant f{\u00fc}r die Forschung geworden ist.},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1676016925aa18edb753d477bc8be2e9\"><p>%0 Book Section<br\/>%1 hanika2019denke<br\/>%A Hanika, Tom<br\/>%A Kibanov, Mark<br\/>%A Kropf, Jonathan<br\/>%A Laser, Stefan<br\/>%B Digitale Bewertungspraktiken<br\/>%D 2019<br\/>%E Kropf, Jonathan<br\/>%E Laser, Stefan<br\/>%I Springer<br\/>%P 165--188<br\/>%T Ich denke, es ist wichtig zu verstehen, warum die Netzwerkanalyse jetzt popul{\u00e4}r und besonders interessant f{\u00fc}r die Forschung geworden ist.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Hirth, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conexp-Clj - A Research Tool for FCA.<\/span><\/span> In: Cristea, D., Ber, F.L., Missaoui, R., Kwuida, L., and Sertkaya, B. (eds.) ICFCA (Supplements). pp. 70\u201375. CEUR-WS.org (2019).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/icfca\/icfca2019suppl.html#HanikaH19\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-432006ec0f26e5c6c5e26900faadc7e3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-432006ec0f26e5c6c5e26900faadc7e3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/432006ec0f26e5c6c5e26900faadc7e3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-432006ec0f26e5c6c5e26900faadc7e3\"><p>@inproceedings{conf\/icfca\/HanikaH19,<br\/>  author = {Hanika, Tom and Hirth, Johannes},<br\/>  booktitle = {ICFCA (Supplements)},<br\/>  crossref = {conf\/icfca\/2019suppl},<br\/>  editor = {Cristea, Diana and Ber, Florence Le and Missaoui, Rokia and Kwuida, L\u00e9onard and Sertkaya, Baris},<br\/>  keywords = {itegpub},<br\/>  pages = {70-75},<br\/>  publisher = {CEUR-WS.org},<br\/>  series = {CEUR Workshop Proceedings},<br\/>  title = {Conexp-Clj - A Research Tool for FCA.},<br\/>  volume = 2378,<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-432006ec0f26e5c6c5e26900faadc7e3\"><p>%0 Conference Paper<br\/>%1 conf\/icfca\/HanikaH19<br\/>%A Hanika, Tom<br\/>%A Hirth, Johannes<br\/>%B ICFCA (Supplements)<br\/>%D 2019<br\/>%E Cristea, Diana<br\/>%E Ber, Florence Le<br\/>%E Missaoui, Rokia<br\/>%E Kwuida, L\u00e9onard<br\/>%E Sertkaya, Baris<br\/>%I CEUR-WS.org<br\/>%P 70-75<br\/>%T Conexp-Clj - A Research Tool for FCA.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/icfca\/icfca2019suppl.html#HanikaH19<br\/>%V 2378<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Hanika, T., Stubbemann, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">FCA2VEC: Embedding Techniques for Formal Concept Analysis<\/span><\/span>, http:\/\/arxiv.org\/abs\/1911.11496, (2019).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1911.11496\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bc5ab586fced13373155352a704a42fb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bc5ab586fced13373155352a704a42fb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bc5ab586fced13373155352a704a42fb\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-bc5ab586fced13373155352a704a42fb\">Embedding large and high dimensional data into low dimensional vector spaces is a necessary task to computationally cope with contemporary data sets. Superseding latent semantic analysis recent approaches like word2vec or node2vec are well established tools in this realm. In the present paper we add to this line of research by introducing fca2vec, a family of embedding techniques for formal concept analysis (FCA). Our investigation contributes to two distinct lines of research. First, we enable the application of FCA notions to large data sets. In particular, we demonstrate how the cover relation of a concept lattice can be retrieved from a computational feasible embedding. Secondly, we show an enhancement for the classical node2vec approach in low dimension. For both directions the overall constraint of FCA of explainable results is preserved. We evaluate our novel procedures by computing fca2vec on different data sets like, wiki44 (a dense part of the Wikidata knowledge graph), the Mushroom data set and a publication network derived from the FCA community.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bc5ab586fced13373155352a704a42fb\"><p>@misc{durrschnabel2019fca2vec,<br\/>  abstract = {Embedding large and high dimensional data into low dimensional vector spaces is a necessary task to computationally cope with contemporary data sets. Superseding latent semantic analysis recent approaches like word2vec or node2vec are well established tools in this realm. In the present paper we add to this line of research by introducing fca2vec, a family of embedding techniques for formal concept analysis (FCA). Our investigation contributes to two distinct lines of research. First, we enable the application of FCA notions to large data sets. In particular, we demonstrate how the cover relation of a concept lattice can be retrieved from a computational feasible embedding. Secondly, we show an enhancement for the classical node2vec approach in low dimension. For both directions the overall constraint of FCA of explainable results is preserved. We evaluate our novel procedures by computing fca2vec on different data sets like, wiki44 (a dense part of the Wikidata knowledge graph), the Mushroom data set and a publication network derived from the FCA community.},<br\/>  author = {D\u00fcrrschnabel, Dominik and Hanika, Tom and Stubbemann, Maximilian},<br\/>  keywords = {itegpub},<br\/>  note = {cite arxiv:1911.11496Comment: 25 pages},<br\/>  title = {FCA2VEC: Embedding Techniques for Formal Concept Analysis},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bc5ab586fced13373155352a704a42fb\"><p>%0 Generic<br\/>%1 durrschnabel2019fca2vec<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Hanika, Tom<br\/>%A Stubbemann, Maximilian<br\/>%D 2019<br\/>%T FCA2VEC: Embedding Techniques for Formal Concept Analysis<br\/>%U http:\/\/arxiv.org\/abs\/1911.11496<br\/>%X Embedding large and high dimensional data into low dimensional vector spaces is a necessary task to computationally cope with contemporary data sets. Superseding latent semantic analysis recent approaches like word2vec or node2vec are well established tools in this realm. In the present paper we add to this line of research by introducing fca2vec, a family of embedding techniques for formal concept analysis (FCA). Our investigation contributes to two distinct lines of research. First, we enable the application of FCA notions to large data sets. In particular, we demonstrate how the cover relation of a concept lattice can be retrieved from a computational feasible embedding. Secondly, we show an enhancement for the classical node2vec approach in low dimension. For both directions the overall constraint of FCA of explainable results is preserved. We evaluate our novel procedures by computing fca2vec on different data sets like, wiki44 (a dense part of the Wikidata knowledge graph), the Mushroom data set and a publication network derived from the FCA community.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Felde, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Interactive Collaborative Exploration using Incomplete Contexts<\/span><\/span>, https:\/\/arxiv.org\/abs\/1908.08740, (2019).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/1908.08740\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1b65d85a8ac013bea8e9948ac2e2f0b4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1b65d85a8ac013bea8e9948ac2e2f0b4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1b65d85a8ac013bea8e9948ac2e2f0b4\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-1b65d85a8ac013bea8e9948ac2e2f0b4\">A common representation of information about relations of objects and attributes in knowledge domains are data-tables. The structure of such information can be analysed using Formal Concept Analysis (FCA). Attribute exploration is a knowledge acquisition method from FCA that reveals dependencies in a set of attributes with help of a domain expert. However, in general no single expert is capable (time- and knowledge-wise) of exploring knowledge domains alone. Therefore it is important to develop methods that allow multiple experts to explore domains together. To this end we build upon results on representation of incomplete knowledge [2, 8-10], adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy. Furthermore we discuss ways of comparing collaboration strategies and suggest avenues for future research.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1b65d85a8ac013bea8e9948ac2e2f0b4\"><p>@misc{felde2019interactive,<br\/>  abstract = {A common representation of information about relations of objects and attributes in knowledge domains are data-tables. The structure of such information can be analysed using Formal Concept Analysis (FCA). Attribute exploration is a knowledge acquisition method from FCA that reveals dependencies in a set of attributes with help of a domain expert. However, in general no single expert is capable (time- and knowledge-wise) of exploring knowledge domains alone. Therefore it is important to develop methods that allow multiple experts to explore domains together. To this end we build upon results on representation of incomplete knowledge [2, 8-10], adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy. Furthermore we discuss ways of comparing collaboration strategies and suggest avenues for future research.},<br\/>  author = {Felde, Maximilian and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  title = {Interactive Collaborative Exploration using Incomplete Contexts},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1b65d85a8ac013bea8e9948ac2e2f0b4\"><p>%0 Generic<br\/>%1 felde2019interactive<br\/>%A Felde, Maximilian<br\/>%A Stumme, Gerd<br\/>%D 2019<br\/>%T Interactive Collaborative Exploration using Incomplete Contexts<br\/>%U https:\/\/arxiv.org\/abs\/1908.08740<br\/>%X A common representation of information about relations of objects and attributes in knowledge domains are data-tables. The structure of such information can be analysed using Formal Concept Analysis (FCA). Attribute exploration is a knowledge acquisition method from FCA that reveals dependencies in a set of attributes with help of a domain expert. However, in general no single expert is capable (time- and knowledge-wise) of exploring knowledge domains alone. Therefore it is important to develop methods that allow multiple experts to explore domains together. To this end we build upon results on representation of incomplete knowledge [2, 8-10], adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy. Furthermore we discuss ways of comparing collaboration strategies and suggest avenues for future research.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis.<\/span><\/span>, (2019). https:\/\/doi.org\/10.17170\/kobra-20190213189.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0ce70858b4793650763bee71b3e2a407\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0ce70858b4793650763bee71b3e2a407\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.17170\/kobra-20190213189\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0ce70858b4793650763bee71b3e2a407\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0ce70858b4793650763bee71b3e2a407\"><p>@phdthesis{phd\/dnb\/Hanika19,<br\/>  author = {Hanika, Tom},<br\/>  keywords = {itegpub},<br\/>  school = {University of Kassel, Germany},<br\/>  title = {Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis.},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0ce70858b4793650763bee71b3e2a407\"><p>%0 Thesis<br\/>%1 phd\/dnb\/Hanika19<br\/>%A Hanika, Tom<br\/>%D 2019<br\/>%R 10.17170\/kobra-20190213189<br\/>%T Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Felde, M., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Formal Context Generation Using Dirichlet Distributions.<\/span><\/span> In: Endres, D., Alam, M., and Sotropa, D. (eds.) ICCS. pp. 57\u201371. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-23182-8_5.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/iccs\/iccs2019.html#FeldeH19\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3150e7472057f04f6e9e2da1954671ab\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3150e7472057f04f6e9e2da1954671ab\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-23182-8_5\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3150e7472057f04f6e9e2da1954671ab\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3150e7472057f04f6e9e2da1954671ab\"><p>@inproceedings{conf\/iccs\/FeldeH19,<br\/>  author = {Felde, Maximilian and Hanika, Tom},<br\/>  booktitle = {ICCS},<br\/>  crossref = {conf\/iccs\/2019},<br\/>  editor = {Endres, Dominik and Alam, Mehwish and Sotropa, Diana},<br\/>  keywords = {itegpub},<br\/>  pages = {57-71},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Formal Context Generation Using Dirichlet Distributions.},<br\/>  volume = 11530,<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3150e7472057f04f6e9e2da1954671ab\"><p>%0 Conference Paper<br\/>%1 conf\/iccs\/FeldeH19<br\/>%A Felde, Maximilian<br\/>%A Hanika, Tom<br\/>%B ICCS<br\/>%D 2019<br\/>%E Endres, Dominik<br\/>%E Alam, Mehwish<br\/>%E Sotropa, Diana<br\/>%I Springer<br\/>%P 57-71<br\/>%R 10.1007\/978-3-030-23182-8_5<br\/>%T Formal Context Generation Using Dirichlet Distributions.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/iccs\/iccs2019.html#FeldeH19<br\/>%V 11530<br\/>%@ 978-3-030-23182-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Herde, M., Kuhn, J., Leimeister, J.M., Lukowicz, P., Oeste-Rei\u00df, S., Schmidt, A., Sick, B., Stumme, G., Tomforde, S., Zweig, K.A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Collaborative Interactive Learning - A clarification of terms and a differentiation from other research fields.<\/span><\/span> CoRR. abs\/1905.07264, (2019).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1905.html#abs-1905-07264\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-490e9c0fd28c8886ae8e296e1530c219\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-490e9c0fd28c8886ae8e296e1530c219\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/490e9c0fd28c8886ae8e296e1530c219\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-490e9c0fd28c8886ae8e296e1530c219\"><p>@article{journals\/corr\/abs-1905-07264,<br\/>  author = {Hanika, Tom and Herde, Marek and Kuhn, Jochen and Leimeister, Jan Marco and Lukowicz, Paul and Oeste-Rei\u00df, Sarah and Schmidt, Albrecht and Sick, Bernhard and Stumme, Gerd and Tomforde, Sven and Zweig, Katharina Anna},<br\/>  journal = {CoRR},<br\/>  keywords = {itegpub},<br\/>  title = {Collaborative Interactive Learning - A clarification of terms and a differentiation from other research fields.},<br\/>  volume = {abs\/1905.07264},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-490e9c0fd28c8886ae8e296e1530c219\"><p>%0 Journal Article<br\/>%1 journals\/corr\/abs-1905-07264<br\/>%A Hanika, Tom<br\/>%A Herde, Marek<br\/>%A Kuhn, Jochen<br\/>%A Leimeister, Jan Marco<br\/>%A Lukowicz, Paul<br\/>%A Oeste-Rei\u00df, Sarah<br\/>%A Schmidt, Albrecht<br\/>%A Sick, Bernhard<br\/>%A Stumme, Gerd<br\/>%A Tomforde, Sven<br\/>%A Zweig, Katharina Anna<br\/>%D 2019<br\/>%J CoRR<br\/>%T Collaborative Interactive Learning - A clarification of terms and a differentiation from other research fields.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1905.html#abs-1905-07264<br\/>%V abs\/1905.07264<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Koyda, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Relevant Attributes in Formal Contexts.<\/span><\/span> In: Endres, D., Alam, M., and Sotropa, D. (eds.) ICCS. pp. 102\u2013116. Springer (2019).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/iccs\/iccs2019.html#HanikaKS19\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-15b11929b97b4ee48f72f21b1bf49b4b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-15b11929b97b4ee48f72f21b1bf49b4b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/15b11929b97b4ee48f72f21b1bf49b4b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-15b11929b97b4ee48f72f21b1bf49b4b\"><p>@inproceedings{conf\/iccs\/HanikaKS19,<br\/>  author = {Hanika, Tom and Koyda, Maren and Stumme, Gerd},<br\/>  booktitle = {ICCS},<br\/>  crossref = {conf\/iccs\/2019},<br\/>  editor = {Endres, Dominik and Alam, Mehwish and Sotropa, Diana},<br\/>  keywords = {kde},<br\/>  pages = {102-116},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Relevant Attributes in Formal Contexts.},<br\/>  volume = 11530,<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-15b11929b97b4ee48f72f21b1bf49b4b\"><p>%0 Conference Paper<br\/>%1 conf\/iccs\/HanikaKS19<br\/>%A Hanika, Tom<br\/>%A Koyda, Maren<br\/>%A Stumme, Gerd<br\/>%B ICCS<br\/>%D 2019<br\/>%E Endres, Dominik<br\/>%E Alam, Mehwish<br\/>%E Sotropa, Diana<br\/>%I Springer<br\/>%P 102-116<br\/>%T Relevant Attributes in Formal Contexts.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/iccs\/iccs2019.html#HanikaKS19<br\/>%V 11530<br\/>%@ 978-3-030-23182-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Sch\u00e4fermeier, B., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Distances for WiFi Based Topological Indoor Mapping<\/span>.<\/span> In: 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous), November 12--14, 2019, Houston, TX, USA (2019). https:\/\/doi.org\/10.1145\/3360774.3360780.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-09f68c7569b44c806d6be3a7b0d9cecd\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-09f68c7569b44c806d6be3a7b0d9cecd\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/3360774.3360780\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/09f68c7569b44c806d6be3a7b0d9cecd\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-09f68c7569b44c806d6be3a7b0d9cecd\">For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-09f68c7569b44c806d6be3a7b0d9cecd\"><p>@inproceedings{schafermeier2019distances,<br\/>  abstract = {For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.},<br\/>  author = {Sch\u00e4fermeier, Bastian and Hanika, Tom and Stumme, Gerd},<br\/>  booktitle = {16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous), November 12--14, 2019, Houston, TX, USA},<br\/>  keywords = {itegpub},<br\/>  title = {Distances for WiFi Based Topological Indoor Mapping},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-09f68c7569b44c806d6be3a7b0d9cecd\"><p>%0 Conference Paper<br\/>%1 schafermeier2019distances<br\/>%A Sch\u00e4fermeier, Bastian<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%B 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous), November 12--14, 2019, Houston, TX, USA<br\/>%D 2019<br\/>%R 10.1145\/3360774.3360780<br\/>%T Distances for WiFi Based Topological Indoor Mapping<br\/>%X For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.<br\/>%@ 978-1-4503-7283-1\/19\/11<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Marx, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Discovering Implicational Knowledge in Wikidata<\/span>.<\/span> In: Cristea, D., Ber, F.L., and Sertkaya, B. (eds.) Formal Concept Analysis - 15th International Conference, {ICFCA} 2019, Frankfurt, Germany, June 25-28, 2019, Proceedings. pp. 315\u2013323. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-21462-3_21.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_21\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2d7e11d03c808f5ee7f22b106e95c63b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2d7e11d03c808f5ee7f22b106e95c63b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-21462-3_21\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2d7e11d03c808f5ee7f22b106e95c63b\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2d7e11d03c808f5ee7f22b106e95c63b\"><p>@inproceedings{DBLP:conf\/icfca\/Hanika0S19,<br\/>  author = {Hanika, Tom and Marx, Maximilian and Stumme, Gerd},<br\/>  booktitle = {Formal Concept Analysis - 15th International Conference, {ICFCA} 2019, Frankfurt, Germany, June 25-28, 2019, Proceedings},<br\/>  editor = {Cristea, Diana and Ber, Florence Le and Sertkaya, Baris},<br\/>  keywords = {kdepub},<br\/>  pages = {315--323},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Discovering Implicational Knowledge in Wikidata},<br\/>  volume = 11511,<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2d7e11d03c808f5ee7f22b106e95c63b\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/icfca\/Hanika0S19<br\/>%A Hanika, Tom<br\/>%A Marx, Maximilian<br\/>%A Stumme, Gerd<br\/>%B Formal Concept Analysis - 15th International Conference, {ICFCA} 2019, Frankfurt, Germany, June 25-28, 2019, Proceedings<br\/>%D 2019<br\/>%E Cristea, Diana<br\/>%E Ber, Florence Le<br\/>%E Sertkaya, Baris<br\/>%I Springer<br\/>%P 315--323<br\/>%R 10.1007\/978-3-030-21462-3_21<br\/>%T Discovering Implicational Knowledge in Wikidata<br\/>%U https:\/\/doi.org\/10.1007\/978-3-030-21462-3_21<br\/>%V 11511<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stubbemann, M., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Orometric Methods in Bounded Metric Data.<\/span><\/span> CoRR. abs\/1907.09239, (2019).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1907.html#abs-1907-09239\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c5e828427056e8c2daeef526cd5ff31f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c5e828427056e8c2daeef526cd5ff31f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c5e828427056e8c2daeef526cd5ff31f\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c5e828427056e8c2daeef526cd5ff31f\"><p>@article{journals\/corr\/abs-1907-09239,<br\/>  author = {Stubbemann, Maximilian and Hanika, Tom and Stumme, Gerd},<br\/>  journal = {CoRR},<br\/>  keywords = {preprint},<br\/>  note = {Accept for IDA 2020},<br\/>  title = {Orometric Methods in Bounded Metric Data.},<br\/>  volume = {abs\/1907.09239},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c5e828427056e8c2daeef526cd5ff31f\"><p>%0 Journal Article<br\/>%1 journals\/corr\/abs-1907-09239<br\/>%A Stubbemann, Maximilian<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%D 2019<br\/>%J CoRR<br\/>%T Orometric Methods in Bounded Metric Data.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1907.html#abs-1907-09239<br\/>%V abs\/1907.09239<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">D\u00fcrrschnabel, D., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">DimDraw - A Novel Tool for Drawing Concept Lattices.<\/span><\/span> In: Cristea, D., Ber, F.L., Missaoui, R., Kwuida, L., and Sertkaya, B. (eds.) ICFCA (Supplements). pp. 60\u201364. CEUR-WS.org (2019).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/icfca\/icfca2019suppl.html#DurrschnabelHS19\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2a39286fae6486a078398ca2baefd55b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2a39286fae6486a078398ca2baefd55b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2a39286fae6486a078398ca2baefd55b\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2a39286fae6486a078398ca2baefd55b\"><p>@inproceedings{conf\/icfca\/DurrschnabelHS19,<br\/>  author = {D\u00fcrrschnabel, Dominik and Hanika, Tom and Stumme, Gerd},<br\/>  booktitle = {ICFCA (Supplements)},<br\/>  crossref = {conf\/icfca\/2019suppl},<br\/>  editor = {Cristea, Diana and Ber, Florence Le and Missaoui, Rokia and Kwuida, L\u00e9onard and Sertkaya, Baris},<br\/>  keywords = {itegpub},<br\/>  pages = {60-64},<br\/>  publisher = {CEUR-WS.org},<br\/>  series = {CEUR Workshop Proceedings},<br\/>  title = {DimDraw - A Novel Tool for Drawing Concept Lattices.},<br\/>  volume = 2378,<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2a39286fae6486a078398ca2baefd55b\"><p>%0 Conference Paper<br\/>%1 conf\/icfca\/DurrschnabelHS19<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%B ICFCA (Supplements)<br\/>%D 2019<br\/>%E Cristea, Diana<br\/>%E Ber, Florence Le<br\/>%E Missaoui, Rokia<br\/>%E Kwuida, L\u00e9onard<br\/>%E Sertkaya, Baris<br\/>%I CEUR-WS.org<br\/>%P 60-64<br\/>%T DimDraw - A Novel Tool for Drawing Concept Lattices.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/icfca\/icfca2019suppl.html#DurrschnabelHS19<br\/>%V 2378<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Heiberger, R.H., R{\u00f6}dder, S., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Social studies of scholarly life with sensor-based ethnographic observations<\/span>.<\/span> Scientometrics. (2019). https:\/\/doi.org\/10.1007\/s11192-019-03097-w.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/s11192-019-03097-w\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a617b7343a9ae4b2bb383506606de699\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a617b7343a9ae4b2bb383506606de699\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s11192-019-03097-w\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a617b7343a9ae4b2bb383506606de699\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-a617b7343a9ae4b2bb383506606de699\">Social network analysis is playing an increasingly important role in sociological studies. At the same time, new technologies such as wearable sensors make it possible to collect new types of social network data. We employed RFID tags to capture face-to-face interactions of participants of two consecutive Ph.D. retreats of a graduate school on climate research. We use this data in order to explore how it may support ethnographic observations and to gain further insights on scholarly interactions. The unique feature of the data is the opportunity to distinguish short and long conversations, which often have a different nature from a sociological point of view. Furthermore, an advantage of this data is the availability of socio-demographic, research-related, and situational attributes of participants. We show that, even though an interaction partner is often found rather randomly during coffee breaks of retreats, a strong homophily between participants from the same institutions or research areas exists. We identify cores of the networks and participants who play ambassador roles between communities, e.g., persons who visit the retreat for the second time are more likely to be ambassadors. Overall, we show the usefulness and potential of RFID tags for scientometric studies.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a617b7343a9ae4b2bb383506606de699\"><p>@article{kibanov2019social,<br\/>  abstract = {Social network analysis is playing an increasingly important role in sociological studies. At the same time, new technologies such as wearable sensors make it possible to collect new types of social network data. We employed RFID tags to capture face-to-face interactions of participants of two consecutive Ph.D. retreats of a graduate school on climate research. We use this data in order to explore how it may support ethnographic observations and to gain further insights on scholarly interactions. The unique feature of the data is the opportunity to distinguish short and long conversations, which often have a different nature from a sociological point of view. Furthermore, an advantage of this data is the availability of socio-demographic, research-related, and situational attributes of participants. We show that, even though an interaction partner is often found rather randomly during coffee breaks of retreats, a strong homophily between participants from the same institutions or research areas exists. We identify cores of the networks and participants who play ambassador roles between communities, e.g., persons who visit the retreat for the second time are more likely to be ambassadors. Overall, we show the usefulness and potential of RFID tags for scientometric studies.},<br\/>  author = {Kibanov, Mark and Heiberger, Raphael H. and R{\u00f6}dder, Simone and Atzmueller, Martin and Stumme, Gerd},<br\/>  journal = {Scientometrics},<br\/>  keywords = {homophily},<br\/>  month = {05},<br\/>  title = {Social studies of scholarly life with sensor-based ethnographic observations},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a617b7343a9ae4b2bb383506606de699\"><p>%0 Journal Article<br\/>%1 kibanov2019social<br\/>%A Kibanov, Mark<br\/>%A Heiberger, Raphael H.<br\/>%A R{\u00f6}dder, Simone<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%D 2019<br\/>%J Scientometrics<br\/>%R 10.1007\/s11192-019-03097-w<br\/>%T Social studies of scholarly life with sensor-based ethnographic observations<br\/>%U https:\/\/doi.org\/10.1007\/s11192-019-03097-w<br\/>%X Social network analysis is playing an increasingly important role in sociological studies. At the same time, new technologies such as wearable sensors make it possible to collect new types of social network data. We employed RFID tags to capture face-to-face interactions of participants of two consecutive Ph.D. retreats of a graduate school on climate research. We use this data in order to explore how it may support ethnographic observations and to gain further insights on scholarly interactions. The unique feature of the data is the opportunity to distinguish short and long conversations, which often have a different nature from a sociological point of view. Furthermore, an advantage of this data is the availability of socio-demographic, research-related, and situational attributes of participants. We show that, even though an interaction partner is often found rather randomly during coffee breaks of retreats, a strong homophily between participants from the same institutions or research areas exists. We identify cores of the networks and participants who play ambassador roles between communities, e.g., persons who visit the retreat for the second time are more likely to be ambassadors. Overall, we show the usefulness and potential of RFID tags for scientometric studies.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schaefermeier, B., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Distances for wifi based topological indoor mapping<\/span>.<\/span> In: Proceedings of the 16th {EAI} International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services. {ACM} (2019). https:\/\/doi.org\/10.1145\/3360774.3360780.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1145%2F3360774.3360780\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7d27117f9e7285f489478f021ac2c35c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7d27117f9e7285f489478f021ac2c35c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/3360774.3360780\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7d27117f9e7285f489478f021ac2c35c\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7d27117f9e7285f489478f021ac2c35c\"><p>@inproceedings{Schaefermeier_2019,<br\/>  author = {Schaefermeier, Bastian and Hanika, Tom and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 16th {EAI} International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services},<br\/>  keywords = {itegpub},<br\/>  month = 11,<br\/>  publisher = {{ACM}},<br\/>  title = {Distances for wifi based topological indoor mapping},<br\/>  year = 2019<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7d27117f9e7285f489478f021ac2c35c\"><p>%0 Conference Paper<br\/>%1 Schaefermeier_2019<br\/>%A Schaefermeier, Bastian<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 16th {EAI} International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services<br\/>%D 2019<br\/>%I {ACM}<br\/>%R 10.1145\/3360774.3360780<br\/>%T Distances for wifi based topological indoor mapping<br\/>%U https:\/\/doi.org\/10.1145%2F3360774.3360780<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2018\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2018<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Navarro Bullock, B., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Accessing Information with Tags: Search and Ranking<\/span>.<\/span> In: Brusilovsky, P. and He, D. (eds.) Social Information Access: Systems and Technologies. pp. 310\u2013343. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90092-6_9.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-319-90092-6_9\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-df420579b2b03b591c1a454151e4c21a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-df420579b2b03b591c1a454151e4c21a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-90092-6_9\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/df420579b2b03b591c1a454151e4c21a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-df420579b2b03b591c1a454151e4c21a\">With the growth of the Social Web, a variety of new web-based services arose and changed the way users interact with the internet and consume information. One central phenomenon was and is tagging which allows to manage, organize and access information in social systems. Tagging helps to manage all kinds of resources, making their access much easier. The first type of social tagging systems were social bookmarking systems, i.e.,\u00a0platforms for storing and sharing bookmarks on the web rather than just in the browser. Meanwhile, (hash-)tagging is central in many other Social Media systems such as social networking sites and micro-blogging platforms. To allow for efficient information access, special algorithms have been developed to guide the user, to search for information and to rank the content based on tagging information contributed by the users.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-df420579b2b03b591c1a454151e4c21a\"><p>@inbook{NavarroBullock2018,<br\/>  abstract = {With the growth of the Social Web, a variety of new web-based services arose and changed the way users interact with the internet and consume information. One central phenomenon was and is tagging which allows to manage, organize and access information in social systems. Tagging helps to manage all kinds of resources, making their access much easier. The first type of social tagging systems were social bookmarking systems, i.e.,\u00a0platforms for storing and sharing bookmarks on the web rather than just in the browser. Meanwhile, (hash-)tagging is central in many other Social Media systems such as social networking sites and micro-blogging platforms. To allow for efficient information access, special algorithms have been developed to guide the user, to search for information and to rank the content based on tagging information contributed by the users.},<br\/>  address = {Cham},<br\/>  author = {Navarro Bullock, Beate and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Social Information Access: Systems and Technologies},<br\/>  editor = {Brusilovsky, Peter and He, Daqing},<br\/>  keywords = {itegpub},<br\/>  pages = {310--343},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {Accessing Information with Tags: Search and Ranking},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-df420579b2b03b591c1a454151e4c21a\"><p>%0 Book Section<br\/>%1 NavarroBullock2018<br\/>%A Navarro Bullock, Beate<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Social Information Access: Systems and Technologies<br\/>%C Cham<br\/>%D 2018<br\/>%E Brusilovsky, Peter<br\/>%E He, Daqing<br\/>%I Springer International Publishing<br\/>%P 310--343<br\/>%R 10.1007\/978-3-319-90092-6_9<br\/>%T Accessing Information with Tags: Search and Ranking<br\/>%U https:\/\/doi.org\/10.1007\/978-3-319-90092-6_9<br\/>%X With the growth of the Social Web, a variety of new web-based services arose and changed the way users interact with the internet and consume information. One central phenomenon was and is tagging which allows to manage, organize and access information in social systems. Tagging helps to manage all kinds of resources, making their access much easier. The first type of social tagging systems were social bookmarking systems, i.e.,\u00a0platforms for storing and sharing bookmarks on the web rather than just in the browser. Meanwhile, (hash-)tagging is central in many other Social Media systems such as social networking sites and micro-blogging platforms. To allow for efficient information access, special algorithms have been developed to guide the user, to search for information and to rank the content based on tagging information contributed by the users.<br\/>%@ 978-3-319-90092-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Borchmann, D., Hanika, T., Obiedkov, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Probably approximately correct learning of Horn envelopes from queries.<\/span><\/span> CoRR. abs\/1807.06149, (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1807.html#abs-1807-06149\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4780ba2a352bc1739173ce604b19a857\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4780ba2a352bc1739173ce604b19a857\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4780ba2a352bc1739173ce604b19a857\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-4780ba2a352bc1739173ce604b19a857\">We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attribute exploration from formal concept analysis is a procedure that solves this problem, but the number of queries it may ask is exponential in the size of the resulting Horn formula in the worst case. We recall a well-known polynomial-time algorithm for learning Horn formulas with membership and equivalence queries and modify it to obtain a polynomial-time probably approximately correct algorithm for learning the Horn envelope of an arbitrary domain.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4780ba2a352bc1739173ce604b19a857\"><p>@article{journals\/corr\/abs-1807-06149,<br\/>  abstract = {We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attribute exploration from formal concept analysis is a procedure that solves this problem, but the number of queries it may ask is exponential in the size of the resulting Horn formula in the worst case. We recall a well-known polynomial-time algorithm for learning Horn formulas with membership and equivalence queries and modify it to obtain a polynomial-time probably approximately correct algorithm for learning the Horn envelope of an arbitrary domain.},<br\/>  author = {Borchmann, Daniel and Hanika, Tom and Obiedkov, Sergei},<br\/>  journal = {CoRR},<br\/>  keywords = {preprint},<br\/>  note = {cite arxiv:1807.06149Comment: 21 pages, 1 figure},<br\/>  title = {Probably approximately correct learning of Horn envelopes from queries.},<br\/>  volume = {abs\/1807.06149},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4780ba2a352bc1739173ce604b19a857\"><p>%0 Journal Article<br\/>%1 journals\/corr\/abs-1807-06149<br\/>%A Borchmann, Daniel<br\/>%A Hanika, Tom<br\/>%A Obiedkov, Sergei<br\/>%D 2018<br\/>%J CoRR<br\/>%T Probably approximately correct learning of Horn envelopes from queries.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1807.html#abs-1807-06149<br\/>%V abs\/1807.06149<br\/>%X We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attribute exploration from formal concept analysis is a procedure that solves this problem, but the number of queries it may ask is exponential in the size of the resulting Horn formula in the worst case. We recall a well-known polynomial-time algorithm for learning Horn formulas with membership and equivalence queries and modify it to obtain a polynomial-time probably approximately correct algorithm for learning the Horn envelope of an arbitrary domain.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Thiele, L., Atzmueller, M., Stumme, G., Kauffeld, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Frequent and\/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Developmental Peer Network Relationships}<\/span>.<\/span> Psychology. (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-97a8782e3058c05ea9738e61924c5a1e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-97a8782e3058c05ea9738e61924c5a1e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/97a8782e3058c05ea9738e61924c5a1e\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-97a8782e3058c05ea9738e61924c5a1e\"><p>@article{TASK:18,<br\/>  author = {Thiele, Lisa and Atzmueller, Martin and Stumme, Gerd and Kauffeld, Simone},<br\/>  journal = {Psychology},<br\/>  keywords = {face-to-face},<br\/>  month = {(In Press)},<br\/>  title = {{Frequent and\/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Developmental Peer Network Relationships}},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-97a8782e3058c05ea9738e61924c5a1e\"><p>%0 Journal Article<br\/>%1 TASK:18<br\/>%A Thiele, Lisa<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%A Kauffeld, Simone<br\/>%D 2018<br\/>%J Psychology<br\/>%T {Frequent and\/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Developmental Peer Network Relationships}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmidt, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Prominence and Dominance in Networks<\/span>.<\/span> In: Faron Zucker, C., Ghidini, C., Napoli, A., and Yannick, T. (eds.) Proceedings of the 21th International Conference on Knowledge Engineering and Knowledge Management (EKAW). pp. 370\u2013385. Springer (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7a605572becca2774c46b81c70ab5285\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7a605572becca2774c46b81c70ab5285\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7a605572becca2774c46b81c70ab5285\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7a605572becca2774c46b81c70ab5285\"><p>@inproceedings{schmidt2018prominence,<br\/>  author = {Schmidt, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 21th International Conference on Knowledge Engineering and Knowledge Management (EKAW)},<br\/>  editor = {Faron Zucker, Catherine and Ghidini, Chiara and Napoli, Amedeo and Yannick, Toussaint},<br\/>  keywords = {topographic},<br\/>  pages = {370-385},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Prominence and Dominance in Networks},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7a605572becca2774c46b81c70ab5285\"><p>%0 Conference Paper<br\/>%1 schmidt2018prominence<br\/>%A Schmidt, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 21th International Conference on Knowledge Engineering and Knowledge Management (EKAW)<br\/>%D 2018<br\/>%E Faron Zucker, Catherine<br\/>%E Ghidini, Chiara<br\/>%E Napoli, Amedeo<br\/>%E Yannick, Toussaint<br\/>%I Springer<br\/>%P 370-385<br\/>%T Prominence and Dominance in Networks<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Schneider, F.M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Intrinsic dimension of concept lattices<\/span>.<\/span> CoRR. abs\/1801.07985, (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1801.07985\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a36ec328eb85d97351ecc027500b9082\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a36ec328eb85d97351ecc027500b9082\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a36ec328eb85d97351ecc027500b9082\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-a36ec328eb85d97351ecc027500b9082\">Geometric analysis is a very capable theory to understand the influence of the high dimensionality of the input data in machine learning (ML) and knowledge discovery (KD). With our approach we can assess how far the application of a specific KD\/ML-algorithm to a concrete data set is prone to the curse of dimensionality. To this end we extend V.~Pestov's axiomatic approach to the instrinsic dimension of data sets, based on the seminal work by M.~Gromov on concentration phenomena, and provide an adaptable and computationally feasible model for studying observable geometric invariants associated to features that are natural to both the data and the learning procedure. In detail, we investigate data represented by formal contexts and give first theoretical as well as experimental insights into the intrinsic dimension of a concept lattice. Because of the correspondence between formal concepts and maximal cliques in graphs, applications to social network analysis are at hand.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a36ec328eb85d97351ecc027500b9082\"><p>@article{hanika2018intrinsic,<br\/>  abstract = {Geometric analysis is a very capable theory to understand the influence of the high dimensionality of the input data in machine learning (ML) and knowledge discovery (KD). With our approach we can assess how far the application of a specific KD\/ML-algorithm to a concrete data set is prone to the curse of dimensionality. To this end we extend V.~Pestov's axiomatic approach to the instrinsic dimension of data sets, based on the seminal work by M.~Gromov on concentration phenomena, and provide an adaptable and computationally feasible model for studying observable geometric invariants associated to features that are natural to both the data and the learning procedure. In detail, we investigate data represented by formal contexts and give first theoretical as well as experimental insights into the intrinsic dimension of a concept lattice. Because of the correspondence between formal concepts and maximal cliques in graphs, applications to social network analysis are at hand.},<br\/>  author = {Hanika, Tom and Schneider, Friedrich Martin and Stumme, Gerd},<br\/>  journal = {CoRR},<br\/>  keywords = {dimension},<br\/>  note = {cite arxiv:1801.07985Comment: 13 pages, 3 figures},<br\/>  title = {Intrinsic dimension of concept lattices},<br\/>  volume = {abs\/1801.07985},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a36ec328eb85d97351ecc027500b9082\"><p>%0 Journal Article<br\/>%1 hanika2018intrinsic<br\/>%A Hanika, Tom<br\/>%A Schneider, Friedrich Martin<br\/>%A Stumme, Gerd<br\/>%D 2018<br\/>%J CoRR<br\/>%T Intrinsic dimension of concept lattices<br\/>%U http:\/\/arxiv.org\/abs\/1801.07985<br\/>%V abs\/1801.07985<br\/>%X Geometric analysis is a very capable theory to understand the influence of the high dimensionality of the input data in machine learning (ML) and knowledge discovery (KD). With our approach we can assess how far the application of a specific KD\/ML-algorithm to a concrete data set is prone to the curse of dimensionality. To this end we extend V.~Pestov's axiomatic approach to the instrinsic dimension of data sets, based on the seminal work by M.~Gromov on concentration phenomena, and provide an adaptable and computationally feasible model for studying observable geometric invariants associated to features that are natural to both the data and the learning procedure. In detail, we investigate data represented by formal contexts and give first theoretical as well as experimental insights into the intrinsic dimension of a concept lattice. Because of the correspondence between formal concepts and maximal cliques in graphs, applications to social network analysis are at hand.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Schneider, F.M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Intrinsic Dimension of Geometric Data Sets<\/span><\/span>, http:\/\/arxiv.org\/abs\/1801.07985, (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1801.07985\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-43edf6db0867e4e2a0367b63ed4f5096\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-43edf6db0867e4e2a0367b63ed4f5096\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/43edf6db0867e4e2a0367b63ed4f5096\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-43edf6db0867e4e2a0367b63ed4f5096\">The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML\/KD-algorithms, as illustrated by various experiments.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-43edf6db0867e4e2a0367b63ed4f5096\"><p>@misc{hanika2018intrinsic,<br\/>  abstract = {The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML\/KD-algorithms, as illustrated by various experiments.},<br\/>  author = {Hanika, Tom and Schneider, Friedrich Martin and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  note = {cite arxiv:1801.07985Comment: v2: completely rewritten 28 pages, 3 figures, 2 tables},<br\/>  title = {Intrinsic Dimension of Geometric Data Sets},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-43edf6db0867e4e2a0367b63ed4f5096\"><p>%0 Generic<br\/>%1 hanika2018intrinsic<br\/>%A Hanika, Tom<br\/>%A Schneider, Friedrich Martin<br\/>%A Stumme, Gerd<br\/>%D 2018<br\/>%T Intrinsic Dimension of Geometric Data Sets<br\/>%U http:\/\/arxiv.org\/abs\/1801.07985<br\/>%X The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML\/KD-algorithms, as illustrated by various experiments.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Sch\u00e4fermeier, B., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Distances for WiFi Based Topological Indoor Mapping<\/span><\/span>, http:\/\/arxiv.org\/abs\/1809.07405, (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1809.07405\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-737da0fb2fa7f6524008ae98aab715bb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-737da0fb2fa7f6524008ae98aab715bb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/737da0fb2fa7f6524008ae98aab715bb\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-737da0fb2fa7f6524008ae98aab715bb\">For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-737da0fb2fa7f6524008ae98aab715bb\"><p>@misc{schafermeier2018distances,<br\/>  abstract = {For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.},<br\/>  author = {Sch\u00e4fermeier, Bastian and Hanika, Tom and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  note = {cite arxiv:1809.07405Comment: 10 pages, 6 figures},<br\/>  title = {Distances for WiFi Based Topological Indoor Mapping},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-737da0fb2fa7f6524008ae98aab715bb\"><p>%0 Generic<br\/>%1 schafermeier2018distances<br\/>%A Sch\u00e4fermeier, Bastian<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%D 2018<br\/>%T Distances for WiFi Based Topological Indoor Mapping<br\/>%U http:\/\/arxiv.org\/abs\/1809.07405<br\/>%X For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Clones in Social Networks<\/span>.<\/span> CoRR. abs\/1802.07849, (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1802.07849\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9951d39082e8428ffb244bfd81b2f119\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9951d39082e8428ffb244bfd81b2f119\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9951d39082e8428ffb244bfd81b2f119\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9951d39082e8428ffb244bfd81b2f119\">It is well known that any bipartite (social) network can be regarded as a formal context $(G,M,I)$. Therefore, such networks give raise to formal concept lattices which can be investigated utilizing the toolset of Formal Concept Analysis (FCA). In particular, the notion of clones in closure systems on $M$, i.e., pairwise interchangeable attributes that leave the closure system unchanged, suggests itself naturally as a candidate to be analyzed in the realm of FCA based social network analysis. In this study, we investigate the notion of clones in social networks. After building up some theoretical background for the clone relation in formal contexts we try to find clones in real word data sets. To this end, we provide an experimental evaluation on nine mostly well known social networks and provide some first insights on the impact of clones. We conclude our work by nourishing the understanding of clones by generalizing those to permutations of higher order.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9951d39082e8428ffb244bfd81b2f119\"><p>@article{doerfel2018clones,<br\/>  abstract = {It is well known that any bipartite (social) network can be regarded as a formal context $(G,M,I)$. Therefore, such networks give raise to formal concept lattices which can be investigated utilizing the toolset of Formal Concept Analysis (FCA). In particular, the notion of clones in closure systems on $M$, i.e., pairwise interchangeable attributes that leave the closure system unchanged, suggests itself naturally as a candidate to be analyzed in the realm of FCA based social network analysis. In this study, we investigate the notion of clones in social networks. After building up some theoretical background for the clone relation in formal contexts we try to find clones in real word data sets. To this end, we provide an experimental evaluation on nine mostly well known social networks and provide some first insights on the impact of clones. We conclude our work by nourishing the understanding of clones by generalizing those to permutations of higher order.},<br\/>  author = {Doerfel, Stephan and Hanika, Tom and Stumme, Gerd},<br\/>  journal = {CoRR},<br\/>  keywords = {networks},<br\/>  note = {cite arxiv:1802.07849Comment: 12 pages, 2 figures, 2 tables},<br\/>  title = {Clones in Social Networks},<br\/>  volume = {abs\/1802.07849},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9951d39082e8428ffb244bfd81b2f119\"><p>%0 Journal Article<br\/>%1 doerfel2018clones<br\/>%A Doerfel, Stephan<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%D 2018<br\/>%J CoRR<br\/>%T Clones in Social Networks<br\/>%U http:\/\/arxiv.org\/abs\/1802.07849<br\/>%V abs\/1802.07849<br\/>%X It is well known that any bipartite (social) network can be regarded as a formal context $(G,M,I)$. Therefore, such networks give raise to formal concept lattices which can be investigated utilizing the toolset of Formal Concept Analysis (FCA). In particular, the notion of clones in closure systems on $M$, i.e., pairwise interchangeable attributes that leave the closure system unchanged, suggests itself naturally as a candidate to be analyzed in the realm of FCA based social network analysis. In this study, we investigate the notion of clones in social networks. After building up some theoretical background for the clone relation in formal contexts we try to find clones in real word data sets. To this end, we provide an experimental evaluation on nine mostly well known social networks and provide some first insights on the impact of clones. We conclude our work by nourishing the understanding of clones by generalizing those to permutations of higher order.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Becker, M., M\u00fcller, J., Atzmueller, M., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Adaptive kNN Using Expected Accuracy for Classification of Geo-Spatial Data}<\/span>.<\/span> In: Proc. 33rd ACM Symposium On Applied Computing. ACM Press, New York, NY, USA (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cb3f8e9e22cfc83cf73337c42116d318\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cb3f8e9e22cfc83cf73337c42116d318\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cb3f8e9e22cfc83cf73337c42116d318\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cb3f8e9e22cfc83cf73337c42116d318\"><p>@inproceedings{KBMAHS:18,<br\/>  address = {New York, NY, USA},<br\/>  author = {Kibanov, Mark and Becker, Martin and M\u00fcller, J\u00fcrgen and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proc. 33rd ACM Symposium On Applied Computing},<br\/>  keywords = {classification},<br\/>  publisher = {ACM Press},<br\/>  title = {{Adaptive kNN Using Expected Accuracy for Classification of Geo-Spatial Data}},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cb3f8e9e22cfc83cf73337c42116d318\"><p>%0 Conference Paper<br\/>%1 KBMAHS:18<br\/>%A Kibanov, Mark<br\/>%A Becker, Martin<br\/>%A M\u00fcller, J\u00fcrgen<br\/>%A Atzmueller, Martin<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proc. 33rd ACM Symposium On Applied Computing<br\/>%C New York, NY, USA<br\/>%D 2018<br\/>%I ACM Press<br\/>%T {Adaptive kNN Using Expected Accuracy for Classification of Geo-Spatial Data}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Schneider, F.M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Intrinsic dimension and its application to association rules<\/span>.<\/span> CoRR. abs\/1805.05714, (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1805.05714\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-db9d371db8b8ad6d580666d06805f733\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-db9d371db8b8ad6d580666d06805f733\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/db9d371db8b8ad6d580666d06805f733\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-db9d371db8b8ad6d580666d06805f733\">The curse of dimensionality in the realm of association rules is twofold. Firstly, we have the well known exponential increase in computational complexity with increasing item set size. Secondly, there is a \\emph{related curse} concerned with the distribution of (spare) data itself in high dimension. The former problem is often coped with by projection, i.e., feature selection, whereas the best known strategy for the latter is avoidance. This work summarizes the first attempt to provide a computationally feasible method for measuring the extent of dimension curse present in a data set with respect to a particular class machine of learning procedures. This recent development enables the application of various other methods from geometric analysis to be investigated and applied in machine learning procedures in the presence of high dimension.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-db9d371db8b8ad6d580666d06805f733\"><p>@article{hanika2018intrinsic,<br\/>  abstract = {The curse of dimensionality in the realm of association rules is twofold. Firstly, we have the well known exponential increase in computational complexity with increasing item set size. Secondly, there is a \\emph{related curse} concerned with the distribution of (spare) data itself in high dimension. The former problem is often coped with by projection, i.e., feature selection, whereas the best known strategy for the latter is avoidance. This work summarizes the first attempt to provide a computationally feasible method for measuring the extent of dimension curse present in a data set with respect to a particular class machine of learning procedures. This recent development enables the application of various other methods from geometric analysis to be investigated and applied in machine learning procedures in the presence of high dimension.},<br\/>  author = {Hanika, Tom and Schneider, Friedrich Martin and Stumme, Gerd},<br\/>  journal = {CoRR},<br\/>  keywords = {dimension},<br\/>  note = {cite arxiv:1805.05714Comment: 4 pages, 1 figure},<br\/>  title = {Intrinsic dimension and its application to association rules},<br\/>  volume = {abs\/1805.05714},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-db9d371db8b8ad6d580666d06805f733\"><p>%0 Journal Article<br\/>%1 hanika2018intrinsic<br\/>%A Hanika, Tom<br\/>%A Schneider, Friedrich Martin<br\/>%A Stumme, Gerd<br\/>%D 2018<br\/>%J CoRR<br\/>%T Intrinsic dimension and its application to association rules<br\/>%U http:\/\/arxiv.org\/abs\/1805.05714<br\/>%V abs\/1805.05714<br\/>%X The curse of dimensionality in the realm of association rules is twofold. Firstly, we have the well known exponential increase in computational complexity with increasing item set size. Secondly, there is a \\emph{related curse} concerned with the distribution of (spare) data itself in high dimension. The former problem is often coped with by projection, i.e., feature selection, whereas the best known strategy for the latter is avoidance. This work summarizes the first attempt to provide a computationally feasible method for measuring the extent of dimension curse present in a data set with respect to a particular class machine of learning procedures. This recent development enables the application of various other methods from geometric analysis to be investigated and applied in machine learning procedures in the presence of high dimension.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Koyda, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Relevant Attributes in Formal Contexts.<\/span><\/span> CoRR. abs\/1812.08868, (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1812.html#abs-1812-08868\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-de85d7174039bae4af32e837cbe427b8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-de85d7174039bae4af32e837cbe427b8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/de85d7174039bae4af32e837cbe427b8\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-de85d7174039bae4af32e837cbe427b8\"><p>@article{journals\/corr\/abs-1812-08868,<br\/>  author = {Hanika, Tom and Koyda, Maren and Stumme, Gerd},<br\/>  journal = {CoRR},<br\/>  keywords = {relevance},<br\/>  note = {Accepted for ICCS'19},<br\/>  title = {Relevant Attributes in Formal Contexts.},<br\/>  volume = {abs\/1812.08868},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-de85d7174039bae4af32e837cbe427b8\"><p>%0 Journal Article<br\/>%1 journals\/corr\/abs-1812-08868<br\/>%A Hanika, Tom<br\/>%A Koyda, Maren<br\/>%A Stumme, Gerd<br\/>%D 2018<br\/>%J CoRR<br\/>%T Relevant Attributes in Formal Contexts.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1812.html#abs-1812-08868<br\/>%V abs\/1812.08868<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Felde, M., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Formal Context Generation using Dirichlet Distributions.<\/span><\/span> CoRR. abs\/1809.11160, (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1809.html#abs-1809-11160\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-df37aff932c689b5d25aef65787c0e2e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-df37aff932c689b5d25aef65787c0e2e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/df37aff932c689b5d25aef65787c0e2e\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-df37aff932c689b5d25aef65787c0e2e\"><p>@article{journals\/corr\/abs-1809-11160,<br\/>  author = {Felde, Maximilian and Hanika, Tom},<br\/>  journal = {CoRR},<br\/>  keywords = {kde},<br\/>  note = {Accepted for ICCS'19},<br\/>  title = {Formal Context Generation using Dirichlet Distributions.},<br\/>  volume = {abs\/1809.11160},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-df37aff932c689b5d25aef65787c0e2e\"><p>%0 Journal Article<br\/>%1 journals\/corr\/abs-1809-11160<br\/>%A Felde, Maximilian<br\/>%A Hanika, Tom<br\/>%D 2018<br\/>%J CoRR<br\/>%T Formal Context Generation using Dirichlet Distributions.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1809.html#abs-1809-11160<br\/>%V abs\/1809.11160<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Demel, A., D\u00fcrrschnabel, D., Mchedlidze, T., Radermacher, M., Wulf, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Greedy Heuristic for Crossing-Angle Maximization.<\/span><\/span> In: Biedl, T.C. and Kerren, A. (eds.) Graph Drawing. pp. 286\u2013299. Springer (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/gd\/gd2018.html#DemelDMRW18\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4d53ae536166435e13c78aeb2025d574\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4d53ae536166435e13c78aeb2025d574\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4d53ae536166435e13c78aeb2025d574\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4d53ae536166435e13c78aeb2025d574\"><p>@inproceedings{conf\/gd\/DemelDMRW18,<br\/>  author = {Demel, Almut and D\u00fcrrschnabel, Dominik and Mchedlidze, Tamara and Radermacher, Marcel and Wulf, Lasse},<br\/>  booktitle = {Graph Drawing},<br\/>  crossref = {conf\/gd\/2018},<br\/>  editor = {Biedl, Therese C. and Kerren, Andreas},<br\/>  keywords = {greedy_heuristik},<br\/>  pages = {286-299},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {A Greedy Heuristic for Crossing-Angle Maximization.},<br\/>  volume = 11282,<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4d53ae536166435e13c78aeb2025d574\"><p>%0 Conference Paper<br\/>%1 conf\/gd\/DemelDMRW18<br\/>%A Demel, Almut<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Mchedlidze, Tamara<br\/>%A Radermacher, Marcel<br\/>%A Wulf, Lasse<br\/>%B Graph Drawing<br\/>%D 2018<br\/>%E Biedl, Therese C.<br\/>%E Kerren, Andreas<br\/>%I Springer<br\/>%P 286-299<br\/>%T A Greedy Heuristic for Crossing-Angle Maximization.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/gd\/gd2018.html#DemelDMRW18<br\/>%V 11282<br\/>%@ 978-3-030-04414-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Thiele, L., Atzmueller, M., Stumme, G., Kauffeld, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Frequent and\/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Students\u2019 Developmental Peer Network Relationships<\/span>.<\/span> Psychology. 09, 633\u2013654 (2018). https:\/\/doi.org\/10.4236\/psych.2018.94040.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.4236%2Fpsych.2018.94040\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ed9538d1fb58f080555d28c89b7dc46b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ed9538d1fb58f080555d28c89b7dc46b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.4236\/psych.2018.94040\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ed9538d1fb58f080555d28c89b7dc46b\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ed9538d1fb58f080555d28c89b7dc46b\"><p>@article{thiele2018frequent,<br\/>  author = {Thiele, Lisa and Atzmueller, Martin and Stumme, Gerd and Kauffeld, Simone},<br\/>  journal = {Psychology},<br\/>  keywords = {itegpub},<br\/>  number = {04},<br\/>  pages = {633--654},<br\/>  publisher = {Scientific Research Publishing, Inc,},<br\/>  title = {Frequent and\/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Students' Developmental Peer Network Relationships},<br\/>  volume = {09},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ed9538d1fb58f080555d28c89b7dc46b\"><p>%0 Journal Article<br\/>%1 thiele2018frequent<br\/>%A Thiele, Lisa<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%A Kauffeld, Simone<br\/>%D 2018<br\/>%I Scientific Research Publishing, Inc,<br\/>%J Psychology<br\/>%N 04<br\/>%P 633--654<br\/>%R 10.4236\/psych.2018.94040<br\/>%T Frequent and\/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Students' Developmental Peer Network Relationships<br\/>%U https:\/\/doi.org\/10.4236%2Fpsych.2018.94040<br\/>%V 09<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., Hanika, T., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Clones in Graphs.<\/span><\/span> In: Ceci, M., Japkowicz, N., Liu, J., Papadopoulos, G.A., and Ras, Z.W. (eds.) ISMIS. pp. 56\u201366. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-01851-1_6.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/ismis\/ismis2018.html#DoerfelHS18\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e347f5fa3a991bc49dc2d5f1c1556694\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e347f5fa3a991bc49dc2d5f1c1556694\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-01851-1_6\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e347f5fa3a991bc49dc2d5f1c1556694\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e347f5fa3a991bc49dc2d5f1c1556694\"><p>@inproceedings{conf\/ismis\/DoerfelHS18,<br\/>  author = {Doerfel, Stephan and Hanika, Tom and Stumme, Gerd},<br\/>  booktitle = {ISMIS},<br\/>  crossref = {conf\/ismis\/2018},<br\/>  editor = {Ceci, Michelangelo and Japkowicz, Nathalie and Liu, Jiming and Papadopoulos, George A. and Ras, Zbigniew W.},<br\/>  keywords = {kdepub},<br\/>  pages = {56-66},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Clones in Graphs.},<br\/>  volume = 11177,<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e347f5fa3a991bc49dc2d5f1c1556694\"><p>%0 Conference Paper<br\/>%1 conf\/ismis\/DoerfelHS18<br\/>%A Doerfel, Stephan<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%B ISMIS<br\/>%D 2018<br\/>%E Ceci, Michelangelo<br\/>%E Japkowicz, Nathalie<br\/>%E Liu, Jiming<br\/>%E Papadopoulos, George A.<br\/>%E Ras, Zbigniew W.<br\/>%I Springer<br\/>%P 56-66<br\/>%R 10.1007\/978-3-030-01851-1_6<br\/>%T Clones in Graphs.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/ismis\/ismis2018.html#DoerfelHS18<br\/>%V 11177<br\/>%@ 978-3-030-01851-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Analyzing Group Interaction on Networks of Face-to-Face Proximity using Wearable Sensors}<\/span>.<\/span> In: Proc. IEEE International Conference on Future IoT Technologies. IEEE Press, Boston, MA, USA (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2018-FutureIoT-Atzmueller-DSNA.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3b5a09791b10f1014c270f429a377a71\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3b5a09791b10f1014c270f429a377a71\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3b5a09791b10f1014c270f429a377a71\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3b5a09791b10f1014c270f429a377a71\"><p>@inproceedings{ATSK:18,<br\/>  address = {Boston, MA, USA},<br\/>  author = {Atzmueller, Martin and Thiele, Lisa and Stumme, Gerd and Kauffeld, Simone},<br\/>  booktitle = {Proc. IEEE International Conference on Future IoT Technologies},<br\/>  keywords = {behavior},<br\/>  publisher = {IEEE Press},<br\/>  title = {{Analyzing Group Interaction on Networks of Face-to-Face Proximity using Wearable Sensors}},<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3b5a09791b10f1014c270f429a377a71\"><p>%0 Conference Paper<br\/>%1 ATSK:18<br\/>%A Atzmueller, Martin<br\/>%A Thiele, Lisa<br\/>%A Stumme, Gerd<br\/>%A Kauffeld, Simone<br\/>%B Proc. IEEE International Conference on Future IoT Technologies<br\/>%C Boston, MA, USA<br\/>%D 2018<br\/>%I IEEE Press<br\/>%T {Analyzing Group Interaction on Networks of Face-to-Face Proximity using Wearable Sensors}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2018-FutureIoT-Atzmueller-DSNA.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Zumbr\u00e4gel, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Collaborative Conceptual Exploration.<\/span><\/span> In: Chapman, P., Endres, D., and Pernelle, N. (eds.) ICCS. pp. 120\u2013134. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-91379-7_10.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/iccs\/iccs2018.html#HanikaZ18\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3a36f6cc1814bf23c75d8d37a2b16024\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3a36f6cc1814bf23c75d8d37a2b16024\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-91379-7_10\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3a36f6cc1814bf23c75d8d37a2b16024\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3a36f6cc1814bf23c75d8d37a2b16024\"><p>@inproceedings{conf\/iccs\/HanikaZ18,<br\/>  author = {Hanika, Tom and Zumbr\u00e4gel, Jens},<br\/>  booktitle = {ICCS},<br\/>  crossref = {conf\/iccs\/2018},<br\/>  editor = {Chapman, Peter and Endres, Dominik and Pernelle, Nathalie},<br\/>  keywords = {itegpub},<br\/>  pages = {120-134},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Towards Collaborative Conceptual Exploration.},<br\/>  volume = 10872,<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3a36f6cc1814bf23c75d8d37a2b16024\"><p>%0 Conference Paper<br\/>%1 conf\/iccs\/HanikaZ18<br\/>%A Hanika, Tom<br\/>%A Zumbr\u00e4gel, Jens<br\/>%B ICCS<br\/>%D 2018<br\/>%E Chapman, Peter<br\/>%E Endres, Dominik<br\/>%E Pernelle, Nathalie<br\/>%I Springer<br\/>%P 120-134<br\/>%R 10.1007\/978-3-319-91379-7_10<br\/>%T Towards Collaborative Conceptual Exploration.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/iccs\/iccs2018.html#HanikaZ18<br\/>%V 10872<br\/>%@ 978-3-319-91379-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Axenovich, M., D\u00fcrrschnabel, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Subsets of vertices of the same size and the same maximum distance<\/span>.<\/span> 5, (2018).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/digitalcommons.georgiasouthern.edu\/tag\/vol5\/iss2\/7\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6c6cd7d05ad108998199f5783bddb524\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6c6cd7d05ad108998199f5783bddb524\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6c6cd7d05ad108998199f5783bddb524\/duerrschnabel\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6c6cd7d05ad108998199f5783bddb524\"><p>@article{axenovich2018subsets,<br\/>  author = {Axenovich, Maria and D\u00fcrrschnabel, Dominik},<br\/>  keywords = 2018,<br\/>  number = 2,<br\/>  title = {Subsets of vertices of the same size and the same maximum distance},<br\/>  volume = 5,<br\/>  year = 2018<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6c6cd7d05ad108998199f5783bddb524\"><p>%0 Journal Article<br\/>%1 axenovich2018subsets<br\/>%A Axenovich, Maria<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%D 2018<br\/>%N 2<br\/>%T Subsets of vertices of the same size and the same maximum distance<br\/>%U https:\/\/digitalcommons.georgiasouthern.edu\/tag\/vol5\/iss2\/7\/<br\/>%V 5<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2017\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2017<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Loreto, V., Haklay, M., Hotho, A., Servedio, V.C.P., Stumme, G., Theunis, J., Tria, F. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Participatory sensing, opinions and collective awareness<\/span>.<\/span> Springer (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4dca15ffae60fc62e68ab32e6fa2cc1b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4dca15ffae60fc62e68ab32e6fa2cc1b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4dca15ffae60fc62e68ab32e6fa2cc1b\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4dca15ffae60fc62e68ab32e6fa2cc1b\"><p>@book{loreto2017participatory,<br\/>  editor = {Loreto, Vittorio and Haklay, Mordechai and Hotho, Andreas and Servedio, Vito C. P. and Stumme, Gerd and Theunis, Jan and Tria, Francesca},<br\/>  keywords = {myown},<br\/>  publisher = {Springer},<br\/>  title = {Participatory sensing, opinions and collective awareness},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4dca15ffae60fc62e68ab32e6fa2cc1b\"><p>%0 Book<br\/>%1 loreto2017participatory<br\/>%D 2017<br\/>%E Loreto, Vittorio<br\/>%E Haklay, Mordechai<br\/>%E Hotho, Andreas<br\/>%E Servedio, Vito C. P.<br\/>%E Stumme, Gerd<br\/>%E Theunis, Jan<br\/>%E Tria, Francesca<br\/>%I Springer<br\/>%T Participatory sensing, opinions and collective awareness<br\/>%@ 9783319256580 3319256580<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Gautama, S., Atzmueller, M., Kostakos, V., Gillis, D., Hosio, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Observing Human Activity Through Sensing}<\/span>.<\/span> In: Loreto, V., Haklay, M., Hotho, A., Servedio, V.D., Stumme, G., Tria, F., and Theunis, J. (eds.) Participatory Sensing, Opinions and Collective Awareness. Springer Verlag, Heidelberg, Germany (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-EveryAware-Book-part_I_ch_3_Gautama.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2d074a3b7b263a532e1de96e3ea5be8b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2d074a3b7b263a532e1de96e3ea5be8b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2d074a3b7b263a532e1de96e3ea5be8b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2d074a3b7b263a532e1de96e3ea5be8b\"><p>@incollection{GAKGH:16,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Gautama, Sidharta and Atzmueller, Martin and Kostakos, Vasillis and Gillis, Dominique and Hosio, Simo},<br\/>  booktitle = {Participatory Sensing, Opinions and Collective Awareness},<br\/>  editor = {Loreto, Vittorio and Haklay, Muki and Hotho, Andreas and Servedio, Vito D.P. and Stumme, Gerd and Tria, Francesca and Theunis, Jan},<br\/>  keywords = {human},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Observing Human Activity Through Sensing}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2d074a3b7b263a532e1de96e3ea5be8b\"><p>%0 Book Section<br\/>%1 GAKGH:16<br\/>%A Gautama, Sidharta<br\/>%A Atzmueller, Martin<br\/>%A Kostakos, Vasillis<br\/>%A Gillis, Dominique<br\/>%A Hosio, Simo<br\/>%B Participatory Sensing, Opinions and Collective Awareness<br\/>%C Heidelberg, Germany<br\/>%D 2017<br\/>%E Loreto, Vittorio<br\/>%E Haklay, Muki<br\/>%E Hotho, Andreas<br\/>%E Servedio, Vito D.P.<br\/>%E Stumme, Gerd<br\/>%E Tria, Francesca<br\/>%E Theunis, Jan<br\/>%I Springer Verlag<br\/>%T {Observing Human Activity Through Sensing}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-EveryAware-Book-part_I_ch_3_Gautama.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mueller, J., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Predicting Rising Follower Counts on Twitter Using Profile Information<\/span>.<\/span> In: 9th International ACM Web Science Conference 2017 (WebSci 2017), Troy, NY, USA, June 26-28, 2017. Accepted for Publication. ACM, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3091478.3091490.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1145\/3091478.3091490\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c2dcb99b790396a843ce607c526058f6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c2dcb99b790396a843ce607c526058f6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/3091478.3091490\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c2dcb99b790396a843ce607c526058f6\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-c2dcb99b790396a843ce607c526058f6\">When evaluating the cause of one's popularity on Twitter, one thing is considered to be the main driver: Many tweets. There is debate about the kind of tweet one should publish, but little beyond tweets. Of particular interest is the information provided by each Twitter user's profile page. One of the features are the given names on those profiles. Studies on psychology and economics identified correlations of the first name to, e.g., one's school marks or chances of getting a job interview in the US. Therefore, we are interested in the influence of those profile information on the follower count. We addressed this question by analyzing the profiles of about 6 Million Twitter users. All profiles are separated into three groups: Users that have a first name, English words, or neither of both in their name field. The assumption is that names and words influence the discoverability of a user and subsequently his\/her follower count. We propose a classifier that labels users who will increase their follower count within a month by applying different models based on the user's group. The classifiers are evaluated with the area under the receiver operator curve score and achieves a score above 0.800.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c2dcb99b790396a843ce607c526058f6\"><p>@inproceedings{mueller-2017,<br\/>  abstract = {When evaluating the cause of one's popularity on Twitter, one thing is considered to be the main driver: Many tweets. There is debate about the kind of tweet one should publish, but little beyond tweets. Of particular interest is the information provided by each Twitter user's profile page. One of the features are the given names on those profiles. Studies on psychology and economics identified correlations of the first name to, e.g., one's school marks or chances of getting a job interview in the US. Therefore, we are interested in the influence of those profile information on the follower count. We addressed this question by analyzing the profiles of about 6 Million Twitter users. All profiles are separated into three groups: Users that have a first name, English words, or neither of both in their name field. The assumption is that names and words influence the discoverability of a user and subsequently his\/her follower count. We propose a classifier that labels users who will increase their follower count within a month by applying different models based on the user's group. The classifiers are evaluated with the area under the receiver operator curve score and achieves a score above 0.800.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Mueller, Juergen and Stumme, Gerd},<br\/>  booktitle = {9th International ACM Web Science Conference 2017 (WebSci 2017), Troy, NY, USA, June 26-28, 2017. Accepted for Publication},<br\/>  keywords = {KDE},<br\/>  month = {06},<br\/>  publisher = {ACM},<br\/>  title = {Predicting Rising Follower Counts on Twitter Using Profile Information},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c2dcb99b790396a843ce607c526058f6\"><p>%0 Conference Paper<br\/>%1 mueller-2017<br\/>%A Mueller, Juergen<br\/>%A Stumme, Gerd<br\/>%B 9th International ACM Web Science Conference 2017 (WebSci 2017), Troy, NY, USA, June 26-28, 2017. Accepted for Publication<br\/>%C New York, NY, USA<br\/>%D 2017<br\/>%I ACM<br\/>%R 10.1145\/3091478.3091490<br\/>%T Predicting Rising Follower Counts on Twitter Using Profile Information<br\/>%U http:\/\/dx.doi.org\/10.1145\/3091478.3091490<br\/>%X When evaluating the cause of one's popularity on Twitter, one thing is considered to be the main driver: Many tweets. There is debate about the kind of tweet one should publish, but little beyond tweets. Of particular interest is the information provided by each Twitter user's profile page. One of the features are the given names on those profiles. Studies on psychology and economics identified correlations of the first name to, e.g., one's school marks or chances of getting a job interview in the US. Therefore, we are interested in the influence of those profile information on the follower count. We addressed this question by analyzing the profiles of about 6 Million Twitter users. All profiles are separated into three groups: Users that have a first name, English words, or neither of both in their name field. The assumption is that names and words influence the discoverability of a user and subsequently his\/her follower count. We propose a classifier that labels users who will increase their follower count within a month by applying different models based on the user's group. The classifiers are evaluated with the area under the receiver operator curve score and achieves a score above 0.800.<br\/>%@ 978-1-4503-4896-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Schmidt, A., Kloepper, B., Arnu, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{HypGraphs: An Approach for Analysis and Assessment of Graph-Based and Sequential Hypotheses}<\/span>.<\/span> In: New Frontiers in Mining Complex Patterns. Postproceedings NFMCP 2016. Springer Verlag, Berlin\/Heidelberg, Germany (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/Atzmueller-Hypgraphs-NFMCP2016-PP.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f1103dca0dd19bd4d0517d5073920906\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f1103dca0dd19bd4d0517d5073920906\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f1103dca0dd19bd4d0517d5073920906\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f1103dca0dd19bd4d0517d5073920906\"><p>@inproceedings{ASKA:17,<br\/>  address = {Berlin\/Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin and Schmidt, Andreas and Kloepper, Benjamin and Arnu, David},<br\/>  booktitle = {New Frontiers in Mining Complex Patterns. Postproceedings NFMCP 2016},<br\/>  keywords = {sequential},<br\/>  month = {(In Press)},<br\/>  publisher = {Springer Verlag},<br\/>  series = {LNAI},<br\/>  title = {{HypGraphs: An Approach for Analysis and Assessment of Graph-Based and Sequential Hypotheses}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f1103dca0dd19bd4d0517d5073920906\"><p>%0 Conference Paper<br\/>%1 ASKA:17<br\/>%A Atzmueller, Martin<br\/>%A Schmidt, Andreas<br\/>%A Kloepper, Benjamin<br\/>%A Arnu, David<br\/>%B New Frontiers in Mining Complex Patterns. Postproceedings NFMCP 2016<br\/>%C Berlin\/Heidelberg, Germany<br\/>%D 2017<br\/>%I Springer Verlag<br\/>%T {HypGraphs: An Approach for Analysis and Assessment of Graph-Based and Sequential Hypotheses}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/Atzmueller-Hypgraphs-NFMCP2016-PP.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Onto Explicative Data Mining: Exploratory, Interpretable and Explainable Analysis}<\/span>.<\/span> In: Proc. Dutch-Belgian Database Day. TU Eindhoven, Netherlands (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-dbdbd-preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7d0ed1b7cbbde15971a1a5aeb318bfb3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7d0ed1b7cbbde15971a1a5aeb318bfb3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7d0ed1b7cbbde15971a1a5aeb318bfb3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7d0ed1b7cbbde15971a1a5aeb318bfb3\"><p>@inproceedings{Atzmueller:DBDBD17,<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Proc. Dutch-Belgian Database Day},<br\/>  keywords = {explanation-aware},<br\/>  month = {(accepted)},<br\/>  organization = {TU Eindhoven, Netherlands},<br\/>  title = {{Onto Explicative Data Mining: Exploratory, Interpretable and Explainable Analysis}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7d0ed1b7cbbde15971a1a5aeb318bfb3\"><p>%0 Conference Paper<br\/>%1 Atzmueller:DBDBD17<br\/>%A Atzmueller, Martin<br\/>%B Proc. Dutch-Belgian Database Day<br\/>%D 2017<br\/>%T {Onto Explicative Data Mining: Exploratory, Interpretable and Explainable Analysis}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-dbdbd-preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Sternberg, E.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Mixed-Initiative Feature Engineering Using Knowledge Graphs}<\/span>.<\/span> In: Proc. 9th International Conference on Knowledge Capture (K-CAP). ACM Press, New York, NY, USA (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-kcap.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a4008c35c70b0a13da1b8932581a2c71\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a4008c35c70b0a13da1b8932581a2c71\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a4008c35c70b0a13da1b8932581a2c71\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a4008c35c70b0a13da1b8932581a2c71\"><p>@inproceedings{AS:17,<br\/>  address = {New York, NY, USA},<br\/>  author = {Atzmueller, Martin and Sternberg, Eric},<br\/>  booktitle = {Proc. 9th International Conference on Knowledge Capture (K-CAP)},<br\/>  keywords = {itegpub},<br\/>  month = {(accepted)},<br\/>  publisher = {ACM Press},<br\/>  title = {{Mixed-Initiative Feature Engineering Using Knowledge Graphs}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a4008c35c70b0a13da1b8932581a2c71\"><p>%0 Conference Paper<br\/>%1 AS:17<br\/>%A Atzmueller, Martin<br\/>%A Sternberg, Eric<br\/>%B Proc. 9th International Conference on Knowledge Capture (K-CAP)<br\/>%C New York, NY, USA<br\/>%D 2017<br\/>%I ACM Press<br\/>%T {Mixed-Initiative Feature Engineering Using Knowledge Graphs}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-kcap.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Contact Patterns, Group Interaction and Dynamics on Socio-Behavioral Multiplex Networks}<\/span>.<\/span> In: Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017). Eindhoven University of Technology, Eindhoven, The Netherlands (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-bl-connectu-preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-55bfbc13eb18a26eb58ece261e9c7312\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-55bfbc13eb18a26eb58ece261e9c7312\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/55bfbc13eb18a26eb58ece261e9c7312\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-55bfbc13eb18a26eb58ece261e9c7312\"><p>@inproceedings{ATSK:17,<br\/>  address = {Eindhoven, The Netherlands},<br\/>  author = {Atzmueller, Martin and Thiele, Lisa and Stumme, Gerd and Kauffeld, Simone},<br\/>  booktitle = {Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017)},<br\/>  keywords = {contacts},<br\/>  publisher = {Eindhoven University of Technology},<br\/>  title = {{Contact Patterns, Group Interaction and Dynamics on Socio-Behavioral Multiplex Networks}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-55bfbc13eb18a26eb58ece261e9c7312\"><p>%0 Conference Paper<br\/>%1 ATSK:17<br\/>%A Atzmueller, Martin<br\/>%A Thiele, Lisa<br\/>%A Stumme, Gerd<br\/>%A Kauffeld, Simone<br\/>%B Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017)<br\/>%C Eindhoven, The Netherlands<br\/>%D 2017<br\/>%I Eindhoven University of Technology<br\/>%T {Contact Patterns, Group Interaction and Dynamics on Socio-Behavioral Multiplex Networks}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-bl-connectu-preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Becker, M., Mueller, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Collective Sensing Platforms}<\/span>.<\/span> In: Loreto, V., Haklay, M., Hotho, A., Servedio, V.D., Stumme, G., Tria, F., and Theunis, J. (eds.) Participatory Sensing, Opinions and Collective Awareness. Springer Verlag, Heidelberg, Germany (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-EveryAware-Book-part_I_ch_6_Atzmueller.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0d5a6696876979c24c4f54dc30738977\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0d5a6696876979c24c4f54dc30738977\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0d5a6696876979c24c4f54dc30738977\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0d5a6696876979c24c4f54dc30738977\"><p>@incollection{ABM:16,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin and Becker, Martin and Mueller, Juergen},<br\/>  booktitle = {Participatory Sensing, Opinions and Collective Awareness},<br\/>  editor = {Loreto, Vittorio and Haklay, Muki and Hotho, Andreas and Servedio, Vito D.P. and Stumme, Gerd and Tria, Francesca and Theunis, Jan},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Collective Sensing Platforms}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0d5a6696876979c24c4f54dc30738977\"><p>%0 Book Section<br\/>%1 ABM:16<br\/>%A Atzmueller, Martin<br\/>%A Becker, Martin<br\/>%A Mueller, Juergen<br\/>%B Participatory Sensing, Opinions and Collective Awareness<br\/>%C Heidelberg, Germany<br\/>%D 2017<br\/>%E Loreto, Vittorio<br\/>%E Haklay, Muki<br\/>%E Hotho, Andreas<br\/>%E Servedio, Vito D.P.<br\/>%E Stumme, Gerd<br\/>%E Tria, Francesca<br\/>%E Theunis, Jan<br\/>%I Springer Verlag<br\/>%T {Collective Sensing Platforms}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-EveryAware-Book-part_I_ch_6_Atzmueller.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Borchmann, D., Hanika, T., Obiedkov, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On the Usability of Probably Approximately Correct Implication Bases.<\/span><\/span> In: Bertet, K., Borchmann, D., Cellier, P., and Ferr\u00e9, S. (eds.) Formal Concept Analysis - 14th International Conference, {ICFCA} 2017, Rennes, France, June 13-16, 2017, Proceedings. pp. 72\u201388. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-59271-8_5.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/icfca\/icfca2017.html#BorchmannHO17\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bfa7746aa81e1a9456966e0b57422172\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bfa7746aa81e1a9456966e0b57422172\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-59271-8_5\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bfa7746aa81e1a9456966e0b57422172\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bfa7746aa81e1a9456966e0b57422172\"><p>@inproceedings{conf\/icfca\/BorchmannHO17,<br\/>  author = {Borchmann, Daniel and Hanika, Tom and Obiedkov, Sergei},<br\/>  booktitle = {Formal Concept Analysis - 14th International Conference, {ICFCA} 2017, Rennes, France, June 13-16, 2017, Proceedings},<br\/>  crossref = {conf\/icfca\/2017},<br\/>  editor = {Bertet, Karell and Borchmann, Daniel and Cellier, Peggy and Ferr\u00e9, S\u00e9bastien},<br\/>  keywords = {itegpub},<br\/>  pages = {72-88},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {On the Usability of Probably Approximately Correct Implication Bases.},<br\/>  volume = 10308,<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bfa7746aa81e1a9456966e0b57422172\"><p>%0 Conference Paper<br\/>%1 conf\/icfca\/BorchmannHO17<br\/>%A Borchmann, Daniel<br\/>%A Hanika, Tom<br\/>%A Obiedkov, Sergei<br\/>%B Formal Concept Analysis - 14th International Conference, {ICFCA} 2017, Rennes, France, June 13-16, 2017, Proceedings<br\/>%D 2017<br\/>%E Bertet, Karell<br\/>%E Borchmann, Daniel<br\/>%E Cellier, Peggy<br\/>%E Ferr\u00e9, S\u00e9bastien<br\/>%I Springer<br\/>%P 72-88<br\/>%R 10.1007\/978-3-319-59271-8_5<br\/>%T On the Usability of Probably Approximately Correct Implication Bases.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/icfca\/icfca2017.html#BorchmannHO17<br\/>%V 10308<br\/>%@ 978-3-319-59271-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Becker, M., Molino, A., Mueller, J., Peters, J., Sirbu, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Applications for Environmental Sensing in EveryAware}<\/span>.<\/span> In: Loreto, V., Haklay, M., Hotho, A., Servedio, V.D., Stumme, G., Tria, F., and Theunis, J. (eds.) Participatory Sensing, Opinions and Collective Awareness. Springer Verlag, Heidelberg, Germany (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-EveryAware-Book-part_I_ch_7_Atzmueller.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f9f37f05e489a77226d56c7076e03751\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f9f37f05e489a77226d56c7076e03751\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f9f37f05e489a77226d56c7076e03751\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f9f37f05e489a77226d56c7076e03751\"><p>@incollection{ABMMPS:16,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin and Becker, Martin and Molino, Andrea and Mueller, Juergen and Peters, Jan and Sirbu, Alina},<br\/>  booktitle = {Participatory Sensing, Opinions and Collective Awareness},<br\/>  editor = {Loreto, Vittorio and Haklay, Muki and Hotho, Andreas and Servedio, Vito D.P. and Stumme, Gerd and Tria, Francesca and Theunis, Jan},<br\/>  keywords = {analysis},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Applications for Environmental Sensing in EveryAware}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f9f37f05e489a77226d56c7076e03751\"><p>%0 Book Section<br\/>%1 ABMMPS:16<br\/>%A Atzmueller, Martin<br\/>%A Becker, Martin<br\/>%A Molino, Andrea<br\/>%A Mueller, Juergen<br\/>%A Peters, Jan<br\/>%A Sirbu, Alina<br\/>%B Participatory Sensing, Opinions and Collective Awareness<br\/>%C Heidelberg, Germany<br\/>%D 2017<br\/>%E Loreto, Vittorio<br\/>%E Haklay, Muki<br\/>%E Hotho, Andreas<br\/>%E Servedio, Vito D.P.<br\/>%E Stumme, Gerd<br\/>%E Tria, Francesca<br\/>%E Theunis, Jan<br\/>%I Springer Verlag<br\/>%T {Applications for Environmental Sensing in EveryAware}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-EveryAware-Book-part_I_ch_7_Atzmueller.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Descriptive Community Detection}<\/span>.<\/span> In: Missaoui, R., Obiedkov, S., and Kuznetsov, S. (eds.) Formal Concept Analysis in Social Network Analysis. Springer Verlag, Berlin\/Heidelberg, Germany (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-descriptive-community-detection.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bccfc864e0ca4787fac0cd22eb04795f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bccfc864e0ca4787fac0cd22eb04795f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bccfc864e0ca4787fac0cd22eb04795f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bccfc864e0ca4787fac0cd22eb04795f\"><p>@incollection{Atzmueller:17:SNA:DCD,<br\/>  address = {Berlin\/Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Formal Concept Analysis in Social Network Analysis},<br\/>  editor = {Missaoui, Rokia and Obiedkov, Sergei and Kuznetsov, Sergei},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Descriptive Community Detection}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bccfc864e0ca4787fac0cd22eb04795f\"><p>%0 Book Section<br\/>%1 Atzmueller:17:SNA:DCD<br\/>%A Atzmueller, Martin<br\/>%B Formal Concept Analysis in Social Network Analysis<br\/>%C Berlin\/Heidelberg, Germany<br\/>%D 2017<br\/>%E Missaoui, Rokia<br\/>%E Obiedkov, Sergei<br\/>%E Kuznetsov, Sergei<br\/>%I Springer Verlag<br\/>%T {Descriptive Community Detection}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-descriptive-community-detection.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Stumme, G., Amin, I., Lee, J.G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mining social media to inform peatland fire and haze disaster management<\/span>.<\/span> Social Network Analysis and Mining. 7, 30 (2017). https:\/\/doi.org\/10.1007\/s13278-017-0446-1.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/rdcu.be\/udmt\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6b97a4f339b2f986059a99f6d0c350d4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6b97a4f339b2f986059a99f6d0c350d4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s13278-017-0446-1\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6b97a4f339b2f986059a99f6d0c350d4\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-6b97a4f339b2f986059a99f6d0c350d4\">Peatland fires and haze events are disasters with national, regional, and international implications. The phenomena lead to direct damage to local assets, as well as broader economic and environmental losses. Satellite imagery is still the main and often the only available source of information for disaster management. In this article, we test the potential of social media to assist disaster management. To this end, we compare insights from two datasets: fire hotspots detected via NASA satellite imagery and almost all GPS-stamped tweets from Sumatra Island, Indonesia, posted during 2014. Sumatra Island is chosen as it regularly experiences a significant number of haze events, which affect citizens in Indonesia as well as in nearby countries including Malaysia and Singapore. We analyze temporal correlations between the datasets and their geo-spatial interdependence. Furthermore, we show how Twitter data reveal changes in users' behavior during severe haze events. Overall, we demonstrate that social media are a valuable source of complementary and supplementary information for haze disaster management. Based on our methodology and findings, an analytics tool to improve peatland fire and haze disaster management by the Indonesian authorities is under development.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6b97a4f339b2f986059a99f6d0c350d4\"><p>@article{kibanov2017mining,<br\/>  abstract = {Peatland fires and haze events are disasters with national, regional, and international implications. The phenomena lead to direct damage to local assets, as well as broader economic and environmental losses. Satellite imagery is still the main and often the only available source of information for disaster management. In this article, we test the potential of social media to assist disaster management. To this end, we compare insights from two datasets: fire hotspots detected via NASA satellite imagery and almost all GPS-stamped tweets from Sumatra Island, Indonesia, posted during 2014. Sumatra Island is chosen as it regularly experiences a significant number of haze events, which affect citizens in Indonesia as well as in nearby countries including Malaysia and Singapore. We analyze temporal correlations between the datasets and their geo-spatial interdependence. Furthermore, we show how Twitter data reveal changes in users' behavior during severe haze events. Overall, we demonstrate that social media are a valuable source of complementary and supplementary information for haze disaster management. Based on our methodology and findings, an analytics tool to improve peatland fire and haze disaster management by the Indonesian authorities is under development.},<br\/>  author = {Kibanov, Mark and Stumme, Gerd and Amin, Imaduddin and Lee, Jong Gun},<br\/>  journal = {Social Network Analysis and Mining},<br\/>  keywords = 2017,<br\/>  month = {07},<br\/>  number = 1,<br\/>  pages = 30,<br\/>  title = {Mining social media to inform peatland fire and haze disaster management},<br\/>  volume = 7,<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6b97a4f339b2f986059a99f6d0c350d4\"><p>%0 Journal Article<br\/>%1 kibanov2017mining<br\/>%A Kibanov, Mark<br\/>%A Stumme, Gerd<br\/>%A Amin, Imaduddin<br\/>%A Lee, Jong Gun<br\/>%D 2017<br\/>%J Social Network Analysis and Mining<br\/>%N 1<br\/>%P 30<br\/>%R 10.1007\/s13278-017-0446-1<br\/>%T Mining social media to inform peatland fire and haze disaster management<br\/>%U http:\/\/rdcu.be\/udmt<br\/>%V 7<br\/>%X Peatland fires and haze events are disasters with national, regional, and international implications. The phenomena lead to direct damage to local assets, as well as broader economic and environmental losses. Satellite imagery is still the main and often the only available source of information for disaster management. In this article, we test the potential of social media to assist disaster management. To this end, we compare insights from two datasets: fire hotspots detected via NASA satellite imagery and almost all GPS-stamped tweets from Sumatra Island, Indonesia, posted during 2014. Sumatra Island is chosen as it regularly experiences a significant number of haze events, which affect citizens in Indonesia as well as in nearby countries including Malaysia and Singapore. We analyze temporal correlations between the datasets and their geo-spatial interdependence. Furthermore, we show how Twitter data reveal changes in users' behavior during severe haze events. Overall, we demonstrate that social media are a valuable source of complementary and supplementary information for haze disaster management. Based on our methodology and findings, an analytics tool to improve peatland fire and haze disaster management by the Indonesian authorities is under development.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Exceptional Model Mining in Ubiquitous and Social Environments}<\/span>.<\/span> In: Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017). Eindhoven University of Technology, Eindhoven, The Netherlands (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-bl-emm-muse-preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-404f6524e42e76e57db5975cc02fb1ee\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-404f6524e42e76e57db5975cc02fb1ee\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/404f6524e42e76e57db5975cc02fb1ee\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-404f6524e42e76e57db5975cc02fb1ee\"><p>@inproceedings{Atzmueller:17,<br\/>  address = {Eindhoven, The Netherlands},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017)},<br\/>  keywords = {hypgraphs},<br\/>  publisher = {Eindhoven University of Technology},<br\/>  title = {{Exceptional Model Mining in Ubiquitous and Social Environments}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-404f6524e42e76e57db5975cc02fb1ee\"><p>%0 Conference Paper<br\/>%1 Atzmueller:17<br\/>%A Atzmueller, Martin<br\/>%B Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017)<br\/>%C Eindhoven, The Netherlands<br\/>%D 2017<br\/>%I Eindhoven University of Technology<br\/>%T {Exceptional Model Mining in Ubiquitous and Social Environments}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-bl-emm-muse-preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Folmer, J., Kirchen, I., Trunzer, E., Vogel-Heuser, B., P\u00f6tter, T., Graube, M., Heinze, S., Urbas, L., Atzmueller, M., Arnu, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Challenges for Big and Smart Data in Process Industries}<\/span>.<\/span> atp edition. 01-02, (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fe8a56a80e423a5feca10b23bccb0f37\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fe8a56a80e423a5feca10b23bccb0f37\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fe8a56a80e423a5feca10b23bccb0f37\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fe8a56a80e423a5feca10b23bccb0f37\"><p>@article{SmartData:ATP:2017,<br\/>  author = {Folmer, Jens and Kirchen, Iris and Trunzer, Emanuel and Vogel-Heuser, Birgit and P\u00f6tter, Thorsten and Graube, Markus and Heinze, Sebastian and Urbas, Leon and Atzmueller, Martin and Arnu, David},<br\/>  journal = {atp edition},<br\/>  keywords = {smart},<br\/>  title = {{Challenges for Big and Smart Data in Process Industries}},<br\/>  volume = {01-02},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fe8a56a80e423a5feca10b23bccb0f37\"><p>%0 Journal Article<br\/>%1 SmartData:ATP:2017<br\/>%A Folmer, Jens<br\/>%A Kirchen, Iris<br\/>%A Trunzer, Emanuel<br\/>%A Vogel-Heuser, Birgit<br\/>%A P\u00f6tter, Thorsten<br\/>%A Graube, Markus<br\/>%A Heinze, Sebastian<br\/>%A Urbas, Leon<br\/>%A Atzmueller, Martin<br\/>%A Arnu, David<br\/>%D 2017<br\/>%J atp edition<br\/>%T {Challenges for Big and Smart Data in Process Industries}<br\/>%V 01-02<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Knoell, D., Atzmueller, M., Rieder, C., Scherer, K.P.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{A Scalable Framework for Data-Driven Ontology Evaluation}<\/span>.<\/span> In: Proc. GWEM 2017, co-located with 9th Conference Professional Knowledge Management (WM 2017). KIT, Karlsruhe, Germany (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/Knoell-GWEM2017-Preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1468997e760c7afe4ba033d9e7d5bb05\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1468997e760c7afe4ba033d9e7d5bb05\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1468997e760c7afe4ba033d9e7d5bb05\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1468997e760c7afe4ba033d9e7d5bb05\"><p>@inproceedings{KARS:17:GWEM,<br\/>  address = {Karlsruhe, Germany},<br\/>  author = {Knoell, Daniel and Atzmueller, Martin and Rieder, Constantin and Scherer, Klaus Peter},<br\/>  booktitle = {Proc. GWEM 2017, co-located with 9th Conference Professional Knowledge Management (WM 2017)},<br\/>  keywords = {ontology},<br\/>  publisher = {KIT},<br\/>  title = {{A Scalable Framework for Data-Driven Ontology Evaluation}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1468997e760c7afe4ba033d9e7d5bb05\"><p>%0 Conference Paper<br\/>%1 KARS:17:GWEM<br\/>%A Knoell, Daniel<br\/>%A Atzmueller, Martin<br\/>%A Rieder, Constantin<br\/>%A Scherer, Klaus Peter<br\/>%B Proc. GWEM 2017, co-located with 9th Conference Professional Knowledge Management (WM 2017)<br\/>%C Karlsruhe, Germany<br\/>%D 2017<br\/>%I KIT<br\/>%T {A Scalable Framework for Data-Driven Ontology Evaluation}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/Knoell-GWEM2017-Preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Arnu, D., Schmidt, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Anomaly Analytics and Structural Assessment in Process Industries}<\/span>.<\/span> In: Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017). Eindhoven University of Technology, Eindhoven, The Netherlands (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-bl-hypgraphs-preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0e7a8c9e315f576b1d205f7f0f1c7c3f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0e7a8c9e315f576b1d205f7f0f1c7c3f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0e7a8c9e315f576b1d205f7f0f1c7c3f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0e7a8c9e315f576b1d205f7f0f1c7c3f\"><p>@inproceedings{AAS:17a,<br\/>  address = {Eindhoven, The Netherlands},<br\/>  author = {Atzmueller, Martin and Arnu, David and Schmidt, Andreas},<br\/>  booktitle = {Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017)},<br\/>  keywords = {hypgraphs},<br\/>  publisher = {Eindhoven University of Technology},<br\/>  title = {{Anomaly Analytics and Structural Assessment in Process Industries}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0e7a8c9e315f576b1d205f7f0f1c7c3f\"><p>%0 Conference Paper<br\/>%1 AAS:17a<br\/>%A Atzmueller, Martin<br\/>%A Arnu, David<br\/>%A Schmidt, Andreas<br\/>%B Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017)<br\/>%C Eindhoven, The Netherlands<br\/>%D 2017<br\/>%I Eindhoven University of Technology<br\/>%T {Anomaly Analytics and Structural Assessment in Process Industries}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-bl-hypgraphs-preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kanawati, R., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Mining Attributed Networks}<\/span><\/span>, http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-dsaa17-abstract.pdf, (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-dsaa17-abstract.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7221f0c096ce62d76de07593bd2f5cfb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7221f0c096ce62d76de07593bd2f5cfb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7221f0c096ce62d76de07593bd2f5cfb\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7221f0c096ce62d76de07593bd2f5cfb\"><p>@misc{RA:17:DSAA,<br\/>  author = {Kanawati, Rushed and Atzmueller, Martin},<br\/>  howpublished = {DSAA 2017, Tutorial Abstract},<br\/>  keywords = {itegpub},<br\/>  title = {{Mining Attributed Networks}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7221f0c096ce62d76de07593bd2f5cfb\"><p>%0 Generic<br\/>%1 RA:17:DSAA<br\/>%A Kanawati, Rushed<br\/>%A Atzmueller, Martin<br\/>%D 2017<br\/>%T {Mining Attributed Networks}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-dsaa17-abstract.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Community Detection and Analysis on Attributed Social Networks}<\/span>.<\/span> In: Encyclopedia of Social Network Analysis and Mining. Springer, Heidelberg, Germany (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-community-detection-analysis-attributed-networks-esnam-preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7a0bfaf7614bab7f193e53e3e651c1f0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7a0bfaf7614bab7f193e53e3e651c1f0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7a0bfaf7614bab7f193e53e3e651c1f0\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7a0bfaf7614bab7f193e53e3e651c1f0\"><p>@incollection{Atzmueller:17:ESNAM,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Encyclopedia of Social Network Analysis and Mining},<br\/>  keywords = {iteg},<br\/>  publisher = {Springer},<br\/>  title = {{Community Detection and Analysis on Attributed Social Networks}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7a0bfaf7614bab7f193e53e3e651c1f0\"><p>%0 Book Section<br\/>%1 Atzmueller:17:ESNAM<br\/>%A Atzmueller, Martin<br\/>%B Encyclopedia of Social Network Analysis and Mining<br\/>%C Heidelberg, Germany<br\/>%D 2017<br\/>%I Springer<br\/>%T {Community Detection and Analysis on Attributed Social Networks}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-community-detection-analysis-attributed-networks-esnam-preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Hayat, N., Schmidt, A., Kl\u00f6pper, B.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Explanation-Aware Feature Selection using Symbolic Time Series Abstraction: Approaches and Experiences in a Petro-Chemical Production Context}<\/span>.<\/span> In: Proc. IEEE International Conference on Industrial Informatics (INDIN). IEEE Press, Boston, MA, USA (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-indin-preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cb22f626d5afbd3654f189d7096309f2\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cb22f626d5afbd3654f189d7096309f2\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cb22f626d5afbd3654f189d7096309f2\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cb22f626d5afbd3654f189d7096309f2\"><p>@inproceedings{AHSK:17,<br\/>  address = {Boston, MA, USA},<br\/>  author = {Atzmueller, Martin and Hayat, Naveed and Schmidt, Andreas and Kl\u00f6pper, Benjamin},<br\/>  booktitle = {Proc. IEEE International Conference on Industrial Informatics (INDIN)},<br\/>  keywords = {feepub},<br\/>  publisher = {IEEE Press},<br\/>  title = {{Explanation-Aware Feature Selection using Symbolic Time Series Abstraction: Approaches and Experiences in a Petro-Chemical Production Context}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cb22f626d5afbd3654f189d7096309f2\"><p>%0 Conference Paper<br\/>%1 AHSK:17<br\/>%A Atzmueller, Martin<br\/>%A Hayat, Naveed<br\/>%A Schmidt, Andreas<br\/>%A Kl\u00f6pper, Benjamin<br\/>%B Proc. IEEE International Conference on Industrial Informatics (INDIN)<br\/>%C Boston, MA, USA<br\/>%D 2017<br\/>%I IEEE Press<br\/>%T {Explanation-Aware Feature Selection using Symbolic Time Series Abstraction: Approaches and Experiences in a Petro-Chemical Production Context}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-indin-preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Borchmann, D., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Individuality in Social Networks<\/span>.<\/span> In: Missaoui, R., Kuznetsov, S.O., and Obiedkov, S. (eds.) Formal Concept Analysis of Social Networks. pp. 19\u201340. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64167-6_2.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1007\/978-3-319-64167-6_2\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2c7e6be27e1bee2ca4fc5c1fff91fdac\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2c7e6be27e1bee2ca4fc5c1fff91fdac\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-64167-6_2\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2c7e6be27e1bee2ca4fc5c1fff91fdac\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-2c7e6be27e1bee2ca4fc5c1fff91fdac\">We consider individuality in bi-modal social networks, a facet that has not been considered before in the mathematical analysis of social networks. We use methods from formal concept analysis to develop a natural definition for individuality, and provide experimental evidence that this yields a meaningful approach for additional insights into the nature of social networks.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2c7e6be27e1bee2ca4fc5c1fff91fdac\"><p>@inbook{Borchmann2017,<br\/>  abstract = {We consider individuality in bi-modal social networks, a facet that has not been considered before in the mathematical analysis of social networks. We use methods from formal concept analysis to develop a natural definition for individuality, and provide experimental evidence that this yields a meaningful approach for additional insights into the nature of social networks.},<br\/>  address = {Cham},<br\/>  author = {Borchmann, Daniel and Hanika, Tom},<br\/>  booktitle = {Formal Concept Analysis of Social Networks},<br\/>  editor = {Missaoui, Rokia and Kuznetsov, Sergei O. and Obiedkov, Sergei},<br\/>  keywords = {itegpub},<br\/>  pages = {19--40},<br\/>  publisher = {Springer International Publishing},<br\/>  title = {Individuality in Social Networks},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2c7e6be27e1bee2ca4fc5c1fff91fdac\"><p>%0 Book Section<br\/>%1 Borchmann2017<br\/>%A Borchmann, Daniel<br\/>%A Hanika, Tom<br\/>%B Formal Concept Analysis of Social Networks<br\/>%C Cham<br\/>%D 2017<br\/>%E Missaoui, Rokia<br\/>%E Kuznetsov, Sergei O.<br\/>%E Obiedkov, Sergei<br\/>%I Springer International Publishing<br\/>%P 19--40<br\/>%R 10.1007\/978-3-319-64167-6_2<br\/>%T Individuality in Social Networks<br\/>%U https:\/\/doi.org\/10.1007\/978-3-319-64167-6_2<br\/>%X We consider individuality in bi-modal social networks, a facet that has not been considered before in the mathematical analysis of social networks. We use methods from formal concept analysis to develop a natural definition for individuality, and provide experimental evidence that this yields a meaningful approach for additional insights into the nature of social networks.<br\/>%@ 978-3-319-64167-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hanika, T., Zumbr\u00e4gel, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Collaborative Conceptual Exploration.<\/span><\/span> CoRR. abs\/1712.08858, (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1712.html#abs-1712-08858\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a38fad1c462d369f45265fb3b7671deb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a38fad1c462d369f45265fb3b7671deb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a38fad1c462d369f45265fb3b7671deb\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a38fad1c462d369f45265fb3b7671deb\"><p>@article{journals\/corr\/abs-1712-08858,<br\/>  author = {Hanika, Tom and Zumbr\u00e4gel, Jens},<br\/>  journal = {CoRR},<br\/>  keywords = {kde},<br\/>  title = {Towards Collaborative Conceptual Exploration.},<br\/>  volume = {abs\/1712.08858},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a38fad1c462d369f45265fb3b7671deb\"><p>%0 Journal Article<br\/>%1 journals\/corr\/abs-1712-08858<br\/>%A Hanika, Tom<br\/>%A Zumbr\u00e4gel, Jens<br\/>%D 2017<br\/>%J CoRR<br\/>%T Towards Collaborative Conceptual Exploration.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1712.html#abs-1712-08858<br\/>%V abs\/1712.08858<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Arnu, D., Schmidt, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Anomaly Detection and Structural Analysis in Industrial Production Environments}<\/span>.<\/span> In: Proc. International Data Science Conference (IDSC 2017). , Salzburg, Austria (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-idsc-preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1d998cb02d7f5343aa1a68b4eb70603d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1d998cb02d7f5343aa1a68b4eb70603d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1d998cb02d7f5343aa1a68b4eb70603d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1d998cb02d7f5343aa1a68b4eb70603d\"><p>@inproceedings{AAS:17,<br\/>  address = {Salzburg, Austria},<br\/>  author = {Atzmueller, Martin and Arnu, David and Schmidt, Andreas},<br\/>  booktitle = {Proc. International Data Science Conference (IDSC 2017)},<br\/>  keywords = {feepub},<br\/>  title = {{Anomaly Detection and Structural Analysis in Industrial Production Environments}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1d998cb02d7f5343aa1a68b4eb70603d\"><p>%0 Conference Paper<br\/>%1 AAS:17<br\/>%A Atzmueller, Martin<br\/>%A Arnu, David<br\/>%A Schmidt, Andreas<br\/>%B Proc. International Data Science Conference (IDSC 2017)<br\/>%C Salzburg, Austria<br\/>%D 2017<br\/>%T {Anomaly Detection and Structural Analysis in Industrial Production Environments}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2017-atzmueller-idsc-preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Thiele, L., Sauer, N.C., Atzmueller, M., Kauffeld, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{The Co-Evolution of Career Aspirations and Peer Relationships in Psychology Bachelor Students: A Longitudinal Social Network Study}<\/span>.<\/span> Journal of Vocational Behavior. (2017).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0001879117301665\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e77f48d7ca5db1c371baf877c315caf2\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e77f48d7ca5db1c371baf877c315caf2\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e77f48d7ca5db1c371baf877c315caf2\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e77f48d7ca5db1c371baf877c315caf2\"><p>@article{TSAK:2017,<br\/>  author = {Thiele, Lisa and Sauer, Nils Christian and Atzmueller, Martin and Kauffeld, Simone},<br\/>  journal = {Journal of Vocational Behavior},<br\/>  keywords = {longitudinal},<br\/>  title = {{The Co-Evolution of Career Aspirations and Peer Relationships in Psychology Bachelor Students: A Longitudinal Social Network Study}},<br\/>  year = 2017<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e77f48d7ca5db1c371baf877c315caf2\"><p>%0 Journal Article<br\/>%1 TSAK:2017<br\/>%A Thiele, Lisa<br\/>%A Sauer, Nils Christian<br\/>%A Atzmueller, Martin<br\/>%A Kauffeld, Simone<br\/>%D 2017<br\/>%J Journal of Vocational Behavior<br\/>%T {The Co-Evolution of Career Aspirations and Peer Relationships in Psychology Bachelor Students: A Longitudinal Social Network Study}<br\/>%U https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0001879117301665<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2016\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2016<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Schmidt, A., Kloepper, B., Arnu, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{HypGraphs: An Approach for Modeling and Comparing Graph-Based and Sequential Hypotheses}<\/span>.<\/span> In: Proc. ECML-PKDD Workshop on New Frontiers in Mining Complex Patterns (NFMCP). , Riva del Garda, Italy (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-hypgraphs.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ff4b67176870a12c9110eddd5c23d066\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ff4b67176870a12c9110eddd5c23d066\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ff4b67176870a12c9110eddd5c23d066\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ff4b67176870a12c9110eddd5c23d066\"><p>@inproceedings{ASKA:16,<br\/>  address = {Riva del Garda, Italy},<br\/>  author = {Atzmueller, Martin and Schmidt, Andreas and Kloepper, Benjamin and Arnu, David},<br\/>  booktitle = {Proc. ECML-PKDD Workshop on New Frontiers in Mining Complex Patterns (NFMCP)},<br\/>  keywords = {feepub},<br\/>  title = {{HypGraphs: An Approach for Modeling and Comparing Graph-Based and Sequential Hypotheses}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ff4b67176870a12c9110eddd5c23d066\"><p>%0 Conference Paper<br\/>%1 ASKA:16<br\/>%A Atzmueller, Martin<br\/>%A Schmidt, Andreas<br\/>%A Kloepper, Benjamin<br\/>%A Arnu, David<br\/>%B Proc. ECML-PKDD Workshop on New Frontiers in Mining Complex Patterns (NFMCP)<br\/>%C Riva del Garda, Italy<br\/>%D 2016<br\/>%T {HypGraphs: An Approach for Modeling and Comparing Graph-Based and Sequential Hypotheses}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-hypgraphs.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Schmidt, A., Kibanov, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{DASHTrails: An Approach for Modeling and Analysis of Distribution-Adapted Sequential Hypotheses and Trails}<\/span>.<\/span> In: Proc. WWW 2016 (Companion). IW3C2 \/ ACM (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-dashtrails.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3cee7e223155b8dca82dc59a2bbc7a2f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3cee7e223155b8dca82dc59a2bbc7a2f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3cee7e223155b8dca82dc59a2bbc7a2f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3cee7e223155b8dca82dc59a2bbc7a2f\"><p>@inproceedings{ASK:16,<br\/>  author = {Atzmueller, Martin and Schmidt, Andreas and Kibanov, Mark},<br\/>  booktitle = {Proc. WWW 2016 (Companion)},<br\/>  keywords = {feepub},<br\/>  organization = {IW3C2 \/ ACM},<br\/>  title = {{DASHTrails: An Approach for Modeling and Analysis of Distribution-Adapted Sequential Hypotheses and Trails}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3cee7e223155b8dca82dc59a2bbc7a2f\"><p>%0 Conference Paper<br\/>%1 ASK:16<br\/>%A Atzmueller, Martin<br\/>%A Schmidt, Andreas<br\/>%A Kibanov, Mark<br\/>%B Proc. WWW 2016 (Companion)<br\/>%D 2016<br\/>%T {DASHTrails: An Approach for Modeling and Analysis of Distribution-Adapted Sequential Hypotheses and Trails}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-dashtrails.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mueller, J., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Gender Inference using Statistical Name Characteristics in Twitter<\/span>.<\/span> In: 5th ASE International Conference on Social Informatics (SocInfo 2016), Union, NJ, USA, August 15-17, 2016. Proceedings. pp. 47:1\u201347:8. ACM, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2955129.2955182.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1145\/2955129.2955182\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-038dca858864c36223ba0dc42a118ca4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-038dca858864c36223ba0dc42a118ca4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2955129.2955182\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/038dca858864c36223ba0dc42a118ca4\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-038dca858864c36223ba0dc42a118ca4\">Much attention has been given to the task of gender inference of Twitter users. Although names are strong gender indicators, the names of Twitter users are rarely used as a feature; probably due to the high number of ill-formed names, which cannot be found in any name dictionary. Instead of relying solely on a name database, we propose a novel name classifier. Our approach extracts characteristics from the user names and uses those in order to assign the names to a gender. This enables us to classify international first names as well as ill-formed names.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-038dca858864c36223ba0dc42a118ca4\"><p>@inproceedings{mueller-2016,<br\/>  abstract = {Much attention has been given to the task of gender inference of Twitter users. Although names are strong gender indicators, the names of Twitter users are rarely used as a feature; probably due to the high number of ill-formed names, which cannot be found in any name dictionary. Instead of relying solely on a name database, we propose a novel name classifier. Our approach extracts characteristics from the user names and uses those in order to assign the names to a gender. This enables us to classify international first names as well as ill-formed names.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Mueller, Juergen and Stumme, Gerd},<br\/>  booktitle = {5th ASE International Conference on Social Informatics (SocInfo 2016), Union, NJ, USA, August 15-17, 2016. Proceedings},<br\/>  keywords = {arXiv},<br\/>  month = {08},<br\/>  pages = {47:1--47:8},<br\/>  publisher = {ACM},<br\/>  title = {Gender Inference using Statistical Name Characteristics in Twitter},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-038dca858864c36223ba0dc42a118ca4\"><p>%0 Conference Paper<br\/>%1 mueller-2016<br\/>%A Mueller, Juergen<br\/>%A Stumme, Gerd<br\/>%B 5th ASE International Conference on Social Informatics (SocInfo 2016), Union, NJ, USA, August 15-17, 2016. Proceedings<br\/>%C New York, NY, USA<br\/>%D 2016<br\/>%I ACM<br\/>%P 47:1--47:8<br\/>%R 10.1145\/2955129.2955182<br\/>%T Gender Inference using Statistical Name Characteristics in Twitter<br\/>%U http:\/\/dx.doi.org\/10.1145\/2955129.2955182<br\/>%X Much attention has been given to the task of gender inference of Twitter users. Although names are strong gender indicators, the names of Twitter users are rarely used as a feature; probably due to the high number of ill-formed names, which cannot be found in any name dictionary. Instead of relying solely on a name database, we propose a novel name classifier. Our approach extracts characteristics from the user names and uses those in order to assign the names to a gender. This enables us to classify international first names as well as ill-formed names.<br\/>%@ 978-1-4503-4129-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Zoller, D., Doerfel, S., J\u00e4schke, R., Stumme, G., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Posted, visited, exported: Altmetrics in the social tagging system BibSonomy<\/span>.<\/span> Journal of Informetrics. 10, 732\u2013749 (2016). https:\/\/doi.org\/http:\/\/dx.doi.org\/10.1016\/j.joi.2016.03.005.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1751157715300936\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-86b725ff326b1e4f24b4b77761dc5c62\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-86b725ff326b1e4f24b4b77761dc5c62\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1016\/j.joi.2016.03.005\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/86b725ff326b1e4f24b4b77761dc5c62\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-86b725ff326b1e4f24b4b77761dc5c62\">Abstract In social tagging systems, like Mendeley, CiteULike, and BibSonomy, users can post, tag, visit, or export scholarly publications. In this paper, we compare citations with metrics derived from users\u2019 activities (altmetrics) in the popular social bookmarking system BibSonomy. Our analysis, using a corpus of more than 250,000 publications published before 2010, reveals that overall, citations and altmetrics in BibSonomy are mildly correlated. Furthermore, grouping publications by user-generated tags results in topic-homogeneous subsets that exhibit higher correlations with citations than the full corpus. We find that posts, exports, and visits of publications are correlated with citations and even bear predictive power over future impact. Machine learning classifiers predict whether the number of citations that a publication receives in a year exceeds the median number of citations in that year, based on the usage counts of the preceding year. In that setup, a Random Forest predictor outperforms the baseline on average by seven percentage points.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-86b725ff326b1e4f24b4b77761dc5c62\"><p>@article{zoller2016posted,<br\/>  abstract = {Abstract In social tagging systems, like Mendeley, CiteULike, and BibSonomy, users can post, tag, visit, or export scholarly publications. In this paper, we compare citations with metrics derived from users\u2019 activities (altmetrics) in the popular social bookmarking system BibSonomy. Our analysis, using a corpus of more than 250,000 publications published before 2010, reveals that overall, citations and altmetrics in BibSonomy are mildly correlated. Furthermore, grouping publications by user-generated tags results in topic-homogeneous subsets that exhibit higher correlations with citations than the full corpus. We find that posts, exports, and visits of publications are correlated with citations and even bear predictive power over future impact. Machine learning classifiers predict whether the number of citations that a publication receives in a year exceeds the median number of citations in that year, based on the usage counts of the preceding year. In that setup, a Random Forest predictor outperforms the baseline on average by seven percentage points.},<br\/>  author = {Zoller, Daniel and Doerfel, Stephan and J\u00e4schke, Robert and Stumme, Gerd and Hotho, Andreas},<br\/>  journal = {Journal of Informetrics},<br\/>  keywords = {posted},<br\/>  number = 3,<br\/>  pages = {732 - 749},<br\/>  title = {Posted, visited, exported: Altmetrics in the social tagging system BibSonomy},<br\/>  volume = 10,<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-86b725ff326b1e4f24b4b77761dc5c62\"><p>%0 Journal Article<br\/>%1 zoller2016posted<br\/>%A Zoller, Daniel<br\/>%A Doerfel, Stephan<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%A Hotho, Andreas<br\/>%D 2016<br\/>%J Journal of Informetrics<br\/>%N 3<br\/>%P 732 - 749<br\/>%R http:\/\/dx.doi.org\/10.1016\/j.joi.2016.03.005<br\/>%T Posted, visited, exported: Altmetrics in the social tagging system BibSonomy<br\/>%U http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1751157715300936<br\/>%V 10<br\/>%X Abstract In social tagging systems, like Mendeley, CiteULike, and BibSonomy, users can post, tag, visit, or export scholarly publications. In this paper, we compare citations with metrics derived from users\u2019 activities (altmetrics) in the popular social bookmarking system BibSonomy. Our analysis, using a corpus of more than 250,000 publications published before 2010, reveals that overall, citations and altmetrics in BibSonomy are mildly correlated. Furthermore, grouping publications by user-generated tags results in topic-homogeneous subsets that exhibit higher correlations with citations than the full corpus. We find that posts, exports, and visits of publications are correlated with citations and even bear predictive power over future impact. Machine learning classifiers predict whether the number of citations that a publication receives in a year exceeds the median number of citations in that year, based on the usage counts of the preceding year. In that setup, a Random Forest predictor outperforms the baseline on average by seven percentage points.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Advances in Exploratory Pattern Analytics on Ubiquitous Data and Social Media}<\/span>.<\/span> In: Michaelis, S., Piatkowski, N., and Stolpe, M. (eds.) Solving Large Scale Learning Tasks: Challenges and Algorithms. Festschrift in Honour of Prof. Dr. Katharina Morik. Springer Verlag (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-advances-in-exploratory-pattern-analytics.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-35bef0f767f66bd84b9b4e207a0c3bfe\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-35bef0f767f66bd84b9b4e207a0c3bfe\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/35bef0f767f66bd84b9b4e207a0c3bfe\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-35bef0f767f66bd84b9b4e207a0c3bfe\"><p>@incollection{Atzmueller:16m,<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Solving Large Scale Learning Tasks: Challenges and Algorithms. Festschrift in Honour of Prof. Dr. Katharina Morik},<br\/>  editor = {Michaelis, Stefan and Piatkowski, Nico and Stolpe, Marco},<br\/>  keywords = 2016,<br\/>  publisher = {Springer Verlag},<br\/>  series = {LNCS},<br\/>  title = {{Advances in Exploratory Pattern Analytics on Ubiquitous Data and Social Media}},<br\/>  volume = 9580,<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-35bef0f767f66bd84b9b4e207a0c3bfe\"><p>%0 Book Section<br\/>%1 Atzmueller:16m<br\/>%A Atzmueller, Martin<br\/>%B Solving Large Scale Learning Tasks: Challenges and Algorithms. Festschrift in Honour of Prof. Dr. Katharina Morik<br\/>%D 2016<br\/>%E Michaelis, Stefan<br\/>%E Piatkowski, Nico<br\/>%E Stolpe, Marco<br\/>%I Springer Verlag<br\/>%T {Advances in Exploratory Pattern Analytics on Ubiquitous Data and Social Media}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-advances-in-exploratory-pattern-analytics.pdf<br\/>%V 9580<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kl\u00f6pper, B., Dix, M., Schorer, L., Ampofo, A., Atzmueller, M., Arnu, D., Klinkenberg, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Defining Software Architectures for Big Data Enabled Operator Support Systems}<\/span>.<\/span> In: Proc. IEEE International Conference on Industrial Informatics (INDIN). IEEE Press, Boston, MA, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/DefiningSoftwareArchitecturesForBigDataEnabledOSS_INDIN2016Preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-368216bf2859af1272ccc91ab4f01a66\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-368216bf2859af1272ccc91ab4f01a66\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/368216bf2859af1272ccc91ab4f01a66\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-368216bf2859af1272ccc91ab4f01a66\"><p>@inproceedings{KloepperEtAl:INDIN:2016,<br\/>  address = {Boston, MA, USA},<br\/>  author = {Kl\u00f6pper, Benjamin and Dix, Marcel and Schorer, Lukas and Ampofo, Ann and Atzmueller, Martin and Arnu, David and Klinkenberg, Ralf},<br\/>  booktitle = {Proc. IEEE International Conference on Industrial Informatics (INDIN)},<br\/>  keywords = {itegpub},<br\/>  publisher = {IEEE Press},<br\/>  title = {{Defining Software Architectures for Big Data Enabled Operator Support Systems}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-368216bf2859af1272ccc91ab4f01a66\"><p>%0 Conference Paper<br\/>%1 KloepperEtAl:INDIN:2016<br\/>%A Kl\u00f6pper, Benjamin<br\/>%A Dix, Marcel<br\/>%A Schorer, Lukas<br\/>%A Ampofo, Ann<br\/>%A Atzmueller, Martin<br\/>%A Arnu, David<br\/>%A Klinkenberg, Ralf<br\/>%B Proc. IEEE International Conference on Industrial Informatics (INDIN)<br\/>%C Boston, MA, USA<br\/>%D 2016<br\/>%I IEEE Press<br\/>%T {Defining Software Architectures for Big Data Enabled Operator Support Systems}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/DefiningSoftwareArchitecturesForBigDataEnabledOSS_INDIN2016Preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Detecting Community Patterns Capturing Exceptional Link Trails}<\/span>.<\/span> In: Proc. IEEE\/ACM ASONAM. IEEE Press, Boston, MA, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-xtrails-asonam2016-preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-714a568ae2edc25a360a425e52202c9c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-714a568ae2edc25a360a425e52202c9c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/714a568ae2edc25a360a425e52202c9c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-714a568ae2edc25a360a425e52202c9c\"><p>@inproceedings{Atzmueller:16:ASONAM,<br\/>  address = {Boston, MA, USA},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Proc. IEEE\/ACM ASONAM},<br\/>  keywords = {model},<br\/>  publisher = {IEEE Press},<br\/>  title = {{Detecting Community Patterns Capturing Exceptional Link Trails}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-714a568ae2edc25a360a425e52202c9c\"><p>%0 Conference Paper<br\/>%1 Atzmueller:16:ASONAM<br\/>%A Atzmueller, Martin<br\/>%B Proc. IEEE\/ACM ASONAM<br\/>%C Boston, MA, USA<br\/>%D 2016<br\/>%I IEEE Press<br\/>%T {Detecting Community Patterns Capturing Exceptional Link Trails}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-xtrails-asonam2016-preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., Zoller, D., Singer, P., Niebler, T., Hotho, A., Strohmaier, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">What Users Actually do in a Social Tagging System: A Study of User Behavior in BibSonomy<\/span>.<\/span> ACM Transactions on the Web. 10, 14:1\u201314:32 (2016). https:\/\/doi.org\/10.1145\/2896821.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dl.acm.org\/citation.cfm?id=2896821\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-95dafc17ef731ee387c6ea52edc01615\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-95dafc17ef731ee387c6ea52edc01615\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2896821\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/95dafc17ef731ee387c6ea52edc01615\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-95dafc17ef731ee387c6ea52edc01615\">Social tagging systems have established themselves as an important part in today\u2019s web and have attracted the interest of our research community in a variety of investigations. Henceforth, several aspects of social tagging systems have been discussed and assumptions have emerged on which our community builds their work. Yet, testing such assumptions has been difficult due to the absence of suitable usage data in the past. In this work, we thoroughly investigate and evaluate four aspects about tagging systems, covering social interaction, retrieval of posted resources, the importance of the three different types of entities, users, resources, and tags, as well as connections between these entities\u2019 popularity in posted and in requested content. For that purpose, we examine live server log data gathered from the real-world, public social tagging system BibSonomy. Our empirical results paint a mixed picture about the four aspects. While for some, typical assumptions hold to a certain extent, other aspects need to be reflected in a very critical light. Our observations have implications for the understanding of social tagging systems, and the way they are used on the web. We make the dataset used in this work available to other researchers.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-95dafc17ef731ee387c6ea52edc01615\"><p>@article{doerfel2016users,<br\/>  abstract = {Social tagging systems have established themselves as an important part in today\u2019s web and have attracted the interest of our research community in a variety of investigations. Henceforth, several aspects of social tagging systems have been discussed and assumptions have emerged on which our community builds their work. Yet, testing such assumptions has been difficult due to the absence of suitable usage data in the past. In this work, we thoroughly investigate and evaluate four aspects about tagging systems, covering social interaction, retrieval of posted resources, the importance of the three different types of entities, users, resources, and tags, as well as connections between these entities\u2019 popularity in posted and in requested content. For that purpose, we examine live server log data gathered from the real-world, public social tagging system BibSonomy. Our empirical results paint a mixed picture about the four aspects. While for some, typical assumptions hold to a certain extent, other aspects need to be reflected in a very critical light. Our observations have implications for the understanding of social tagging systems, and the way they are used on the web. We make the dataset used in this work available to other researchers.},<br\/>  author = {Doerfel, Stephan and Zoller, Daniel and Singer, Philipp and Niebler, Thomas and Hotho, Andreas and Strohmaier, Markus},<br\/>  journal = {ACM Transactions on the Web},<br\/>  keywords = {equality},<br\/>  month = {05},<br\/>  number = 2,<br\/>  pages = {14:1--14:32},<br\/>  publisher = {ACM},<br\/>  title = {What Users Actually do in a Social Tagging System: A Study of User Behavior in BibSonomy},<br\/>  volume = 10,<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-95dafc17ef731ee387c6ea52edc01615\"><p>%0 Journal Article<br\/>%1 doerfel2016users<br\/>%A Doerfel, Stephan<br\/>%A Zoller, Daniel<br\/>%A Singer, Philipp<br\/>%A Niebler, Thomas<br\/>%A Hotho, Andreas<br\/>%A Strohmaier, Markus<br\/>%D 2016<br\/>%I ACM<br\/>%J ACM Transactions on the Web<br\/>%N 2<br\/>%P 14:1--14:32<br\/>%R 10.1145\/2896821<br\/>%T What Users Actually do in a Social Tagging System: A Study of User Behavior in BibSonomy<br\/>%U http:\/\/dl.acm.org\/citation.cfm?id=2896821<br\/>%V 10<br\/>%X Social tagging systems have established themselves as an important part in today\u2019s web and have attracted the interest of our research community in a variety of investigations. Henceforth, several aspects of social tagging systems have been discussed and assumptions have emerged on which our community builds their work. Yet, testing such assumptions has been difficult due to the absence of suitable usage data in the past. In this work, we thoroughly investigate and evaluate four aspects about tagging systems, covering social interaction, retrieval of posted resources, the importance of the three different types of entities, users, resources, and tags, as well as connections between these entities\u2019 popularity in posted and in requested content. For that purpose, we examine live server log data gathered from the real-world, public social tagging system BibSonomy. Our empirical results paint a mixed picture about the four aspects. While for some, typical assumptions hold to a certain extent, other aspects need to be reflected in a very critical light. Our observations have implications for the understanding of social tagging systems, and the way they are used on the web. We make the dataset used in this work available to other researchers.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Gebhardt, J., Froese, T., Kr\u00fcger, A., Appel, J., Benner, R., Hammer, M., Altermann, A., Hochrein, T., Kugler, C., Jatzkowski, P., Gloy, Y.-S., Saggiomo, M., Roth, R., Elixmann, I., Tapken, H., Weber, W., Atzmueller, M., Garcke, J., Pielmeier, J., Rosen, R., Tercan, H.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Statusreport: Chancen mit Big Data -- Best Practice}<\/span>.<\/span> VDI\/VDE-Gesellschaft Mess- und Automatisierungstechnik (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/m.vdi.de\/fileadmin\/vdi_de\/redakteur_dateien\/gma_dateien\/z01_NEU_Statusreport_Best_Practice_WEB.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4e3bae1e6dd3d9b8f3e7dea60b8aea23\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4e3bae1e6dd3d9b8f3e7dea60b8aea23\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4e3bae1e6dd3d9b8f3e7dea60b8aea23\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4e3bae1e6dd3d9b8f3e7dea60b8aea23\"><p>@techreport{VDI:Statusreport:2016,<br\/>  author = {Gebhardt, J\u00f6rg and Froese, Thomas and Kr\u00fcger, Andreas and Appel, J\u00f6rg and Benner, Raphael and Hammer, Markus and Altermann, Alexandra and Hochrein, Thomas and Kugler, Christoph and Jatzkowski, Phillip and Gloy, Yves-Simon and Saggiomo, Marco and Roth, Rolf and Elixmann, Inga and Tapken, Heiko and Weber, Wolfgang and Atzmueller, Martin and Garcke, Jochen and Pielmeier, Julia and Rosen, Roland and Tercan, Hasan},<br\/>  institution = {VDI\/VDE-Gesellschaft Mess- und Automatisierungstechnik},<br\/>  keywords = {itegpub},<br\/>  title = {{Statusreport: Chancen mit Big Data -- Best Practice}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4e3bae1e6dd3d9b8f3e7dea60b8aea23\"><p>%0 Report<br\/>%1 VDI:Statusreport:2016<br\/>%A Gebhardt, J\u00f6rg<br\/>%A Froese, Thomas<br\/>%A Kr\u00fcger, Andreas<br\/>%A Appel, J\u00f6rg<br\/>%A Benner, Raphael<br\/>%A Hammer, Markus<br\/>%A Altermann, Alexandra<br\/>%A Hochrein, Thomas<br\/>%A Kugler, Christoph<br\/>%A Jatzkowski, Phillip<br\/>%A Gloy, Yves-Simon<br\/>%A Saggiomo, Marco<br\/>%A Roth, Rolf<br\/>%A Elixmann, Inga<br\/>%A Tapken, Heiko<br\/>%A Weber, Wolfgang<br\/>%A Atzmueller, Martin<br\/>%A Garcke, Jochen<br\/>%A Pielmeier, Julia<br\/>%A Rosen, Roland<br\/>%A Tercan, Hasan<br\/>%D 2016<br\/>%T {Statusreport: Chancen mit Big Data -- Best Practice}<br\/>%U https:\/\/m.vdi.de\/fileadmin\/vdi_de\/redakteur_dateien\/gma_dateien\/z01_NEU_Statusreport_Best_Practice_WEB.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., J\u00e4schke, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems<\/span>.<\/span> ACM Transactions on Intelligent Systems and Technology. 7, 40:1\u201340:33 (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2700485\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bd08732fd4924af3b4add3f0a98b3682\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bd08732fd4924af3b4add3f0a98b3682\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bd08732fd4924af3b4add3f0a98b3682\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-bd08732fd4924af3b4add3f0a98b3682\">Social bookmarking systems have established themselves as an important part in today\u2019s web. In such systems, tag recommender systems support users during the posting of a resource by suggesting suitable tags. Tag recommender algorithms have often been evaluated in offline benchmarking experiments. Yet, the particular setup of such experiments has rarely been analyzed. In particular, since the recommendation quality usually suffers from difficulties like the sparsity of the data or the cold start problem for new resources or users, datasets have often been pruned to so-called cores (specific subsets of the original datasets) \u2013 however without much consideration of the implications on the benchmarking results. In this paper, we generalize the notion of a core by introducing the new notion of a set-core \u2013 which is independent of any graph structure \u2013 to overcome a structural drawback in the previous constructions of cores on tagging data. We show that problems caused by some types of cores can be eliminated using setcores. Further, we present a thorough analysis of tag recommender benchmarking setups using cores. To that end, we conduct a large-scale experiment on four real-world datasets in which we analyze the influence of different cores on the evaluation of recommendation algorithms. We can show that the results of the comparison of different recommendation approaches depends on the selection of core type and level. For the benchmarking of tag recommender algorithms, our results suggest that the evaluation must be set up more carefully and should not be based on one arbitrarily chosen core type and level.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bd08732fd4924af3b4add3f0a98b3682\"><p>@article{doerfel2016cores,<br\/>  abstract = {Social bookmarking systems have established themselves as an important part in today\u2019s web. In such systems, tag recommender systems support users during the posting of a resource by suggesting suitable tags. Tag recommender algorithms have often been evaluated in offline benchmarking experiments. Yet, the particular setup of such experiments has rarely been analyzed. In particular, since the recommendation quality usually suffers from difficulties like the sparsity of the data or the cold start problem for new resources or users, datasets have often been pruned to so-called cores (specific subsets of the original datasets) \u2013 however without much consideration of the implications on the benchmarking results. In this paper, we generalize the notion of a core by introducing the new notion of a set-core \u2013 which is independent of any graph structure \u2013 to overcome a structural drawback in the previous constructions of cores on tagging data. We show that problems caused by some types of cores can be eliminated using setcores. Further, we present a thorough analysis of tag recommender benchmarking setups using cores. To that end, we conduct a large-scale experiment on four real-world datasets in which we analyze the influence of different cores on the evaluation of recommendation algorithms. We can show that the results of the comparison of different recommendation approaches depends on the selection of core type and level. For the benchmarking of tag recommender algorithms, our results suggest that the evaluation must be set up more carefully and should not be based on one arbitrarily chosen core type and level.},<br\/>  author = {Doerfel, Stephan and J\u00e4schke, Robert and Stumme, Gerd},<br\/>  journal = {ACM Transactions on Intelligent Systems and Technology},<br\/>  keywords = {homepage},<br\/>  month = {02},<br\/>  number = 3,<br\/>  pages = {40:1-40:33},<br\/>  title = {The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems},<br\/>  volume = 7,<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bd08732fd4924af3b4add3f0a98b3682\"><p>%0 Journal Article<br\/>%1 doerfel2016cores<br\/>%A Doerfel, Stephan<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%D 2016<br\/>%J ACM Transactions on Intelligent Systems and Technology<br\/>%N 3<br\/>%P 40:1-40:33<br\/>%T The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems<br\/>%U http:\/\/doi.acm.org\/10.1145\/2700485<br\/>%V 7<br\/>%X Social bookmarking systems have established themselves as an important part in today\u2019s web. In such systems, tag recommender systems support users during the posting of a resource by suggesting suitable tags. Tag recommender algorithms have often been evaluated in offline benchmarking experiments. Yet, the particular setup of such experiments has rarely been analyzed. In particular, since the recommendation quality usually suffers from difficulties like the sparsity of the data or the cold start problem for new resources or users, datasets have often been pruned to so-called cores (specific subsets of the original datasets) \u2013 however without much consideration of the implications on the benchmarking results. In this paper, we generalize the notion of a core by introducing the new notion of a set-core \u2013 which is independent of any graph structure \u2013 to overcome a structural drawback in the previous constructions of cores on tagging data. We show that problems caused by some types of cores can be eliminated using setcores. Further, we present a thorough analysis of tag recommender benchmarking setups using cores. To that end, we conduct a large-scale experiment on four real-world datasets in which we analyze the influence of different cores on the evaluation of recommendation algorithms. We can show that the results of the comparison of different recommendation approaches depends on the selection of core type and level. For the benchmarking of tag recommender algorithms, our results suggest that the evaluation must be set up more carefully and should not be based on one arbitrarily chosen core type and level.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Doerfel, S., Mitzlaff, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Description-Oriented Community Detection using Exhaustive Subgroup Discovery<\/span>.<\/span> Information Sciences. 329, 965\u2013984 (2016). https:\/\/doi.org\/http:\/\/dx.doi.org\/10.1016\/j.ins.2015.05.008.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025515003667\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-df3a386b3084f99c18cb2dd2adc2955f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-df3a386b3084f99c18cb2dd2adc2955f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1016\/j.ins.2015.05.008\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/df3a386b3084f99c18cb2dd2adc2955f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-df3a386b3084f99c18cb2dd2adc2955f\">Abstract Communities can intuitively be defined as subsets of nodes of a graph with a dense structure in the corresponding subgraph. However, for mining such communities usually only structural aspects are taken into account. Typically, no concise nor easily interpretable community description is provided. For tackling this issue, this paper focuses on description-oriented community detection using subgroup discovery. In order to provide both structurally valid and interpretable communities we utilize the graph structure as well as additional descriptive features of the graph\u2019s nodes. A descriptive community pattern built upon these features then describes and identifies a community, i.e., a set of nodes, and vice versa. Essentially, we mine patterns in the \u201cdescription space\u201d characterizing interesting sets of nodes (i.e., subgroups) in the \u201cgraph space\u201d; the interestingness of a community is evaluated by a selectable quality measure. We aim at identifying communities according to standard community quality measures, while providing characteristic descriptions of these communities at the same time. For this task, we propose several optimistic estimates of standard community quality functions to be used for efficient pruning of the search space in an exhaustive branch-and-bound algorithm. We demonstrate our approach in an evaluation using five real-world data sets, obtained from three different social media applications.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-df3a386b3084f99c18cb2dd2adc2955f\"><p>@article{atzmueller2015descriptionoriented,<br\/>  abstract = {Abstract Communities can intuitively be defined as subsets of nodes of a graph with a dense structure in the corresponding subgraph. However, for mining such communities usually only structural aspects are taken into account. Typically, no concise nor easily interpretable community description is provided. For tackling this issue, this paper focuses on description-oriented community detection using subgroup discovery. In order to provide both structurally valid and interpretable communities we utilize the graph structure as well as additional descriptive features of the graph\u2019s nodes. A descriptive community pattern built upon these features then describes and identifies a community, i.e., a set of nodes, and vice versa. Essentially, we mine patterns in the \u201cdescription space\u201d characterizing interesting sets of nodes (i.e., subgroups) in the \u201cgraph space\u201d; the interestingness of a community is evaluated by a selectable quality measure. We aim at identifying communities according to standard community quality measures, while providing characteristic descriptions of these communities at the same time. For this task, we propose several optimistic estimates of standard community quality functions to be used for efficient pruning of the search space in an exhaustive branch-and-bound algorithm. We demonstrate our approach in an evaluation using five real-world data sets, obtained from three different social media applications.},<br\/>  author = {Atzmueller, Martin and Doerfel, Stephan and Mitzlaff, Folke},<br\/>  journal = {Information Sciences},<br\/>  keywords = {inpress},<br\/>  month = {02},<br\/>  pages = {965-984},<br\/>  title = {Description-Oriented Community Detection using Exhaustive Subgroup Discovery},<br\/>  volume = 329,<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-df3a386b3084f99c18cb2dd2adc2955f\"><p>%0 Journal Article<br\/>%1 atzmueller2015descriptionoriented<br\/>%A Atzmueller, Martin<br\/>%A Doerfel, Stephan<br\/>%A Mitzlaff, Folke<br\/>%D 2016<br\/>%J Information Sciences<br\/>%P 965-984<br\/>%R http:\/\/dx.doi.org\/10.1016\/j.ins.2015.05.008<br\/>%T Description-Oriented Community Detection using Exhaustive Subgroup Discovery<br\/>%U http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025515003667<br\/>%V 329<br\/>%X Abstract Communities can intuitively be defined as subsets of nodes of a graph with a dense structure in the corresponding subgraph. However, for mining such communities usually only structural aspects are taken into account. Typically, no concise nor easily interpretable community description is provided. For tackling this issue, this paper focuses on description-oriented community detection using subgroup discovery. In order to provide both structurally valid and interpretable communities we utilize the graph structure as well as additional descriptive features of the graph\u2019s nodes. A descriptive community pattern built upon these features then describes and identifies a community, i.e., a set of nodes, and vice versa. Essentially, we mine patterns in the \u201cdescription space\u201d characterizing interesting sets of nodes (i.e., subgroups) in the \u201cgraph space\u201d; the interestingness of a community is evaluated by a selectable quality measure. We aim at identifying communities according to standard community quality measures, while providing characteristic descriptions of these communities at the same time. For this task, we propose several optimistic estimates of standard community quality functions to be used for efficient pruning of the search space in an exhaustive branch-and-bound algorithm. We demonstrate our approach in an evaluation using five real-world data sets, obtained from three different social media applications.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Niebler, T., Becker, M., Zoller, D., Doerfel, S., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">FolkTrails: Interpreting Navigation Behavior in a Social Tagging System<\/span>.<\/span> In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. ACM, New York, NY, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1145\/2983323.2983686\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b3b6e9c496fc336dbfc47169647959a2\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b3b6e9c496fc336dbfc47169647959a2\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b3b6e9c496fc336dbfc47169647959a2\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-b3b6e9c496fc336dbfc47169647959a2\">Social tagging systems have established themselves as a quick and easy way to organize information by annotating resources with tags. In recent work, user behavior in social tagging systems was studied, that is, how users assign tags, and consume content. However, it is still unclear how users make use of the navigation options they are given. Understanding their behavior and differences in behavior of different user groups is an important step towards assessing the effectiveness of a navigational concept and of improving it to better suit the users\u2019 needs. In this work, we investigate navigation trails in the popular scholarly social tagging system BibSonomy from six years of log data. We discuss dynamic browsing behavior of the general user population and show that different navigational subgroups exhibit different navigational traits. Furthermore, we provide strong evidence that the semantic nature of the underlying folksonomy is an essential factor for explaining navigation.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b3b6e9c496fc336dbfc47169647959a2\"><p>@inproceedings{niebler2016folktrails,<br\/>  abstract = {Social tagging systems have established themselves as a quick and easy way to organize information by annotating resources with tags. In recent work, user behavior in social tagging systems was studied, that is, how users assign tags, and consume content. However, it is still unclear how users make use of the navigation options they are given. Understanding their behavior and differences in behavior of different user groups is an important step towards assessing the effectiveness of a navigational concept and of improving it to better suit the users\u2019 needs. In this work, we investigate navigation trails in the popular scholarly social tagging system BibSonomy from six years of log data. We discuss dynamic browsing behavior of the general user population and show that different navigational subgroups exhibit different navigational traits. Furthermore, we provide strong evidence that the semantic nature of the underlying folksonomy is an essential factor for explaining navigation.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Niebler, Thomas and Becker, Martin and Zoller, Daniel and Doerfel, Stephan and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the 25th ACM International on Conference on Information and Knowledge Management},<br\/>  keywords = {bibsonomy},<br\/>  note = {forthcoming},<br\/>  publisher = {ACM},<br\/>  series = {CIKM '16},<br\/>  title = {FolkTrails: Interpreting Navigation Behavior in a Social Tagging System},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b3b6e9c496fc336dbfc47169647959a2\"><p>%0 Conference Paper<br\/>%1 niebler2016folktrails<br\/>%A Niebler, Thomas<br\/>%A Becker, Martin<br\/>%A Zoller, Daniel<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the 25th ACM International on Conference on Information and Knowledge Management<br\/>%C New York, NY, USA<br\/>%D 2016<br\/>%I ACM<br\/>%T FolkTrails: Interpreting Navigation Behavior in a Social Tagging System<br\/>%U http:\/\/dx.doi.org\/10.1145\/2983323.2983686<br\/>%X Social tagging systems have established themselves as a quick and easy way to organize information by annotating resources with tags. In recent work, user behavior in social tagging systems was studied, that is, how users assign tags, and consume content. However, it is still unclear how users make use of the navigation options they are given. Understanding their behavior and differences in behavior of different user groups is an important step towards assessing the effectiveness of a navigational concept and of improving it to better suit the users\u2019 needs. In this work, we investigate navigation trails in the popular scholarly social tagging system BibSonomy from six years of log data. We discuss dynamic browsing behavior of the general user population and show that different navigational subgroups exhibit different navigational traits. Furthermore, we provide strong evidence that the semantic nature of the underlying folksonomy is an essential factor for explaining navigation.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Schmidt, A., Arnu, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Sequential Modeling and Structural Anomaly Analytics in Industrial Production Environments}<\/span>.<\/span> In: Proc. LWA 2016 (KDML Special Track). University of Potsdam, Potsdam, Germany (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-anomaly-analytics-lwda.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-604d352598778ba09810ca7d72669c94\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-604d352598778ba09810ca7d72669c94\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/604d352598778ba09810ca7d72669c94\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-604d352598778ba09810ca7d72669c94\"><p>@inproceedings{ASA:16:LWDA,<br\/>  address = {Potsdam, Germany},<br\/>  author = {Atzmueller, Martin and Schmidt, Andreas and Arnu, David},<br\/>  booktitle = {Proc. LWA 2016 (KDML Special Track)},<br\/>  keywords = {itegpub},<br\/>  publisher = {University of Potsdam},<br\/>  title = {{Sequential Modeling and Structural Anomaly Analytics in Industrial Production Environments}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-604d352598778ba09810ca7d72669c94\"><p>%0 Conference Paper<br\/>%1 ASA:16:LWDA<br\/>%A Atzmueller, Martin<br\/>%A Schmidt, Andreas<br\/>%A Arnu, David<br\/>%B Proc. LWA 2016 (KDML Special Track)<br\/>%C Potsdam, Germany<br\/>%D 2016<br\/>%I University of Potsdam<br\/>%T {Sequential Modeling and Structural Anomaly Analytics in Industrial Production Environments}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-anomaly-analytics-lwda.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Borchmann, D., Hanika, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Some Experimental Results on Randomly Generating Formal Contexts.<\/span><\/span> In: Huchard, M. and Kuznetsov, S. (eds.) CLA. pp. 57\u201369. CEUR-WS.org (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/cla\/cla2016.html#BorchmannH16\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8af414e45f306527e8316ac681fe7f08\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8af414e45f306527e8316ac681fe7f08\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8af414e45f306527e8316ac681fe7f08\/tomhanika\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8af414e45f306527e8316ac681fe7f08\"><p>@inproceedings{conf\/cla\/BorchmannH16,<br\/>  author = {Borchmann, Daniel and Hanika, Tom},<br\/>  booktitle = {CLA},<br\/>  crossref = {conf\/cla\/2016},<br\/>  editor = {Huchard, Marianne and Kuznetsov, Sergei},<br\/>  keywords = {itegpub},<br\/>  pages = {57-69},<br\/>  publisher = {CEUR-WS.org},<br\/>  series = {CEUR Workshop Proceedings},<br\/>  title = {Some Experimental Results on Randomly Generating Formal Contexts.},<br\/>  volume = 1624,<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8af414e45f306527e8316ac681fe7f08\"><p>%0 Conference Paper<br\/>%1 conf\/cla\/BorchmannH16<br\/>%A Borchmann, Daniel<br\/>%A Hanika, Tom<br\/>%B CLA<br\/>%D 2016<br\/>%E Huchard, Marianne<br\/>%E Kuznetsov, Sergei<br\/>%I CEUR-WS.org<br\/>%P 57-69<br\/>%T Some Experimental Results on Randomly Generating Formal Contexts.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/cla\/cla2016.html#BorchmannH16<br\/>%V 1624<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Kloepper, B., Mawla, H.A., J\u00e4schke, B., Hollender, M., Graube, M., Arnu, D., Schmidt, A., Heinze, S., Schorer, L., Kroll, A., Stumme, G., Urbas, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Big Data Analytics for Proactive Industrial Decision Support: Approaches \\& First Experiences in the Context of the FEE Project}<\/span>.<\/span> atp edition. 58, (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.atpinfo.de\/produkte\/2016-big-data-analytics-for-proactive-industrial-decision-support\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7f3a52ae196cd48e1c2c09f61e47b0fb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7f3a52ae196cd48e1c2c09f61e47b0fb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7f3a52ae196cd48e1c2c09f61e47b0fb\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7f3a52ae196cd48e1c2c09f61e47b0fb\"><p>@article{FEE:ATP:2016,<br\/>  author = {Atzmueller, Martin and Kloepper, Benjamin and Mawla, Hassan Al and J\u00e4schke, Benjamin and Hollender, Martin and Graube, Markus and Arnu, David and Schmidt, Andreas and Heinze, Sebastian and Schorer, Lukas and Kroll, Andreas and Stumme, Gerd and Urbas, Leon},<br\/>  journal = {atp edition},<br\/>  keywords = {big},<br\/>  number = 9,<br\/>  title = {{Big Data Analytics for Proactive Industrial Decision Support: Approaches \\& First Experiences in the Context of the FEE Project}},<br\/>  volume = 58,<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7f3a52ae196cd48e1c2c09f61e47b0fb\"><p>%0 Journal Article<br\/>%1 FEE:ATP:2016<br\/>%A Atzmueller, Martin<br\/>%A Kloepper, Benjamin<br\/>%A Mawla, Hassan Al<br\/>%A J\u00e4schke, Benjamin<br\/>%A Hollender, Martin<br\/>%A Graube, Markus<br\/>%A Arnu, David<br\/>%A Schmidt, Andreas<br\/>%A Heinze, Sebastian<br\/>%A Schorer, Lukas<br\/>%A Kroll, Andreas<br\/>%A Stumme, Gerd<br\/>%A Urbas, Leon<br\/>%D 2016<br\/>%J atp edition<br\/>%N 9<br\/>%T {Big Data Analytics for Proactive Industrial Decision Support: Approaches \\& First Experiences in the Context of the FEE Project}<br\/>%U https:\/\/www.atpinfo.de\/produkte\/2016-big-data-analytics-for-proactive-industrial-decision-support\/<br\/>%V 58<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Hanika, T., Stumme, G., Schaller, R., Ludwig, B.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Social Event Network Analysis: Structure, Preferences, and Reality}<\/span>.<\/span> In: Proc. IEEE\/ACM ASONAM. IEEE Press, Boston, MA, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-social-event-analysis-asonam16-preprint.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9d3966d8cee2f5cebeeaa0144469cb12\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9d3966d8cee2f5cebeeaa0144469cb12\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9d3966d8cee2f5cebeeaa0144469cb12\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9d3966d8cee2f5cebeeaa0144469cb12\"><p>@inproceedings{AHSSL:16:ASONAM,<br\/>  address = {Boston, MA, USA},<br\/>  author = {Atzmueller, Martin and Hanika, Tom and Stumme, Gerd and Schaller, Richard and Ludwig, Bernd},<br\/>  booktitle = {Proc. IEEE\/ACM ASONAM},<br\/>  keywords = {spatial},<br\/>  publisher = {IEEE Press},<br\/>  title = {{Social Event Network Analysis: Structure, Preferences, and Reality}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9d3966d8cee2f5cebeeaa0144469cb12\"><p>%0 Conference Paper<br\/>%1 AHSSL:16:ASONAM<br\/>%A Atzmueller, Martin<br\/>%A Hanika, Tom<br\/>%A Stumme, Gerd<br\/>%A Schaller, Richard<br\/>%A Ludwig, Bernd<br\/>%B Proc. IEEE\/ACM ASONAM<br\/>%C Boston, MA, USA<br\/>%D 2016<br\/>%I IEEE Press<br\/>%T {Social Event Network Analysis: Structure, Preferences, and Reality}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-social-event-analysis-asonam16-preprint.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Mollenhauer, D., Schmidt, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Big Data Analytics Using Local Exceptionality Detection}<\/span>.<\/span> In: {Enterprise Big Data Engineering, Analytics, and Management}. IGI Global, Hershey, PA, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/Atzmueller-Preprint-Big-Data-Analytics-Using-Local-Exceptionality-Detection.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b117c1e18e0748fbd065ba79c65c40f3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b117c1e18e0748fbd065ba79c65c40f3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b117c1e18e0748fbd065ba79c65c40f3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b117c1e18e0748fbd065ba79c65c40f3\"><p>@incollection{AMS:16,<br\/>  address = {Hershey, PA, USA},<br\/>  author = {Atzmueller, Martin and Mollenhauer, Dennis and Schmidt, Andreas},<br\/>  booktitle = {{Enterprise Big Data Engineering, Analytics, and Management}},<br\/>  keywords = {big},<br\/>  publisher = {IGI Global},<br\/>  title = {{Big Data Analytics Using Local Exceptionality Detection}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b117c1e18e0748fbd065ba79c65c40f3\"><p>%0 Book Section<br\/>%1 AMS:16<br\/>%A Atzmueller, Martin<br\/>%A Mollenhauer, Dennis<br\/>%A Schmidt, Andreas<br\/>%B {Enterprise Big Data Engineering, Analytics, and Management}<br\/>%C Hershey, PA, USA<br\/>%D 2016<br\/>%I IGI Global<br\/>%T {Big Data Analytics Using Local Exceptionality Detection}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/Atzmueller-Preprint-Big-Data-Analytics-Using-Local-Exceptionality-Detection.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Oussena, S., Roth-Berghofer, T. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Enterprise Big Data Engineering, Analytics and Management}<\/span>.<\/span> IGI Global, Hershey, PA, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-356449bfcd0e442f34a661c553d51068\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-356449bfcd0e442f34a661c553d51068\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/356449bfcd0e442f34a661c553d51068\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-356449bfcd0e442f34a661c553d51068\"><p>@book{AOR:16,<br\/>  address = {Hershey, PA, USA},<br\/>  editor = {Atzmueller, Martin and Oussena, Samia and Roth-Berghofer, Thomas},<br\/>  keywords = {big},<br\/>  publisher = {IGI Global},<br\/>  title = {{Enterprise Big Data Engineering, Analytics and Management}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-356449bfcd0e442f34a661c553d51068\"><p>%0 Book<br\/>%1 AOR:16<br\/>%C Hershey, PA, USA<br\/>%D 2016<br\/>%E Atzmueller, Martin<br\/>%E Oussena, Samia<br\/>%E Roth-Berghofer, Thomas<br\/>%I IGI Global<br\/>%T {Enterprise Big Data Engineering, Analytics and Management}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Local Exceptionality Detection on Social Interaction Networks}<\/span>.<\/span> In: Proc. ECML-PKDD 2016: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases. Springer Verlag, Heidelberg, Germany (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-local-exceptionality-detection-ecml-pkdd-2016.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-60e75c0ce7987d6d4e30247bb28444ed\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-60e75c0ce7987d6d4e30247bb28444ed\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/60e75c0ce7987d6d4e30247bb28444ed\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-60e75c0ce7987d6d4e30247bb28444ed\"><p>@inproceedings{Atzmueller:16,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Proc. ECML-PKDD 2016: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},<br\/>  keywords = {interaction},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Local Exceptionality Detection on Social Interaction Networks}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-60e75c0ce7987d6d4e30247bb28444ed\"><p>%0 Conference Paper<br\/>%1 Atzmueller:16<br\/>%A Atzmueller, Martin<br\/>%B Proc. ECML-PKDD 2016: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases<br\/>%C Heidelberg, Germany<br\/>%D 2016<br\/>%I Springer Verlag<br\/>%T {Local Exceptionality Detection on Social Interaction Networks}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-local-exceptionality-detection-ecml-pkdd-2016.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Analyzing Group Interaction and Dynamics on Socio-Behavioral Networks of Face-to-Face Proximity}<\/span>.<\/span> In: Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication. ACM Press, New York, NY, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-analyzing-group-interaction-ubicomp16.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4f15a17fe42a0157993b9c026afa8a87\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4f15a17fe42a0157993b9c026afa8a87\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4f15a17fe42a0157993b9c026afa8a87\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4f15a17fe42a0157993b9c026afa8a87\"><p>@inproceedings{ATSK:16,<br\/>  address = {New York, NY, USA},<br\/>  author = {Atzmueller, Martin and Thiele, Lisa and Stumme, Gerd and Kauffeld, Simone},<br\/>  booktitle = {Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication},<br\/>  keywords = {behavior},<br\/>  publisher = {ACM Press},<br\/>  series = {UbiComp '16 Adjunct},<br\/>  title = {{Analyzing Group Interaction and Dynamics on Socio-Behavioral Networks of Face-to-Face Proximity}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4f15a17fe42a0157993b9c026afa8a87\"><p>%0 Conference Paper<br\/>%1 ATSK:16<br\/>%A Atzmueller, Martin<br\/>%A Thiele, Lisa<br\/>%A Stumme, Gerd<br\/>%A Kauffeld, Simone<br\/>%B Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication<br\/>%C New York, NY, USA<br\/>%D 2016<br\/>%I ACM Press<br\/>%T {Analyzing Group Interaction and Dynamics on Socio-Behavioral Networks of Face-to-Face Proximity}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-analyzing-group-interaction-ubicomp16.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Ernst, A., Krebs, F., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Formation and Temporal Evolution of Social Groups During Coffee Breaks}<\/span>.<\/span> In: Postproceedings of the International Workshops MUSE &amp; SenseML 2014, Nancy, France, and MSM 2014, Seoul, Korea. Springer Verlag, Heidelberg, Germany (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-group-formation-temporal-evolution.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-afd137d11c7de6070f59356096a9d4e9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-afd137d11c7de6070f59356096a9d4e9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/afd137d11c7de6070f59356096a9d4e9\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-afd137d11c7de6070f59356096a9d4e9\"><p>@incollection{AEKSS:15,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin and Ernst, Andreas and Krebs, Friedrich and Scholz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Postproceedings of the International Workshops MUSE & SenseML 2014, Nancy, France, and MSM 2014, Seoul, Korea},<br\/>  keywords = {group},<br\/>  publisher = {Springer Verlag},<br\/>  series = {LNAI},<br\/>  title = {{Formation and Temporal Evolution of Social Groups During Coffee Breaks}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-afd137d11c7de6070f59356096a9d4e9\"><p>%0 Book Section<br\/>%1 AEKSS:15<br\/>%A Atzmueller, Martin<br\/>%A Ernst, Andreas<br\/>%A Krebs, Friedrich<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Postproceedings of the International Workshops MUSE & SenseML 2014, Nancy, France, and MSM 2014, Seoul, Korea<br\/>%C Heidelberg, Germany<br\/>%D 2016<br\/>%I Springer Verlag<br\/>%T {Formation and Temporal Evolution of Social Groups During Coffee Breaks}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-group-formation-temporal-evolution.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Community Detection: From Plain to Attributed Complex Networks}<\/span>.<\/span> In: Proc. ACM Web Science Conference. ACM Press, New York, NY, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-websci-community-detection-on-complex-attributed-networks.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-872e8f8d2e157768027ec7f660a010bc\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-872e8f8d2e157768027ec7f660a010bc\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/872e8f8d2e157768027ec7f660a010bc\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-872e8f8d2e157768027ec7f660a010bc\"><p>@inproceedings{Atzmueller:16:websci,<br\/>  address = {New York, NY, USA},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Proc. ACM Web Science Conference},<br\/>  keywords = 2016,<br\/>  organization = {ACM},<br\/>  publisher = {ACM Press},<br\/>  title = {{Community Detection: From Plain to Attributed Complex Networks}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-872e8f8d2e157768027ec7f660a010bc\"><p>%0 Conference Paper<br\/>%1 Atzmueller:16:websci<br\/>%A Atzmueller, Martin<br\/>%B Proc. ACM Web Science Conference<br\/>%C New York, NY, USA<br\/>%D 2016<br\/>%I ACM Press<br\/>%T {Community Detection: From Plain to Attributed Complex Networks}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2016-atzmueller-websci-community-detection-on-complex-attributed-networks.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Chin, A., Janssen, F., Schweizer, I., Trattner, C. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Big Data Analytics in the Social and Ubiquitous Context}<\/span>.<\/span> Springer Verlag, Heidelberg, Germany (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4cfeb536b6aa3bd1041e8c44cad65c4a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4cfeb536b6aa3bd1041e8c44cad65c4a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4cfeb536b6aa3bd1041e8c44cad65c4a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4cfeb536b6aa3bd1041e8c44cad65c4a\"><p>@proceedings{ACJST:16,<br\/>  address = {Heidelberg, Germany},<br\/>  booktitle = {MSM\/MUSE Postproceedings 2015},<br\/>  editor = {Atzmueller, Martin and Chin, Alvin and Janssen, Frederik and Schweizer, Immanuel and Trattner, Christoph},<br\/>  keywords = {big},<br\/>  publisher = {Springer Verlag},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {{Big Data Analytics in the Social and Ubiquitous Context}},<br\/>  volume = 9546,<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4cfeb536b6aa3bd1041e8c44cad65c4a\"><p>%0 Conference Proceedings<br\/>%1 ACJST:16<br\/>%B MSM\/MUSE Postproceedings 2015<br\/>%C Heidelberg, Germany<br\/>%D 2016<br\/>%E Atzmueller, Martin<br\/>%E Chin, Alvin<br\/>%E Janssen, Frederik<br\/>%E Schweizer, Immanuel<br\/>%E Trattner, Christoph<br\/>%I Springer Verlag<br\/>%T {Big Data Analytics in the Social and Ubiquitous Context}<br\/>%V 9546<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Knoell, D., Atzmueller, M., Rieder, C., Scherer, K.P.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{BISHOP \u2013 Big Data Driven Self-Learning Support for High-performance Ontology Population}<\/span>.<\/span> In: Proc. LWA 2016 (FGWM Special Track). University of Potsdam, Potsdam, Germany (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/BISHOP-LWDA2016.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-34adc63fb9ab5d2837688aa575d7a9c4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-34adc63fb9ab5d2837688aa575d7a9c4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/34adc63fb9ab5d2837688aa575d7a9c4\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-34adc63fb9ab5d2837688aa575d7a9c4\"><p>@inproceedings{KARS:16:LWDA,<br\/>  address = {Potsdam, Germany},<br\/>  author = {Knoell, Daniel and Atzmueller, Martin and Rieder, Constantin and Scherer, Klaus Peter},<br\/>  booktitle = {Proc. LWA 2016 (FGWM Special Track)},<br\/>  keywords = {ontology},<br\/>  publisher = {University of Potsdam},<br\/>  title = {{BISHOP \u2013 Big Data Driven Self-Learning Support for High-performance Ontology Population}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-34adc63fb9ab5d2837688aa575d7a9c4\"><p>%0 Conference Paper<br\/>%1 KARS:16:LWDA<br\/>%A Knoell, Daniel<br\/>%A Atzmueller, Martin<br\/>%A Rieder, Constantin<br\/>%A Scherer, Klaus Peter<br\/>%B Proc. LWA 2016 (FGWM Special Track)<br\/>%C Potsdam, Germany<br\/>%D 2016<br\/>%I University of Potsdam<br\/>%T {BISHOP \u2013 Big Data Driven Self-Learning Support for High-performance Ontology Population}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/BISHOP-LWDA2016.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Lemmerich, F., Atzmueller, M., Puppe, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Fast Exhaustive Subgroup Discovery with Numerical Target Concepts}<\/span>.<\/span> Data Mining and Knowledge Discovery. 30, 711\u2013762 (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-dmkd-preprint-sdnum.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c62a19b6dec89913f6a96dad22c17650\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c62a19b6dec89913f6a96dad22c17650\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c62a19b6dec89913f6a96dad22c17650\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c62a19b6dec89913f6a96dad22c17650\"><p>@article{LAP:15,<br\/>  author = {Lemmerich, Florian and Atzmueller, Martin and Puppe, Frank},<br\/>  journal = {Data Mining and Knowledge Discovery},<br\/>  keywords = {itegpub},<br\/>  pages = {711-762},<br\/>  title = {{Fast Exhaustive Subgroup Discovery with Numerical Target Concepts}},<br\/>  volume = 30,<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c62a19b6dec89913f6a96dad22c17650\"><p>%0 Journal Article<br\/>%1 LAP:15<br\/>%A Lemmerich, Florian<br\/>%A Atzmueller, Martin<br\/>%A Puppe, Frank<br\/>%D 2016<br\/>%J Data Mining and Knowledge Discovery<br\/>%P 711-762<br\/>%T {Fast Exhaustive Subgroup Discovery with Numerical Target Concepts}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-dmkd-preprint-sdnum.pdf<br\/>%V 30<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmidt, A., Atzmueller, M., Hollender, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Data Preparation for Big Data Analytics: Methods \\& Experiences}<\/span>.<\/span> In: {Enterprise Big Data Engineering, Analytics, and Management}. IGI Global, Hershey, PA, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.igi-global.com\/chapter\/data-preparation-for-big-data-analytics\/154561\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0d3f78c35ae36768d1f38d0d24dd938e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0d3f78c35ae36768d1f38d0d24dd938e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0d3f78c35ae36768d1f38d0d24dd938e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0d3f78c35ae36768d1f38d0d24dd938e\"><p>@incollection{ASH:16,<br\/>  address = {Hershey, PA, USA},<br\/>  author = {Schmidt, Andreas and Atzmueller, Martin and Hollender, Martin},<br\/>  booktitle = {{Enterprise Big Data Engineering, Analytics, and Management}},<br\/>  keywords = {big},<br\/>  publisher = {IGI Global},<br\/>  title = {{Data Preparation for Big Data Analytics: Methods \\& Experiences}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0d3f78c35ae36768d1f38d0d24dd938e\"><p>%0 Book Section<br\/>%1 ASH:16<br\/>%A Schmidt, Andreas<br\/>%A Atzmueller, Martin<br\/>%A Hollender, Martin<br\/>%B {Enterprise Big Data Engineering, Analytics, and Management}<br\/>%C Hershey, PA, USA<br\/>%D 2016<br\/>%I IGI Global<br\/>%T {Data Preparation for Big Data Analytics: Methods \\& Experiences}<br\/>%U http:\/\/www.igi-global.com\/chapter\/data-preparation-for-big-data-analytics\/154561<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Fries, B., Hayat, N.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Sensing, Processing and Analytics - Augmenting the Ubicon Platform for Anticipatory Ubiquitous Computing}<\/span>.<\/span> In: Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication. ACM Press, New York, NY, USA (2016).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-ubicon-ubicomp16.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-30b510b61ae006d617fa5989c2ef34d9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-30b510b61ae006d617fa5989c2ef34d9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/30b510b61ae006d617fa5989c2ef34d9\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-30b510b61ae006d617fa5989c2ef34d9\"><p>@inproceedings{AFH:16,<br\/>  address = {New York, NY, USA},<br\/>  author = {Atzmueller, Martin and Fries, Bj\u00f6rn and Hayat, Naveed},<br\/>  booktitle = {Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication},<br\/>  keywords = {ubicon},<br\/>  publisher = {ACM Press},<br\/>  series = {UbiComp '16 Adjunct},<br\/>  title = {{Sensing, Processing and Analytics - Augmenting the Ubicon Platform for Anticipatory Ubiquitous Computing}},<br\/>  year = 2016<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-30b510b61ae006d617fa5989c2ef34d9\"><p>%0 Conference Paper<br\/>%1 AFH:16<br\/>%A Atzmueller, Martin<br\/>%A Fries, Bj\u00f6rn<br\/>%A Hayat, Naveed<br\/>%B Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication<br\/>%C New York, NY, USA<br\/>%D 2016<br\/>%I ACM Press<br\/>%T {Sensing, Processing and Analytics - Augmenting the Ubicon Platform for Anticipatory Ubiquitous Computing}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-ubicon-ubicomp16.pdf<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2015\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2015<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Subgroup and Community Analytics}<\/span><\/span>, https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-cssws15-abstract.pdf, (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-cssws15-abstract.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-55c5d99fb003a1111f3d85f0d7155167\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-55c5d99fb003a1111f3d85f0d7155167\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/55c5d99fb003a1111f3d85f0d7155167\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-55c5d99fb003a1111f3d85f0d7155167\"><p>@misc{Atzmueller:15:CSSWS,<br\/>  author = {Atzmueller, Martin},<br\/>  editor = {Symposium, Computational Social Science Winter},<br\/>  howpublished = {Tutorial Abstract},<br\/>  keywords = {community},<br\/>  title = {{Subgroup and Community Analytics}},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-55c5d99fb003a1111f3d85f0d7155167\"><p>%0 Generic<br\/>%1 Atzmueller:15:CSSWS<br\/>%A Atzmueller, Martin<br\/>%D 2015<br\/>%E Symposium, Computational Social Science Winter<br\/>%T {Subgroup and Community Analytics}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-cssws15-abstract.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Doerfel, S., Mitzlaff, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Fast Description-Oriented Community Detection using Subgroup Discovery (Extended Abstract, Resubmission)}<\/span>.<\/span> In: Proc. LWA 2015 (KDML Special Track) (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-lwa-kdml-atzmueller.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-36befc7efef3831f5b40b5ebd8f3bc88\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-36befc7efef3831f5b40b5ebd8f3bc88\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/36befc7efef3831f5b40b5ebd8f3bc88\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-36befc7efef3831f5b40b5ebd8f3bc88\"><p>@inproceedings{ADM:15b,<br\/>  author = {Atzmueller, Martin and Doerfel, Stephan and Mitzlaff, Folke},<br\/>  booktitle = {Proc. LWA 2015 (KDML Special Track)},<br\/>  keywords = 2015,<br\/>  title = {{Fast Description-Oriented Community Detection using Subgroup Discovery (Extended Abstract, Resubmission)}},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-36befc7efef3831f5b40b5ebd8f3bc88\"><p>%0 Conference Paper<br\/>%1 ADM:15b<br\/>%A Atzmueller, Martin<br\/>%A Doerfel, Stephan<br\/>%A Mitzlaff, Folke<br\/>%B Proc. LWA 2015 (KDML Special Track)<br\/>%D 2015<br\/>%T {Fast Description-Oriented Community Detection using Subgroup Discovery (Extended Abstract, Resubmission)}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-lwa-kdml-atzmueller.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Zoller, D., Doerfel, S., J\u00e4schke, R., Stumme, G., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On Publication Usage in a Social Bookmarking System<\/span>.<\/span> In: Proceedings of the 2015 ACM Conference on Web Science. pp. 67:1\u201367:2. ACM, Oxford, United Kingdom (2015). https:\/\/doi.org\/10.1145\/2786451.2786927.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2786451.2786927\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-548a7010ee2726f28e04e5c6e5fd6e2d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-548a7010ee2726f28e04e5c6e5fd6e2d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2786451.2786927\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/548a7010ee2726f28e04e5c6e5fd6e2d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-548a7010ee2726f28e04e5c6e5fd6e2d\">Scholarly success is traditionally measured in terms of citations to publications. With the advent of publication man- agement and digital libraries on the web, scholarly usage data has become a target of investigation and new impact metrics computed on such usage data have been proposed \u2013 so called altmetrics. In scholarly social bookmarking sys- tems, scientists collect and manage publication meta data and thus reveal their interest in these publications. In this work, we investigate connections between usage metrics and citations, and find posts, exports, and page views of publications to be correlated to citations.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-548a7010ee2726f28e04e5c6e5fd6e2d\"><p>@inproceedings{zoller2015publication,<br\/>  abstract = {Scholarly success is traditionally measured in terms of citations to publications. With the advent of publication man- agement and digital libraries on the web, scholarly usage data has become a target of investigation and new impact metrics computed on such usage data have been proposed \u2013 so called altmetrics. In scholarly social bookmarking sys- tems, scientists collect and manage publication meta data and thus reveal their interest in these publications. In this work, we investigate connections between usage metrics and citations, and find posts, exports, and page views of publications to be correlated to citations.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Zoller, Daniel and Doerfel, Stephan and J\u00e4schke, Robert and Stumme, Gerd and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the 2015 ACM Conference on Web Science},<br\/>  keywords = {bookmarking},<br\/>  pages = {67:1--67:2},<br\/>  publisher = {ACM},<br\/>  series = {WebSci '15},<br\/>  title = {On Publication Usage in a Social Bookmarking System},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-548a7010ee2726f28e04e5c6e5fd6e2d\"><p>%0 Conference Paper<br\/>%1 zoller2015publication<br\/>%A Zoller, Daniel<br\/>%A Doerfel, Stephan<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the 2015 ACM Conference on Web Science<br\/>%C New York, NY, USA<br\/>%D 2015<br\/>%I ACM<br\/>%P 67:1--67:2<br\/>%R 10.1145\/2786451.2786927<br\/>%T On Publication Usage in a Social Bookmarking System<br\/>%U http:\/\/doi.acm.org\/10.1145\/2786451.2786927<br\/>%X Scholarly success is traditionally measured in terms of citations to publications. With the advent of publication man- agement and digital libraries on the web, scholarly usage data has become a target of investigation and new impact metrics computed on such usage data have been proposed \u2013 so called altmetrics. In scholarly social bookmarking sys- tems, scientists collect and manage publication meta data and thus reveal their interest in these publications. In this work, we investigate connections between usage metrics and citations, and find posts, exports, and page views of publications to be correlated to citations.<br\/>%@ 978-1-4503-3672-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Atzmueller, M., Illig, J., Scholz, C., Barrat, A., Cattuto, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists<\/span>.<\/span> In: Proceedings of the 2015 ACM\/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25-28, 2015 (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8e828b0d478e0e46d3cb0a9b2d1597b1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8e828b0d478e0e46d3cb0a9b2d1597b1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8e828b0d478e0e46d3cb0a9b2d1597b1\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8e828b0d478e0e46d3cb0a9b2d1597b1\"><p>@inproceedings{kibanov2015content,<br\/>  author = {Kibanov, Mark and Atzmueller, Martin and Illig, Jens and Scholz, Christoph and Barrat, Alain and Cattuto, Ciro and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 2015 ACM\/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25-28, 2015},<br\/>  keywords = {mark},<br\/>  title = {Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8e828b0d478e0e46d3cb0a9b2d1597b1\"><p>%0 Conference Paper<br\/>%1 kibanov2015content<br\/>%A Kibanov, Mark<br\/>%A Atzmueller, Martin<br\/>%A Illig, Jens<br\/>%A Scholz, Christoph<br\/>%A Barrat, Alain<br\/>%A Cattuto, Ciro<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 2015 ACM\/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25-28, 2015<br\/>%D 2015<br\/>%T Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mining Groups Stability in Ubiquitous and Social Environments: Communities, Classes and Clusters<\/span>.<\/span> In: Cheng, X., Li, H., Gabrilovich, E., and Tang, J. (eds.) Proceedings of the Eighth ACM International Conference on Web Search and Data Mining. pp. 441\u2013446. ACM, Shanghai, China (2015). https:\/\/doi.org\/10.1145\/2684822.2697034.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2684822.2697034\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-17ed02a44f9050e7b9178c11bdfed3cd\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-17ed02a44f9050e7b9178c11bdfed3cd\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2684822.2697034\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/17ed02a44f9050e7b9178c11bdfed3cd\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-17ed02a44f9050e7b9178c11bdfed3cd\">Ubiquitous Computing is an emerging research area of computer science. Similarly, social network analysis and mining became very important in the last years. We aim to combine these two research areas to explore the nature of processes happening around users. The presented research focuses on exploring and analyzing different groups of persons or entities (communities, clusters and classes), their stability and semantics. An example of ubiquitous social data are social networks captured during scientific conferences using face-to-face RFID proximity tags. Another example of ubiquitous data is crowd-generated environmental sensor data. In this paper we generalize various problems connected to these and further datasets and consider them as a task for measuring group stability. Group stability can be used to improve state-of-the-art methods to analyze data. We also aim to improve the performance of different data mining algorithms, eg. by better handling of data with a skewed density distribution. We describe significant results some experiments that show how the presented approach can be applied and discuss the planned experiments.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-17ed02a44f9050e7b9178c11bdfed3cd\"><p>@inproceedings{kibanov2015mining,<br\/>  abstract = {Ubiquitous Computing is an emerging research area of computer science. Similarly, social network analysis and mining became very important in the last years. We aim to combine these two research areas to explore the nature of processes happening around users. The presented research focuses on exploring and analyzing different groups of persons or entities (communities, clusters and classes), their stability and semantics. An example of ubiquitous social data are social networks captured during scientific conferences using face-to-face RFID proximity tags. Another example of ubiquitous data is crowd-generated environmental sensor data. In this paper we generalize various problems connected to these and further datasets and consider them as a task for measuring group stability. Group stability can be used to improve state-of-the-art methods to analyze data. We also aim to improve the performance of different data mining algorithms, eg. by better handling of data with a skewed density distribution. We describe significant results some experiments that show how the presented approach can be applied and discuss the planned experiments.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Kibanov, Mark},<br\/>  booktitle = {Proceedings of the Eighth ACM International Conference on Web Search and Data Mining},<br\/>  editor = {Cheng, Xueqi and Li, Hang and Gabrilovich, Evgeniy and Tang, Jie},<br\/>  keywords = {itegpub},<br\/>  pages = {441--446},<br\/>  publisher = {ACM},<br\/>  series = {WSDM '15},<br\/>  title = {Mining Groups Stability in Ubiquitous and Social Environments: Communities, Classes and Clusters},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-17ed02a44f9050e7b9178c11bdfed3cd\"><p>%0 Conference Paper<br\/>%1 kibanov2015mining<br\/>%A Kibanov, Mark<br\/>%B Proceedings of the Eighth ACM International Conference on Web Search and Data Mining<br\/>%C New York, NY, USA<br\/>%D 2015<br\/>%E Cheng, Xueqi<br\/>%E Li, Hang<br\/>%E Gabrilovich, Evgeniy<br\/>%E Tang, Jie<br\/>%I ACM<br\/>%P 441--446<br\/>%R 10.1145\/2684822.2697034<br\/>%T Mining Groups Stability in Ubiquitous and Social Environments: Communities, Classes and Clusters<br\/>%U http:\/\/doi.acm.org\/10.1145\/2684822.2697034<br\/>%X Ubiquitous Computing is an emerging research area of computer science. Similarly, social network analysis and mining became very important in the last years. We aim to combine these two research areas to explore the nature of processes happening around users. The presented research focuses on exploring and analyzing different groups of persons or entities (communities, clusters and classes), their stability and semantics. An example of ubiquitous social data are social networks captured during scientific conferences using face-to-face RFID proximity tags. Another example of ubiquitous data is crowd-generated environmental sensor data. In this paper we generalize various problems connected to these and further datasets and consider them as a task for measuring group stability. Group stability can be used to improve state-of-the-art methods to analyze data. We also aim to improve the performance of different data mining algorithms, eg. by better handling of data with a skewed density distribution. We describe significant results some experiments that show how the presented approach can be applied and discuss the planned experiments.<br\/>%@ 978-1-4503-3317-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Knoell, D., Rieder, C., Atzmueller, M., Scherer, K.P.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Towards Generating Test Ontologies using Subgroup Discovery}<\/span>.<\/span> In: Proc. LWA 2015 (WM Special Track) (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-lwa-kdml-sd-ontology-testing.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4b1690695ddd7c20795f759ea94a3648\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4b1690695ddd7c20795f759ea94a3648\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4b1690695ddd7c20795f759ea94a3648\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4b1690695ddd7c20795f759ea94a3648\"><p>@inproceedings{KRAS:15,<br\/>  author = {Knoell, Daniel and Rieder, Constantin and Atzmueller, Martin and Scherer, Klaus Peter},<br\/>  booktitle = {Proc. LWA 2015 (WM Special Track)},<br\/>  keywords = {ontology},<br\/>  title = {{Towards Generating Test Ontologies using Subgroup Discovery}},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4b1690695ddd7c20795f759ea94a3648\"><p>%0 Conference Paper<br\/>%1 KRAS:15<br\/>%A Knoell, Daniel<br\/>%A Rieder, Constantin<br\/>%A Atzmueller, Martin<br\/>%A Scherer, Klaus Peter<br\/>%B Proc. LWA 2015 (WM Special Track)<br\/>%D 2015<br\/>%T {Towards Generating Test Ontologies using Subgroup Discovery}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-lwa-kdml-sd-ontology-testing.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Singer, P., Helic, D., Hotho, A., Strohmaier, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Hyptrails: A bayesian approach for comparing hypotheses about human trails<\/span>.<\/span> In: 24th International World Wide Web Conference (WWW2015). ACM, Firenze, Italy (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.www2015.it\/documents\/proceedings\/proceedings\/p1003.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5d21e53dc91b35a4a6cb6b9ec858045d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5d21e53dc91b35a4a6cb6b9ec858045d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5d21e53dc91b35a4a6cb6b9ec858045d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5d21e53dc91b35a4a6cb6b9ec858045d\"><p>@inproceedings{singer2015hyptrails,<br\/>  address = {Firenze, Italy},<br\/>  author = {Singer, P. and Helic, D. and Hotho, A. and Strohmaier, M.},<br\/>  booktitle = {24th International World Wide Web Conference (WWW2015)},<br\/>  keywords = {bibsonomy},<br\/>  month = {05},<br\/>  organization = {ACM},<br\/>  publisher = {ACM},<br\/>  title = {Hyptrails: A bayesian approach for comparing hypotheses about human trails},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5d21e53dc91b35a4a6cb6b9ec858045d\"><p>%0 Conference Paper<br\/>%1 singer2015hyptrails<br\/>%A Singer, P.<br\/>%A Helic, D.<br\/>%A Hotho, A.<br\/>%A Strohmaier, M.<br\/>%B 24th International World Wide Web Conference (WWW2015)<br\/>%C Firenze, Italy<br\/>%D 2015<br\/>%I ACM<br\/>%T Hyptrails: A bayesian approach for comparing hypotheses about human trails<br\/>%U http:\/\/www.www2015.it\/documents\/proceedings\/proceedings\/p1003.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Chin, A., Scholz, C., Trattner, C. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Mining, Modeling and Recommending \u2019Things\u2019 in Social Media}<\/span>.<\/span> Springer Verlag, Heidelberg, Germany (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e944e8734b27daae6fbad4459cde416d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e944e8734b27daae6fbad4459cde416d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e944e8734b27daae6fbad4459cde416d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e944e8734b27daae6fbad4459cde416d\"><p>@book{ACST:15,<br\/>  address = {Heidelberg, Germany},<br\/>  booktitle = {MSM\/MUSE Postproceedings 2013},<br\/>  editor = {Atzmueller, Martin and Chin, Alvin and Scholz, Christoph and Trattner, Christoph},<br\/>  journal = {LNCS},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  series = {LNCS},<br\/>  title = {{Mining, Modeling and Recommending 'Things' in Social Media}},<br\/>  volume = 8940,<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e944e8734b27daae6fbad4459cde416d\"><p>%0 Book<br\/>%1 ACST:15<br\/>%B MSM\/MUSE Postproceedings 2013<br\/>%C Heidelberg, Germany<br\/>%D 2015<br\/>%E Atzmueller, Martin<br\/>%E Chin, Alvin<br\/>%E Scholz, Christoph<br\/>%E Trattner, Christoph<br\/>%I Springer Verlag<br\/>%J LNCS<br\/>%T {Mining, Modeling and Recommending 'Things' in Social Media}<br\/>%V 8940<br\/>%@ 978-3-642-23598-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Mueller, J., Becker, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Exploratory Subgroup Analytics on Ubiquitous Data}<\/span>.<\/span> In: Mining, Modeling and Recommending \u2019Things\u2019 in Social Media. Springer Verlag, Heidelberg, Germany (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-927a22e096c2cac7f23966d89756236e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-927a22e096c2cac7f23966d89756236e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/927a22e096c2cac7f23966d89756236e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-927a22e096c2cac7f23966d89756236e\"><p>@incollection{AMB:15,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin and Mueller, Juergen and Becker, Martin},<br\/>  booktitle = {Mining, Modeling and Recommending 'Things' in Social Media},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  series = {LNAI},<br\/>  title = {{Exploratory Subgroup Analytics on Ubiquitous Data}},<br\/>  volume = 8940,<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-927a22e096c2cac7f23966d89756236e\"><p>%0 Book Section<br\/>%1 AMB:15<br\/>%A Atzmueller, Martin<br\/>%A Mueller, Juergen<br\/>%A Becker, Martin<br\/>%B Mining, Modeling and Recommending 'Things' in Social Media<br\/>%C Heidelberg, Germany<br\/>%D 2015<br\/>%I Springer Verlag<br\/>%T {Exploratory Subgroup Analytics on Ubiquitous Data}<br\/>%V 8940<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">S\u00eerbu, A., Becker, M., Caminiti, S., De Baets, B., Elen, B., Francis, L., Gravino, P., Hotho, A., Ingarra, S., Loreto, V., Molino, A., Mueller, J., Peters, J., Ricchiuti, F., Saracino, F., Servedio, V.D.P., Stumme, G., Theunis, J., Tria, F., Van den Bossche, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Participatory Patterns in an International Air Quality Monitoring Initiative<\/span>.<\/span> PLOS ONE. 10, 1\u201319 (2015). https:\/\/doi.org\/10.1371\/journal.pone.0136763.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1371\/journal.pone.0136763\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ad517a67592e79441844f1a360dc9fde\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ad517a67592e79441844f1a360dc9fde\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1371\/journal.pone.0136763\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ad517a67592e79441844f1a360dc9fde\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-ad517a67592e79441844f1a360dc9fde\">The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air\/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ad517a67592e79441844f1a360dc9fde\"><p>@article{sirbu2015participatory,<br\/>  abstract = {The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air\/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.},<br\/>  author = {S\u00eerbu, Alina and Becker, Martin and Caminiti, Saverio and De Baets, Bernard and Elen, Bart and Francis, Louise and Gravino, Pietro and Hotho, Andreas and Ingarra, Stefano and Loreto, Vittorio and Molino, Andrea and Mueller, Juergen and Peters, Jan and Ricchiuti, Ferdinando and Saracino, Fabio and Servedio, Vito D. P. and Stumme, Gerd and Theunis, Jan and Tria, Francesca and Van den Bossche, Joris},<br\/>  journal = {PLOS ONE},<br\/>  keywords = {itegpub},<br\/>  month = {08},<br\/>  number = 8,<br\/>  pages = {1-19},<br\/>  publisher = {Public Library of Science},<br\/>  title = {Participatory Patterns in an International Air Quality Monitoring Initiative},<br\/>  volume = 10,<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ad517a67592e79441844f1a360dc9fde\"><p>%0 Journal Article<br\/>%1 sirbu2015participatory<br\/>%A S\u00eerbu, Alina<br\/>%A Becker, Martin<br\/>%A Caminiti, Saverio<br\/>%A De Baets, Bernard<br\/>%A Elen, Bart<br\/>%A Francis, Louise<br\/>%A Gravino, Pietro<br\/>%A Hotho, Andreas<br\/>%A Ingarra, Stefano<br\/>%A Loreto, Vittorio<br\/>%A Molino, Andrea<br\/>%A Mueller, Juergen<br\/>%A Peters, Jan<br\/>%A Ricchiuti, Ferdinando<br\/>%A Saracino, Fabio<br\/>%A Servedio, Vito D. P.<br\/>%A Stumme, Gerd<br\/>%A Theunis, Jan<br\/>%A Tria, Francesca<br\/>%A Van den Bossche, Joris<br\/>%D 2015<br\/>%I Public Library of Science<br\/>%J PLOS ONE<br\/>%N 8<br\/>%P 1-19<br\/>%R 10.1371\/journal.pone.0136763<br\/>%T Participatory Patterns in an International Air Quality Monitoring Initiative<br\/>%U https:\/\/doi.org\/10.1371\/journal.pone.0136763<br\/>%V 10<br\/>%X The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air\/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Subgroup and Community Analytics on Attributed Graphs}<\/span>.<\/span> In: Proc. International Workshop on Social Network Analysis using Formal Concept Analysis (SNAFCA-2015). CEUR-WS (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-snafca-community-analytics.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f51fae9eed72d7b523fb71fda93d828c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f51fae9eed72d7b523fb71fda93d828c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f51fae9eed72d7b523fb71fda93d828c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f51fae9eed72d7b523fb71fda93d828c\"><p>@inproceedings{Atzmueller:15b,<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Proc. International Workshop on Social Network Analysis using Formal Concept Analysis (SNAFCA-2015)},<br\/>  keywords = 2015,<br\/>  publisher = {CEUR-WS},<br\/>  title = {{Subgroup and Community Analytics on Attributed Graphs}},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f51fae9eed72d7b523fb71fda93d828c\"><p>%0 Conference Paper<br\/>%1 Atzmueller:15b<br\/>%A Atzmueller, Martin<br\/>%B Proc. International Workshop on Social Network Analysis using Formal Concept Analysis (SNAFCA-2015)<br\/>%D 2015<br\/>%I CEUR-WS<br\/>%T {Subgroup and Community Analytics on Attributed Graphs}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-snafca-community-analytics.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Tran, T., Tran, N.-K., Teka Hadgu, A., J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Annotation for Microblog Topics Using Wikipedia Temporal Information<\/span>.<\/span> In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing (EMNLP). Association for Computational Linguistics (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9d4cd9070922e1eb43bcab1da4a9d840\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9d4cd9070922e1eb43bcab1da4a9d840\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9d4cd9070922e1eb43bcab1da4a9d840\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9d4cd9070922e1eb43bcab1da4a9d840\">In this paper we study the problem of semantic annotation for a trending hashtag which is the crucial step towards analyzing user behavior in social media, yet has been largely unexplored. We tackle the problem via linking to entities from Wikipedia. We incorporate the social aspects of trending hashtags by identifying prominent entities for the annotation so as to maximize the information spreading in entity networks. We exploit temporal dynamics of entities in Wikipedia, namely Wikipedia edits and page views to improve the annotation quality. Our experiments show that we significantly outperform the established methods in tweet annotation.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9d4cd9070922e1eb43bcab1da4a9d840\"><p>@inproceedings{tran2015semantic,<br\/>  abstract = {In this paper we study the problem of semantic annotation for a trending hashtag which is the crucial step towards analyzing user behavior in social media, yet has been largely unexplored. We tackle the problem via linking to entities from Wikipedia. We incorporate the social aspects of trending hashtags by identifying prominent entities for the annotation so as to maximize the information spreading in entity networks. We exploit temporal dynamics of entities in Wikipedia, namely Wikipedia edits and page views to improve the annotation quality. Our experiments show that we significantly outperform the established methods in tweet annotation.},<br\/>  author = {Tran, Tuan and Tran, Nam-Khanh and Teka Hadgu, Asmelash and J\u00e4schke, Robert},<br\/>  booktitle = {Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing (EMNLP)},<br\/>  keywords = {temporal},<br\/>  month = {09},<br\/>  publisher = {Association for Computational Linguistics},<br\/>  title = {Semantic Annotation for Microblog Topics Using Wikipedia Temporal Information},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9d4cd9070922e1eb43bcab1da4a9d840\"><p>%0 Conference Paper<br\/>%1 tran2015semantic<br\/>%A Tran, Tuan<br\/>%A Tran, Nam-Khanh<br\/>%A Teka Hadgu, Asmelash<br\/>%A J\u00e4schke, Robert<br\/>%B Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing (EMNLP)<br\/>%D 2015<br\/>%I Association for Computational Linguistics<br\/>%T Semantic Annotation for Microblog Topics Using Wikipedia Temporal Information<br\/>%X In this paper we study the problem of semantic annotation for a trending hashtag which is the crucial step towards analyzing user behavior in social media, yet has been largely unexplored. We tackle the problem via linking to entities from Wikipedia. We incorporate the social aspects of trending hashtags by identifying prominent entities for the annotation so as to maximize the information spreading in entity networks. We exploit temporal dynamics of entities in Wikipedia, namely Wikipedia edits and page views to improve the annotation quality. Our experiments show that we significantly outperform the established methods in tweet annotation.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Dallmann, A., Lemmerich, F., Zoller, D., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Media Bias in German Online Newspapers<\/span>.<\/span> In: 26th ACM Conference on Hypertext and Social Media. ACM, Cyprus, Turkey, September 1-4 (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-addfd0d84b4347392dc94a4bec400412\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-addfd0d84b4347392dc94a4bec400412\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/addfd0d84b4347392dc94a4bec400412\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-addfd0d84b4347392dc94a4bec400412\"><p>@inproceedings{dallmann2015media,<br\/>  address = {Cyprus, Turkey, September 1-4},<br\/>  author = {Dallmann, Alexander and Lemmerich, Florian and Zoller, Daniel and Hotho, Andreas},<br\/>  booktitle = {26th ACM Conference on Hypertext and Social Media},<br\/>  keywords = {bias},<br\/>  publisher = {ACM},<br\/>  title = {Media Bias in German Online Newspapers},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-addfd0d84b4347392dc94a4bec400412\"><p>%0 Conference Paper<br\/>%1 dallmann2015media<br\/>%A Dallmann, Alexander<br\/>%A Lemmerich, Florian<br\/>%A Zoller, Daniel<br\/>%A Hotho, Andreas<br\/>%B 26th ACM Conference on Hypertext and Social Media<br\/>%C Cyprus, Turkey, September 1-4<br\/>%D 2015<br\/>%I ACM<br\/>%T Media Bias in German Online Newspapers<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Atzmueller, M., Illig, J., Scholz, C., Barrat, A., Cattuto, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists (Poster)}<\/span><\/span>, http:\/\/www.gesis.org\/css-wintersymposium\/program\/poster-sessions-presentations\/, (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.gesis.org\/css-wintersymposium\/program\/poster-sessions-presentations\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-eba4cf7c5221d117285c8395aa10fe73\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-eba4cf7c5221d117285c8395aa10fe73\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/eba4cf7c5221d117285c8395aa10fe73\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-eba4cf7c5221d117285c8395aa10fe73\"><p>@misc{KAISBCS:15p,<br\/>  author = {Kibanov, Mark and Atzmueller, Martin and Illig, Jens and Scholz, Christoph and Barrat, Alain and Cattuto, Ciro and Stumme, Gerd},<br\/>  howpublished = {Computational Social Science Winter Symposium 2015, Poster},<br\/>  keywords = {face-to-face},<br\/>  title = {{Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists (Poster)}},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-eba4cf7c5221d117285c8395aa10fe73\"><p>%0 Generic<br\/>%1 KAISBCS:15p<br\/>%A Kibanov, Mark<br\/>%A Atzmueller, Martin<br\/>%A Illig, Jens<br\/>%A Scholz, Christoph<br\/>%A Barrat, Alain<br\/>%A Cattuto, Ciro<br\/>%A Stumme, Gerd<br\/>%D 2015<br\/>%T {Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists (Poster)}<br\/>%U http:\/\/www.gesis.org\/css-wintersymposium\/program\/poster-sessions-presentations\/<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Kibanov, M., Scholz, C., Mueller, J., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Conferator \u2013 A Ubiquitous System for Enhancing Social Networking at Conferences}<\/span>.<\/span> In: Proc. UIS Workshop (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-uis-atzmueller-conferator-ubiquitous-social-computing.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-95e058c3dd8698e2ec78ea1037b4348e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-95e058c3dd8698e2ec78ea1037b4348e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/95e058c3dd8698e2ec78ea1037b4348e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-95e058c3dd8698e2ec78ea1037b4348e\"><p>@inproceedings{AKSMS:15,<br\/>  author = {Atzmueller, Martin and Kibanov, Mark and Scholz, Christoph and Mueller, Juergen and Stumme, Gerd},<br\/>  booktitle = {Proc. UIS Workshop},<br\/>  keywords = {itegpub},<br\/>  title = {{Conferator \u2013 A Ubiquitous System for Enhancing Social Networking at Conferences}},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-95e058c3dd8698e2ec78ea1037b4348e\"><p>%0 Conference Paper<br\/>%1 AKSMS:15<br\/>%A Atzmueller, Martin<br\/>%A Kibanov, Mark<br\/>%A Scholz, Christoph<br\/>%A Mueller, Juergen<br\/>%A Stumme, Gerd<br\/>%B Proc. UIS Workshop<br\/>%D 2015<br\/>%T {Conferator \u2013 A Ubiquitous System for Enhancing Social Networking at Conferences}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-uis-atzmueller-conferator-ubiquitous-social-computing.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Subgroup Discovery and Community Detection on Attributed Graphs}<\/span><\/span>, https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-asonam15-abstract.pdf, (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-asonam15-abstract.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5dda2ec977a4f35f2a1b89aaec0a181d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5dda2ec977a4f35f2a1b89aaec0a181d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5dda2ec977a4f35f2a1b89aaec0a181d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5dda2ec977a4f35f2a1b89aaec0a181d\"><p>@misc{Atzmueller:15:ASONAM,<br\/>  author = {Atzmueller, Martin},<br\/>  editor = {ASONAM},<br\/>  howpublished = {ASONAM 2015, Tutorial Abstract},<br\/>  keywords = {community},<br\/>  title = {{Subgroup Discovery and Community Detection on Attributed Graphs}},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5dda2ec977a4f35f2a1b89aaec0a181d\"><p>%0 Generic<br\/>%1 Atzmueller:15:ASONAM<br\/>%A Atzmueller, Martin<br\/>%D 2015<br\/>%E ASONAM, <br\/>%T {Subgroup Discovery and Community Detection on Attributed Graphs}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-atzmueller-asonam15-abstract.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">v. Kistowski, J., Nikolas, H., Zoller, D., Kounev, S., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Modeling and Extracting Load Intensity Profiles<\/span>.<\/span> In: Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS) (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f449d3cf35941636f96d72aaf620a275\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f449d3cf35941636f96d72aaf620a275\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f449d3cf35941636f96d72aaf620a275\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-f449d3cf35941636f96d72aaf620a275\">Today\u2019s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly vari- able load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load inten- sity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f449d3cf35941636f96d72aaf620a275\"><p>@inproceedings{vkistowski2015modeling,<br\/>  abstract = {Today\u2019s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly vari- able load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load inten- sity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.},<br\/>  author = {v. Kistowski, J\u00f3akim and Nikolas, Herbst. and Zoller, Daniel and Kounev, Samuel and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)},<br\/>  keywords = {extracting},<br\/>  title = {Modeling and Extracting Load Intensity Profiles},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f449d3cf35941636f96d72aaf620a275\"><p>%0 Conference Paper<br\/>%1 vkistowski2015modeling<br\/>%A v. Kistowski, J\u00f3akim<br\/>%A Nikolas, Herbst.<br\/>%A Zoller, Daniel<br\/>%A Kounev, Samuel<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)<br\/>%D 2015<br\/>%T Modeling and Extracting Load Intensity Profiles<br\/>%X Today\u2019s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly vari- able load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load inten- sity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ring, M., Otto, F., Becker, M., Niebler, T., Landes, D., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">ConDist: A Context-Driven Categorical Distance Measure<\/span>.<\/span> Presented at the (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a2f9d649f2856677e4d886a3b517404d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a2f9d649f2856677e4d886a3b517404d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a2f9d649f2856677e4d886a3b517404d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a2f9d649f2856677e4d886a3b517404d\"><p>@inproceedings{ring2015condist,<br\/>  author = {Ring, Markus and Otto, Florian and Becker, Martin and Niebler, Thomas and Landes, Dieter and Hotho, Andreas},<br\/>  editor = {ECMLPKDD2015},<br\/>  keywords = {categorical},<br\/>  title = {ConDist: A Context-Driven Categorical Distance Measure},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a2f9d649f2856677e4d886a3b517404d\"><p>%0 Conference Paper<br\/>%1 ring2015condist<br\/>%A Ring, Markus<br\/>%A Otto, Florian<br\/>%A Becker, Martin<br\/>%A Niebler, Thomas<br\/>%A Landes, Dieter<br\/>%A Hotho, Andreas<br\/>%D 2015<br\/>%E ECMLPKDD2015, <br\/>%T ConDist: A Context-Driven Categorical Distance Measure<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., J\u00e4schke, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems<\/span>.<\/span> Transactions on Intelligent Systems and Technology. (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e210502ef8b4e022949f592905a4c638\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e210502ef8b4e022949f592905a4c638\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e210502ef8b4e022949f592905a4c638\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e210502ef8b4e022949f592905a4c638\"><p>@article{doerfel2015cores,<br\/>  author = {Doerfel, Stephan and J\u00e4schke, Robert and Stumme, Gerd},<br\/>  journal = {Transactions on Intelligent Systems and Technology},<br\/>  keywords = {benchmark},<br\/>  publisher = {ACM},<br\/>  title = {The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e210502ef8b4e022949f592905a4c638\"><p>%0 Journal Article<br\/>%1 doerfel2015cores<br\/>%A Doerfel, Stephan<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%D 2015<br\/>%I ACM<br\/>%J Transactions on Intelligent Systems and Technology<br\/>%T The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Amin, I., Lee, J.G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Supporting Peat Fire Management using Social Media<\/span><\/span>, (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f23e8c30891e2900a98397e7a59bb7c8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f23e8c30891e2900a98397e7a59bb7c8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f23e8c30891e2900a98397e7a59bb7c8\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-f23e8c30891e2900a98397e7a59bb7c8\">Peat fires and haze originating from such fires cause a large spectrum of ecological, social and economical problems as well as health issues. Indonesia is a country where peat fires are prevalent and the population suffers from the ensuing haze problems. Two Indonesian islands (Sumatra and Kalimantan) are most affected by peat fires. In this abstract, considering the fact that the usage of social media in Indonesia is high (with 72 million accounts in social networks), it is expected that insights generated from social media can help central and local authorities to improve peat fire management. In particular, we focus on peat fires in the year 2014 in Riau Province, which is one of the most haze-affected areas on Sumatra Island.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f23e8c30891e2900a98397e7a59bb7c8\"><p>@misc{kibanov2015supporting,<br\/>  abstract = {Peat fires and haze originating from such fires cause a large spectrum of ecological, social and economical problems as well as health issues. Indonesia is a country where peat fires are prevalent and the population suffers from the ensuing haze problems. Two Indonesian islands (Sumatra and Kalimantan) are most affected by peat fires. In this abstract, considering the fact that the usage of social media in Indonesia is high (with 72 million accounts in social networks), it is expected that insights generated from social media can help central and local authorities to improve peat fire management. In particular, we focus on peat fires in the year 2014 in Riau Province, which is one of the most haze-affected areas on Sumatra Island.},<br\/>  author = {Kibanov, Mark and Amin, Imaduddin and Lee, Jong Gun},<br\/>  howpublished = {Computational Social Science Winter Symposium 2015, Poster},<br\/>  keywords = {itegpub},<br\/>  title = {Supporting Peat Fire Management using Social Media},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f23e8c30891e2900a98397e7a59bb7c8\"><p>%0 Generic<br\/>%1 kibanov2015supporting<br\/>%A Kibanov, Mark<br\/>%A Amin, Imaduddin<br\/>%A Lee, Jong Gun<br\/>%D 2015<br\/>%T Supporting Peat Fire Management using Social Media<br\/>%X Peat fires and haze originating from such fires cause a large spectrum of ecological, social and economical problems as well as health issues. Indonesia is a country where peat fires are prevalent and the population suffers from the ensuing haze problems. Two Indonesian islands (Sumatra and Kalimantan) are most affected by peat fires. In this abstract, considering the fact that the usage of social media in Indonesia is high (with 72 million accounts in social networks), it is expected that insights generated from social media can help central and local authorities to improve peat fire management. In particular, we focus on peat fires in the year 2014 in Riau Province, which is one of the most haze-affected areas on Sumatra Island.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Subgroup Discovery - Advanced Review}<\/span>.<\/span> WIREs: Data Mining and Knowledge Discovery. 5, 35\u201349 (2015). https:\/\/doi.org\/10.1002\/widm.1144.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-subgroup-discovery-advanced-review-wires-2015.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-717e0495131111ba6e9ecd63d55c308c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-717e0495131111ba6e9ecd63d55c308c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1002\/widm.1144\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/717e0495131111ba6e9ecd63d55c308c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-717e0495131111ba6e9ecd63d55c308c\">Subgroup discovery is a broadly applicable descriptive data mining technique for identifying interesting subgroups according to some property of interest. This article summarizes fundamentals of subgroup discovery, before it reviews algorithms and further advanced methodological issues. In addition, we briefly discuss tools and applications of subgroup discovery approaches. In that context, we also discuss experiences and lessons learned and outline future directions in order to show the advantages and benefits of subgroup discovery.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-717e0495131111ba6e9ecd63d55c308c\"><p>@article{Atzmueller:15a,<br\/>  abstract = {Subgroup discovery is a broadly applicable descriptive data mining technique for identifying interesting subgroups according to some property of interest. This article summarizes fundamentals of subgroup discovery, before it reviews algorithms and further advanced methodological issues. In addition, we briefly discuss tools and applications of subgroup discovery approaches. In that context, we also discuss experiences and lessons learned and outline future directions in order to show the advantages and benefits of subgroup discovery.},<br\/>  author = {Atzmueller, Martin},<br\/>  journal = {WIREs: Data Mining and Knowledge Discovery},<br\/>  keywords = {itegpub},<br\/>  number = 1,<br\/>  pages = {35--49},<br\/>  title = {{Subgroup Discovery - Advanced Review}},<br\/>  volume = 5,<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-717e0495131111ba6e9ecd63d55c308c\"><p>%0 Journal Article<br\/>%1 Atzmueller:15a<br\/>%A Atzmueller, Martin<br\/>%D 2015<br\/>%J WIREs: Data Mining and Knowledge Discovery<br\/>%N 1<br\/>%P 35--49<br\/>%R 10.1002\/widm.1144<br\/>%T {Subgroup Discovery - Advanced Review}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-subgroup-discovery-advanced-review-wires-2015.pdf<br\/>%V 5<br\/>%X Subgroup discovery is a broadly applicable descriptive data mining technique for identifying interesting subgroups according to some property of interest. This article summarizes fundamentals of subgroup discovery, before it reviews algorithms and further advanced methodological issues. In addition, we briefly discuss tools and applications of subgroup discovery approaches. In that context, we also discuss experiences and lessons learned and outline future directions in order to show the advantages and benefits of subgroup discovery.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Pujari, S.C., Teka Hadgu, A., Lex, E., J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Social Activity versus Academic Activity: A Case Study of Computer Scientists on Twitter<\/span>.<\/span> In: Proceedings of the 15th International Conference on Knowledge Technologies and Data-driven Business. ACM, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2809563.2809584.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1145\/2809563.2809584\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5fb7f2e8c0f9e5c975b750268c9622f7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5fb7f2e8c0f9e5c975b750268c9622f7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2809563.2809584\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5fb7f2e8c0f9e5c975b750268c9622f7\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5fb7f2e8c0f9e5c975b750268c9622f7\">In this work, we study social and academic network activities of researchers from Computer Science. Using a recently proposed framework, we map the researchers to their Twitter accounts and link them to their publications. This enables us to create two types of networks: first, networks that reflect social activities on Twitter, namely the researchers\u2019 follow, retweet and mention networks and second, networks that reflect academic activities, that is the co-authorship and citation networks. Based on these datasets, we (i) compare the social activities of researchers with their academic activities, (ii) investigate the consistency and similarity of communities within the social and academic activity networks, and (iii) investigate the information flow between different areas of Computer Science in and between both types of networks. Our findings show that if co-authors interact on Twitter, their relationship is reciprocal, increasing with the numbers of papers they co-authored. In general, the social and the academic activities are not correlated. In terms of community analysis, we found that the three social activity networks are most consistent with each other, with the highest consistency between the retweet and mention network. A study of information flow revealed that in the follow network, researchers from Data Management, Human-Computer Interaction, and Artificial Intelligence act as a source of information for other areas in Computer Science.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5fb7f2e8c0f9e5c975b750268c9622f7\"><p>@inproceedings{pujari2015social,<br\/>  abstract = {In this work, we study social and academic network activities of researchers from Computer Science. Using a recently proposed framework, we map the researchers to their Twitter accounts and link them to their publications. This enables us to create two types of networks: first, networks that reflect social activities on Twitter, namely the researchers\u2019 follow, retweet and mention networks and second, networks that reflect academic activities, that is the co-authorship and citation networks. Based on these datasets, we (i) compare the social activities of researchers with their academic activities, (ii) investigate the consistency and similarity of communities within the social and academic activity networks, and (iii) investigate the information flow between different areas of Computer Science in and between both types of networks. Our findings show that if co-authors interact on Twitter, their relationship is reciprocal, increasing with the numbers of papers they co-authored. In general, the social and the academic activities are not correlated. In terms of community analysis, we found that the three social activity networks are most consistent with each other, with the highest consistency between the retweet and mention network. A study of information flow revealed that in the follow network, researchers from Data Management, Human-Computer Interaction, and Artificial Intelligence act as a source of information for other areas in Computer Science.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Pujari, Subhash Chandra and Teka Hadgu, Asmelash and Lex, Elisabeth and J\u00e4schke, Robert},<br\/>  booktitle = {Proceedings of the 15th International Conference on Knowledge Technologies and Data-driven Business},<br\/>  keywords = {network},<br\/>  publisher = {ACM},<br\/>  series = {i-KNOW '15},<br\/>  title = {Social Activity versus Academic Activity: A Case Study of Computer Scientists on Twitter},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5fb7f2e8c0f9e5c975b750268c9622f7\"><p>%0 Conference Paper<br\/>%1 pujari2015social<br\/>%A Pujari, Subhash Chandra<br\/>%A Teka Hadgu, Asmelash<br\/>%A Lex, Elisabeth<br\/>%A J\u00e4schke, Robert<br\/>%B Proceedings of the 15th International Conference on Knowledge Technologies and Data-driven Business<br\/>%C New York, NY, USA<br\/>%D 2015<br\/>%I ACM<br\/>%R 10.1145\/2809563.2809584<br\/>%T Social Activity versus Academic Activity: A Case Study of Computer Scientists on Twitter<br\/>%U http:\/\/dx.doi.org\/10.1145\/2809563.2809584<br\/>%X In this work, we study social and academic network activities of researchers from Computer Science. Using a recently proposed framework, we map the researchers to their Twitter accounts and link them to their publications. This enables us to create two types of networks: first, networks that reflect social activities on Twitter, namely the researchers\u2019 follow, retweet and mention networks and second, networks that reflect academic activities, that is the co-authorship and citation networks. Based on these datasets, we (i) compare the social activities of researchers with their academic activities, (ii) investigate the consistency and similarity of communities within the social and academic activity networks, and (iii) investigate the information flow between different areas of Computer Science in and between both types of networks. Our findings show that if co-authors interact on Twitter, their relationship is reciprocal, increasing with the numbers of papers they co-authored. In general, the social and the academic activities are not correlated. In terms of community analysis, we found that the three social activity networks are most consistent with each other, with the highest consistency between the retweet and mention network. A study of information flow revealed that in the follow network, researchers from Data Management, Human-Computer Interaction, and Artificial Intelligence act as a source of information for other areas in Computer Science.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmidt, A., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The FEE Project: Introduction and First Insights<\/span>.<\/span> In: Proc. UIS Workshop (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-uis-big-data-fee-first-insights.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4c1ca530f76ea4ea2a087eb6963c533e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4c1ca530f76ea4ea2a087eb6963c533e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4c1ca530f76ea4ea2a087eb6963c533e\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4c1ca530f76ea4ea2a087eb6963c533e\"><p>@inproceedings{schmidt2015project,<br\/>  author = {Schmidt, Andreas and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {Proc. UIS Workshop},<br\/>  keywords = {myown},<br\/>  title = {The FEE Project: Introduction and First Insights},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4c1ca530f76ea4ea2a087eb6963c533e\"><p>%0 Conference Paper<br\/>%1 schmidt2015project<br\/>%A Schmidt, Andreas<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B Proc. UIS Workshop<br\/>%D 2015<br\/>%T The FEE Project: Introduction and First Insights<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2015-uis-big-data-fee-first-insights.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Lemmerich, F. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings of the 2015 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2015)}<\/span>.<\/span> CEUR-WS, Porto, Portugal (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1521\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bbc51cf1c0797b337fe49e6c45dcd68b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bbc51cf1c0797b337fe49e6c45dcd68b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bbc51cf1c0797b337fe49e6c45dcd68b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bbc51cf1c0797b337fe49e6c45dcd68b\"><p>@book{AL:15,<br\/>  address = {Porto, Portugal},<br\/>  editor = {Atzmueller, Martin and Lemmerich, Florian},<br\/>  keywords = {itegpub},<br\/>  publisher = {CEUR-WS},<br\/>  title = {{Proceedings of the 2015 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2015)}},<br\/>  volume = 1521,<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bbc51cf1c0797b337fe49e6c45dcd68b\"><p>%0 Book<br\/>%1 AL:15<br\/>%C Porto, Portugal<br\/>%D 2015<br\/>%E Atzmueller, Martin<br\/>%E Lemmerich, Florian<br\/>%I CEUR-WS<br\/>%T {Proceedings of the 2015 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2015)}<br\/>%U http:\/\/ceur-ws.org\/Vol-1521\/<br\/>%V 1521<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Kibanov, M., Hayat, N., Trojahn, M., Kroll, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Adaptive Class Association Rule Mining for Human Activity Recognition}<\/span>.<\/span> In: Proceedings of the International Workshop on Mining Ubiquitous and Social Environments (MUSE2015). , Porto, Portugal (2015).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/muse2015\/papers\/atzmueller.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-990fcc856e9f13eead7858198ceb73b4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-990fcc856e9f13eead7858198ceb73b4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/990fcc856e9f13eead7858198ceb73b4\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-990fcc856e9f13eead7858198ceb73b4\"><p>@inproceedings{AKHTK:15,<br\/>  address = {Porto, Portugal},<br\/>  author = {Atzmueller, Martin and Kibanov, Mark and Hayat, Naveed and Trojahn, Matthias and Kroll, Dennis},<br\/>  booktitle = {Proceedings of the International Workshop on Mining Ubiquitous and Social Environments (MUSE2015)},<br\/>  keywords = {itegpub},<br\/>  title = {{Adaptive Class Association Rule Mining for Human Activity Recognition}},<br\/>  year = 2015<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-990fcc856e9f13eead7858198ceb73b4\"><p>%0 Conference Paper<br\/>%1 AKHTK:15<br\/>%A Atzmueller, Martin<br\/>%A Kibanov, Mark<br\/>%A Hayat, Naveed<br\/>%A Trojahn, Matthias<br\/>%A Kroll, Dennis<br\/>%B Proceedings of the International Workshop on Mining Ubiquitous and Social Environments (MUSE2015)<br\/>%C Porto, Portugal<br\/>%D 2015<br\/>%T {Adaptive Class Association Rule Mining for Human Activity Recognition}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/muse2015\/papers\/atzmueller.pdf<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2014\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2014<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract, Resubmission)}<\/span>.<\/span> In: Proc. LWA 2014 (KDML Special Track). RTWH Aachen University, Aachen, Germany (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-653db2c6705c15c8fd9afe0536982a62\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-653db2c6705c15c8fd9afe0536982a62\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/653db2c6705c15c8fd9afe0536982a62\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-653db2c6705c15c8fd9afe0536982a62\"><p>@inproceedings{SIAS:14b,<br\/>  address = {Aachen, Germany},<br\/>  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {Proc. LWA 2014 (KDML Special Track)},<br\/>  keywords = {itegpub},<br\/>  publisher = {RTWH Aachen University},<br\/>  title = {{On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract, Resubmission)}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-653db2c6705c15c8fd9afe0536982a62\"><p>%0 Conference Paper<br\/>%1 SIAS:14b<br\/>%A Scholz, Christoph<br\/>%A Illig, Jens<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B Proc. LWA 2014 (KDML Special Track)<br\/>%C Aachen, Germany<br\/>%D 2014<br\/>%I RTWH Aachen University<br\/>%T {On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract, Resubmission)}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hernandez, N., J\u00e4schke, R., Croitoru, M. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Graph-Based Representation and Reasoning<\/span>.<\/span> Springer (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.springer.com\/computer\/ai\/book\/978-3-319-08388-9\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-134aef15011f07b63ab3fb30965d099a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-134aef15011f07b63ab3fb30965d099a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/134aef15011f07b63ab3fb30965d099a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-134aef15011f07b63ab3fb30965d099a\">This book constitutes the proceedings of the 21st International Conference on Conceptual Structures, ICCS 2014, held in Ia\u015fi, Romania, in July 2014. The 17 regular papers and 6 short papers presented in this volume were carefully reviewed and selected from 40 and 10 submissions, respectively. The topics covered are: conceptual structures, knowledge representation, reasoning, conceptual graphs, formal concept analysis, semantic Web, information integration, machine learning, data mining and information retrieval.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-134aef15011f07b63ab3fb30965d099a\"><p>@proceedings{hernandez2014graphbased,<br\/>  abstract = {This book constitutes the proceedings of the 21st International Conference on Conceptual Structures, ICCS 2014, held in Ia\u015fi, Romania, in July 2014. The 17 regular papers and 6 short papers presented in this volume were carefully reviewed and selected from 40 and 10 submissions, respectively. The topics covered are: conceptual structures, knowledge representation, reasoning, conceptual graphs, formal concept analysis, semantic Web, information integration, machine learning, data mining and information retrieval.},<br\/>  editor = {Hernandez, Nathalie and J\u00e4schke, Robert and Croitoru, Madalina},<br\/>  keywords = {proceedings},<br\/>  month = {06},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Graph-Based Representation and Reasoning},<br\/>  volume = 8577,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-134aef15011f07b63ab3fb30965d099a\"><p>%0 Conference Proceedings<br\/>%1 hernandez2014graphbased<br\/>%B Lecture Notes in Computer Science<br\/>%D 2014<br\/>%E Hernandez, Nathalie<br\/>%E J\u00e4schke, Robert<br\/>%E Croitoru, Madalina<br\/>%I Springer<br\/>%T Graph-Based Representation and Reasoning<br\/>%U http:\/\/www.springer.com\/computer\/ai\/book\/978-3-319-08388-9<br\/>%V 8577<br\/>%X This book constitutes the proceedings of the 21st International Conference on Conceptual Structures, ICCS 2014, held in Ia\u015fi, Romania, in July 2014. The 17 regular papers and 6 short papers presented in this volume were carefully reviewed and selected from 40 and 10 submissions, respectively. The topics covered are: conceptual structures, knowledge representation, reasoning, conceptual graphs, formal concept analysis, semantic Web, information integration, machine learning, data mining and information retrieval.<br\/>%@ 978-3-319-08388-9<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On the Predictability of Talk Attendance at Academic Conferences<\/span>.<\/span> In: Proceedings of the 25th ACM Conference on Hypertext and Social Media. pp. 279\u2013284. ACM, Santiago, Chile (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f5867be917f2a45f4b6d6e3fc842369a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f5867be917f2a45f4b6d6e3fc842369a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f5867be917f2a45f4b6d6e3fc842369a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-f5867be917f2a45f4b6d6e3fc842369a\">This paper focuses on the prediction of real-world talk attendances at academic conferences with respect to different influence factors. We study and discuss the predictability of talk attendances using real-world face-to-face contact data and user interests extracted from the users' previous publications. For our experiments, we apply RFID-tracked talk attendance information captured at the ACM Conference on Hypertext and Hypermedia 2011. We find that contact and similarity networks achieve comparable results, and that combining these networks helps to a limited extent to improve the prediction quality.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f5867be917f2a45f4b6d6e3fc842369a\"><p>@inproceedings{scholz2014predictability,<br\/>  abstract = {This paper focuses on the prediction of real-world talk attendances at academic conferences with respect to different influence factors. We study and discuss the predictability of talk attendances using real-world face-to-face contact data and user interests extracted from the users' previous publications. For our experiments, we apply RFID-tracked talk attendance information captured at the ACM Conference on Hypertext and Hypermedia 2011. We find that contact and similarity networks achieve comparable results, and that combining these networks helps to a limited extent to improve the prediction quality.},<br\/>  address = {Santiago, Chile},<br\/>  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 25th ACM Conference on Hypertext and Social Media},<br\/>  keywords = {chile},<br\/>  month = {09},<br\/>  pages = {279--284},<br\/>  publisher = {ACM},<br\/>  series = {HT '14},<br\/>  title = {On the Predictability of Talk Attendance at Academic Conferences},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f5867be917f2a45f4b6d6e3fc842369a\"><p>%0 Conference Paper<br\/>%1 scholz2014predictability<br\/>%A Scholz, Christoph<br\/>%A Illig, Jens<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 25th ACM Conference on Hypertext and Social Media<br\/>%C Santiago, Chile<br\/>%D 2014<br\/>%I ACM<br\/>%P 279--284<br\/>%T On the Predictability of Talk Attendance at Academic Conferences<br\/>%X This paper focuses on the prediction of real-world talk attendances at academic conferences with respect to different influence factors. We study and discuss the predictability of talk attendances using real-world face-to-face contact data and user interests extracted from the users' previous publications. For our experiments, we apply RFID-tracked talk attendance information captured at the ACM Conference on Hypertext and Hypermedia 2011. We find that contact and similarity networks achieve comparable results, and that combining these networks helps to a limited extent to improve the prediction quality.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cantador, I., Chi, M., Farzan, R., J\u00e4schke, R. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">UMAP 2014 Extended Proceedings<\/span>.<\/span> CEUR-WS (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1181\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0569bdc5b5a0e1a080c3b05bc8ede186\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0569bdc5b5a0e1a080c3b05bc8ede186\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0569bdc5b5a0e1a080c3b05bc8ede186\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-0569bdc5b5a0e1a080c3b05bc8ede186\">The workshops at the 22nd conference on User Modeling, Adaptation and Personalization cover broad and exciting topics related to ongoing research in the field. The workshops bring together researchers from a large number of academic institutions across the United States and Europe. Forty three papers at six workshops at UMAP 2014 highlight the impact of different factors such as human factors and emotions on user modeling. At the same time, the workshops attempt to discuss new challenges in the field such as news recommendation in the age of social media, student modeling in the context of MOOCs and gamified learning environments, and personalization in citizen-participatory e-government services and multilingual information systems.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0569bdc5b5a0e1a080c3b05bc8ede186\"><p>@proceedings{cantador2014umap,<br\/>  abstract = {The workshops at the 22nd conference on User Modeling, Adaptation and Personalization cover broad and exciting topics related to ongoing research in the field. The workshops bring together researchers from a large number of academic institutions across the United States and Europe. Forty three papers at six workshops at UMAP 2014 highlight the impact of different factors such as human factors and emotions on user modeling. At the same time, the workshops attempt to discuss new challenges in the field such as news recommendation in the age of social media, student modeling in the context of MOOCs and gamified learning environments, and personalization in citizen-participatory e-government services and multilingual information systems.},<br\/>  editor = {Cantador, Iv\u00e1n and Chi, Min and Farzan, Rosta and J\u00e4schke, Robert},<br\/>  keywords = 2014,<br\/>  month = {07},<br\/>  publisher = {CEUR-WS},<br\/>  title = {UMAP 2014 Extended Proceedings},<br\/>  volume = 1181,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0569bdc5b5a0e1a080c3b05bc8ede186\"><p>%0 Conference Proceedings<br\/>%1 cantador2014umap<br\/>%D 2014<br\/>%E Cantador, Iv\u00e1n<br\/>%E Chi, Min<br\/>%E Farzan, Rosta<br\/>%E J\u00e4schke, Robert<br\/>%I CEUR-WS<br\/>%T UMAP 2014 Extended Proceedings<br\/>%U http:\/\/ceur-ws.org\/Vol-1181<br\/>%V 1181<br\/>%X The workshops at the 22nd conference on User Modeling, Adaptation and Personalization cover broad and exciting topics related to ongoing research in the field. The workshops bring together researchers from a large number of academic institutions across the United States and Europe. Forty three papers at six workshops at UMAP 2014 highlight the impact of different factors such as human factors and emotions on user modeling. At the same time, the workshops attempt to discuss new challenges in the field such as news recommendation in the age of social media, student modeling in the context of MOOCs and gamified learning environments, and personalization in citizen-participatory e-government services and multilingual information systems.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Data Mining on Social Interaction Networks}<\/span>.<\/span> Journal of Data Mining and Digital Humanities. 1, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/jdmdh.episciences.org\/11\/pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0d8bbb3b6d9b908c59d17cacbcf98c14\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0d8bbb3b6d9b908c59d17cacbcf98c14\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0d8bbb3b6d9b908c59d17cacbcf98c14\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0d8bbb3b6d9b908c59d17cacbcf98c14\"><p>@article{Atzmueller:14:CoRR,<br\/>  author = {Atzmueller, Martin},<br\/>  journal = {Journal of Data Mining and Digital Humanities},<br\/>  keywords = {conferator},<br\/>  month = {06},<br\/>  title = {{Data Mining on Social Interaction Networks}},<br\/>  volume = 1,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0d8bbb3b6d9b908c59d17cacbcf98c14\"><p>%0 Journal Article<br\/>%1 Atzmueller:14:CoRR<br\/>%A Atzmueller, Martin<br\/>%D 2014<br\/>%J Journal of Data Mining and Digital Humanities<br\/>%T {Data Mining on Social Interaction Networks}<br\/>%U https:\/\/jdmdh.episciences.org\/11\/pdf<br\/>%V 1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bl\u00fcmel, I., Dietze, S., Heller, L., J\u00e4schke, R., Mehlberg, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Quest for Research Information<\/span>.<\/span> In: Proceedings of the 12th International Conference on Current Research Information Systems. euroCRIS (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/hdl.handle.net\/123456789\/194\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fde786bccb41fdeb3a65e339cc0314b5\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fde786bccb41fdeb3a65e339cc0314b5\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fde786bccb41fdeb3a65e339cc0314b5\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-fde786bccb41fdeb3a65e339cc0314b5\">Research information, i.e., data about research projects, organisations, researchers or research outputs such as publications or patents, is spread across the web, usually residing on institutional and personal web pages or in semi-open databases and information systems. While there exists a wealth of unstructured information, the limited amounts of structured data often are exposed following proprietary or less-established schemas and interfaces. Therefore, a holistic view on research information across organisational and national boundaries is not feasible and information is inconsistent and incomplete. On the other hand, web crawling and information extraction techniques have matured throughout the last decade, allowing for automated approaches of harvesting, extracting and consolidating research information into a more coherent knowledge graph. In particular the Linked Data community has provided a range of techniques, schemas and vocabularies which allow to represent and interlink research information in a more coherent manner. In this work, we give an overview of the current state of the art in research information sharing on the web and present initial ideas towards a more holistic approach for boot-strapping research information from available web sources.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fde786bccb41fdeb3a65e339cc0314b5\"><p>@inproceedings{bluemel2014quest,<br\/>  abstract = {Research information, i.e., data about research projects, organisations, researchers or research outputs such as publications or patents, is spread across the web, usually residing on institutional and personal web pages or in semi-open databases and information systems. While there exists a wealth of unstructured information, the limited amounts of structured data often are exposed following proprietary or less-established schemas and interfaces. Therefore, a holistic view on research information across organisational and national boundaries is not feasible and information is inconsistent and incomplete. On the other hand, web crawling and information extraction techniques have matured throughout the last decade, allowing for automated approaches of harvesting, extracting and consolidating research information into a more coherent knowledge graph. In particular the Linked Data community has provided a range of techniques, schemas and vocabularies which allow to represent and interlink research information in a more coherent manner. In this work, we give an overview of the current state of the art in research information sharing on the web and present initial ideas towards a more holistic approach for boot-strapping research information from available web sources.},<br\/>  author = {Bl\u00fcmel, Ina and Dietze, Stefan and Heller, Lambert and J\u00e4schke, Robert and Mehlberg, Martin},<br\/>  booktitle = {Proceedings of the 12th International Conference on Current Research Information Systems},<br\/>  keywords = {research},<br\/>  month = {05},<br\/>  organization = {euroCRIS},<br\/>  title = {The Quest for Research Information},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fde786bccb41fdeb3a65e339cc0314b5\"><p>%0 Conference Paper<br\/>%1 bluemel2014quest<br\/>%A Bl\u00fcmel, Ina<br\/>%A Dietze, Stefan<br\/>%A Heller, Lambert<br\/>%A J\u00e4schke, Robert<br\/>%A Mehlberg, Martin<br\/>%B Proceedings of the 12th International Conference on Current Research Information Systems<br\/>%D 2014<br\/>%T The Quest for Research Information<br\/>%U http:\/\/hdl.handle.net\/123456789\/194<br\/>%X Research information, i.e., data about research projects, organisations, researchers or research outputs such as publications or patents, is spread across the web, usually residing on institutional and personal web pages or in semi-open databases and information systems. While there exists a wealth of unstructured information, the limited amounts of structured data often are exposed following proprietary or less-established schemas and interfaces. Therefore, a holistic view on research information across organisational and national boundaries is not feasible and information is inconsistent and incomplete. On the other hand, web crawling and information extraction techniques have matured throughout the last decade, allowing for automated approaches of harvesting, extracting and consolidating research information into a more coherent knowledge graph. In particular the Linked Data community has provided a range of techniques, schemas and vocabularies which allow to represent and interlink research information in a more coherent manner. In this work, we give an overview of the current state of the art in research information sharing on the web and present initial ideas towards a more holistic approach for boot-strapping research information from available web sources.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Illig, J., Roth, B., Klakow, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Unsupervised Parsing for Generating Surface-Based Relation Extraction Patterns<\/span>.<\/span> In: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, volume 2: Short Papers. pp. 100\u2013105. Association for Computational Linguistics, Gothenburg, Sweden (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.aclweb.org\/anthology\/E14-4020\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cb0cb9a81fa67c1d4cad716f5e9d518f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cb0cb9a81fa67c1d4cad716f5e9d518f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cb0cb9a81fa67c1d4cad716f5e9d518f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-cb0cb9a81fa67c1d4cad716f5e9d518f\">Finding the right features and patterns for identifying relations in natural language is one of the most pressing research questions for relation extraction. In this paper, we compare patterns based on supervised and unsupervised syntactic parsing and present a simple method for extracting surface patterns from a parsed training set. Results show that the use of surface-based patterns not only increases extraction speed, but also improves the quality of the extracted relations. We find that, in this setting, unsupervised parsing, besides requiring less resources, compares favorably in terms of extraction quality.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cb0cb9a81fa67c1d4cad716f5e9d518f\"><p>@inproceedings{illig-roth-klakow:2014:EACL2014-SP,<br\/>  abstract = {Finding the right features and patterns for identifying relations in natural language is one of the most pressing research questions for relation extraction. In this paper, we compare patterns based on supervised and unsupervised syntactic parsing and present a simple method for extracting surface patterns from a parsed training set. Results show that the use of surface-based patterns not only increases extraction speed, but also improves the quality of the extracted relations. We find that, in this setting, unsupervised parsing, besides requiring less resources, compares favorably in terms of extraction quality.},<br\/>  address = {Gothenburg, Sweden},<br\/>  author = {Illig, Jens and Roth, Benjamin and Klakow, Dietrich},<br\/>  booktitle = {Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, volume 2: Short Papers},<br\/>  crossref = {EACL2014-SP:2014},<br\/>  keywords = {extraction},<br\/>  month = {04},<br\/>  pages = {100--105},<br\/>  publisher = {Association for Computational Linguistics},<br\/>  title = {Unsupervised Parsing for Generating Surface-Based Relation Extraction Patterns},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cb0cb9a81fa67c1d4cad716f5e9d518f\"><p>%0 Conference Paper<br\/>%1 illig-roth-klakow:2014:EACL2014-SP<br\/>%A Illig, Jens<br\/>%A Roth, Benjamin<br\/>%A Klakow, Dietrich<br\/>%B Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, volume 2: Short Papers<br\/>%C Gothenburg, Sweden<br\/>%D 2014<br\/>%I Association for Computational Linguistics<br\/>%P 100--105<br\/>%T Unsupervised Parsing for Generating Surface-Based Relation Extraction Patterns<br\/>%U http:\/\/www.aclweb.org\/anthology\/E14-4020<br\/>%X Finding the right features and patterns for identifying relations in natural language is one of the most pressing research questions for relation extraction. In this paper, we compare patterns based on supervised and unsupervised syntactic parsing and present a simple method for extracting surface patterns from a parsed training set. Results show that the use of surface-based patterns not only increases extraction speed, but also improves the quality of the extracted relations. We find that, in this setting, unsupervised parsing, besides requiring less resources, compares favorably in terms of extraction quality.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Becker, M., Kibanov, M., Scholz, C., Doerfel, S., Hotho, A., Macek, B.-E., Mitzlaff, F., Mueller, J., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ubicon and its Applications for Ubiquitous Social Computing<\/span>.<\/span> New Review of Hypermedia and Multimedia. 1, 53\u201377 (2014). https:\/\/doi.org\/10.1080\/13614568.2013.873488.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1080\/13614568.2013.873488\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d38f1e01e735253b4cad2c98c1027659\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d38f1e01e735253b4cad2c98c1027659\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1080\/13614568.2013.873488\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d38f1e01e735253b4cad2c98c1027659\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-d38f1e01e735253b4cad2c98c1027659\">The combination of ubiquitous and social computing is an emerging research area which integrates different but complementary methods, techniques and tools. In this paper, we focus on the Ubicon platform, its applications, and a large spectrum of analysis results. Ubicon provides an extensible framework for building and hosting applications targeting both ubiquitous and social environments. We summarize the architecture and exemplify its implementation using four real-world applications built on top of Ubicon. In addition, we discuss several scientific experiments in the context of these applications in order to give a better picture of the potential of the framework, and discuss analysis results using several real-world data sets collected utilizing Ubicon.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d38f1e01e735253b4cad2c98c1027659\"><p>@article{mueller-2014b,<br\/>  abstract = {The combination of ubiquitous and social computing is an emerging research area which integrates different but complementary methods, techniques and tools. In this paper, we focus on the Ubicon platform, its applications, and a large spectrum of analysis results. Ubicon provides an extensible framework for building and hosting applications targeting both ubiquitous and social environments. We summarize the architecture and exemplify its implementation using four real-world applications built on top of Ubicon. In addition, we discuss several scientific experiments in the context of these applications in order to give a better picture of the potential of the framework, and discuss analysis results using several real-world data sets collected utilizing Ubicon.},<br\/>  author = {Atzmueller, Martin and Becker, Martin and Kibanov, Mark and Scholz, Christoph and Doerfel, Stephan and Hotho, Andreas and Macek, Bjoern-Elmar and Mitzlaff, Folke and Mueller, Juergen and Stumme, Gerd},<br\/>  journal = {New Review of Hypermedia and Multimedia},<br\/>  keywords = {applications},<br\/>  month = {03},<br\/>  number = 20,<br\/>  pages = {53--77},<br\/>  title = {Ubicon and its Applications for Ubiquitous Social Computing},<br\/>  volume = 1,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d38f1e01e735253b4cad2c98c1027659\"><p>%0 Journal Article<br\/>%1 mueller-2014b<br\/>%A Atzmueller, Martin<br\/>%A Becker, Martin<br\/>%A Kibanov, Mark<br\/>%A Scholz, Christoph<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%A Macek, Bjoern-Elmar<br\/>%A Mitzlaff, Folke<br\/>%A Mueller, Juergen<br\/>%A Stumme, Gerd<br\/>%D 2014<br\/>%J New Review of Hypermedia and Multimedia<br\/>%N 20<br\/>%P 53--77<br\/>%R 10.1080\/13614568.2013.873488<br\/>%T Ubicon and its Applications for Ubiquitous Social Computing<br\/>%U http:\/\/dx.doi.org\/10.1080\/13614568.2013.873488<br\/>%V 1<br\/>%X The combination of ubiquitous and social computing is an emerging research area which integrates different but complementary methods, techniques and tools. In this paper, we focus on the Ubicon platform, its applications, and a large spectrum of analysis results. Ubicon provides an extensible framework for building and hosting applications targeting both ubiquitous and social environments. We summarize the architecture and exemplify its implementation using four real-world applications built on top of Ubicon. In addition, we discuss several scientific experiments in the context of these applications in order to give a better picture of the potential of the framework, and discuss analysis results using several real-world data sets collected utilizing Ubicon.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Temporal Evolution of Contacts and Communities in Networks of Face-to-Face Human Interactions}<\/span>.<\/span> Science China. 57, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ea0f450249503499c0c553a2d51505cb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ea0f450249503499c0c553a2d51505cb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ea0f450249503499c0c553a2d51505cb\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ea0f450249503499c0c553a2d51505cb\"><p>@article{KASS:14,<br\/>  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},<br\/>  journal = {Science China},<br\/>  keywords = {itegpub},<br\/>  month = {03},<br\/>  title = {{Temporal Evolution of Contacts and Communities in Networks of Face-to-Face Human Interactions}},<br\/>  volume = 57,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ea0f450249503499c0c553a2d51505cb\"><p>%0 Journal Article<br\/>%1 KASS:14<br\/>%A Kibanov, Mark<br\/>%A Atzmueller, Martin<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%D 2014<br\/>%J Science China<br\/>%T {Temporal Evolution of Contacts and Communities in Networks of Face-to-Face Human Interactions}<br\/>%V 57<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., Hotho, A., J\u00e4schke, R., Mitzlaff, F., Mueller, J. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the ECML PKDD Discovery Challenge 2013 - Recommending Given Names<\/span>.<\/span> (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1120\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bff41e8c2de86acd287c96a4cdef5e6e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bff41e8c2de86acd287c96a4cdef5e6e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bff41e8c2de86acd287c96a4cdef5e6e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bff41e8c2de86acd287c96a4cdef5e6e\"><p>@proceedings{doerfel2014discovery,<br\/>  editor = {Doerfel, Stephan and Hotho, Andreas and J\u00e4schke, Robert and Mitzlaff, Folke and Mueller, Juergen},<br\/>  keywords = {20dc13},<br\/>  month = {01},<br\/>  series = {CEUR-WS.org},<br\/>  title = {Proceedings of the ECML PKDD Discovery Challenge 2013 - Recommending Given Names},<br\/>  volume = 1120,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bff41e8c2de86acd287c96a4cdef5e6e\"><p>%0 Conference Proceedings<br\/>%1 doerfel2014discovery<br\/>%B CEUR-WS.org<br\/>%D 2014<br\/>%E Doerfel, Stephan<br\/>%E Hotho, Andreas<br\/>%E J\u00e4schke, Robert<br\/>%E Mitzlaff, Folke<br\/>%E Mueller, Juergen<br\/>%T Proceedings of the ECML PKDD Discovery Challenge 2013 - Recommending Given Names<br\/>%U http:\/\/ceur-ws.org\/Vol-1120\/<br\/>%V 1120<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Baraki, H., Behrenbruch, K., Comes, D., Evers, C., Hoffmann, A., Hoffmann, H., Jandt, S., Kibanov, M., Kieselmann, O., Kniewel, R., K\u00f6nig, I., Macek, B.-E., Niemczyk, S., Scholz, C., Schuldt, M., Schulz, T., Skistims, H., S\u00f6llner, M., Voigtmann, C., Witsch, A., Zirfas, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Die VENUS-Entwicklungsmethode: Eine interdisziplin\u00e4re Methode f\u00fcr soziotechnische Softwaregestaltung}<\/span>.<\/span> Research Center for Information System Design (ITeG), University of Kassel (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7f9827692b63182c72cbce6a83713f01\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7f9827692b63182c72cbce6a83713f01\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7f9827692b63182c72cbce6a83713f01\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7f9827692b63182c72cbce6a83713f01\"><p>@techreport{Atzmueller:VENUSEntwicklungsmethode:2014,<br\/>  author = {Atzmueller, Martin and Baraki, Harun and Behrenbruch, Kay and Comes, Diana and Evers, Christoph and Hoffmann, Axel and Hoffmann, Holger and Jandt, Silke and Kibanov, Mark and Kieselmann, Olga and Kniewel, Romy and K\u00f6nig, Immanuel and Macek, Bj\u00f6rn-Elmar and Niemczyk, Stefan and Scholz, Christoph and Schuldt, Michaela and Schulz, Thomas and Skistims, Hendrik and S\u00f6llner, Matthias and Voigtmann, Christian and Witsch, Andreas and Zirfas, Julia},<br\/>  editor = {Hoffmann, Axel and Niemczyk, Stefan},<br\/>  institution = {Research Center for Information System Design (ITeG), University of Kassel},<br\/>  keywords = {itegpub},<br\/>  title = {{Die VENUS-Entwicklungsmethode: Eine interdisziplin\u00e4re Methode f\u00fcr soziotechnische Softwaregestaltung}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7f9827692b63182c72cbce6a83713f01\"><p>%0 Report<br\/>%1 Atzmueller:VENUSEntwicklungsmethode:2014<br\/>%A Atzmueller, Martin<br\/>%A Baraki, Harun<br\/>%A Behrenbruch, Kay<br\/>%A Comes, Diana<br\/>%A Evers, Christoph<br\/>%A Hoffmann, Axel<br\/>%A Hoffmann, Holger<br\/>%A Jandt, Silke<br\/>%A Kibanov, Mark<br\/>%A Kieselmann, Olga<br\/>%A Kniewel, Romy<br\/>%A K\u00f6nig, Immanuel<br\/>%A Macek, Bj\u00f6rn-Elmar<br\/>%A Niemczyk, Stefan<br\/>%A Scholz, Christoph<br\/>%A Schuldt, Michaela<br\/>%A Schulz, Thomas<br\/>%A Skistims, Hendrik<br\/>%A S\u00f6llner, Matthias<br\/>%A Voigtmann, Christian<br\/>%A Witsch, Andreas<br\/>%A Zirfas, Julia<br\/>%D 2014<br\/>%E Hoffmann, Axel<br\/>%E Niemczyk, Stefan<br\/>%T {Die VENUS-Entwicklungsmethode: Eine interdisziplin\u00e4re Methode f\u00fcr soziotechnische Softwaregestaltung}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hadgu, A.T., J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Identifying and Analyzing Researchers on Twitter<\/span>.<\/span> In: Proceedings of the 2014 ACM Conference on Web Science. pp. 23\u201330. ACM, Bloomington, Indiana, USA (2014). https:\/\/doi.org\/10.1145\/2615569.2615676.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2615569.2615676\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-49a48ba3731d4405ed5b570c1cc2180d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-49a48ba3731d4405ed5b570c1cc2180d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2615569.2615676\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/49a48ba3731d4405ed5b570c1cc2180d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-49a48ba3731d4405ed5b570c1cc2180d\">For millions of users Twitter is an important communication platform, a social network, and a system for resource sharing. Likewise, scientists use Twitter to connect with other researchers, announce calls for papers, or share their thoughts. Filtering tweets, discovering other researchers, or finding relevant information on a topic of interest, however, is difficult since no directory of researchers on Twitter exists. In this paper we present an approach to identify Twitter accounts of researchers and demonstrate its utility for the discipline of computer science. Based on a seed set of computer science conferences we collect relevant Twitter users which we can partially map to ground-truth data. The mapping is leveraged to learn a model for classifying the remaining. To gain first insights into how researchers use Twitter, we empirically analyze the identified users and compare their age, popularity, influence, and social network.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-49a48ba3731d4405ed5b570c1cc2180d\"><p>@inproceedings{hadgu2014identifying,<br\/>  abstract = {For millions of users Twitter is an important communication platform, a social network, and a system for resource sharing. Likewise, scientists use Twitter to connect with other researchers, announce calls for papers, or share their thoughts. Filtering tweets, discovering other researchers, or finding relevant information on a topic of interest, however, is difficult since no directory of researchers on Twitter exists. In this paper we present an approach to identify Twitter accounts of researchers and demonstrate its utility for the discipline of computer science. Based on a seed set of computer science conferences we collect relevant Twitter users which we can partially map to ground-truth data. The mapping is leveraged to learn a model for classifying the remaining. To gain first insights into how researchers use Twitter, we empirically analyze the identified users and compare their age, popularity, influence, and social network.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Hadgu, Asmelash Teka and J\u00e4schke, Robert},<br\/>  booktitle = {Proceedings of the 2014 ACM Conference on Web Science},<br\/>  keywords = {research},<br\/>  pages = {23--30},<br\/>  publisher = {ACM},<br\/>  series = {WebSci '14},<br\/>  title = {Identifying and Analyzing Researchers on Twitter},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-49a48ba3731d4405ed5b570c1cc2180d\"><p>%0 Conference Paper<br\/>%1 hadgu2014identifying<br\/>%A Hadgu, Asmelash Teka<br\/>%A J\u00e4schke, Robert<br\/>%B Proceedings of the 2014 ACM Conference on Web Science<br\/>%C New York, NY, USA<br\/>%D 2014<br\/>%I ACM<br\/>%P 23--30<br\/>%R 10.1145\/2615569.2615676<br\/>%T Identifying and Analyzing Researchers on Twitter<br\/>%U http:\/\/doi.acm.org\/10.1145\/2615569.2615676<br\/>%X For millions of users Twitter is an important communication platform, a social network, and a system for resource sharing. Likewise, scientists use Twitter to connect with other researchers, announce calls for papers, or share their thoughts. Filtering tweets, discovering other researchers, or finding relevant information on a topic of interest, however, is difficult since no directory of researchers on Twitter exists. In this paper we present an approach to identify Twitter accounts of researchers and demonstrate its utility for the discipline of computer science. Based on a seed set of computer science conferences we collect relevant Twitter users which we can partially map to ground-truth data. The mapping is leveraged to learn a model for classifying the remaining. To gain first insights into how researchers use Twitter, we empirically analyze the identified users and compare their age, popularity, influence, and social network.<br\/>%@ 978-1-4503-2622-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Doerfel, S., Hotho, A., J\u00e4schke, R., Mueller, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Summary of the 15th Discovery Challenge: Recommending Given Names<\/span>.<\/span> In: 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. pp. 7\u201324. CEUR-WS, Aachen, Germany (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1120\/paper1.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e279965dffa803ee660e4026fe48340a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e279965dffa803ee660e4026fe48340a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e279965dffa803ee660e4026fe48340a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-e279965dffa803ee660e4026fe48340a\">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.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e279965dffa803ee660e4026fe48340a\"><p>@inproceedings{mueller-2014a,<br\/>  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.},<br\/>  address = {Aachen, Germany},<br\/>  author = {Mitzlaff, Folke and Doerfel, Stephan and Hotho, Andreas and J\u00e4schke, Robert and Mueller, Juergen},<br\/>  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},<br\/>  keywords = {LUH},<br\/>  pages = {7--24},<br\/>  publisher = {CEUR-WS},<br\/>  title = {Summary of the 15th Discovery Challenge: Recommending Given Names},<br\/>  volume = 1120,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e279965dffa803ee660e4026fe48340a\"><p>%0 Conference Paper<br\/>%1 mueller-2014a<br\/>%A Mitzlaff, Folke<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Mueller, Juergen<br\/>%B 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<br\/>%C Aachen, Germany<br\/>%D 2014<br\/>%I CEUR-WS<br\/>%P 7--24<br\/>%T Summary of the 15th Discovery Challenge: Recommending Given Names<br\/>%U http:\/\/ceur-ws.org\/Vol-1120\/paper1.pdf<br\/>%V 1120<br\/>%X 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.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Macek, B.-E., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Predicting the Stability of User Interaction Ties in Twitter}<\/span>.<\/span> In: Proc. I-KNOW 2014. ACM Press, New York, NY, USA (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-31db01fb44ac44837ab09dc7d5257dc4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-31db01fb44ac44837ab09dc7d5257dc4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/31db01fb44ac44837ab09dc7d5257dc4\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-31db01fb44ac44837ab09dc7d5257dc4\"><p>@inproceedings{MAS:14,<br\/>  address = {New York, NY, USA},<br\/>  author = {Macek, Bjoern-Elmar and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {Proc. I-KNOW 2014},<br\/>  keywords = {myown},<br\/>  publisher = {ACM Press},<br\/>  title = {{Predicting the Stability of User Interaction Ties in Twitter}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-31db01fb44ac44837ab09dc7d5257dc4\"><p>%0 Conference Paper<br\/>%1 MAS:14<br\/>%A Macek, Bjoern-Elmar<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B Proc. I-KNOW 2014<br\/>%C New York, NY, USA<br\/>%D 2014<br\/>%I ACM Press<br\/>%T {Predicting the Stability of User Interaction Ties in Twitter}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Jannach, D., Freyne, J., Geyer, W., Guy, I., Hotho, A., Mobasher, B.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The sixth {ACM} RecSys workshop on recommender systems and the social web<\/span>.<\/span> In: Eighth {ACM} Conference on Recommender Systems, RecSys \u201914, Foster City, Silicon Valley, CA, {USA} - October 06 - 10, 2014. p. 395 (2014). https:\/\/doi.org\/10.1145\/2645710.2645786.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2645710.2645786\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5773f799bec72240eda5e6cfb6a03d7b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5773f799bec72240eda5e6cfb6a03d7b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2645710.2645786\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5773f799bec72240eda5e6cfb6a03d7b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5773f799bec72240eda5e6cfb6a03d7b\"><p>@inproceedings{jannach2014sixth,<br\/>  author = {Jannach, Dietmar and Freyne, Jill and Geyer, Werner and Guy, Ido and Hotho, Andreas and Mobasher, Bamshad},<br\/>  booktitle = {Eighth {ACM} Conference on Recommender Systems, RecSys '14, Foster City, Silicon Valley, CA, {USA} - October 06 - 10, 2014},<br\/>  keywords = {introduction},<br\/>  pages = 395,<br\/>  title = {The sixth {ACM} RecSys workshop on recommender systems and the social web},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5773f799bec72240eda5e6cfb6a03d7b\"><p>%0 Conference Paper<br\/>%1 jannach2014sixth<br\/>%A Jannach, Dietmar<br\/>%A Freyne, Jill<br\/>%A Geyer, Werner<br\/>%A Guy, Ido<br\/>%A Hotho, Andreas<br\/>%A Mobasher, Bamshad<br\/>%B Eighth {ACM} Conference on Recommender Systems, RecSys '14, Foster City, Silicon Valley, CA, {USA} - October 06 - 10, 2014<br\/>%D 2014<br\/>%P 395<br\/>%R 10.1145\/2645710.2645786<br\/>%T The sixth {ACM} RecSys workshop on recommender systems and the social web<br\/>%U http:\/\/doi.acm.org\/10.1145\/2645710.2645786<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cellier, P., Charnois, T., Hotho, A., Matwin, S., Moens, M.- }Francine, Toussaint, Y. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the 1st International Workshop on Interactions between Data Mining and Natural Language Processing co-located with The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, DMNLP@PKDD\/ECML 2014, Nancy, France, September 15, 2014<\/span>.<\/span> CEUR-WS.org (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1202\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cfb7265080d484cfda32e1fbdaff361f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cfb7265080d484cfda32e1fbdaff361f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cfb7265080d484cfda32e1fbdaff361f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cfb7265080d484cfda32e1fbdaff361f\"><p>@proceedings{cellier2014proceedings,<br\/>  editor = {Cellier, Peggy and Charnois, Thierry and Hotho, Andreas and Matwin, Stan and Moens, Marie{-}Francine and Toussaint, Yannick},<br\/>  keywords = {workshop},<br\/>  publisher = {CEUR-WS.org},<br\/>  series = {{CEUR} Workshop Proceedings},<br\/>  title = {Proceedings of the 1st International Workshop on Interactions between Data Mining and Natural Language Processing co-located with The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, DMNLP@PKDD\/ECML 2014, Nancy, France, September 15, 2014},<br\/>  volume = 1202,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cfb7265080d484cfda32e1fbdaff361f\"><p>%0 Conference Proceedings<br\/>%1 cellier2014proceedings<br\/>%B {CEUR} Workshop Proceedings<br\/>%D 2014<br\/>%E Cellier, Peggy<br\/>%E Charnois, Thierry<br\/>%E Hotho, Andreas<br\/>%E Matwin, Stan<br\/>%E Moens, Marie{-}Francine<br\/>%E Toussaint, Yannick<br\/>%I CEUR-WS.org<br\/>%T Proceedings of the 1st International Workshop on Interactions between Data Mining and Natural Language Processing co-located with The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, DMNLP@PKDD\/ECML 2014, Nancy, France, September 15, 2014<br\/>%U http:\/\/ceur-ws.org\/Vol-1202<br\/>%V 1202<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Scholz, C. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings of the 2014 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2014)}<\/span>.<\/span> ECML\/PKDD 2014, Nancy, France (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-27b5d582946866971444834ceaf83248\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-27b5d582946866971444834ceaf83248\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/27b5d582946866971444834ceaf83248\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-27b5d582946866971444834ceaf83248\"><p>@book{AS:14,<br\/>  address = {Nancy, France},<br\/>  editor = {Atzmueller, Martin and Scholz, Christoph},<br\/>  keywords = {muse},<br\/>  publisher = {ECML\/PKDD 2014},<br\/>  title = {{Proceedings of the 2014 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2014)}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-27b5d582946866971444834ceaf83248\"><p>%0 Book<br\/>%1 AS:14<br\/>%C Nancy, France<br\/>%D 2014<br\/>%E Atzmueller, Martin<br\/>%E Scholz, Christoph<br\/>%I ECML\/PKDD 2014<br\/>%T {Proceedings of the 2014 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2014)}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Becker, M., Hotho, A., Mueller, J., Kibanov, M., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Subjective vs. Objective Data: Bridging the Gap<\/span><\/span>, http:\/\/www.gesis.org\/en\/events\/css-wintersymposium\/poster-presentation\/, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.gesis.org\/en\/events\/css-wintersymposium\/poster-presentation\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-33cf40cc46170f51767c46d2ec14a495\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-33cf40cc46170f51767c46d2ec14a495\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/33cf40cc46170f51767c46d2ec14a495\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-33cf40cc46170f51767c46d2ec14a495\">Sensor data is objective. But when measuring our environment, measured values are contrasted with our perception, which is always subjective. This makes interpreting sensor measurements difficult for a single person in her personal environment. In this context, the EveryAware projects directly connects the concepts of objective sensor data with subjective impressions and perceptions by providing a collective sensing platform with several client applications allowing to explicitly associate those two data types. The goal is to provide the user with personalized feedback, a characterization of the global as well as her personal environment, and enable her to position her perceptions in this global context. In this poster we summarize the collected data of two EveryAware applications, namely WideNoise for noise measurements and AirProbe for participatory air quality sensing. Basic insights are presented including user activity, learning processes and sensor data to perception correlations. These results provide an outlook on how this data can further be used to understand the connection between sensor data and perceptions.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-33cf40cc46170f51767c46d2ec14a495\"><p>@misc{becker2014subjective,<br\/>  abstract = {Sensor data is objective. But when measuring our environment, measured values are contrasted with our perception, which is always subjective. This makes interpreting sensor measurements difficult for a single person in her personal environment. In this context, the EveryAware projects directly connects the concepts of objective sensor data with subjective impressions and perceptions by providing a collective sensing platform with several client applications allowing to explicitly associate those two data types. The goal is to provide the user with personalized feedback, a characterization of the global as well as her personal environment, and enable her to position her perceptions in this global context. In this poster we summarize the collected data of two EveryAware applications, namely WideNoise for noise measurements and AirProbe for participatory air quality sensing. Basic insights are presented including user activity, learning processes and sensor data to perception correlations. These results provide an outlook on how this data can further be used to understand the connection between sensor data and perceptions.},<br\/>  author = {Becker, Martin and Hotho, Andreas and Mueller, Juergen and Kibanov, Mark and Atzmueller, Martin and Stumme, Gerd},<br\/>  howpublished = {CSSWS 2014, Poster},<br\/>  keywords = {everyaware},<br\/>  title = {Subjective vs. Objective Data: Bridging the Gap},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-33cf40cc46170f51767c46d2ec14a495\"><p>%0 Generic<br\/>%1 becker2014subjective<br\/>%A Becker, Martin<br\/>%A Hotho, Andreas<br\/>%A Mueller, Juergen<br\/>%A Kibanov, Mark<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%D 2014<br\/>%T Subjective vs. Objective Data: Bridging the Gap<br\/>%U http:\/\/www.gesis.org\/en\/events\/css-wintersymposium\/poster-presentation\/<br\/>%X Sensor data is objective. But when measuring our environment, measured values are contrasted with our perception, which is always subjective. This makes interpreting sensor measurements difficult for a single person in her personal environment. In this context, the EveryAware projects directly connects the concepts of objective sensor data with subjective impressions and perceptions by providing a collective sensing platform with several client applications allowing to explicitly associate those two data types. The goal is to provide the user with personalized feedback, a characterization of the global as well as her personal environment, and enable her to position her perceptions in this global context. In this poster we summarize the collected data of two EveryAware applications, namely WideNoise for noise measurements and AirProbe for participatory air quality sensing. Basic insights are presented including user activity, learning processes and sensor data to perception correlations. These results provide an outlook on how this data can further be used to understand the connection between sensor data and perceptions.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}<\/span>.<\/span> Journal of Social Network Analysis and Mining. 4, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/link.springer.com\/article\/10.1007\/s13278-014-0217-1\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b72145d6354103b604ca287519eac000\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b72145d6354103b604ca287519eac000\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b72145d6354103b604ca287519eac000\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b72145d6354103b604ca287519eac000\"><p>@article{SAS:14c,<br\/>  author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},<br\/>  journal = {Journal of Social Network Analysis and Mining},<br\/>  keywords = {itegpub},<br\/>  number = 217,<br\/>  title = {{Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}},<br\/>  volume = 4,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b72145d6354103b604ca287519eac000\"><p>%0 Journal Article<br\/>%1 SAS:14c<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Kibanov, Mark<br\/>%A Stumme, Gerd<br\/>%D 2014<br\/>%J Journal of Social Network Analysis and Mining<br\/>%N 217<br\/>%T {Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}<br\/>%U http:\/\/link.springer.com\/article\/10.1007\/s13278-014-0217-1<br\/>%V 4<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Unsupervised and Hybrid Approaches for On-Line RFID Localization with Mixed Context Knowledge<\/span>.<\/span> In: ISMIS (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d52a7bee8a41aa633ab63e419b042e31\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d52a7bee8a41aa633ab63e419b042e31\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d52a7bee8a41aa633ab63e419b042e31\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d52a7bee8a41aa633ab63e419b042e31\"><p>@inproceedings{DBLP:conf\/ismis\/SAS14,<br\/>  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {ISMIS},<br\/>  keywords = {itegpub},<br\/>  title = {Unsupervised and Hybrid Approaches for On-Line RFID Localization with Mixed Context Knowledge},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d52a7bee8a41aa633ab63e419b042e31\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/ismis\/SAS14<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B ISMIS<br\/>%D 2014<br\/>%T Unsupervised and Hybrid Approaches for On-Line RFID Localization with Mixed Context Knowledge<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On the Predictability of Recurring Links in Networks of Face-to-Face Proximity<\/span>.<\/span> In: [accepted\/to appear] (ed.) 5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014. , Seoul, South Korea (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e083ad7d039c28b4ecc000fda3fabc94\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e083ad7d039c28b4ecc000fda3fabc94\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e083ad7d039c28b4ecc000fda3fabc94\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e083ad7d039c28b4ecc000fda3fabc94\"><p>@inproceedings{scholz2014predictability,<br\/>  address = {Seoul, South Korea},<br\/>  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014},<br\/>  editor = {[accepted\/to appear]},<br\/>  keywords = {face-to-face},<br\/>  title = {On the Predictability of Recurring Links in Networks of Face-to-Face Proximity},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e083ad7d039c28b4ecc000fda3fabc94\"><p>%0 Conference Paper<br\/>%1 scholz2014predictability<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B 5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014<br\/>%C Seoul, South Korea<br\/>%D 2014<br\/>%E [accepted\/to appear], <br\/>%T On the Predictability of Recurring Links in Networks of Face-to-Face Proximity<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Ernst, A., Krebs, F., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On the Evolution of Social Groups During Coffee Breaks<\/span>.<\/span> In: [accepted\/to appear] (ed.) 5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014. , Seoul, South Korea (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f4ac9a1ea3004fe310bc5951cfb5a802\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f4ac9a1ea3004fe310bc5951cfb5a802\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f4ac9a1ea3004fe310bc5951cfb5a802\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f4ac9a1ea3004fe310bc5951cfb5a802\"><p>@inproceedings{atzmueller2014evolution,<br\/>  address = {Seoul, South Korea},<br\/>  author = {Atzmueller, Martin and Ernst, Andreas and Krebs, Friedrich and Scholz, Christoph and Stumme, Gerd},<br\/>  booktitle = {5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014},<br\/>  editor = {[accepted\/to appear]},<br\/>  keywords = {itegpub},<br\/>  title = {On the Evolution of Social Groups During Coffee Breaks},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f4ac9a1ea3004fe310bc5951cfb5a802\"><p>%0 Conference Paper<br\/>%1 atzmueller2014evolution<br\/>%A Atzmueller, Martin<br\/>%A Ernst, Andreas<br\/>%A Krebs, Friedrich<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%B 5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014<br\/>%C Seoul, South Korea<br\/>%D 2014<br\/>%E [accepted\/to appear], <br\/>%T On the Evolution of Social Groups During Coffee Breaks<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Thiele, L., Atzmueller, M., Kauffeld, S., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Subjective versus Objective Captured Social Networks: Comparing Standard Self-Report Questionnaire Data with Observational RFID Technology Data}<\/span>.<\/span> In: Proc. Measuring Behavior. , Wageningen, The Netherlands (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-db2582a5ca1a0a91ac9378f8dfcb7d8d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-db2582a5ca1a0a91ac9378f8dfcb7d8d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/db2582a5ca1a0a91ac9378f8dfcb7d8d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-db2582a5ca1a0a91ac9378f8dfcb7d8d\"><p>@inproceedings{TAKS:14,<br\/>  address = {Wageningen, The Netherlands},<br\/>  author = {Thiele, Lisa and Atzmueller, Martin and Kauffeld, Simone and Stumme, Gerd},<br\/>  booktitle = {Proc. Measuring Behavior},<br\/>  keywords = {itegpub},<br\/>  title = {{Subjective versus Objective Captured Social Networks: Comparing Standard Self-Report Questionnaire Data with Observational RFID Technology Data}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-db2582a5ca1a0a91ac9378f8dfcb7d8d\"><p>%0 Conference Paper<br\/>%1 TAKS:14<br\/>%A Thiele, Lisa<br\/>%A Atzmueller, Martin<br\/>%A Kauffeld, Simone<br\/>%A Stumme, Gerd<br\/>%B Proc. Measuring Behavior<br\/>%C Wageningen, The Netherlands<br\/>%D 2014<br\/>%T {Subjective versus Objective Captured Social Networks: Comparing Standard Self-Report Questionnaire Data with Observational RFID Technology Data}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Singer, P., Helic, D., Hotho, A., Strohmaier, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">HypTrails: A Bayesian Approach for Comparing Hypotheses about Human Trails on the Web<\/span><\/span>, http:\/\/arxiv.org\/abs\/1411.2844, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1411.2844\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-07a19041ef1bfd5cef707e03d1510d5e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-07a19041ef1bfd5cef707e03d1510d5e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/07a19041ef1bfd5cef707e03d1510d5e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-07a19041ef1bfd5cef707e03d1510d5e\">When users interact with the Web today, they leave sequential digital trails on a massive scale. Examples of such human trails include Web navigation, sequences of online restaurant reviews, or online music play lists. Understanding the factors that drive the production of these trails can be useful for e.g., improving underlying network structures, predicting user clicks or enhancing recommendations. In this work, we present a general approach called HypTrails for comparing a set of hypotheses about human trails on the Web, where hypotheses represent beliefs about transitions between states. Our approach utilizes Markov chain models with Bayesian inference. The main idea is to incorporate hypotheses as informative Dirichlet priors and to leverage the sensitivity of Bayes factors on the prior for comparing hypotheses with each other. For eliciting Dirichlet priors from hypotheses, we present an adaption of the so-called (trial) roulette method. We demonstrate the general mechanics and applicability of HypTrails by performing experiments with (i) synthetic trails for which we control the mechanisms that have produced them and (ii) empirical trails stemming from different domains including website navigation, business reviews and online music played. Our work expands the repertoire of methods available for studying human trails on the Web.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-07a19041ef1bfd5cef707e03d1510d5e\"><p>@misc{singer2014hyptrails,<br\/>  abstract = {When users interact with the Web today, they leave sequential digital trails on a massive scale. Examples of such human trails include Web navigation, sequences of online restaurant reviews, or online music play lists. Understanding the factors that drive the production of these trails can be useful for e.g., improving underlying network structures, predicting user clicks or enhancing recommendations. In this work, we present a general approach called HypTrails for comparing a set of hypotheses about human trails on the Web, where hypotheses represent beliefs about transitions between states. Our approach utilizes Markov chain models with Bayesian inference. The main idea is to incorporate hypotheses as informative Dirichlet priors and to leverage the sensitivity of Bayes factors on the prior for comparing hypotheses with each other. For eliciting Dirichlet priors from hypotheses, we present an adaption of the so-called (trial) roulette method. We demonstrate the general mechanics and applicability of HypTrails by performing experiments with (i) synthetic trails for which we control the mechanisms that have produced them and (ii) empirical trails stemming from different domains including website navigation, business reviews and online music played. Our work expands the repertoire of methods available for studying human trails on the Web.},<br\/>  author = {Singer, Philipp and Helic, Denis and Hotho, Andreas and Strohmaier, Markus},<br\/>  keywords = {hypotheses},<br\/>  note = {cite arxiv:1411.2844},<br\/>  title = {HypTrails: A Bayesian Approach for Comparing Hypotheses about Human Trails on the Web},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-07a19041ef1bfd5cef707e03d1510d5e\"><p>%0 Generic<br\/>%1 singer2014hyptrails<br\/>%A Singer, Philipp<br\/>%A Helic, Denis<br\/>%A Hotho, Andreas<br\/>%A Strohmaier, Markus<br\/>%D 2014<br\/>%T HypTrails: A Bayesian Approach for Comparing Hypotheses about Human Trails on the Web<br\/>%U http:\/\/arxiv.org\/abs\/1411.2844<br\/>%X When users interact with the Web today, they leave sequential digital trails on a massive scale. Examples of such human trails include Web navigation, sequences of online restaurant reviews, or online music play lists. Understanding the factors that drive the production of these trails can be useful for e.g., improving underlying network structures, predicting user clicks or enhancing recommendations. In this work, we present a general approach called HypTrails for comparing a set of hypotheses about human trails on the Web, where hypotheses represent beliefs about transitions between states. Our approach utilizes Markov chain models with Bayesian inference. The main idea is to incorporate hypotheses as informative Dirichlet priors and to leverage the sensitivity of Bayes factors on the prior for comparing hypotheses with each other. For eliciting Dirichlet priors from hypotheses, we present an adaption of the so-called (trial) roulette method. We demonstrate the general mechanics and applicability of HypTrails by performing experiments with (i) synthetic trails for which we control the mechanisms that have produced them and (ii) empirical trails stemming from different domains including website navigation, business reviews and online music played. Our work expands the repertoire of methods available for studying human trails on the Web.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Macek, B.-E., Atzmueller, M., Doerfel, S., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Mining Social Links for Ubiquitous Knowledge Engineering}<\/span>.<\/span> In: David, K., Geihs, K., Leimeister, J.-M., Ro\u00dfnagel, A., Schmidt, L., Stumme, G., and Wacker, A. (eds.) {Socio-technical Design of Ubiquitous Computing Systems}. Springer Verlag, Heidelberg, Germany (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2fb39e94ebb07dde6b46abc09c4ce371\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2fb39e94ebb07dde6b46abc09c4ce371\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2fb39e94ebb07dde6b46abc09c4ce371\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2fb39e94ebb07dde6b46abc09c4ce371\"><p>@incollection{SMADS:14,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Scholz, Christoph and Macek, Bjoern-Elmar and Atzmueller, Martin and Doerfel, Stephan and Stumme, Gerd},<br\/>  booktitle = {{Socio-technical Design of Ubiquitous Computing Systems}},<br\/>  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan-Marco and Ro\u00dfnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Mining Social Links for Ubiquitous Knowledge Engineering}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2fb39e94ebb07dde6b46abc09c4ce371\"><p>%0 Book Section<br\/>%1 SMADS:14<br\/>%A Scholz, Christoph<br\/>%A Macek, Bjoern-Elmar<br\/>%A Atzmueller, Martin<br\/>%A Doerfel, Stephan<br\/>%A Stumme, Gerd<br\/>%B {Socio-technical Design of Ubiquitous Computing Systems}<br\/>%C Heidelberg, Germany<br\/>%D 2014<br\/>%E David, Klaus<br\/>%E Geihs, Kurt<br\/>%E Leimeister, Jan-Marco<br\/>%E Ro\u00dfnagel, Alexander<br\/>%E Schmidt, Ludger<br\/>%E Stumme, Gerd<br\/>%E Wacker, Arno<br\/>%I Springer Verlag<br\/>%T {Mining Social Links for Ubiquitous Knowledge Engineering}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract)}<\/span>.<\/span> In: Proc. LWA 2014 (KDML Special Track). RTWH Aachen University, Aachen, Germany (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2014-lwa-kdml-talk-prediction-extended-abstract.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b29c1972d61b606dfce66f439cef7671\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b29c1972d61b606dfce66f439cef7671\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b29c1972d61b606dfce66f439cef7671\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b29c1972d61b606dfce66f439cef7671\"><p>@inproceedings{SIAS:14b,<br\/>  address = {Aachen, Germany},<br\/>  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {Proc. LWA 2014 (KDML Special Track)},<br\/>  keywords = {user},<br\/>  publisher = {RTWH Aachen University},<br\/>  title = {{On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract)}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b29c1972d61b606dfce66f439cef7671\"><p>%0 Conference Paper<br\/>%1 SIAS:14b<br\/>%A Scholz, Christoph<br\/>%A Illig, Jens<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B Proc. LWA 2014 (KDML Special Track)<br\/>%C Aachen, Germany<br\/>%D 2014<br\/>%I RTWH Aachen University<br\/>%T {On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract)}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2014-lwa-kdml-talk-prediction-extended-abstract.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Analyzing and Grounding Social Interaction in Online and Offline Networks}<\/span>.<\/span> In: Proc. ECML\/PKDD 2014: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases. pp. 485\u2013488. Springer Verlag, Heidelberg, Germany (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4e4cd2f9733127d4ce1661b378e7f97a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4e4cd2f9733127d4ce1661b378e7f97a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4e4cd2f9733127d4ce1661b378e7f97a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4e4cd2f9733127d4ce1661b378e7f97a\"><p>@inproceedings{Atzmueller:14:Nectar,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Proc. ECML\/PKDD 2014: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},<br\/>  keywords = {itegpub},<br\/>  pages = {485--488},<br\/>  publisher = {Springer Verlag},<br\/>  series = {LNCS},<br\/>  title = {{Analyzing and Grounding Social Interaction in Online and Offline Networks}},<br\/>  volume = 8726,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4e4cd2f9733127d4ce1661b378e7f97a\"><p>%0 Conference Paper<br\/>%1 Atzmueller:14:Nectar<br\/>%A Atzmueller, Martin<br\/>%B Proc. ECML\/PKDD 2014: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases<br\/>%C Heidelberg, Germany<br\/>%D 2014<br\/>%I Springer Verlag<br\/>%P 485--488<br\/>%T {Analyzing and Grounding Social Interaction in Online and Offline Networks}<br\/>%V 8726<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzmueller, M., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The social distributional hypothesis: a pragmatic proxy for homophily in online social networks<\/span>.<\/span> Social Network Analysis and Mining. 4, (2014). https:\/\/doi.org\/10.1007\/s13278-014-0216-2.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/s13278-014-0216-2\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5b268a7c5308af783c3028573ffcd0c0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5b268a7c5308af783c3028573ffcd0c0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s13278-014-0216-2\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5b268a7c5308af783c3028573ffcd0c0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5b268a7c5308af783c3028573ffcd0c0\">Applications of the Social Web are ubiquitous and have become an integral part of everyday life: Users make friends, for example, with the help of online social networks, share thoughts via Twitter, or collaboratively write articles in Wikipedia. All such interactions leave digital traces; thus, users participate in the creation of heterogeneous, distributed, collaborative data collections. In linguistics, the<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5b268a7c5308af783c3028573ffcd0c0\"><p>@article{mitzlaff2014social,<br\/>  abstract = {Applications of the Social Web are ubiquitous and have become an integral part of everyday life: Users make friends, for example, with the help of online social networks, share thoughts via Twitter, or collaboratively write articles in Wikipedia. All such interactions leave digital traces; thus, users participate in the creation of heterogeneous, distributed, collaborative data collections. In linguistics, the},<br\/>  author = {Mitzlaff, Folke and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},<br\/>  journal = {Social Network Analysis and Mining},<br\/>  keywords = {itegpub},<br\/>  number = 1,<br\/>  publisher = {Springer Vienna},<br\/>  title = {The social distributional hypothesis: a pragmatic proxy for homophily in online social networks},<br\/>  volume = 4,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5b268a7c5308af783c3028573ffcd0c0\"><p>%0 Journal Article<br\/>%1 mitzlaff2014social<br\/>%A Mitzlaff, Folke<br\/>%A Atzmueller, Martin<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%D 2014<br\/>%I Springer Vienna<br\/>%J Social Network Analysis and Mining<br\/>%N 1<br\/>%R 10.1007\/s13278-014-0216-2<br\/>%T The social distributional hypothesis: a pragmatic proxy for homophily in online social networks<br\/>%U http:\/\/dx.doi.org\/10.1007\/s13278-014-0216-2<br\/>%V 4<br\/>%X Applications of the Social Web are ubiquitous and have become an integral part of everyday life: Users make friends, for example, with the help of online social networks, share thoughts via Twitter, or collaboratively write articles in Wikipedia. All such interactions leave digital traces; thus, users participate in the creation of heterogeneous, distributed, collaborative data collections. In linguistics, the<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzmueller, M., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{The Social Distributional Hypothesis}<\/span>.<\/span> Journal of Social Network Analysis and Mining. 4, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-46f7a831481ba0761e10798be044f691\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-46f7a831481ba0761e10798be044f691\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/46f7a831481ba0761e10798be044f691\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-46f7a831481ba0761e10798be044f691\"><p>@article{MAHS:14,<br\/>  author = {Mitzlaff, Folke and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},<br\/>  journal = {Journal of Social Network Analysis and Mining},<br\/>  keywords = {itegpub},<br\/>  number = 216,<br\/>  title = {{The Social Distributional Hypothesis}},<br\/>  volume = 4,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-46f7a831481ba0761e10798be044f691\"><p>%0 Journal Article<br\/>%1 MAHS:14<br\/>%A Mitzlaff, Folke<br\/>%A Atzmueller, Martin<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%D 2014<br\/>%J Journal of Social Network Analysis and Mining<br\/>%N 216<br\/>%T {The Social Distributional Hypothesis}<br\/>%V 4<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}<\/span>.<\/span> Journal of Social Network Analysis and Mining. 4, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b1d72d24278760d72fb0774543cfdb06\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b1d72d24278760d72fb0774543cfdb06\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b1d72d24278760d72fb0774543cfdb06\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b1d72d24278760d72fb0774543cfdb06\"><p>@article{SAS:14c,<br\/>  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},<br\/>  journal = {Journal of Social Network Analysis and Mining},<br\/>  keywords = {itegpub},<br\/>  number = 217,<br\/>  title = {{Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}},<br\/>  volume = 4,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b1d72d24278760d72fb0774543cfdb06\"><p>%0 Journal Article<br\/>%1 SAS:14c<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%D 2014<br\/>%J Journal of Social Network Analysis and Mining<br\/>%N 217<br\/>%T {Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}<br\/>%V 4<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Macek, B.-E., Atzmueller, M., Doerfel, S., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Socio-technical Design of Ubiquitous Computing Systems}<\/span>.<\/span> Presented at the , Heidelberg, Germany (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9ca0cc5d3994d2bc9805f479d7c045c0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9ca0cc5d3994d2bc9805f479d7c045c0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9ca0cc5d3994d2bc9805f479d7c045c0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9ca0cc5d3994d2bc9805f479d7c045c0\"><p>@incollection{scholz2014sociotechnical,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Scholz, Christoph and Macek, Bjoern-Elmar and Atzmueller, Martin and Doerfel, Stephan and Stumme, Gerd},<br\/>  chapter = {{Mining Social Links for Ubiquitous Knowledge Engineering}},<br\/>  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan-Marco and Ro\u00dfnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},<br\/>  keywords = 2014,<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Socio-technical Design of Ubiquitous Computing Systems}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9ca0cc5d3994d2bc9805f479d7c045c0\"><p>%0 Book Section<br\/>%1 scholz2014sociotechnical<br\/>%A Scholz, Christoph<br\/>%A Macek, Bjoern-Elmar<br\/>%A Atzmueller, Martin<br\/>%A Doerfel, Stephan<br\/>%A Stumme, Gerd<br\/>%C Heidelberg, Germany<br\/>%D 2014<br\/>%E David, Klaus<br\/>%E Geihs, Kurt<br\/>%E Leimeister, Jan-Marco<br\/>%E Ro\u00dfnagel, Alexander<br\/>%E Schmidt, Ludger<br\/>%E Stumme, Gerd<br\/>%E Wacker, Arno<br\/>%I Springer Verlag<br\/>%T {Socio-technical Design of Ubiquitous Computing Systems}<br\/>%& {Mining Social Links for Ubiquitous Knowledge Engineering}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzm\u00fcller, M., Baraki, H., Behrenbruch, K., Comes, D., Evers, C., Hoffmann, A., Hoffmann, H., Jandt, S., Kibanov, M., Kieselmann, O., Kniewel, R., K\u00f6nig, I., Macek, B., Niemczyk, S., Scholz, C., Schuldt, M., Schulz, T., Skistims, H., S\u00f6llner, M., Voigtmann, C., Witsch, A., Zirfas, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Die VENUS-Entwicklungsmethode - Eine interdisziplin\u00e4re Methode f\u00fcr soziotechnische Softwaregestaltung<\/span>.<\/span> Kassel University Press (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.uni-kassel.de\/upress\/online\/OpenAccess\/978-3-86219-550-3.OpenAccess.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6cfde79bbd7b598c6c50cf8ba78eb79a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6cfde79bbd7b598c6c50cf8ba78eb79a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6cfde79bbd7b598c6c50cf8ba78eb79a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6cfde79bbd7b598c6c50cf8ba78eb79a\"><p>@techreport{atzmuller2014venusentwicklungsmethode,<br\/>  author = {Atzm\u00fcller, Martin and Baraki, Harun and Behrenbruch, Kay and Comes, Diana and Evers, Christoph and Hoffmann, Axel and Hoffmann, Holger and Jandt, Silke and Kibanov, Mark and Kieselmann, Olga and Kniewel, Romy and K\u00f6nig, Immanuel and Macek, Bj\u00f6rn\u2010Elmar and Niemczyk, Stefan and Scholz, Christoph and Schuldt, Michaela and Schulz, Thomas and Skistims, Hendrik and S\u00f6llner, Matthias and Voigtmann, Christian and Witsch, Andreas and Zirfas, Julia},<br\/>  editor = {Hoffmann, Axel and Niemczyk, Stefan},<br\/>  institution = {Zentrum f\u00fcr Informationstechnik\u2010Gestaltung (ITeG)},<br\/>  keywords = {myown},<br\/>  organization = {Kassel University},<br\/>  publisher = {Kassel University Press},<br\/>  title = {Die VENUS-Entwicklungsmethode - Eine interdisziplin\u00e4re Methode f\u00fcr soziotechnische Softwaregestaltung},<br\/>  volume = 1,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6cfde79bbd7b598c6c50cf8ba78eb79a\"><p>%0 Report<br\/>%1 atzmuller2014venusentwicklungsmethode<br\/>%A Atzm\u00fcller, Martin<br\/>%A Baraki, Harun<br\/>%A Behrenbruch, Kay<br\/>%A Comes, Diana<br\/>%A Evers, Christoph<br\/>%A Hoffmann, Axel<br\/>%A Hoffmann, Holger<br\/>%A Jandt, Silke<br\/>%A Kibanov, Mark<br\/>%A Kieselmann, Olga<br\/>%A Kniewel, Romy<br\/>%A K\u00f6nig, Immanuel<br\/>%A Macek, Bj\u00f6rn\u2010Elmar<br\/>%A Niemczyk, Stefan<br\/>%A Scholz, Christoph<br\/>%A Schuldt, Michaela<br\/>%A Schulz, Thomas<br\/>%A Skistims, Hendrik<br\/>%A S\u00f6llner, Matthias<br\/>%A Voigtmann, Christian<br\/>%A Witsch, Andreas<br\/>%A Zirfas, Julia<br\/>%D 2014<br\/>%E Hoffmann, Axel<br\/>%E Niemczyk, Stefan<br\/>%I Kassel University Press<br\/>%T Die VENUS-Entwicklungsmethode - Eine interdisziplin\u00e4re Methode f\u00fcr soziotechnische Softwaregestaltung<br\/>%U http:\/\/www.uni-kassel.de\/upress\/online\/OpenAccess\/978-3-86219-550-3.OpenAccess.pdf<br\/>%V 1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bl\u00fcmel, I., Hauschke, C., J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Literatur recherchieren und verwalten<\/span>.<\/span> In: CoScience - Gemeinsam forschen und publizieren mit dem Netz. pp. 12\u201320. Technische Informationsbibliothek, Hannover (2014). https:\/\/doi.org\/10.2314\/coscv1.1.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/handbuch.io\/w\/index.php?title=Handbuch_CoScience\/Literatur_recherchieren_und_verwalten\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9d87348e2ce9f970dfac29446b04729b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9d87348e2ce9f970dfac29446b04729b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.2314\/coscv1.1\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9d87348e2ce9f970dfac29446b04729b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9d87348e2ce9f970dfac29446b04729b\">Ob in Forschungs- oder Publikationsprojekten - Recherche ist essentieller Bestandteil im Prozess des wissenschaftlichen Arbeitens, und das nicht nur am Anfang eines Projektes, sondern immer wieder und zu unterschiedlichen Projektmomenten. Wer forscht, m\u00f6chte wissen, was schon geforscht wurde, welche Methoden f\u00fcr ein Projekt anwendbar sind, welche Begrifflichkeiten verwendet werden und welche inhaltlichen, formalen und methodischen Klippen es gegebenenfalls zu umschiffen gilt. Die Verwaltung der gefundenen Quellen ist Teil der Recherche und, unter anderem, eine wichtige Voraussetzung f\u00fcr korrektes Zitieren. Beim kollaborativen Arbeiten ist das Teilen der recherchierten Information w\u00fcnschenswert, um den Wissenstand zu homogenisieren und Doppelarbeit zu vermeiden. In vernetzten Projekten besteht die Besonderheit darin, die Recherche so durchzuf\u00fchren, dass das Ergebnis, also die gefundenen Informationen, allen Projektmitgliedern transparent ist.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9d87348e2ce9f970dfac29446b04729b\"><p>@incollection{bluemel2014literatur,<br\/>  abstract = {Ob in Forschungs- oder Publikationsprojekten - Recherche ist essentieller Bestandteil im Prozess des wissenschaftlichen Arbeitens, und das nicht nur am Anfang eines Projektes, sondern immer wieder und zu unterschiedlichen Projektmomenten. Wer forscht, m\u00f6chte wissen, was schon geforscht wurde, welche Methoden f\u00fcr ein Projekt anwendbar sind, welche Begrifflichkeiten verwendet werden und welche inhaltlichen, formalen und methodischen Klippen es gegebenenfalls zu umschiffen gilt. Die Verwaltung der gefundenen Quellen ist Teil der Recherche und, unter anderem, eine wichtige Voraussetzung f\u00fcr korrektes Zitieren. Beim kollaborativen Arbeiten ist das Teilen der recherchierten Information w\u00fcnschenswert, um den Wissenstand zu homogenisieren und Doppelarbeit zu vermeiden. In vernetzten Projekten besteht die Besonderheit darin, die Recherche so durchzuf\u00fchren, dass das Ergebnis, also die gefundenen Informationen, allen Projektmitgliedern transparent ist.},<br\/>  address = {Hannover},<br\/>  author = {Bl\u00fcmel, Ina and Hauschke, Christian and J\u00e4schke, Robert},<br\/>  booktitle = {CoScience - Gemeinsam forschen und publizieren mit dem Netz},<br\/>  chapter = 1,<br\/>  keywords = {recherche},<br\/>  pages = {12--20},<br\/>  publisher = {Technische Informationsbibliothek},<br\/>  title = {Literatur recherchieren und verwalten},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9d87348e2ce9f970dfac29446b04729b\"><p>%0 Book Section<br\/>%1 bluemel2014literatur<br\/>%A Bl\u00fcmel, Ina<br\/>%A Hauschke, Christian<br\/>%A J\u00e4schke, Robert<br\/>%B CoScience - Gemeinsam forschen und publizieren mit dem Netz<br\/>%C Hannover<br\/>%D 2014<br\/>%I Technische Informationsbibliothek<br\/>%P 12--20<br\/>%R 10.2314\/coscv1.1<br\/>%T Literatur recherchieren und verwalten<br\/>%U http:\/\/handbuch.io\/w\/index.php?title=Handbuch_CoScience\/Literatur_recherchieren_und_verwalten<br\/>%X Ob in Forschungs- oder Publikationsprojekten - Recherche ist essentieller Bestandteil im Prozess des wissenschaftlichen Arbeitens, und das nicht nur am Anfang eines Projektes, sondern immer wieder und zu unterschiedlichen Projektmomenten. Wer forscht, m\u00f6chte wissen, was schon geforscht wurde, welche Methoden f\u00fcr ein Projekt anwendbar sind, welche Begrifflichkeiten verwendet werden und welche inhaltlichen, formalen und methodischen Klippen es gegebenenfalls zu umschiffen gilt. Die Verwaltung der gefundenen Quellen ist Teil der Recherche und, unter anderem, eine wichtige Voraussetzung f\u00fcr korrektes Zitieren. Beim kollaborativen Arbeiten ist das Teilen der recherchierten Information w\u00fcnschenswert, um den Wissenstand zu homogenisieren und Doppelarbeit zu vermeiden. In vernetzten Projekten besteht die Besonderheit darin, die Recherche so durchzuf\u00fchren, dass das Ergebnis, also die gefundenen Informationen, allen Projektmitgliedern transparent ist.<br\/>%& 1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Mining Social Interaction -- Ubiquitous Sensors and Social Media}<\/span>.<\/span> In: Proc. International Conference on Future RFID Technologies. pp. 5\u201313. , Eger, Hungary (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8370326f32d50a74ebbcc8e8970bfca4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8370326f32d50a74ebbcc8e8970bfca4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8370326f32d50a74ebbcc8e8970bfca4\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8370326f32d50a74ebbcc8e8970bfca4\"><p>@inproceedings{Atzmueller:14:FutureRFID,<br\/>  address = {Eger, Hungary},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Proc. International Conference on Future RFID Technologies},<br\/>  keywords = {knowledge},<br\/>  pages = {5--13},<br\/>  title = {{Mining Social Interaction -- Ubiquitous Sensors and Social Media}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8370326f32d50a74ebbcc8e8970bfca4\"><p>%0 Conference Paper<br\/>%1 Atzmueller:14:FutureRFID<br\/>%A Atzmueller, Martin<br\/>%B Proc. International Conference on Future RFID Technologies<br\/>%C Eger, Hungary<br\/>%D 2014<br\/>%P 5--13<br\/>%T {Mining Social Interaction -- Ubiquitous Sensors and Social Media}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Bobek, S., Kibanov, M., Nalepa, G.J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Towards Context Detection in the Ambient Classroom using Wearable Sensors}<\/span>.<\/span> In: Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK. , London, UK (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-smartuni14-paper7.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5f91ae66178e38f9e8c701dc28037927\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5f91ae66178e38f9e8c701dc28037927\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5f91ae66178e38f9e8c701dc28037927\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5f91ae66178e38f9e8c701dc28037927\"><p>@inproceedings{ABKN:14,<br\/>  address = {London, UK},<br\/>  author = {Atzmueller, Martin and Bobek, Szymon and Kibanov, Mark and Nalepa, Grzegorz J.},<br\/>  booktitle = {Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK},<br\/>  keywords = {itegpub},<br\/>  title = {{Towards Context Detection in the Ambient Classroom using Wearable Sensors}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5f91ae66178e38f9e8c701dc28037927\"><p>%0 Conference Paper<br\/>%1 ABKN:14<br\/>%A Atzmueller, Martin<br\/>%A Bobek, Szymon<br\/>%A Kibanov, Mark<br\/>%A Nalepa, Grzegorz J.<br\/>%B Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK<br\/>%C London, UK<br\/>%D 2014<br\/>%T {Towards Context Detection in the Ambient Classroom using Wearable Sensors}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-smartuni14-paper7.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">David, K., Geihs, K., Leimeister, J.M., Ro\u00dfnagel, A., Schmidt, L., Stumme, G., Wacker, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Socio-technical design of ubiquitous computing systems<\/span>.<\/span> Springer (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/978-3-319-05044-7\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8eddf6c7fe2d62802036f76465364eac\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8eddf6c7fe2d62802036f76465364eac\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8eddf6c7fe2d62802036f76465364eac\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-8eddf6c7fe2d62802036f76465364eac\">By using various data inputs, ubiquitous computing systems detect their current usage context, automatically adapt their services to the user's situational needs and interact with other services or resources in their environment on an ad-hoc basis. Designing such self-adaptive, context-aware knowledge processing systems is, in itself, a formidable challenge. This book presents core findings from the VENUS project at the Interdisciplinary Research Center for Information System Design (ITeG) at Kassel University, where researchers from different fields, such as computer science, information systems, human-computer interaction and law, together seek to find general principles and guidelines for the design of socially aware ubiquitous computing systems. To this end, system usability, user trust in the technology and adherence to privacy laws and regulations were treated as particularly important criteria in the context of socio-technical system design. During the project, a comprehensive blueprint for systematic, interdisciplinary software development was developed, covering the particular functional and non-functional design aspects of ubiquitous computing at the interface between technology and human beings. The organization of the book reflects the structure of the VENUS work program. After an introductory part I, part II provides the groundwork for VENUS by presenting foundational results from all four disciplines involved. Subsequently, part III focuses on methodological research funneling the development activities into a common framework. Part IV then covers the design of the demonstrators that were built in order to develop and evaluate the VENUS method. Finally, part V is dedicated to the evaluation phase to assess the user acceptance of the new approach and applications. The presented findings are especially important for researchers in computer science, information systems, and human-computer interaction, but also for everyone working on the acceptance of new technologies in society in general.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8eddf6c7fe2d62802036f76465364eac\"><p>@book{david2014sociotechnical,<br\/>  abstract = {By using various data inputs, ubiquitous computing systems detect their current usage context, automatically adapt their services to the user's situational needs and interact with other services or resources in their environment on an ad-hoc basis. Designing such self-adaptive, context-aware knowledge processing systems is, in itself, a formidable challenge. This book presents core findings from the VENUS project at the Interdisciplinary Research Center for Information System Design (ITeG) at Kassel University, where researchers from different fields, such as computer science, information systems, human-computer interaction and law, together seek to find general principles and guidelines for the design of socially aware ubiquitous computing systems. To this end, system usability, user trust in the technology and adherence to privacy laws and regulations were treated as particularly important criteria in the context of socio-technical system design. During the project, a comprehensive blueprint for systematic, interdisciplinary software development was developed, covering the particular functional and non-functional design aspects of ubiquitous computing at the interface between technology and human beings. The organization of the book reflects the structure of the VENUS work program. After an introductory part I, part II provides the groundwork for VENUS by presenting foundational results from all four disciplines involved. Subsequently, part III focuses on methodological research funneling the development activities into a common framework. Part IV then covers the design of the demonstrators that were built in order to develop and evaluate the VENUS method. Finally, part V is dedicated to the evaluation phase to assess the user acceptance of the new approach and applications. The presented findings are especially important for researchers in computer science, information systems, and human-computer interaction, but also for everyone working on the acceptance of new technologies in society in general.},<br\/>  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan M. and Ro\u00dfnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},<br\/>  keywords = {topoi},<br\/>  publisher = {Springer},<br\/>  title = {Socio-technical design of ubiquitous computing systems},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8eddf6c7fe2d62802036f76465364eac\"><p>%0 Book<br\/>%1 david2014sociotechnical<br\/>%D 2014<br\/>%E David, Klaus<br\/>%E Geihs, Kurt<br\/>%E Leimeister, Jan M.<br\/>%E Ro\u00dfnagel, Alexander<br\/>%E Schmidt, Ludger<br\/>%E Stumme, Gerd<br\/>%E Wacker, Arno<br\/>%I Springer<br\/>%T Socio-technical design of ubiquitous computing systems<br\/>%U http:\/\/dx.doi.org\/10.1007\/978-3-319-05044-7<br\/>%X By using various data inputs, ubiquitous computing systems detect their current usage context, automatically adapt their services to the user's situational needs and interact with other services or resources in their environment on an ad-hoc basis. Designing such self-adaptive, context-aware knowledge processing systems is, in itself, a formidable challenge. This book presents core findings from the VENUS project at the Interdisciplinary Research Center for Information System Design (ITeG) at Kassel University, where researchers from different fields, such as computer science, information systems, human-computer interaction and law, together seek to find general principles and guidelines for the design of socially aware ubiquitous computing systems. To this end, system usability, user trust in the technology and adherence to privacy laws and regulations were treated as particularly important criteria in the context of socio-technical system design. During the project, a comprehensive blueprint for systematic, interdisciplinary software development was developed, covering the particular functional and non-functional design aspects of ubiquitous computing at the interface between technology and human beings. The organization of the book reflects the structure of the VENUS work program. After an introductory part I, part II provides the groundwork for VENUS by presenting foundational results from all four disciplines involved. Subsequently, part III focuses on methodological research funneling the development activities into a common framework. Part IV then covers the design of the demonstrators that were built in order to develop and evaluate the VENUS method. Finally, part V is dedicated to the evaluation phase to assess the user acceptance of the new approach and applications. The presented findings are especially important for researchers in computer science, information systems, and human-computer interaction, but also for everyone working on the acceptance of new technologies in society in general.<br\/>%@ 9783319050447 3319050443 3319050435 9783319050430<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Chin, A., Trattner, C. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings MSM 2014: Workshop on Modeling Social Media - Mining Big Data in Social Media and the Web}<\/span>.<\/span> ACM Press, New York, NY, USA (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3e76258ec26cf4b446cc8a2d699e0cf2\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3e76258ec26cf4b446cc8a2d699e0cf2\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3e76258ec26cf4b446cc8a2d699e0cf2\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3e76258ec26cf4b446cc8a2d699e0cf2\"><p>@proceedings{ACT:14,<br\/>  address = {New York, NY, USA},<br\/>  editor = {Atzmueller, Martin and Chin, Alvin and Trattner, Christoph},<br\/>  keywords = {big},<br\/>  publisher = {ACM Press},<br\/>  title = {{Proceedings MSM 2014: Workshop on Modeling Social Media - Mining Big Data in Social Media and the Web}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3e76258ec26cf4b446cc8a2d699e0cf2\"><p>%0 Conference Proceedings<br\/>%1 ACT:14<br\/>%C New York, NY, USA<br\/>%D 2014<br\/>%E Atzmueller, Martin<br\/>%E Chin, Alvin<br\/>%E Trattner, Christoph<br\/>%I ACM Press<br\/>%T {Proceedings MSM 2014: Workshop on Modeling Social Media - Mining Big Data in Social Media and the Web}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., Zoller, D., Singer, P., Niebler, T., Hotho, A., Strohmaier, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">How Social is Social Tagging?<\/span>.<\/span> In: Proceedings of the Companion Publication of the 23rd International Conference on World Wide Web Companion. pp. 251\u2013252. International World Wide Web Conferences Steering Committee, Seoul, Korea (2014). https:\/\/doi.org\/10.1145\/2567948.2577301.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1145\/2567948.2577301\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0ae6feb82aecc69d9cb7f9e21caa3702\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0ae6feb82aecc69d9cb7f9e21caa3702\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2567948.2577301\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0ae6feb82aecc69d9cb7f9e21caa3702\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-0ae6feb82aecc69d9cb7f9e21caa3702\">Social tagging systems have established themselves as an important part in today's web and have attracted the interest of our research community in a variety of investigations. This has led to several assumptions about tagging, such as that tagging systems exhibit a social component. In this work we overcome the previous absence of data for testing such an assumption. We thoroughly study social interaction, leveraging for the first time live log data gathered from the real-world public social tagging system \\bibs. Our results indicate that sharing of resources constitutes an important and indeed social aspect of tagging.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0ae6feb82aecc69d9cb7f9e21caa3702\"><p>@inproceedings{doerfel2014social,<br\/>  abstract = {Social tagging systems have established themselves as an important part in today's web and have attracted the interest of our research community in a variety of investigations. This has led to several assumptions about tagging, such as that tagging systems exhibit a social component. In this work we overcome the previous absence of data for testing such an assumption. We thoroughly study social interaction, leveraging for the first time live log data gathered from the real-world public social tagging system \\bibs. Our results indicate that sharing of resources constitutes an important and indeed social aspect of tagging.},<br\/>  address = {Republic and Canton of Geneva, Switzerland},<br\/>  author = {Doerfel, Stephan and Zoller, Daniel and Singer, Philipp and Niebler, Thomas and Hotho, Andreas and Strohmaier, Markus},<br\/>  booktitle = {Proceedings of the Companion Publication of the 23rd International Conference on World Wide Web Companion},<br\/>  keywords = {behavior},<br\/>  pages = {251-252},<br\/>  publisher = {International World Wide Web Conferences Steering Committee},<br\/>  title = {How Social is Social Tagging?},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0ae6feb82aecc69d9cb7f9e21caa3702\"><p>%0 Conference Paper<br\/>%1 doerfel2014social<br\/>%A Doerfel, Stephan<br\/>%A Zoller, Daniel<br\/>%A Singer, Philipp<br\/>%A Niebler, Thomas<br\/>%A Hotho, Andreas<br\/>%A Strohmaier, Markus<br\/>%B Proceedings of the Companion Publication of the 23rd International Conference on World Wide Web Companion<br\/>%C Republic and Canton of Geneva, Switzerland<br\/>%D 2014<br\/>%I International World Wide Web Conferences Steering Committee<br\/>%P 251-252<br\/>%R 10.1145\/2567948.2577301<br\/>%T How Social is Social Tagging?<br\/>%U http:\/\/dx.doi.org\/10.1145\/2567948.2577301<br\/>%X Social tagging systems have established themselves as an important part in today's web and have attracted the interest of our research community in a variety of investigations. This has led to several assumptions about tagging, such as that tagging systems exhibit a social component. In this work we overcome the previous absence of data for testing such an assumption. We thoroughly study social interaction, leveraging for the first time live log data gathered from the real-world public social tagging system \\bibs. Our results indicate that sharing of resources constitutes an important and indeed social aspect of tagging.<br\/>%@ 978-1-4503-2745-9<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Behrenbruch, K., Hoffmann, A., Kibanov, M., Macek, B.-E., Scholz, C., Skistims, H., S\u00f6llner, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Socio-technical Design of Ubiquitous Computing Systems}<\/span>.<\/span> Presented at the , Heidelberg, Germany (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-79f9960366ea2bd627fc1577eeab870f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-79f9960366ea2bd627fc1577eeab870f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/79f9960366ea2bd627fc1577eeab870f\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-79f9960366ea2bd627fc1577eeab870f\"><p>@incollection{atzmueller2014sociotechnical,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin and Behrenbruch, Kay and Hoffmann, Axel and Kibanov, Mark and Macek, Bjoern-Elmar and Scholz, Christoph and Skistims, Hendrik and S\u00f6llner, Matthias and Stumme, Gerd},<br\/>  chapter = {{Connect-U: A System for Enhancing Social Networking}},<br\/>  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan-Marco and Ro\u00dfnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Socio-technical Design of Ubiquitous Computing Systems}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-79f9960366ea2bd627fc1577eeab870f\"><p>%0 Book Section<br\/>%1 atzmueller2014sociotechnical<br\/>%A Atzmueller, Martin<br\/>%A Behrenbruch, Kay<br\/>%A Hoffmann, Axel<br\/>%A Kibanov, Mark<br\/>%A Macek, Bjoern-Elmar<br\/>%A Scholz, Christoph<br\/>%A Skistims, Hendrik<br\/>%A S\u00f6llner, Matthias<br\/>%A Stumme, Gerd<br\/>%C Heidelberg, Germany<br\/>%D 2014<br\/>%E David, Klaus<br\/>%E Geihs, Kurt<br\/>%E Leimeister, Jan-Marco<br\/>%E Ro\u00dfnagel, Alexander<br\/>%E Schmidt, Ludger<br\/>%E Stumme, Gerd<br\/>%E Wacker, Arno<br\/>%I Springer Verlag<br\/>%T {Socio-technical Design of Ubiquitous Computing Systems}<br\/>%& {Connect-U: A System for Enhancing Social Networking}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Evolution and Dynamics of Student Interaction on Networks of Face-to-Face Proximity}<\/span>.<\/span> In: Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK. , London, UK (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-35b065d3afc739bc42118a3b85ea57d0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-35b065d3afc739bc42118a3b85ea57d0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/35b065d3afc739bc42118a3b85ea57d0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-35b065d3afc739bc42118a3b85ea57d0\"><p>@inproceedings{ATSK:14,<br\/>  address = {London, UK},<br\/>  author = {Atzmueller, Martin and Thiele, Lisa and Stumme, Gerd and Kauffeld, Simone},<br\/>  booktitle = {Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK},<br\/>  keywords = {itegpub},<br\/>  title = {{Evolution and Dynamics of Student Interaction on Networks of Face-to-Face Proximity}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-35b065d3afc739bc42118a3b85ea57d0\"><p>%0 Conference Paper<br\/>%1 ATSK:14<br\/>%A Atzmueller, Martin<br\/>%A Thiele, Lisa<br\/>%A Stumme, Gerd<br\/>%A Kauffeld, Simone<br\/>%B Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK<br\/>%C London, UK<br\/>%D 2014<br\/>%T {Evolution and Dynamics of Student Interaction on Networks of Face-to-Face Proximity}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Link Prediction and the Role of Stronger Ties in Networks of Face-to-Face Proximity<\/span>.<\/span> CoRR. abs\/1407.2161, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9c8ecf3df858805b00a204d7d7d40bea\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9c8ecf3df858805b00a204d7d7d40bea\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9c8ecf3df858805b00a204d7d7d40bea\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9c8ecf3df858805b00a204d7d7d40bea\"><p>@article{DBLP:journals\/corr\/SAS_Arxiv14,<br\/>  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},<br\/>  journal = {CoRR},<br\/>  keywords = {itegpub},<br\/>  title = {Link Prediction and the Role of Stronger Ties in Networks of Face-to-Face Proximity},<br\/>  volume = {abs\/1407.2161},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9c8ecf3df858805b00a204d7d7d40bea\"><p>%0 Journal Article<br\/>%1 DBLP:journals\/corr\/SAS_Arxiv14<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%D 2014<br\/>%J CoRR<br\/>%T Link Prediction and the Role of Stronger Ties in Networks of Face-to-Face Proximity<br\/>%V abs\/1407.2161<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Singer, P., Niebler, T., Hotho, A., Strohmaier, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Folksonomies<\/span>.<\/span> In: Encyclopedia of Social Network Analysis and Mining. pp. 542\u2013547. Springer (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-84d9498b73de976d8d550c6761d4be0d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-84d9498b73de976d8d550c6761d4be0d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/84d9498b73de976d8d550c6761d4be0d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-84d9498b73de976d8d550c6761d4be0d\"><p>@incollection{singer2014folksonomies,<br\/>  author = {Singer, Philipp and Niebler, Thomas and Hotho, Andreas and Strohmaier, Markus},<br\/>  booktitle = {Encyclopedia of Social Network Analysis and Mining},<br\/>  keywords = {characterization},<br\/>  pages = {542--547},<br\/>  publisher = {Springer},<br\/>  title = {Folksonomies},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-84d9498b73de976d8d550c6761d4be0d\"><p>%0 Book Section<br\/>%1 singer2014folksonomies<br\/>%A Singer, Philipp<br\/>%A Niebler, Thomas<br\/>%A Hotho, Andreas<br\/>%A Strohmaier, Markus<br\/>%B Encyclopedia of Social Network Analysis and Mining<br\/>%D 2014<br\/>%I Springer<br\/>%P 542--547<br\/>%T Folksonomies<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Jannach, D., Freyne, J., Geyer, W., Guy, I., Hotho, A., Mobasher, B. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the 6th Workshop on Recommender Systems and the Social Web (RSWeb 2014) co-located with the 8th {ACM} Conference on Recommender Systems (RecSys 2014), Foster City, CA, USA, October 6, 2014<\/span>.<\/span> CEUR-WS.org (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1271\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-09cb7c63e60bd3c5e6773c9c871a8aba\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-09cb7c63e60bd3c5e6773c9c871a8aba\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/09cb7c63e60bd3c5e6773c9c871a8aba\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-09cb7c63e60bd3c5e6773c9c871a8aba\"><p>@proceedings{jannach2014proceedings,<br\/>  editor = {Jannach, Dietmar and Freyne, Jill and Geyer, Werner and Guy, Ido and Hotho, Andreas and Mobasher, Bamshad},<br\/>  keywords = {recommender},<br\/>  publisher = {CEUR-WS.org},<br\/>  series = {{CEUR} Workshop Proceedings},<br\/>  title = {Proceedings of the 6th Workshop on Recommender Systems and the Social Web (RSWeb 2014) co-located with the 8th {ACM} Conference on Recommender Systems (RecSys 2014), Foster City, CA, USA, October 6, 2014},<br\/>  volume = 1271,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-09cb7c63e60bd3c5e6773c9c871a8aba\"><p>%0 Conference Proceedings<br\/>%1 jannach2014proceedings<br\/>%B {CEUR} Workshop Proceedings<br\/>%D 2014<br\/>%E Jannach, Dietmar<br\/>%E Freyne, Jill<br\/>%E Geyer, Werner<br\/>%E Guy, Ido<br\/>%E Hotho, Andreas<br\/>%E Mobasher, Bamshad<br\/>%I CEUR-WS.org<br\/>%T Proceedings of the 6th Workshop on Recommender Systems and the Social Web (RSWeb 2014) co-located with the 8th {ACM} Conference on Recommender Systems (RecSys 2014), Foster City, CA, USA, October 6, 2014<br\/>%U http:\/\/ceur-ws.org\/Vol-1271<br\/>%V 1271<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Yang, S., Lerman, K., She, J., Atzmueller, M. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings of the 2014 International Conference on Social Computing, Beijing, China, August 04 - 07, 2014}<\/span>.<\/span> {ACM} (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9c4fc5b0a81cbdeef7336c1d17d390ce\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9c4fc5b0a81cbdeef7336c1d17d390ce\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9c4fc5b0a81cbdeef7336c1d17d390ce\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9c4fc5b0a81cbdeef7336c1d17d390ce\"><p>@proceedings{YLSA:14,<br\/>  editor = {Yang, Su and Lerman, Kristina and She, James and Atzmueller, Martin},<br\/>  keywords = {itegpub},<br\/>  publisher = {{ACM}},<br\/>  title = {{Proceedings of the 2014 International Conference on Social Computing, Beijing, China, August 04 - 07, 2014}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9c4fc5b0a81cbdeef7336c1d17d390ce\"><p>%0 Conference Proceedings<br\/>%1 YLSA:14<br\/>%D 2014<br\/>%E Yang, Su<br\/>%E Lerman, Kristina<br\/>%E She, James<br\/>%E Atzmueller, Martin<br\/>%I {ACM}<br\/>%T {Proceedings of the 2014 International Conference on Social Computing, Beijing, China, August 04 - 07, 2014}<br\/>%@ 978-1-4503-2888-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., Zoller, D., Singer, P., Niebler, T., Hotho, A., Strohmaier, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Evaluating Assumptions about Social Tagging - A Study of User Behavior in BibSonomy<\/span>.<\/span> In: Seidl, T., Hassani, M., and Beecks, C. (eds.) Proceedings of the 16th LWA Workshops: KDML, IR and FGWM, Aachen, Germany, September 8-10, 2014. pp. 18\u201319. CEUR-WS.org (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1226\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4b2e73c82b5a84e1959ad66aaad4a235\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4b2e73c82b5a84e1959ad66aaad4a235\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4b2e73c82b5a84e1959ad66aaad4a235\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-4b2e73c82b5a84e1959ad66aaad4a235\">Social tagging systems have established themselves as an important part in today\u2019s web and have attracted the interest of our research community in a variety of investigations. Henceforth, several assumptions about social tagging systems have emerged on which our community also builds their work. Yet, testing such assumptions has been difficult due to the absence of suitable usage data in the past. In this work, we investigate and evaluate four assumptions about tagging systems by examining live server log data gathered from the public social tagging system BibSonomy. Our empirical results indicate that while some of these assumptions hold to a certain extent, other assumptions need to be reflected in a very critical light.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4b2e73c82b5a84e1959ad66aaad4a235\"><p>@inproceedings{doerfel2014evaluating,<br\/>  abstract = {Social tagging systems have established themselves as an important part in today\u2019s web and have attracted the interest of our research community in a variety of investigations. Henceforth, several assumptions about social tagging systems have emerged on which our community also builds their work. Yet, testing such assumptions has been difficult due to the absence of suitable usage data in the past. In this work, we investigate and evaluate four assumptions about tagging systems by examining live server log data gathered from the public social tagging system BibSonomy. Our empirical results indicate that while some of these assumptions hold to a certain extent, other assumptions need to be reflected in a very critical light.},<br\/>  author = {Doerfel, Stephan and Zoller, Daniel and Singer, Philipp and Niebler, Thomas and Hotho, Andreas and Strohmaier, Markus},<br\/>  booktitle = {Proceedings of the 16th LWA Workshops: KDML, IR and FGWM, Aachen, Germany, September 8-10, 2014.},<br\/>  editor = {Seidl, Thomas and Hassani, Marwan and Beecks, Christian},<br\/>  keywords = {behavior},<br\/>  pages = {18-19},<br\/>  publisher = {CEUR-WS.org},<br\/>  title = {Evaluating Assumptions about Social Tagging - A Study of User Behavior in BibSonomy},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4b2e73c82b5a84e1959ad66aaad4a235\"><p>%0 Conference Paper<br\/>%1 doerfel2014evaluating<br\/>%A Doerfel, Stephan<br\/>%A Zoller, Daniel<br\/>%A Singer, Philipp<br\/>%A Niebler, Thomas<br\/>%A Hotho, Andreas<br\/>%A Strohmaier, Markus<br\/>%B Proceedings of the 16th LWA Workshops: KDML, IR and FGWM, Aachen, Germany, September 8-10, 2014.<br\/>%D 2014<br\/>%E Seidl, Thomas<br\/>%E Hassani, Marwan<br\/>%E Beecks, Christian<br\/>%I CEUR-WS.org<br\/>%P 18-19<br\/>%T Evaluating Assumptions about Social Tagging - A Study of User Behavior in BibSonomy<br\/>%U http:\/\/ceur-ws.org\/Vol-1226\/<br\/>%X Social tagging systems have established themselves as an important part in today\u2019s web and have attracted the interest of our research community in a variety of investigations. Henceforth, several assumptions about social tagging systems have emerged on which our community also builds their work. Yet, testing such assumptions has been difficult due to the absence of suitable usage data in the past. In this work, we investigate and evaluate four assumptions about tagging systems by examining live server log data gathered from the public social tagging system BibSonomy. Our empirical results indicate that while some of these assumptions hold to a certain extent, other assumptions need to be reflected in a very critical light.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., Hotho, A., J\u00e4schke, R., Mitzlaff, F., Mueller, J. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">ECML PKDD Discovery Challenge - Recommending Given Names<\/span>.<\/span> CEUR-WS (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1120\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ec51992c492a2b4bf96d8e5719645639\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ec51992c492a2b4bf96d8e5719645639\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ec51992c492a2b4bf96d8e5719645639\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-ec51992c492a2b4bf96d8e5719645639\">All over the world, future parents are facing the task of finding a suitable given name for their children. Their choice is usually influenced by a variety of 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. Since 1999 the ECML PKDD embraces the tradition of organizing a Discovery Challenge, allowing researchers to develop and test algorithms for novel and real world datasets. The Discovery Challenge 20131 tackled the task of recommending given names in the context of the name search engine Nameling. It consisted of an offline and an online phase. In both phases, participants were asked to create a name recommendation algorithm that could provide suitable suggestions of given names to users of Nameling. More than 40 participants\/teams registered for the challenge, of which 17 handed in predictions of the offline challenge. After the end of the offline phase 6 teams submitted a paper. All papers have been peer reviewed and can be found in these proceedings. The different approaches to the challenge are presented at the ECML PKDD workshop on September 27th, 2013, in Prague, Czech Republic. The online challenge ran until the day before the workshop and four teams successfully participated with implementations meeting all required criteria. Details of the two challenge tasks, winners of both phases and an overview of the main findings are presented in the first paper of these proceedings.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ec51992c492a2b4bf96d8e5719645639\"><p>@proceedings{doerfel2014discovery,<br\/>  abstract = {All over the world, future parents are facing the task of finding a suitable given name for their children. Their choice is usually influenced by a variety of 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. Since 1999 the ECML PKDD embraces the tradition of organizing a Discovery Challenge, allowing researchers to develop and test algorithms for novel and real world datasets. The Discovery Challenge 20131 tackled the task of recommending given names in the context of the name search engine Nameling. It consisted of an offline and an online phase. In both phases, participants were asked to create a name recommendation algorithm that could provide suitable suggestions of given names to users of Nameling. More than 40 participants\/teams registered for the challenge, of which 17 handed in predictions of the offline challenge. After the end of the offline phase 6 teams submitted a paper. All papers have been peer reviewed and can be found in these proceedings. The different approaches to the challenge are presented at the ECML PKDD workshop on September 27th, 2013, in Prague, Czech Republic. The online challenge ran until the day before the workshop and four teams successfully participated with implementations meeting all required criteria. Details of the two challenge tasks, winners of both phases and an overview of the main findings are presented in the first paper of these proceedings.},<br\/>  editor = {Doerfel, Stephan and Hotho, Andreas and J\u00e4schke, Robert and Mitzlaff, Folke and Mueller, Juergen},<br\/>  keywords = {nameling},<br\/>  publisher = {CEUR-WS},<br\/>  title = {ECML PKDD Discovery Challenge - Recommending Given Names},<br\/>  volume = 1120,<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ec51992c492a2b4bf96d8e5719645639\"><p>%0 Conference Proceedings<br\/>%1 doerfel2014discovery<br\/>%D 2014<br\/>%E Doerfel, Stephan<br\/>%E Hotho, Andreas<br\/>%E J\u00e4schke, Robert<br\/>%E Mitzlaff, Folke<br\/>%E Mueller, Juergen<br\/>%I CEUR-WS<br\/>%T ECML PKDD Discovery Challenge - Recommending Given Names<br\/>%U http:\/\/ceur-ws.org\/Vol-1120\/<br\/>%V 1120<br\/>%X All over the world, future parents are facing the task of finding a suitable given name for their children. Their choice is usually influenced by a variety of 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. Since 1999 the ECML PKDD embraces the tradition of organizing a Discovery Challenge, allowing researchers to develop and test algorithms for novel and real world datasets. The Discovery Challenge 20131 tackled the task of recommending given names in the context of the name search engine Nameling. It consisted of an offline and an online phase. In both phases, participants were asked to create a name recommendation algorithm that could provide suitable suggestions of given names to users of Nameling. More than 40 participants\/teams registered for the challenge, of which 17 handed in predictions of the offline challenge. After the end of the offline phase 6 teams submitted a paper. All papers have been peer reviewed and can be found in these proceedings. The different approaches to the challenge are presented at the ECML PKDD workshop on September 27th, 2013, in Prague, Czech Republic. The online challenge ran until the day before the workshop and four teams successfully participated with implementations meeting all required criteria. Details of the two challenge tasks, winners of both phases and an overview of the main findings are presented in the first paper of these proceedings.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Behrenbruch, K., Hoffmann, A., Kibanov, M., Macek, B.-E., Scholz, C., Skistims, H., S\u00f6llner, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Connect-U: A System for Enhancing Social Networking}<\/span>.<\/span> In: David, K., Geihs, K., Leimeister, J.-M., Ro\u00dfnagel, A., Schmidt, L., Stumme, G., and Wacker, A. (eds.) {Socio-technical Design of Ubiquitous Computing Systems}. Springer Verlag, Heidelberg, Germany (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-afbf4cb8505f83b1384b7471ab599abf\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-afbf4cb8505f83b1384b7471ab599abf\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/afbf4cb8505f83b1384b7471ab599abf\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-afbf4cb8505f83b1384b7471ab599abf\"><p>@incollection{ABHKMSSSS:14,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin and Behrenbruch, Kay and Hoffmann, Axel and Kibanov, Mark and Macek, Bjoern-Elmar and Scholz, Christoph and Skistims, Hendrik and S\u00f6llner, Matthias and Stumme, Gerd},<br\/>  booktitle = {{Socio-technical Design of Ubiquitous Computing Systems}},<br\/>  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan-Marco and Ro\u00dfnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},<br\/>  keywords = {network},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Connect-U: A System for Enhancing Social Networking}},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-afbf4cb8505f83b1384b7471ab599abf\"><p>%0 Book Section<br\/>%1 ABHKMSSSS:14<br\/>%A Atzmueller, Martin<br\/>%A Behrenbruch, Kay<br\/>%A Hoffmann, Axel<br\/>%A Kibanov, Mark<br\/>%A Macek, Bjoern-Elmar<br\/>%A Scholz, Christoph<br\/>%A Skistims, Hendrik<br\/>%A S\u00f6llner, Matthias<br\/>%A Stumme, Gerd<br\/>%B {Socio-technical Design of Ubiquitous Computing Systems}<br\/>%C Heidelberg, Germany<br\/>%D 2014<br\/>%E David, Klaus<br\/>%E Geihs, Kurt<br\/>%E Leimeister, Jan-Marco<br\/>%E Ro\u00dfnagel, Alexander<br\/>%E Schmidt, Ludger<br\/>%E Stumme, Gerd<br\/>%E Wacker, Arno<br\/>%I Springer Verlag<br\/>%T {Connect-U: A System for Enhancing Social Networking}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{On the Predictability of Talk Attendance at Academic Conferences (Extended Version)}<\/span>.<\/span> CoRR. abs\/1407.0613, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3c8f0d99481312cf1543184948366b94\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3c8f0d99481312cf1543184948366b94\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3c8f0d99481312cf1543184948366b94\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3c8f0d99481312cf1543184948366b94\"><p>@article{SIAS:14c,<br\/>  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},<br\/>  journal = {CoRR},<br\/>  keywords = {itegpub},<br\/>  title = {{On the Predictability of Talk Attendance at Academic Conferences (Extended Version)}},<br\/>  volume = {abs\/1407.0613},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3c8f0d99481312cf1543184948366b94\"><p>%0 Journal Article<br\/>%1 SIAS:14c<br\/>%A Scholz, Christoph<br\/>%A Illig, Jens<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%D 2014<br\/>%J CoRR<br\/>%T {On the Predictability of Talk Attendance at Academic Conferences (Extended Version)}<br\/>%V abs\/1407.0613<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., Zoller, D., Singer, P., Niebler, T., Hotho, A., Strohmaier, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Of course we share! Testing Assumptions about Social Tagging Systems<\/span><\/span>, http:\/\/arxiv.org\/abs\/1401.0629, (2014).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1401.0629\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-988ea3a9b85ec0656e27750e4080325c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-988ea3a9b85ec0656e27750e4080325c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/988ea3a9b85ec0656e27750e4080325c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-988ea3a9b85ec0656e27750e4080325c\">Social tagging systems have established themselves as an important part in today's web and have attracted the interest from our research community in a variety of investigations. The overall vision of our community is that simply through interactions with the system, i.e., through tagging and sharing of resources, users would contribute to building useful semantic structures as well as resource indexes using uncontrolled vocabulary not only due to the easy-to-use mechanics. Henceforth, a variety of assumptions about social tagging systems have emerged, yet testing them has been difficult due to the absence of suitable data. In this work we thoroughly investigate three available assumptions - e.g., is a tagging system really social? - by examining live log data gathered from the real-world public social tagging system BibSonomy. Our empirical results indicate that while some of these assumptions hold to a certain extent, other assumptions need to be reflected and viewed in a very critical light. Our observations have implications for the design of future search and other algorithms to better reflect the actual user behavior.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-988ea3a9b85ec0656e27750e4080325c\"><p>@misc{doerfel2014course,<br\/>  abstract = {Social tagging systems have established themselves as an important part in today's web and have attracted the interest from our research community in a variety of investigations. The overall vision of our community is that simply through interactions with the system, i.e., through tagging and sharing of resources, users would contribute to building useful semantic structures as well as resource indexes using uncontrolled vocabulary not only due to the easy-to-use mechanics. Henceforth, a variety of assumptions about social tagging systems have emerged, yet testing them has been difficult due to the absence of suitable data. In this work we thoroughly investigate three available assumptions - e.g., is a tagging system really social? - by examining live log data gathered from the real-world public social tagging system BibSonomy. Our empirical results indicate that while some of these assumptions hold to a certain extent, other assumptions need to be reflected and viewed in a very critical light. Our observations have implications for the design of future search and other algorithms to better reflect the actual user behavior.},<br\/>  author = {Doerfel, Stephan and Zoller, Daniel and Singer, Philipp and Niebler, Thomas and Hotho, Andreas and Strohmaier, Markus},<br\/>  keywords = {share},<br\/>  note = {cite arxiv:1401.0629},<br\/>  title = {Of course we share! Testing Assumptions about Social Tagging Systems},<br\/>  year = 2014<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-988ea3a9b85ec0656e27750e4080325c\"><p>%0 Generic<br\/>%1 doerfel2014course<br\/>%A Doerfel, Stephan<br\/>%A Zoller, Daniel<br\/>%A Singer, Philipp<br\/>%A Niebler, Thomas<br\/>%A Hotho, Andreas<br\/>%A Strohmaier, Markus<br\/>%D 2014<br\/>%T Of course we share! Testing Assumptions about Social Tagging Systems<br\/>%U http:\/\/arxiv.org\/abs\/1401.0629<br\/>%X Social tagging systems have established themselves as an important part in today's web and have attracted the interest from our research community in a variety of investigations. The overall vision of our community is that simply through interactions with the system, i.e., through tagging and sharing of resources, users would contribute to building useful semantic structures as well as resource indexes using uncontrolled vocabulary not only due to the easy-to-use mechanics. Henceforth, a variety of assumptions about social tagging systems have emerged, yet testing them has been difficult due to the absence of suitable data. In this work we thoroughly investigate three available assumptions - e.g., is a tagging system really social? - by examining live log data gathered from the real-world public social tagging system BibSonomy. Our empirical results indicate that while some of these assumptions hold to a certain extent, other assumptions need to be reflected and viewed in a very critical light. Our observations have implications for the design of future search and other algorithms to better reflect the actual user behavior.<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2013\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2013<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Chin, A., Helic, D., Hotho, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Ubiquitous Social Media Analysis}<\/span>.<\/span> Springer Verlag, Heidelberg, Germany (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-12be8dd773fdc186d1c47d74f835be89\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-12be8dd773fdc186d1c47d74f835be89\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/12be8dd773fdc186d1c47d74f835be89\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-12be8dd773fdc186d1c47d74f835be89\"><p>@proceedings{ACHH:13,<br\/>  address = {Heidelberg, Germany},<br\/>  booktitle = {MSM\/MUSE Postproceedings 2013},<br\/>  editor = {Atzmueller, Martin and Chin, Alvin and Helic, Denis and Hotho, Andreas},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {{Ubiquitous Social Media Analysis}},<br\/>  volume = 8329,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-12be8dd773fdc186d1c47d74f835be89\"><p>%0 Conference Proceedings<br\/>%1 ACHH:13<br\/>%B MSM\/MUSE Postproceedings 2013<br\/>%C Heidelberg, Germany<br\/>%D 2013<br\/>%E Atzmueller, Martin<br\/>%E Chin, Alvin<br\/>%E Helic, Denis<br\/>%E Hotho, Andreas<br\/>%I Springer Verlag<br\/>%T {Ubiquitous Social Media Analysis}<br\/>%V 8329<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Rudolph, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Attribute Exploration on the Web<\/span>.<\/span> In: Cellier, P., Distel, F., and Ganter, B. (eds.) Contributions to the 11th International Conference on Formal Concept Analysis. pp. 19\u201334. Technische Universit\u00e4t Dresden (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/nbn-resolving.de\/urn:nbn:de:bsz:14-qucosa-113133\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-45e900e280661d775d8da949baee3747\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-45e900e280661d775d8da949baee3747\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/45e900e280661d775d8da949baee3747\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-45e900e280661d775d8da949baee3747\">We propose an approach for supporting attribute exploration by web information retrieval, in particular by posing appropriate queries to search engines, crowd sourcing systems, and the linked open data cloud. We discuss underlying general assumptions for this to work and the degree to which these can be taken for granted.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-45e900e280661d775d8da949baee3747\"><p>@inproceedings{jaeschke2013attribute,<br\/>  abstract = {We propose an approach for supporting attribute exploration by web information retrieval, in particular by posing appropriate queries to search engines, crowd sourcing systems, and the linked open data cloud. We discuss underlying general assumptions for this to work and the degree to which these can be taken for granted.},<br\/>  author = {J\u00e4schke, Robert and Rudolph, Sebastian},<br\/>  booktitle = {Contributions to the 11th International Conference on Formal Concept Analysis},<br\/>  editor = {Cellier, Peggy and Distel, Felix and Ganter, Bernhard},<br\/>  keywords = {linked},<br\/>  month = {05},<br\/>  organization = {Technische Universit\u00e4t Dresden},<br\/>  pages = {19--34},<br\/>  title = {Attribute Exploration on the Web},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-45e900e280661d775d8da949baee3747\"><p>%0 Conference Paper<br\/>%1 jaeschke2013attribute<br\/>%A J\u00e4schke, Robert<br\/>%A Rudolph, Sebastian<br\/>%B Contributions to the 11th International Conference on Formal Concept Analysis<br\/>%D 2013<br\/>%E Cellier, Peggy<br\/>%E Distel, Felix<br\/>%E Ganter, Bernhard<br\/>%P 19--34<br\/>%T Attribute Exploration on the Web<br\/>%U http:\/\/nbn-resolving.de\/urn:nbn:de:bsz:14-qucosa-113133<br\/>%X We propose an approach for supporting attribute exploration by web information retrieval, in particular by posing appropriate queries to search engines, crowd sourcing systems, and the linked open data cloud. We discuss underlying general assumptions for this to work and the degree to which these can be taken for granted.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Becker, M., Caminiti, S., Fiorella, D., Francis, L., Gravino, P., Haklay, M. (Muki), Hotho, A., Loreto, V., Mueller, J., Ricchiuti, F., Servedio, V.D.P., S\u00eerbu, A., Tria, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Awareness and Learning in Participatory Noise Sensing<\/span>.<\/span> PLOS ONE. 8, e81638 (2013). https:\/\/doi.org\/10.1371\/journal.pone.0081638.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1371\/journal.pone.0081638\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4b843a252dfa2c2616c18aea426f9861\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4b843a252dfa2c2616c18aea426f9861\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1371\/journal.pone.0081638\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4b843a252dfa2c2616c18aea426f9861\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-4b843a252dfa2c2616c18aea426f9861\">The development of ICT infrastructures has facilitated the emergence of new paradigms for looking at society and the environment over the last few years. Participatory environmental sensing, i.e. directly involving citizens in environmental monitoring, is one example, which is hoped to encourage learning and enhance awareness of environmental issues. In this paper, an analysis of the behaviour of individuals involved in noise sensing is presented. Citizens have been involved in noise measuring activities through the WideNoise smartphone application. This application has been designed to record both objective (noise samples) and subjective (opinions, feelings) data. The application has been open to be used freely by anyone and has been widely employed worldwide. In addition, several test cases have been organised in European countries. Based on the information submitted by users, an analysis of emerging awareness and learning is performed. The data show that changes in the way the environment is perceived after repeated usage of the application do appear. Specifically, users learn how to recognise different noise levels they are exposed to. Additionally, the subjective data collected indicate an increased user involvement in time and a categorisation effect between pleasant and less pleasant environments.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4b843a252dfa2c2616c18aea426f9861\"><p>@article{mueller-2013d,<br\/>  abstract = {The development of ICT infrastructures has facilitated the emergence of new paradigms for looking at society and the environment over the last few years. Participatory environmental sensing, i.e. directly involving citizens in environmental monitoring, is one example, which is hoped to encourage learning and enhance awareness of environmental issues. In this paper, an analysis of the behaviour of individuals involved in noise sensing is presented. Citizens have been involved in noise measuring activities through the WideNoise smartphone application. This application has been designed to record both objective (noise samples) and subjective (opinions, feelings) data. The application has been open to be used freely by anyone and has been widely employed worldwide. In addition, several test cases have been organised in European countries. Based on the information submitted by users, an analysis of emerging awareness and learning is performed. The data show that changes in the way the environment is perceived after repeated usage of the application do appear. Specifically, users learn how to recognise different noise levels they are exposed to. Additionally, the subjective data collected indicate an increased user involvement in time and a categorisation effect between pleasant and less pleasant environments.},<br\/>  author = {Becker, Martin and Caminiti, Saverio and Fiorella, Donato and Francis, Louise and Gravino, Pietro and Haklay, Mordechai (Muki) and Hotho, Andreas and Loreto, Vittorio and Mueller, Juergen and Ricchiuti, Ferdinando and Servedio, Vito D. P. and S\u00eerbu, Alina and Tria, Francesca},<br\/>  journal = {PLOS ONE},<br\/>  keywords = {EveryAware},<br\/>  month = 12,<br\/>  number = 12,<br\/>  pages = {e81638},<br\/>  title = {Awareness and Learning in Participatory Noise Sensing},<br\/>  volume = 8,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4b843a252dfa2c2616c18aea426f9861\"><p>%0 Journal Article<br\/>%1 mueller-2013d<br\/>%A Becker, Martin<br\/>%A Caminiti, Saverio<br\/>%A Fiorella, Donato<br\/>%A Francis, Louise<br\/>%A Gravino, Pietro<br\/>%A Haklay, Mordechai (Muki)<br\/>%A Hotho, Andreas<br\/>%A Loreto, Vittorio<br\/>%A Mueller, Juergen<br\/>%A Ricchiuti, Ferdinando<br\/>%A Servedio, Vito D. P.<br\/>%A S\u00eerbu, Alina<br\/>%A Tria, Francesca<br\/>%D 2013<br\/>%J PLOS ONE<br\/>%N 12<br\/>%P e81638<br\/>%R 10.1371\/journal.pone.0081638<br\/>%T Awareness and Learning in Participatory Noise Sensing<br\/>%U http:\/\/dx.doi.org\/10.1371\/journal.pone.0081638<br\/>%V 8<br\/>%X The development of ICT infrastructures has facilitated the emergence of new paradigms for looking at society and the environment over the last few years. Participatory environmental sensing, i.e. directly involving citizens in environmental monitoring, is one example, which is hoped to encourage learning and enhance awareness of environmental issues. In this paper, an analysis of the behaviour of individuals involved in noise sensing is presented. Citizens have been involved in noise measuring activities through the WideNoise smartphone application. This application has been designed to record both objective (noise samples) and subjective (opinions, feelings) data. The application has been open to be used freely by anyone and has been widely employed worldwide. In addition, several test cases have been organised in European countries. Based on the information submitted by users, an analysis of emerging awareness and learning is performed. The data show that changes in the way the environment is perceived after repeated usage of the application do appear. Specifically, users learn how to recognise different noise levels they are exposed to. Additionally, the subjective data collected indicate an increased user involvement in time and a categorisation effect between pleasant and less pleasant environments.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">An analysis of tag-recommender evaluation procedures<\/span>.<\/span> In: Proceedings of the 7th ACM conference on Recommender systems. pp. 343\u2013346. ACM, Hong Kong, China (2013). https:\/\/doi.org\/10.1145\/2507157.2507222.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/doerfel2013analysis.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-aa4b3d79a362d7415aaa77625b590dfa\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-aa4b3d79a362d7415aaa77625b590dfa\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2507157.2507222\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/aa4b3d79a362d7415aaa77625b590dfa\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-aa4b3d79a362d7415aaa77625b590dfa\">Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-aa4b3d79a362d7415aaa77625b590dfa\"><p>@inproceedings{doerfel2013analysis,<br\/>  abstract = {Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Doerfel, Stephan and J\u00e4schke, Robert},<br\/>  booktitle = {Proceedings of the 7th ACM conference on Recommender systems},<br\/>  keywords = {bookmarking},<br\/>  pages = {343--346},<br\/>  publisher = {ACM},<br\/>  series = {RecSys '13},<br\/>  title = {An analysis of tag-recommender evaluation procedures},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-aa4b3d79a362d7415aaa77625b590dfa\"><p>%0 Conference Paper<br\/>%1 doerfel2013analysis<br\/>%A Doerfel, Stephan<br\/>%A J\u00e4schke, Robert<br\/>%B Proceedings of the 7th ACM conference on Recommender systems<br\/>%C New York, NY, USA<br\/>%D 2013<br\/>%I ACM<br\/>%P 343--346<br\/>%R 10.1145\/2507157.2507222<br\/>%T An analysis of tag-recommender evaluation procedures<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/doerfel2013analysis.pdf<br\/>%X Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.<br\/>%@ 978-1-4503-2409-0<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Chin, A., Helic, D., Hotho, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ubiquitous Social Media Analysis Third International Workshops, MUSE 2012, Bristol, UK, September 24, 2012, and MSM 2012, Milwaukee, WI, USA, June 25, 2012, Revised Selected Papers<\/span>.<\/span> Imprint: Springer, Berlin, Heidelberg (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/link.springer.com\/book\/10.1007\/978-3-642-45392-2\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1e2d036351662d35ef95719554d37e46\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1e2d036351662d35ef95719554d37e46\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1e2d036351662d35ef95719554d37e46\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1e2d036351662d35ef95719554d37e46\"><p>@book{atzmueller2013ubiquitous,<br\/>  address = {Berlin, Heidelberg},<br\/>  editor = {Atzmueller, Martin and Chin, Alvin and Helic, Denis and Hotho, Andreas},<br\/>  keywords = {bibsonomy},<br\/>  publisher = {Imprint: Springer},<br\/>  title = {Ubiquitous Social Media Analysis Third International Workshops, MUSE 2012, Bristol, UK, September 24, 2012, and MSM 2012, Milwaukee, WI, USA, June 25, 2012, Revised Selected Papers},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1e2d036351662d35ef95719554d37e46\"><p>%0 Book<br\/>%1 atzmueller2013ubiquitous<br\/>%C Berlin, Heidelberg<br\/>%D 2013<br\/>%E Atzmueller, Martin<br\/>%E Chin, Alvin<br\/>%E Helic, Denis<br\/>%E Hotho, Andreas<br\/>%I Imprint: Springer<br\/>%T Ubiquitous Social Media Analysis Third International Workshops, MUSE 2012, Bristol, UK, September 24, 2012, and MSM 2012, Milwaukee, WI, USA, June 25, 2012, Revised Selected Papers<br\/>%U http:\/\/link.springer.com\/book\/10.1007\/978-3-642-45392-2<br\/>%@ 9783642453915 3642453910 9783642453922 3642453929<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mueller, J., Doerfel, S., Becker, M., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Tag Recommendations for SensorFolkSonomies<\/span>.<\/span> In: Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings. CEUR-WS, Aachen, Germany (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1066\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2bab3f013052bc741e795c5c61aea5c9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2bab3f013052bc741e795c5c61aea5c9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2bab3f013052bc741e795c5c61aea5c9\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-2bab3f013052bc741e795c5c61aea5c9\">With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2bab3f013052bc741e795c5c61aea5c9\"><p>@inproceedings{mueller2013recommendations,<br\/>  abstract = {With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.},<br\/>  address = {Aachen, Germany},<br\/>  author = {Mueller, Juergen and Doerfel, Stephan and Becker, Martin and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings},<br\/>  keywords = {recommender},<br\/>  publisher = {CEUR-WS},<br\/>  title = {Tag Recommendations for SensorFolkSonomies},<br\/>  volume = 1066,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2bab3f013052bc741e795c5c61aea5c9\"><p>%0 Conference Paper<br\/>%1 mueller2013recommendations<br\/>%A Mueller, Juergen<br\/>%A Doerfel, Stephan<br\/>%A Becker, Martin<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings<br\/>%C Aachen, Germany<br\/>%D 2013<br\/>%I CEUR-WS<br\/>%T Tag Recommendations for SensorFolkSonomies<br\/>%U http:\/\/ceur-ws.org\/Vol-1066\/<br\/>%V 1066<br\/>%X With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Becker, M., Mueller, J., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Generic Platform for Ubiquitous and Subjective Data<\/span>.<\/span> In: 1st International Workshop on Pervasive Urban Crowdsensing Architecture and Applications, PUCAA 2013, Zurich, Switzerland -- September 9, 2013. Proceedings. p. New York, NY, USA. ACM (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-35eef1ecdac9d83d3bfbcac22c31984a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-35eef1ecdac9d83d3bfbcac22c31984a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/35eef1ecdac9d83d3bfbcac22c31984a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-35eef1ecdac9d83d3bfbcac22c31984a\">An increasing number of platforms like Xively or ThingSpeak are available to manage ubiquitous sensor data enabling the Internet of Things. Strict data formats allow interoperability and informative visualizations, supporting the development of custom user applications. Yet, these strict data formats as well as the common feed-centric approach limit the flexibility of these platforms. We aim at providing a concept that supports data ranging from text-based formats like JSON to images and video footage. Furthermore, we introduce the concept of extensions, which allows to enrich existing data points with additional information, thus, taking a data point centric approach. This enables us to gain semantic and user specific context by attaching subjective data to objective values. This paper provides an overview of our architecture including concept, implementation details and present applications. We distinguish our approach from several other systems and describe two sensing applications namely AirProbe and WideNoise that were implemented for our platform.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-35eef1ecdac9d83d3bfbcac22c31984a\"><p>@inproceedings{mueller-2013a,<br\/>  abstract = {An increasing number of platforms like Xively or ThingSpeak are available to manage ubiquitous sensor data enabling the Internet of Things. Strict data formats allow interoperability and informative visualizations, supporting the development of custom user applications. Yet, these strict data formats as well as the common feed-centric approach limit the flexibility of these platforms. We aim at providing a concept that supports data ranging from text-based formats like JSON to images and video footage. Furthermore, we introduce the concept of extensions, which allows to enrich existing data points with additional information, thus, taking a data point centric approach. This enables us to gain semantic and user specific context by attaching subjective data to objective values. This paper provides an overview of our architecture including concept, implementation details and present applications. We distinguish our approach from several other systems and describe two sensing applications namely AirProbe and WideNoise that were implemented for our platform.},<br\/>  author = {Becker, Martin and Mueller, Juergen and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {1st International Workshop on Pervasive Urban Crowdsensing Architecture and Applications, PUCAA 2013, Zurich, Switzerland -- September 9, 2013. Proceedings},<br\/>  keywords = {platform},<br\/>  note = {Accepted for publication},<br\/>  pages = {New York, NY, USA},<br\/>  publisher = {ACM},<br\/>  title = {A Generic Platform for Ubiquitous and Subjective Data},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-35eef1ecdac9d83d3bfbcac22c31984a\"><p>%0 Conference Paper<br\/>%1 mueller-2013a<br\/>%A Becker, Martin<br\/>%A Mueller, Juergen<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B 1st International Workshop on Pervasive Urban Crowdsensing Architecture and Applications, PUCAA 2013, Zurich, Switzerland -- September 9, 2013. Proceedings<br\/>%D 2013<br\/>%I ACM<br\/>%P New York, NY, USA<br\/>%T A Generic Platform for Ubiquitous and Subjective Data<br\/>%X An increasing number of platforms like Xively or ThingSpeak are available to manage ubiquitous sensor data enabling the Internet of Things. Strict data formats allow interoperability and informative visualizations, supporting the development of custom user applications. Yet, these strict data formats as well as the common feed-centric approach limit the flexibility of these platforms. We aim at providing a concept that supports data ranging from text-based formats like JSON to images and video footage. Furthermore, we introduce the concept of extensions, which allows to enrich existing data points with additional information, thus, taking a data point centric approach. This enables us to gain semantic and user specific context by attaching subjective data to objective values. This paper provides an overview of our architecture including concept, implementation details and present applications. We distinguish our approach from several other systems and describe two sensing applications namely AirProbe and WideNoise that were implemented for our platform.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Recommending Given Names<\/span><\/span>, http:\/\/arxiv.org\/abs\/1302.4412, (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1302.4412\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-41f92650f0f7d78366febc1832cedba9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-41f92650f0f7d78366febc1832cedba9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/41f92650f0f7d78366febc1832cedba9\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-41f92650f0f7d78366febc1832cedba9\">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.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-41f92650f0f7d78366febc1832cedba9\"><p>@misc{mitzlaff2013recommending,<br\/>  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.},<br\/>  author = {Mitzlaff, Folke and Stumme, Gerd},<br\/>  keywords = {nameling},<br\/>  note = {cite arxiv:1302.4412Comment: Baseline results for the ECML PKDD Discovery Challenge 2013},<br\/>  title = {Recommending Given Names},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-41f92650f0f7d78366febc1832cedba9\"><p>%0 Generic<br\/>%1 mitzlaff2013recommending<br\/>%A Mitzlaff, Folke<br\/>%A Stumme, Gerd<br\/>%D 2013<br\/>%T Recommending Given Names<br\/>%U http:\/\/arxiv.org\/abs\/1302.4412<br\/>%X 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.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Onomastics 2.0 - The Power of Social Co-Occurrences<\/span><\/span>, http:\/\/arxiv.org\/abs\/1303.0484, (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1303.0484\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0e7c394199e6b0587a880184b206af57\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0e7c394199e6b0587a880184b206af57\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0e7c394199e6b0587a880184b206af57\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-0e7c394199e6b0587a880184b206af57\">Onomastics is \"the science or study of the origin and forms of proper names of persons or places.\" [\"Onomastics\". Merriam-Webster.com, 2013. http:\/\/www.merriam-webster.com (11 February 2013)]. Especially personal names play an important role in daily life, as 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, in particular, personal taste. With the rise of the Social Web and its applications, users more and more interact digitally and participate in the creation of heterogeneous, distributed, collaborative data collections. These sources of data also reflect current and new naming trends as well as new emerging interrelations among names. The present work shows, how basic approaches from the field of social network analysis and information retrieval can be applied for discovering relations among names, thus extending Onomastics by data mining techniques. The considered approach starts with building co-occurrence graphs relative to data from the Social Web, respectively for given names and city names. As a main result, correlations between semantically grounded similarities among names (e.g., geographical distance for city names) and structural graph based similarities are observed. The discovered relations among given names are the foundation of \"nameling\" [http:\/\/nameling.net], a search engine and academic research platform for given names which attracted more than 30,000 users within four months, underpinningthe relevance of the proposed methodology.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0e7c394199e6b0587a880184b206af57\"><p>@misc{mitzlaff2013onomastics,<br\/>  abstract = {Onomastics is \"the science or study of the origin and forms of proper names of persons or places.\" [\"Onomastics\". Merriam-Webster.com, 2013. http:\/\/www.merriam-webster.com (11 February 2013)]. Especially personal names play an important role in daily life, as 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, in particular, personal taste. With the rise of the Social Web and its applications, users more and more interact digitally and participate in the creation of heterogeneous, distributed, collaborative data collections. These sources of data also reflect current and new naming trends as well as new emerging interrelations among names. The present work shows, how basic approaches from the field of social network analysis and information retrieval can be applied for discovering relations among names, thus extending Onomastics by data mining techniques. The considered approach starts with building co-occurrence graphs relative to data from the Social Web, respectively for given names and city names. As a main result, correlations between semantically grounded similarities among names (e.g., geographical distance for city names) and structural graph based similarities are observed. The discovered relations among given names are the foundation of \"nameling\" [http:\/\/nameling.net], a search engine and academic research platform for given names which attracted more than 30,000 users within four months, underpinningthe relevance of the proposed methodology.},<br\/>  author = {Mitzlaff, Folke and Stumme, Gerd},<br\/>  keywords = {nameling},<br\/>  note = {cite arxiv:1303.0484Comment: Historically, this is the first paper on the analysis of names in the context of the name search engine 'nameling'. arXiv admin note: text overlap with arXiv:1302.4412},<br\/>  title = {Onomastics 2.0 - The Power of Social Co-Occurrences},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0e7c394199e6b0587a880184b206af57\"><p>%0 Generic<br\/>%1 mitzlaff2013onomastics<br\/>%A Mitzlaff, Folke<br\/>%A Stumme, Gerd<br\/>%D 2013<br\/>%T Onomastics 2.0 - The Power of Social Co-Occurrences<br\/>%U http:\/\/arxiv.org\/abs\/1303.0484<br\/>%X Onomastics is \"the science or study of the origin and forms of proper names of persons or places.\" [\"Onomastics\". Merriam-Webster.com, 2013. http:\/\/www.merriam-webster.com (11 February 2013)]. Especially personal names play an important role in daily life, as 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, in particular, personal taste. With the rise of the Social Web and its applications, users more and more interact digitally and participate in the creation of heterogeneous, distributed, collaborative data collections. These sources of data also reflect current and new naming trends as well as new emerging interrelations among names. The present work shows, how basic approaches from the field of social network analysis and information retrieval can be applied for discovering relations among names, thus extending Onomastics by data mining techniques. The considered approach starts with building co-occurrence graphs relative to data from the Social Web, respectively for given names and city names. As a main result, correlations between semantically grounded similarities among names (e.g., geographical distance for city names) and structural graph based similarities are observed. The discovered relations among given names are the foundation of \"nameling\" [http:\/\/nameling.net], a search engine and academic research platform for given names which attracted more than 30,000 users within four months, underpinningthe relevance of the proposed methodology.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., Hotho, A., Kartal-Aydemir, A., Ro\u00dfnagel, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Informationelle Selbstbestimmung Im Web 2.0 Chancen Und Risiken Sozialer Verschlagwortungssysteme<\/span>.<\/span> Vieweg + Teubner Verlag (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.worldcat.org\/search?qt=worldcat_org_all&q=9783642380556\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2bb934c0ff3652843fd0aff97d8d7324\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2bb934c0ff3652843fd0aff97d8d7324\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2bb934c0ff3652843fd0aff97d8d7324\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2bb934c0ff3652843fd0aff97d8d7324\"><p>@book{doerfel2013informationelle,<br\/>  author = {Doerfel, Stephan and Hotho, Andreas and Kartal-Aydemir, Aliye and Ro\u00dfnagel, Alexander and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  publisher = {Vieweg + Teubner Verlag},<br\/>  title = {Informationelle Selbstbestimmung Im Web 2.0 Chancen Und Risiken Sozialer Verschlagwortungssysteme},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2bb934c0ff3652843fd0aff97d8d7324\"><p>%0 Book<br\/>%1 doerfel2013informationelle<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%A Kartal-Aydemir, Aliye<br\/>%A Ro\u00dfnagel, Alexander<br\/>%A Stumme, Gerd<br\/>%D 2013<br\/>%I Vieweg + Teubner Verlag<br\/>%T Informationelle Selbstbestimmung Im Web 2.0 Chancen Und Risiken Sozialer Verschlagwortungssysteme<br\/>%U http:\/\/www.worldcat.org\/search?qt=worldcat_org_all&q=9783642380556<br\/>%@ 9783642380556 3642380557<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzmueller, M., Stumme, G., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Semantics of User Interaction in Social Media}<\/span>.<\/span> In: Ghoshal, G., Poncela-Casasnovas, J., and Tolksdorf, R. (eds.) Complex Networks IV. Springer Verlag, Heidelberg, Germany (2013). https:\/\/doi.org\/10.1007\/978-3-642-36844-8_2.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0a35f1ed66fcd342a6a44d70c63fb735\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0a35f1ed66fcd342a6a44d70c63fb735\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-36844-8_2\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0a35f1ed66fcd342a6a44d70c63fb735\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0a35f1ed66fcd342a6a44d70c63fb735\"><p>@incollection{mitzlaff2013semantics,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Mitzlaff, Folke and Atzmueller, Martin and Stumme, Gerd and Hotho, Andreas},<br\/>  booktitle = {Complex Networks IV},<br\/>  editor = {Ghoshal, Gourab and Poncela-Casasnovas, Julia and Tolksdorf, Robert},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  series = {Studies in Computational Intelligence},<br\/>  title = {{Semantics of User Interaction in Social Media}},<br\/>  volume = 476,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0a35f1ed66fcd342a6a44d70c63fb735\"><p>%0 Book Section<br\/>%1 mitzlaff2013semantics<br\/>%A Mitzlaff, Folke<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%A Hotho, Andreas<br\/>%B Complex Networks IV<br\/>%C Heidelberg, Germany<br\/>%D 2013<br\/>%E Ghoshal, Gourab<br\/>%E Poncela-Casasnovas, Julia<br\/>%E Tolksdorf, Robert<br\/>%I Springer Verlag<br\/>%R 10.1007\/978-3-642-36844-8_2<br\/>%T {Semantics of User Interaction in Social Media}<br\/>%V 476<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Landia, N., Doerfel, S., J\u00e4schke, R., Anand, S.S., Hotho, A., Griffiths, N.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations<\/span>.<\/span> cs.IR. 1310.1498, (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/arxiv.org\/abs\/1310.1498\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e585a92994be476480545eb62d741642\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e585a92994be476480545eb62d741642\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e585a92994be476480545eb62d741642\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-e585a92994be476480545eb62d741642\">The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e585a92994be476480545eb62d741642\"><p>@article{landia2013deeper,<br\/>  abstract = {The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.},<br\/>  author = {Landia, Nikolas and Doerfel, Stephan and J\u00e4schke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan},<br\/>  journal = {cs.IR},<br\/>  keywords = {bookmarking},<br\/>  title = {Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations},<br\/>  volume = {1310.1498},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e585a92994be476480545eb62d741642\"><p>%0 Journal Article<br\/>%1 landia2013deeper<br\/>%A Landia, Nikolas<br\/>%A Doerfel, Stephan<br\/>%A J\u00e4schke, Robert<br\/>%A Anand, Sarabjot Singh<br\/>%A Hotho, Andreas<br\/>%A Griffiths, Nathan<br\/>%D 2013<br\/>%J cs.IR<br\/>%T Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations<br\/>%U http:\/\/arxiv.org\/abs\/1310.1498<br\/>%V 1310.1498<br\/>%X The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract, Resubmission)}<\/span>.<\/span> In: Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a5d94c9930fd413a404efe6d9420a752\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a5d94c9930fd413a404efe6d9420a752\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a5d94c9930fd413a404efe6d9420a752\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a5d94c9930fd413a404efe6d9420a752\"><p>@inproceedings{kibanov2013evolution,<br\/>  address = {Bamberg, Germany},<br\/>  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proc. LWA 2013 (KDML Special Track)},<br\/>  keywords = {itegpub},<br\/>  publisher = {University of Bamberg},<br\/>  title = {{Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract, Resubmission)}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a5d94c9930fd413a404efe6d9420a752\"><p>%0 Conference Paper<br\/>%1 kibanov2013evolution<br\/>%A Kibanov, Mark<br\/>%A Atzmueller, Martin<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proc. LWA 2013 (KDML Special Track)<br\/>%C Bamberg, Germany<br\/>%D 2013<br\/>%I University of Bamberg<br\/>%T {Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract, Resubmission)}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzmueller, M., Stumme, G., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{On the Semantics of User Interaction in Social Media (Extended Abstract)}<\/span>.<\/span> In: Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2013-lwa-kdml-user-semantics-social-media-extended-abstract.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d22621179875b7a97e3351a0872ed48d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d22621179875b7a97e3351a0872ed48d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d22621179875b7a97e3351a0872ed48d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d22621179875b7a97e3351a0872ed48d\"><p>@inproceedings{MASH:13b,<br\/>  address = {Bamberg, Germany},<br\/>  author = {Mitzlaff, Folke and Atzmueller, Martin and Stumme, Gerd and Hotho, Andreas},<br\/>  booktitle = {Proc. LWA 2013 (KDML Special Track)},<br\/>  keywords = {itegpub},<br\/>  publisher = {University of Bamberg},<br\/>  title = {{On the Semantics of User Interaction in Social Media (Extended Abstract)}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d22621179875b7a97e3351a0872ed48d\"><p>%0 Conference Paper<br\/>%1 MASH:13b<br\/>%A Mitzlaff, Folke<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%A Hotho, Andreas<br\/>%B Proc. LWA 2013 (KDML Special Track)<br\/>%C Bamberg, Germany<br\/>%D 2013<br\/>%I University of Bamberg<br\/>%T {On the Semantics of User Interaction in Social Media (Extended Abstract)}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2013-lwa-kdml-user-semantics-social-media-extended-abstract.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity<\/span>.<\/span> In: Guerrero, J.E. (ed.) Proceedings of the 2013 IEEE Cyber, Physical and Social Computing, CPSCom 2013, Beijing, China, 20-23 August, 2013. pp. 993\u20131000. IEEE Computer Society, Los Alamitos, CA, USA (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1109\/GreenCom-iThings-CPSCom.2013.170\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-66cb1b9488f093892fd4fb699240094f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-66cb1b9488f093892fd4fb699240094f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/66cb1b9488f093892fd4fb699240094f\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-66cb1b9488f093892fd4fb699240094f\">Communities are a central aspect in the formation of social interaction networks. In this paper, we analyze the evolution of communities in networks of face-to-face proximity. As our application context, we consider four scientific conferences. We compare the basic properties of the contact graphs to describe the properties of the contact networks and analyze the resulting community structure using state-of-the-art automic community detection algorithms. Specifically, we analyze the evolution of contacts and communities over time to consider the stability of the respective communities. In addition, we assess different factors which have an influence on the quality of community prediction. Overall, we provide first important insights into the evolution of contacts and communities in face-to-face contact networks.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-66cb1b9488f093892fd4fb699240094f\"><p>@inproceedings{kibanov2013evolution,<br\/>  abstract = {Communities are a central aspect in the formation of social interaction networks. In this paper, we analyze the evolution of communities in networks of face-to-face proximity. As our application context, we consider four scientific conferences. We compare the basic properties of the contact graphs to describe the properties of the contact networks and analyze the resulting community structure using state-of-the-art automic community detection algorithms. Specifically, we analyze the evolution of contacts and communities over time to consider the stability of the respective communities. In addition, we assess different factors which have an influence on the quality of community prediction. Overall, we provide first important insights into the evolution of contacts and communities in face-to-face contact networks.},<br\/>  address = {Los Alamitos, CA, USA},<br\/>  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 2013 IEEE Cyber, Physical and Social Computing, CPSCom 2013, Beijing, China, 20-23 August, 2013},<br\/>  editor = {Guerrero, Juan E.},<br\/>  keywords = {itegpub},<br\/>  pages = {993--1000},<br\/>  publisher = {IEEE Computer Society},<br\/>  title = {On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-66cb1b9488f093892fd4fb699240094f\"><p>%0 Conference Paper<br\/>%1 kibanov2013evolution<br\/>%A Kibanov, Mark<br\/>%A Atzmueller, Martin<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 2013 IEEE Cyber, Physical and Social Computing, CPSCom 2013, Beijing, China, 20-23 August, 2013<br\/>%C Los Alamitos, CA, USA<br\/>%D 2013<br\/>%E Guerrero, Juan E.<br\/>%I IEEE Computer Society<br\/>%P 993--1000<br\/>%T On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity<br\/>%U http:\/\/dx.doi.org\/10.1109\/GreenCom-iThings-CPSCom.2013.170<br\/>%X Communities are a central aspect in the formation of social interaction networks. In this paper, we analyze the evolution of communities in networks of face-to-face proximity. As our application context, we consider four scientific conferences. We compare the basic properties of the contact graphs to describe the properties of the contact networks and analyze the resulting community structure using state-of-the-art automic community detection algorithms. Specifically, we analyze the evolution of contacts and communities over time to consider the stability of the respective communities. In addition, we assess different factors which have an influence on the quality of community prediction. Overall, we provide first important insights into the evolution of contacts and communities in face-to-face contact networks.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kluegl, P., Toepfer, M., Lemmerich, F., Hotho, A., Puppe, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Exploiting Structural Consistencies with Stacked Conditional Random Fields<\/span>.<\/span> Mathematical Methodologies in Pattern Recognition and Machine Learning Springer Proceedings in Mathematics &amp; Statistics. 30, 111\u2013125 (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fbaab25e96dd20d96ece9d7fefdc3b4f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fbaab25e96dd20d96ece9d7fefdc3b4f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fbaab25e96dd20d96ece9d7fefdc3b4f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-fbaab25e96dd20d96ece9d7fefdc3b4f\">Conditional Random Fields (CRF) are popular methods for labeling unstructured or textual data. Like many machine learning approaches, these undirected graphical models assume the instances to be independently distributed. However, in real-world applications data is grouped in a natural way, e.g., by its creation context. The instances in each group often share additional structural consistencies. This paper proposes a domain-independent method for exploiting these consistencies by combining two CRFs in a stacked learning framework. We apply rule learning collectively on the predictions of an initial CRF for one context to acquire descriptions of its specific properties. Then, we utilize these descriptions as dynamic and high quality features in an additional (stacked) CRF. The presented approach is evaluated with a real-world dataset for the segmentation of references and achieves a significant reduction of the labeling error.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fbaab25e96dd20d96ece9d7fefdc3b4f\"><p>@article{kluegl2013exploiting,<br\/>  abstract = {Conditional Random Fields (CRF) are popular methods for labeling unstructured or textual data. Like many machine learning approaches, these undirected graphical models assume the instances to be independently distributed. However, in real-world applications data is grouped in a natural way, e.g., by its creation context. The instances in each group often share additional structural consistencies. This paper proposes a domain-independent method for exploiting these consistencies by combining two CRFs in a stacked learning framework. We apply rule learning collectively on the predictions of an initial CRF for one context to acquire descriptions of its specific properties. Then, we utilize these descriptions as dynamic and high quality features in an additional (stacked) CRF. The presented approach is evaluated with a real-world dataset for the segmentation of references and achieves a significant reduction of the labeling error.},<br\/>  author = {Kluegl, Peter and Toepfer, Martin and Lemmerich, Florian and Hotho, Andreas and Puppe, Frank},<br\/>  journal = {Mathematical Methodologies in Pattern Recognition and Machine Learning Springer Proceedings in Mathematics & Statistics},<br\/>  keywords = {ie},<br\/>  pages = {111-125},<br\/>  title = {Exploiting Structural Consistencies with Stacked Conditional Random Fields},<br\/>  volume = 30,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fbaab25e96dd20d96ece9d7fefdc3b4f\"><p>%0 Journal Article<br\/>%1 kluegl2013exploiting<br\/>%A Kluegl, Peter<br\/>%A Toepfer, Martin<br\/>%A Lemmerich, Florian<br\/>%A Hotho, Andreas<br\/>%A Puppe, Frank<br\/>%D 2013<br\/>%J Mathematical Methodologies in Pattern Recognition and Machine Learning Springer Proceedings in Mathematics & Statistics<br\/>%P 111-125<br\/>%T Exploiting Structural Consistencies with Stacked Conditional Random Fields<br\/>%V 30<br\/>%X Conditional Random Fields (CRF) are popular methods for labeling unstructured or textual data. Like many machine learning approaches, these undirected graphical models assume the instances to be independently distributed. However, in real-world applications data is grouped in a natural way, e.g., by its creation context. The instances in each group often share additional structural consistencies. This paper proposes a domain-independent method for exploiting these consistencies by combining two CRFs in a stacked learning framework. We apply rule learning collectively on the predictions of an initial CRF for one context to acquire descriptions of its specific properties. Then, we utilize these descriptions as dynamic and high quality features in an additional (stacked) CRF. The presented approach is evaluated with a real-world dataset for the segmentation of references and achieves a significant reduction of the labeling error.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Erdmann, D.J., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{How to Select a Suitable Tool for a Software Development Project: Three Case Studies and the Lessons Learned}<\/span>.<\/span> In: Software Engineering 2013 - Workshopband. Gesellschaft f\u00fcr Informatik (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f94a42249c770cdf5d62e4ec3db073e9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f94a42249c770cdf5d62e4ec3db073e9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f94a42249c770cdf5d62e4ec3db073e9\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f94a42249c770cdf5d62e4ec3db073e9\"><p>@inproceedings{KEA:13,<br\/>  author = {Kibanov, Mark and Erdmann, Dominik J. and Atzmueller, Martin},<br\/>  booktitle = {Software Engineering 2013 - Workshopband},<br\/>  keywords = {itegpub},<br\/>  publisher = {Gesellschaft f\u00fcr Informatik},<br\/>  title = {{How to Select a Suitable Tool for a Software Development Project: Three Case Studies and the Lessons Learned}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f94a42249c770cdf5d62e4ec3db073e9\"><p>%0 Conference Paper<br\/>%1 KEA:13<br\/>%A Kibanov, Mark<br\/>%A Erdmann, Dominik J.<br\/>%A Atzmueller, Martin<br\/>%B Software Engineering 2013 - Workshopband<br\/>%D 2013<br\/>%I Gesellschaft f\u00fcr Informatik<br\/>%T {How to Select a Suitable Tool for a Software Development Project: Three Case Studies and the Lessons Learned}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks<\/span>.<\/span> In: Rokne, J.G. and Faloutsos, C. (eds.) Proceedings of the 2013 ACM\/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, Niagara Falls, Canada, August 25-28, 2013. pp. 356\u2013363. ACM, New York, NY, USA (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1145\/2492517.2492521\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5e4b9d8757eaebd10e6493c08bf583af\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5e4b9d8757eaebd10e6493c08bf583af\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5e4b9d8757eaebd10e6493c08bf583af\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5e4b9d8757eaebd10e6493c08bf583af\">Understanding the process of link creation is rather important for link prediction in social networks. Therefore, this paper analyzes contact structures in networks of face-to-face spatial proximity, and presents new insights on the dynamic and static contact behavior in such real world networks. We focus on face-to-face contact networks collected at different conferences using the social conference guidance system Conferator. Specifically, we investigate the strength of ties and its connection to triadic closures in face-to-face proximity networks. Furthermore, we analyze the predictability of all, new and recurring links at different points of time during the conference. In addition, we consider network dynamics for the prediction of new links.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5e4b9d8757eaebd10e6493c08bf583af\"><p>@inproceedings{scholz2013people,<br\/>  abstract = {Understanding the process of link creation is rather important for link prediction in social networks. Therefore, this paper analyzes contact structures in networks of face-to-face spatial proximity, and presents new insights on the dynamic and static contact behavior in such real world networks. We focus on face-to-face contact networks collected at different conferences using the social conference guidance system Conferator. Specifically, we investigate the strength of ties and its connection to triadic closures in face-to-face proximity networks. Furthermore, we analyze the predictability of all, new and recurring links at different points of time during the conference. In addition, we consider network dynamics for the prediction of new links.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 2013 ACM\/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, Niagara Falls, Canada, August 25-28, 2013},<br\/>  editor = {Rokne, Jon G. and Faloutsos, Christos},<br\/>  keywords = {network},<br\/>  pages = {356--363},<br\/>  publisher = {ACM},<br\/>  title = {How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5e4b9d8757eaebd10e6493c08bf583af\"><p>%0 Conference Paper<br\/>%1 scholz2013people<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Kibanov, Mark<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 2013 ACM\/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, Niagara Falls, Canada, August 25-28, 2013<br\/>%C New York, NY, USA<br\/>%D 2013<br\/>%E Rokne, Jon G.<br\/>%E Faloutsos, Christos<br\/>%I ACM<br\/>%P 356--363<br\/>%T How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks<br\/>%U http:\/\/dx.doi.org\/10.1145\/2492517.2492521<br\/>%X Understanding the process of link creation is rather important for link prediction in social networks. Therefore, this paper analyzes contact structures in networks of face-to-face spatial proximity, and presents new insights on the dynamic and static contact behavior in such real world networks. We focus on face-to-face contact networks collected at different conferences using the social conference guidance system Conferator. Specifically, we investigate the strength of ties and its connection to triadic closures in face-to-face proximity networks. Furthermore, we analyze the predictability of all, new and recurring links at different points of time during the conference. In addition, we consider network dynamics for the prediction of new links.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Kibanov, M., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Conferator - a Social System for Conference and Contact Management}<\/span><\/span>, (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2668432d7c035c34c4af4f6f96e22397\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2668432d7c035c34c4af4f6f96e22397\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2668432d7c035c34c4af4f6f96e22397\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2668432d7c035c34c4af4f6f96e22397\"><p>@misc{atzmueller2013conferator,<br\/>  author = {Atzmueller, Martin and Kibanov, Mark and Scholz, Christoph and Stumme, Gerd},<br\/>  howpublished = {Poster at INFORMATIK 2013},<br\/>  institution = {University of Koblenz-Landau},<br\/>  keywords = {itegpub},<br\/>  publisher = {INFORMATIK 2013},<br\/>  title = {{Conferator - a Social System for Conference and Contact Management}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2668432d7c035c34c4af4f6f96e22397\"><p>%0 Generic<br\/>%1 atzmueller2013conferator<br\/>%A Atzmueller, Martin<br\/>%A Kibanov, Mark<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%D 2013<br\/>%I INFORMATIK 2013<br\/>%T {Conferator - a Social System for Conference and Contact Management}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Bobek, S., Kibanov, M., Nalepa, G.J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards the Ambient Classroom: An Environment for Enhancing Collaborative Educational Processes<\/span>.<\/span> In: Roth-Berghofer, T., Oussena, S., and Atzmueller, M. (eds.) Proceedings of the Smart University Workshop, SmartUni 2013 -- International and Interdisciplinary Conference on Modeling and Using Context, Context 2013, Annecy, Haute-Savoie, France, 28 October, 2013 (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.univ-savoie.org\/context2013\/SmartUni2013.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ae3d8a5ec891e1e71576bd4ad6a1a57d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ae3d8a5ec891e1e71576bd4ad6a1a57d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ae3d8a5ec891e1e71576bd4ad6a1a57d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-ae3d8a5ec891e1e71576bd4ad6a1a57d\">With the rapid development of mobile technologies like, e.g., RFID tags, smartphones, and tablets, ambient intelligence applications have gained a huge popularity in recent years. However, most of the existing approaches aim at developing ambient environments that are rather static, and do not take the aspect of social interaction between the inhabitants into account. We argue that this is essential for smart classrooms, meeting rooms and other environments that are strictly based on mechanisms of human face-to-face interactions. In the context of the smart university, we propose the ambient classroom system for enhancing collaborative educational processes using sensor fusion, data mining, semantic technologies, and inference methods.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ae3d8a5ec891e1e71576bd4ad6a1a57d\"><p>@inproceedings{atzmueller2013towards,<br\/>  abstract = {With the rapid development of mobile technologies like, e.g., RFID tags, smartphones, and tablets, ambient intelligence applications have gained a huge popularity in recent years. However, most of the existing approaches aim at developing ambient environments that are rather static, and do not take the aspect of social interaction between the inhabitants into account. We argue that this is essential for smart classrooms, meeting rooms and other environments that are strictly based on mechanisms of human face-to-face interactions. In the context of the smart university, we propose the ambient classroom system for enhancing collaborative educational processes using sensor fusion, data mining, semantic technologies, and inference methods.},<br\/>  author = {Atzmueller, Martin and Bobek, Szymon and Kibanov, Mark and Nalepa, Grzegorz J.},<br\/>  booktitle = {Proceedings of the Smart University Workshop, SmartUni 2013 -- International and Interdisciplinary Conference on Modeling and Using Context, Context 2013, Annecy, Haute-Savoie, France, 28 October, 2013},<br\/>  editor = {Roth-Berghofer, Thomas and Oussena, Samia and Atzmueller, Martin},<br\/>  keywords = 2013,<br\/>  title = {Towards the Ambient Classroom: An Environment for Enhancing Collaborative Educational Processes},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ae3d8a5ec891e1e71576bd4ad6a1a57d\"><p>%0 Conference Paper<br\/>%1 atzmueller2013towards<br\/>%A Atzmueller, Martin<br\/>%A Bobek, Szymon<br\/>%A Kibanov, Mark<br\/>%A Nalepa, Grzegorz J.<br\/>%B Proceedings of the Smart University Workshop, SmartUni 2013 -- International and Interdisciplinary Conference on Modeling and Using Context, Context 2013, Annecy, Haute-Savoie, France, 28 October, 2013<br\/>%D 2013<br\/>%E Roth-Berghofer, Thomas<br\/>%E Oussena, Samia<br\/>%E Atzmueller, Martin<br\/>%T Towards the Ambient Classroom: An Environment for Enhancing Collaborative Educational Processes<br\/>%U http:\/\/www.univ-savoie.org\/context2013\/SmartUni2013.pdf<br\/>%X With the rapid development of mobile technologies like, e.g., RFID tags, smartphones, and tablets, ambient intelligence applications have gained a huge popularity in recent years. However, most of the existing approaches aim at developing ambient environments that are rather static, and do not take the aspect of social interaction between the inhabitants into account. We argue that this is essential for smart classrooms, meeting rooms and other environments that are strictly based on mechanisms of human face-to-face interactions. In the context of the smart university, we propose the ambient classroom system for enhancing collaborative educational processes using sensor fusion, data mining, semantic technologies, and inference methods.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Mueller, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Subgroup Analytics and Interactive Assessment on Ubiquitous Data}<\/span>.<\/span> In: {Proceedings of the International Workshop on Mining Ubiquitous and Social Environments (MUSE2013)}. , Prague, Czech Republic (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-56661bf6212e1e5ab839640fdfba09b6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-56661bf6212e1e5ab839640fdfba09b6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/56661bf6212e1e5ab839640fdfba09b6\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-56661bf6212e1e5ab839640fdfba09b6\"><p>@inproceedings{AM:13,<br\/>  address = {Prague, Czech Republic},<br\/>  author = {Atzmueller, Martin and Mueller, Juergen},<br\/>  booktitle = {{Proceedings of the International Workshop on Mining Ubiquitous and Social Environments (MUSE2013)}},<br\/>  keywords = {itegpub},<br\/>  title = {{Subgroup Analytics and Interactive Assessment on Ubiquitous Data}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-56661bf6212e1e5ab839640fdfba09b6\"><p>%0 Conference Paper<br\/>%1 AM:13<br\/>%A Atzmueller, Martin<br\/>%A Mueller, Juergen<br\/>%B {Proceedings of the International Workshop on Mining Ubiquitous and Social Environments (MUSE2013)}<br\/>%C Prague, Czech Republic<br\/>%D 2013<br\/>%T {Subgroup Analytics and Interactive Assessment on Ubiquitous Data}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Seipel, D., K\u00f6hler, S., Neubeck, P., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Mining Complex Event Patterns in Computer Networks}<\/span>.<\/span> In: {Postproceedings of the 1st Workshop on New Frontiers in Mining Complex Patterns (NFMCP 2012}. Springer Verlag, Heidelberg, Germany (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0c1b2ffe552535d3f34521a74f4c4253\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0c1b2ffe552535d3f34521a74f4c4253\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0c1b2ffe552535d3f34521a74f4c4253\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0c1b2ffe552535d3f34521a74f4c4253\"><p>@incollection{SKNA:13,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Seipel, Dietmar and K\u00f6hler, Stefan and Neubeck, Philipp and Atzmueller, Martin},<br\/>  booktitle = {{Postproceedings of the 1st Workshop on New Frontiers in Mining Complex Patterns (NFMCP 2012}},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  series = {LNAI},<br\/>  title = {{Mining Complex Event Patterns in Computer Networks}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0c1b2ffe552535d3f34521a74f4c4253\"><p>%0 Book Section<br\/>%1 SKNA:13<br\/>%A Seipel, Dietmar<br\/>%A K\u00f6hler, Stefan<br\/>%A Neubeck, Philipp<br\/>%A Atzmueller, Martin<br\/>%B {Postproceedings of the 1st Workshop on New Frontiers in Mining Complex Patterns (NFMCP 2012}<br\/>%C Heidelberg, Germany<br\/>%D 2013<br\/>%I Springer Verlag<br\/>%T {Mining Complex Event Patterns in Computer Networks}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Lemmerich, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Exploratory Pattern Mining on Social Media using Geo-References and Social Tagging Information}<\/span>.<\/span> International Journal of Web Science. 2, (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1fc4c36dba72fe1495cd6c9bfb50f612\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1fc4c36dba72fe1495cd6c9bfb50f612\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1fc4c36dba72fe1495cd6c9bfb50f612\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1fc4c36dba72fe1495cd6c9bfb50f612\"><p>@article{AL:13,<br\/>  author = {Atzmueller, Martin and Lemmerich, Florian},<br\/>  journal = {International Journal of Web Science},<br\/>  keywords = {itegpub},<br\/>  number = {1\/2},<br\/>  title = {{Exploratory Pattern Mining on Social Media using Geo-References and Social Tagging Information}},<br\/>  volume = 2,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1fc4c36dba72fe1495cd6c9bfb50f612\"><p>%0 Journal Article<br\/>%1 AL:13<br\/>%A Atzmueller, Martin<br\/>%A Lemmerich, Florian<br\/>%D 2013<br\/>%J International Journal of Web Science<br\/>%N 1\/2<br\/>%T {Exploratory Pattern Mining on Social Media using Geo-References and Social Tagging Information}<br\/>%V 2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Hilgenberg, K.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Towards Capturing Social Interactions with SDCF: An Extensible Framework for Mobile Sensing and Ubiquitous Data Collection}<\/span>.<\/span> In: Proc. 4th International Workshop on Modeling Social Media (MSM 2013), Hypertext 2013. ACM Press, New York, NY, USA (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4ebea4979524a9c1c0d41845e41e33a9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4ebea4979524a9c1c0d41845e41e33a9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4ebea4979524a9c1c0d41845e41e33a9\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4ebea4979524a9c1c0d41845e41e33a9\"><p>@inproceedings{AH:13b,<br\/>  address = {New York, NY, USA},<br\/>  author = {Atzmueller, Martin and Hilgenberg, Katy},<br\/>  booktitle = {Proc. 4th International Workshop on Modeling Social Media (MSM 2013), Hypertext 2013},<br\/>  keywords = {itegpub},<br\/>  publisher = {ACM Press},<br\/>  title = {{Towards Capturing Social Interactions with SDCF: An Extensible Framework for Mobile Sensing and Ubiquitous Data Collection}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4ebea4979524a9c1c0d41845e41e33a9\"><p>%0 Conference Paper<br\/>%1 AH:13b<br\/>%A Atzmueller, Martin<br\/>%A Hilgenberg, Katy<br\/>%B Proc. 4th International Workshop on Modeling Social Media (MSM 2013), Hypertext 2013<br\/>%C New York, NY, USA<br\/>%D 2013<br\/>%I ACM Press<br\/>%T {Towards Capturing Social Interactions with SDCF: An Extensible Framework for Mobile Sensing and Ubiquitous Data Collection}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract)}<\/span>.<\/span> In: Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2013-lwa-kdml-community-evolution-extended-abstract.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d726125157058ea15b59b37ec847784a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d726125157058ea15b59b37ec847784a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d726125157058ea15b59b37ec847784a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d726125157058ea15b59b37ec847784a\"><p>@inproceedings{KASS:13b,<br\/>  address = {Bamberg, Germany},<br\/>  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proc. LWA 2013 (KDML Special Track)},<br\/>  keywords = {itegpub},<br\/>  publisher = {University of Bamberg},<br\/>  title = {{Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract)}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d726125157058ea15b59b37ec847784a\"><p>%0 Conference Paper<br\/>%1 KASS:13b<br\/>%A Kibanov, Mark<br\/>%A Atzmueller, Martin<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proc. LWA 2013 (KDML Special Track)<br\/>%C Bamberg, Germany<br\/>%D 2013<br\/>%I University of Bamberg<br\/>%T {Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract)}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2013-lwa-kdml-community-evolution-extended-abstract.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Macek, B.-E., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Visualizing The Impact of Time Series Data for Predicting User Interactions<\/span>.<\/span> In: Proc. ASONAM 2013. ACM Press, New York, NY, USA (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-04a24a6fa8abc228ea70b7d1c2ca7455\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-04a24a6fa8abc228ea70b7d1c2ca7455\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/04a24a6fa8abc228ea70b7d1c2ca7455\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-04a24a6fa8abc228ea70b7d1c2ca7455\"><p>@conference{MA:13a,<br\/>  address = {New York, NY, USA},<br\/>  author = {Macek, Bj\u00f6rn-Elmar and Atzmueller, Martin},<br\/>  booktitle = {Proc. ASONAM 2013},<br\/>  keywords = {itegpub},<br\/>  publisher = {ACM Press},<br\/>  title = {Visualizing The Impact of Time Series Data for Predicting User Interactions},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-04a24a6fa8abc228ea70b7d1c2ca7455\"><p>%0 Generic<br\/>%1 MA:13a<br\/>%A Macek, Bj\u00f6rn-Elmar<br\/>%A Atzmueller, Martin<br\/>%B Proc. ASONAM 2013<br\/>%C New York, NY, USA<br\/>%D 2013<br\/>%I ACM Press<br\/>%T Visualizing The Impact of Time Series Data for Predicting User Interactions<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Roth-Berghofer, T., Oussena, S., Atzmueller, M. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings of the 2013 International Smart University Workshop (SmartU 2013)}<\/span>.<\/span> CONTEXT 2013, Annecy, France (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2b36fe460601217691180f0affbbe286\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2b36fe460601217691180f0affbbe286\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2b36fe460601217691180f0affbbe286\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2b36fe460601217691180f0affbbe286\"><p>@book{RSA:13,<br\/>  address = {Annecy, France},<br\/>  editor = {Roth-Berghofer, Thomas and Oussena, Samia and Atzmueller, Martin},<br\/>  keywords = {smart},<br\/>  publisher = {CONTEXT 2013},<br\/>  title = {{Proceedings of the 2013 International Smart University Workshop (SmartU 2013)}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2b36fe460601217691180f0affbbe286\"><p>%0 Book<br\/>%1 RSA:13<br\/>%C Annecy, France<br\/>%D 2013<br\/>%E Roth-Berghofer, Thomas<br\/>%E Oussena, Samia<br\/>%E Atzmueller, Martin<br\/>%I CONTEXT 2013<br\/>%T {Proceedings of the 2013 International Smart University Workshop (SmartU 2013)}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{User-Relatedness and Community Structure in Social Interaction Networks}<\/span>.<\/span> CoRR\/abs. 1309.3888, (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-424d0f2d4a5c9a0eb68cbf2fc5b0010a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-424d0f2d4a5c9a0eb68cbf2fc5b0010a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/424d0f2d4a5c9a0eb68cbf2fc5b0010a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-424d0f2d4a5c9a0eb68cbf2fc5b0010a\"><p>@article{51seitenPaper,<br\/>  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  journal = {CoRR\/abs},<br\/>  keywords = {itegpub},<br\/>  title = {{User-Relatedness and Community Structure in Social Interaction Networks}},<br\/>  volume = {1309.3888},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-424d0f2d4a5c9a0eb68cbf2fc5b0010a\"><p>%0 Journal Article<br\/>%1 51seitenPaper<br\/>%A Mitzlaff, Folke<br\/>%A Atzmueller, Martin<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%D 2013<br\/>%J CoRR\/abs<br\/>%T {User-Relatedness and Community Structure in Social Interaction Networks}<br\/>%V 1309.3888<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Social Behavior in Mobile Social Networks: Characterizing Links, Roles and Communities}<\/span>.<\/span> In: Chin, A. and Zhang, D. (eds.) Mobile Social Networking: An Innovative Approach. Springer Verlag, Heidelberg, Germany (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cd910f3a16c9368e7b73407708452653\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cd910f3a16c9368e7b73407708452653\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cd910f3a16c9368e7b73407708452653\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cd910f3a16c9368e7b73407708452653\"><p>@incollection{Atzmueller:13,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Mobile Social Networking: An Innovative Approach},<br\/>  editor = {Chin, Alvin and Zhang, Daqing},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Social Behavior in Mobile Social Networks: Characterizing Links, Roles and Communities}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cd910f3a16c9368e7b73407708452653\"><p>%0 Book Section<br\/>%1 Atzmueller:13<br\/>%A Atzmueller, Martin<br\/>%B Mobile Social Networking: An Innovative Approach<br\/>%C Heidelberg, Germany<br\/>%D 2013<br\/>%E Chin, Alvin<br\/>%E Zhang, Daqing<br\/>%I Springer Verlag<br\/>%T {Social Behavior in Mobile Social Networks: Characterizing Links, Roles and Communities}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, {Christoph, Atzmueller, M., Barrat, A., Cattuto, C., Gerd Stumme}: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{New Insights and Methods For Predicting Face-To-Face Contacts}<\/span>.<\/span> In: Proc. 7th Intl. AAAI Conference on Weblogs and Social Media. AAAI Press, Palo Alto, CA, USA (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3dce3522e260238f2a8e802b52096cb7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3dce3522e260238f2a8e802b52096cb7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3dce3522e260238f2a8e802b52096cb7\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3dce3522e260238f2a8e802b52096cb7\"><p>@inproceedings{christophscholzandmartinatzmuellerandalainbarratandcirocattutoandgerdstumme2013insights,<br\/>  address = {Palo Alto, CA, USA},<br\/>  author = {{Christoph Scholz and Martin Atzmueller and Alain Barrat and Ciro Cattuto and Gerd Stumme}},<br\/>  booktitle = {Proc. 7th Intl. AAAI Conference on Weblogs and Social Media},<br\/>  keywords = {iteg},<br\/>  publisher = {AAAI Press},<br\/>  title = {{New Insights and Methods For Predicting Face-To-Face Contacts}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3dce3522e260238f2a8e802b52096cb7\"><p>%0 Conference Paper<br\/>%1 christophscholzandmartinatzmuellerandalainbarratandcirocattutoandgerdstumme2013insights<br\/>%A Scholz, {Christoph<br\/>%A Atzmueller, Martin<br\/>%A Barrat, Alain<br\/>%A Cattuto, Ciro<br\/>%A Gerd Stumme}, <br\/>%B Proc. 7th Intl. AAAI Conference on Weblogs and Social Media<br\/>%C Palo Alto, CA, USA<br\/>%D 2013<br\/>%I AAAI Press<br\/>%T {New Insights and Methods For Predicting Face-To-Face Contacts}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Hilgenberg, K.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{SDCF - A Sensor Data Collection Framework for Social and Ubiquitous Environments: Challenges and First Experiences in Sensor-based Social Networks (Abstract)}<\/span>.<\/span> In: Proc. Sunbelt XXXIII: Annual Meeting of the International Network for Social Network Analysis. INSNA, Hamburg, Germany (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2013-Atzmueller-SDCF-Sunbelt-ExtendedAbstract.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5f8a4602c1087ea93f1f7440050d1982\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5f8a4602c1087ea93f1f7440050d1982\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5f8a4602c1087ea93f1f7440050d1982\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5f8a4602c1087ea93f1f7440050d1982\"><p>@inproceedings{AH:13a,<br\/>  address = {Hamburg, Germany},<br\/>  author = {Atzmueller, Martin and Hilgenberg, Katy},<br\/>  booktitle = {Proc. Sunbelt XXXIII: Annual Meeting of the International Network for Social Network Analysis},<br\/>  keywords = {itegpub},<br\/>  publisher = {INSNA},<br\/>  title = {{SDCF - A Sensor Data Collection Framework for Social and Ubiquitous Environments: Challenges and First Experiences in Sensor-based Social Networks (Abstract)}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5f8a4602c1087ea93f1f7440050d1982\"><p>%0 Conference Paper<br\/>%1 AH:13a<br\/>%A Atzmueller, Martin<br\/>%A Hilgenberg, Katy<br\/>%B Proc. Sunbelt XXXIII: Annual Meeting of the International Network for Social Network Analysis<br\/>%C Hamburg, Germany<br\/>%D 2013<br\/>%I INSNA<br\/>%T {SDCF - A Sensor Data Collection Framework for Social and Ubiquitous Environments: Challenges and First Experiences in Sensor-based Social Networks (Abstract)}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2013-Atzmueller-SDCF-Sunbelt-ExtendedAbstract.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Niebler, T., Singer, P., Benz, D., K\u00f6rner, C., Strohmaier, M., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">How Tagging Pragmatics Influence Tag Sense Discovery in Social Annotation Systems<\/span>.<\/span> In: Serdyukov, P., Braslavski, P., Kuznetsov, S., Kamps, J., R\u00fcger, S., Agichtein, E., Segalovich, I., and Yilmaz, E. (eds.) Advances in Information Retrieval. pp. 86\u201397. Springer Berlin Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36973-5_8.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/978-3-642-36973-5_8\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8583743a7598e78cc7b4e8af71a43902\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8583743a7598e78cc7b4e8af71a43902\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-36973-5_8\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8583743a7598e78cc7b4e8af71a43902\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-8583743a7598e78cc7b4e8af71a43902\">The presence of emergent semantics in social annotation systems has been reported in numerous studies. Two important problems in this context are the induction of semantic relations among tags and the discovery of different senses of a given tag. While a number of approaches for discovering tag senses exist, little is known about which<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8583743a7598e78cc7b4e8af71a43902\"><p>@incollection{niebler2013tagging,<br\/>  abstract = {The presence of emergent semantics in social annotation systems has been reported in numerous studies. Two important problems in this context are the induction of semantic relations among tags and the discovery of different senses of a given tag. While a number of approaches for discovering tag senses exist, little is known about which},<br\/>  author = {Niebler, Thomas and Singer, Philipp and Benz, Dominik and K\u00f6rner, Christian and Strohmaier, Markus and Hotho, Andreas},<br\/>  booktitle = {Advances in Information Retrieval},<br\/>  editor = {Serdyukov, Pavel and Braslavski, Pavel and Kuznetsov, SergeiO. and Kamps, Jaap and R\u00fcger, Stefan and Agichtein, Eugene and Segalovich, Ilya and Yilmaz, Emine},<br\/>  keywords = {sense},<br\/>  pages = {86-97},<br\/>  publisher = {Springer Berlin Heidelberg},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {How Tagging Pragmatics Influence Tag Sense Discovery in Social Annotation Systems},<br\/>  volume = 7814,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8583743a7598e78cc7b4e8af71a43902\"><p>%0 Book Section<br\/>%1 niebler2013tagging<br\/>%A Niebler, Thomas<br\/>%A Singer, Philipp<br\/>%A Benz, Dominik<br\/>%A K\u00f6rner, Christian<br\/>%A Strohmaier, Markus<br\/>%A Hotho, Andreas<br\/>%B Advances in Information Retrieval<br\/>%D 2013<br\/>%E Serdyukov, Pavel<br\/>%E Braslavski, Pavel<br\/>%E Kuznetsov, SergeiO.<br\/>%E Kamps, Jaap<br\/>%E R\u00fcger, Stefan<br\/>%E Agichtein, Eugene<br\/>%E Segalovich, Ilya<br\/>%E Yilmaz, Emine<br\/>%I Springer Berlin Heidelberg<br\/>%P 86-97<br\/>%R 10.1007\/978-3-642-36973-5_8<br\/>%T How Tagging Pragmatics Influence Tag Sense Discovery in Social Annotation Systems<br\/>%U http:\/\/dx.doi.org\/10.1007\/978-3-642-36973-5_8<br\/>%V 7814<br\/>%X The presence of emergent semantics in social annotation systems has been reported in numerous studies. Two important problems in this context are the induction of semantic relations among tags and the discovery of different senses of a given tag. While a number of approaches for discovering tag senses exist, little is known about which<br\/>%@ 978-3-642-36972-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Singer, P., Niebler, T., Strohmaier, M., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Computing Semantic Relatedness from Human Navigational Paths: A Case Study on Wikipedia<\/span>.<\/span> International Journal on Semantic Web and Information Systems (IJSWIS). 9, 41\u201370 (2013). https:\/\/doi.org\/10.4018\/ijswis.2013100103.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijswis.2013100103\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5262c48a2e2791d28610712e3bf5cf55\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5262c48a2e2791d28610712e3bf5cf55\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.4018\/ijswis.2013100103\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5262c48a2e2791d28610712e3bf5cf55\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5262c48a2e2791d28610712e3bf5cf55\">In this article, the authors present a novel approach for computing semantic relatedness and conduct a large-scale study of it on Wikipedia. Unlike existing semantic analysis methods that utilize Wikipedia\u2019s content or link structure, the authors propose to use human navigational paths on Wikipedia for this task. The authors obtain 1.8 million human navigational paths from a semi-controlled navigation experiment \u2013 a Wikipedia-based navigation game, in which users are required to find short paths between two articles in a given Wikipedia article network. The authors\u2019 results are intriguing: They suggest that (i) semantic relatedness computed from human navigational paths may be more precise than semantic relatedness computed from Wikipedia\u2019s plain link structure alone and (ii) that not all navigational paths are equally useful. Intelligent selection based on path characteristics can improve accuracy. The authors\u2019 work makes an argument for expanding the existing arsenal of data sources for calculating semantic relatedness and to consider the utility of human navigational paths for this task.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5262c48a2e2791d28610712e3bf5cf55\"><p>@article{singer2013computing,<br\/>  abstract = {In this article, the authors present a novel approach for computing semantic relatedness and conduct a large-scale study of it on Wikipedia. Unlike existing semantic analysis methods that utilize Wikipedia\u2019s content or link structure, the authors propose to use human navigational paths on Wikipedia for this task. The authors obtain 1.8 million human navigational paths from a semi-controlled navigation experiment \u2013 a Wikipedia-based navigation game, in which users are required to find short paths between two articles in a given Wikipedia article network. The authors\u2019 results are intriguing: They suggest that (i) semantic relatedness computed from human navigational paths may be more precise than semantic relatedness computed from Wikipedia\u2019s plain link structure alone and (ii) that not all navigational paths are equally useful. Intelligent selection based on path characteristics can improve accuracy. The authors\u2019 work makes an argument for expanding the existing arsenal of data sources for calculating semantic relatedness and to consider the utility of human navigational paths for this task.},<br\/>  author = {Singer, Philipp and Niebler, Thomas and Strohmaier, Markus and Hotho, Andreas},<br\/>  journal = {International Journal on Semantic Web and Information Systems (IJSWIS)},<br\/>  keywords = 2013,<br\/>  number = 4,<br\/>  pages = {41--70},<br\/>  publisher = {IGI Global},<br\/>  title = {Computing Semantic Relatedness from Human Navigational Paths: A Case Study on Wikipedia},<br\/>  volume = 9,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5262c48a2e2791d28610712e3bf5cf55\"><p>%0 Journal Article<br\/>%1 singer2013computing<br\/>%A Singer, Philipp<br\/>%A Niebler, Thomas<br\/>%A Strohmaier, Markus<br\/>%A Hotho, Andreas<br\/>%D 2013<br\/>%I IGI Global<br\/>%J International Journal on Semantic Web and Information Systems (IJSWIS)<br\/>%N 4<br\/>%P 41--70<br\/>%R 10.4018\/ijswis.2013100103<br\/>%T Computing Semantic Relatedness from Human Navigational Paths: A Case Study on Wikipedia<br\/>%U http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijswis.2013100103<br\/>%V 9<br\/>%X In this article, the authors present a novel approach for computing semantic relatedness and conduct a large-scale study of it on Wikipedia. Unlike existing semantic analysis methods that utilize Wikipedia\u2019s content or link structure, the authors propose to use human navigational paths on Wikipedia for this task. The authors obtain 1.8 million human navigational paths from a semi-controlled navigation experiment \u2013 a Wikipedia-based navigation game, in which users are required to find short paths between two articles in a given Wikipedia article network. The authors\u2019 results are intriguing: They suggest that (i) semantic relatedness computed from human navigational paths may be more precise than semantic relatedness computed from Wikipedia\u2019s plain link structure alone and (ii) that not all navigational paths are equally useful. Intelligent selection based on path characteristics can improve accuracy. The authors\u2019 work makes an argument for expanding the existing arsenal of data sources for calculating semantic relatedness and to consider the utility of human navigational paths for this task.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Community and Pattern Analytics in Social Networks}<\/span><\/span>, https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2013-atzmueller-lwa13-abstract.pdf, (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2013-atzmueller-lwa13-abstract.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-18389ab2966421e5578115862657ade8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-18389ab2966421e5578115862657ade8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/18389ab2966421e5578115862657ade8\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-18389ab2966421e5578115862657ade8\"><p>@misc{Atzmueller:13:LWA13:Tutorial,<br\/>  author = {Atzmueller, Martin},<br\/>  editor = {2013, LWA},<br\/>  howpublished = {Tutorial Abstract},<br\/>  keywords = {itegpub},<br\/>  title = {{Community and Pattern Analytics in Social Networks}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-18389ab2966421e5578115862657ade8\"><p>%0 Generic<br\/>%1 Atzmueller:13:LWA13:Tutorial<br\/>%A Atzmueller, Martin<br\/>%D 2013<br\/>%E 2013, LWA<br\/>%T {Community and Pattern Analytics in Social Networks}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2013-atzmueller-lwa13-abstract.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schulz, T., Skistims, H., Zirfas, J., Atzmueller, M., Scholz, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Rechtliche Ausgestaltung sozialer Konferenzplattformen}<\/span>.<\/span> ZD. 2, 60\u201365 (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2ec777edc0adc9f74292caf4ae9ad4f0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2ec777edc0adc9f74292caf4ae9ad4f0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2ec777edc0adc9f74292caf4ae9ad4f0\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2ec777edc0adc9f74292caf4ae9ad4f0\"><p>@article{SSZAS:13,<br\/>  author = {Schulz, Thomas and Skistims, Hendrik and Zirfas, Julia and Atzmueller, Martin and Scholz, Christoph},<br\/>  journal = {ZD},<br\/>  keywords = {recht},<br\/>  pages = {60--65},<br\/>  title = {{Rechtliche Ausgestaltung sozialer Konferenzplattformen}},<br\/>  volume = 2,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2ec777edc0adc9f74292caf4ae9ad4f0\"><p>%0 Journal Article<br\/>%1 SSZAS:13<br\/>%A Schulz, Thomas<br\/>%A Skistims, Hendrik<br\/>%A Zirfas, Julia<br\/>%A Atzmueller, Martin<br\/>%A Scholz, Christoph<br\/>%D 2013<br\/>%J ZD<br\/>%P 60--65<br\/>%T {Rechtliche Ausgestaltung sozialer Konferenzplattformen}<br\/>%V 2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Scholz, C. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings of the 2013 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2013)}<\/span>.<\/span> ECML\/PKDD 2013, Prague, Czech Republic (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-df284a5c0da26066183bb7f528ded439\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-df284a5c0da26066183bb7f528ded439\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/df284a5c0da26066183bb7f528ded439\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-df284a5c0da26066183bb7f528ded439\"><p>@book{AS:13,<br\/>  address = {Prague, Czech Republic},<br\/>  editor = {Atzmueller, Martin and Scholz, Christoph},<br\/>  keywords = {itegpub},<br\/>  publisher = {ECML\/PKDD 2013},<br\/>  title = {{Proceedings of the 2013 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2013)}},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-df284a5c0da26066183bb7f528ded439\"><p>%0 Book<br\/>%1 AS:13<br\/>%C Prague, Czech Republic<br\/>%D 2013<br\/>%E Atzmueller, Martin<br\/>%E Scholz, Christoph<br\/>%I ECML\/PKDD 2013<br\/>%T {Proceedings of the 2013 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2013)}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Atzmueller, M., Barrat, A., Cattuto, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">New Insights and Methods For Predicting Face-To-Face Contacts<\/span>.<\/span> In: Proc. 7th Intl. AAAI Conference on Weblogs and Social Media. AAAI Press, Palo Alto, CA, USA (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3dce3522e260238f2a8e802b52096cb7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3dce3522e260238f2a8e802b52096cb7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3dce3522e260238f2a8e802b52096cb7\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3dce3522e260238f2a8e802b52096cb7\"><p>@inproceedings{SABCS:13,<br\/>  address = {Palo Alto, CA, USA},<br\/>  author = {Scholz, Christoph and Atzmueller, Martin and Barrat, Alain and Cattuto, Ciro and Stumme, Gerd},<br\/>  booktitle = {Proc. 7th Intl. AAAI Conference on Weblogs and Social Media},<br\/>  keywords = {link},<br\/>  publisher = {AAAI Press},<br\/>  title = {New Insights and Methods For Predicting Face-To-Face Contacts},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3dce3522e260238f2a8e802b52096cb7\"><p>%0 Conference Paper<br\/>%1 SABCS:13<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Barrat, Alain<br\/>%A Cattuto, Ciro<br\/>%A Stumme, Gerd<br\/>%B Proc. 7th Intl. AAAI Conference on Weblogs and Social Media<br\/>%C Palo Alto, CA, USA<br\/>%D 2013<br\/>%I AAAI Press<br\/>%T New Insights and Methods For Predicting Face-To-Face Contacts<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mobasher, B., Jannach, D., Geyer, W., Freyne, J., Hotho, A., Anand, S.S., Guy, I. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the Fifth ACM RecSys Workshop on Recommender Systems and the Social Web co-located with the 7th ACM Conference on Recommender Systems (RecSys 2013), Hong Kong, China, October 13, 2013.<\/span><\/span> CEUR-WS.org (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-1066\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-aca768068f09003e97b51d48ec092ddc\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-aca768068f09003e97b51d48ec092ddc\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/aca768068f09003e97b51d48ec092ddc\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-aca768068f09003e97b51d48ec092ddc\"><p>@proceedings{conf\/recsys\/2013rsweb,<br\/>  booktitle = {RSWeb@RecSys},<br\/>  editor = {Mobasher, Bamshad and Jannach, Dietmar and Geyer, Werner and Freyne, Jill and Hotho, Andreas and Anand, Sarabjot Singh and Guy, Ido},<br\/>  keywords = {bibsonomy},<br\/>  publisher = {CEUR-WS.org},<br\/>  series = {CEUR Workshop Proceedings},<br\/>  title = {Proceedings of the Fifth ACM RecSys Workshop on Recommender Systems and the Social Web co-located with the 7th ACM Conference on Recommender Systems (RecSys 2013), Hong Kong, China, October 13, 2013.},<br\/>  volume = 1066,<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-aca768068f09003e97b51d48ec092ddc\"><p>%0 Conference Proceedings<br\/>%1 conf\/recsys\/2013rsweb<br\/>%B RSWeb@RecSys<br\/>%D 2013<br\/>%E Mobasher, Bamshad<br\/>%E Jannach, Dietmar<br\/>%E Geyer, Werner<br\/>%E Freyne, Jill<br\/>%E Hotho, Andreas<br\/>%E Anand, Sarabjot Singh<br\/>%E Guy, Ido<br\/>%I CEUR-WS.org<br\/>%T Proceedings of the Fifth ACM RecSys Workshop on Recommender Systems and the Social Web co-located with the 7th ACM Conference on Recommender Systems (RecSys 2013), Hong Kong, China, October 13, 2013.<br\/>%U http:\/\/ceur-ws.org\/Vol-1066<br\/>%V 1066<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Name Me If You Can(!) - Leveraging Networks of Given Names<\/span>.<\/span> In: Proceedings from Sunbelt XXXIII (2013).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-aedf89a1eb405370be2a6d8e0c3be382\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-aedf89a1eb405370be2a6d8e0c3be382\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/aedf89a1eb405370be2a6d8e0c3be382\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-aedf89a1eb405370be2a6d8e0c3be382\"><p>@inproceedings{mitzlaff2013leveraging,<br\/>  author = {Mitzlaff, Folke},<br\/>  booktitle = {Proceedings from Sunbelt XXXIII},<br\/>  keywords = {nameling},<br\/>  title = {Name Me If You Can(!) - Leveraging Networks of Given Names},<br\/>  year = 2013<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-aedf89a1eb405370be2a6d8e0c3be382\"><p>%0 Conference Paper<br\/>%1 mitzlaff2013leveraging<br\/>%A Mitzlaff, Folke<br\/>%B Proceedings from Sunbelt XXXIII<br\/>%D 2013<br\/>%T Name Me If You Can(!) - Leveraging Networks of Given Names<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2012\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2012<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Mining Social Media: Key Players, Sentiments, and Communities}<\/span>.<\/span> WIREs: Data Mining and Knowledge Discovery. 1069, (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1b9ea8439dc1f86ded6436883ce4475f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1b9ea8439dc1f86ded6436883ce4475f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1b9ea8439dc1f86ded6436883ce4475f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1b9ea8439dc1f86ded6436883ce4475f\"><p>@article{Atzmueller:12c,<br\/>  author = {Atzmueller, Martin},<br\/>  journal = {WIREs: Data Mining and Knowledge Discovery},<br\/>  keywords = {mining},<br\/>  title = {{Mining Social Media: Key Players, Sentiments, and Communities}},<br\/>  volume = 1069,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1b9ea8439dc1f86ded6436883ce4475f\"><p>%0 Journal Article<br\/>%1 Atzmueller:12c<br\/>%A Atzmueller, Martin<br\/>%D 2012<br\/>%J WIREs: Data Mining and Knowledge Discovery<br\/>%T {Mining Social Media: Key Players, Sentiments, and Communities}<br\/>%V 1069<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Becker, M., Doerfel, S., Kibanov, M., Hotho, A., Macek, B.-E., Mitzlaff, F., Mueller, J., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ubicon: Observing Social and Physical Activities<\/span>.<\/span> In: Proceedings of the 2012 IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besan\u00e7on, France, 20-23 November, 2012. pp. 317\u2013324. IEEE Computer Society, Los Alamitos, CA, USA (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1109\/GreenCom.2012.75\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-54d215e78345e612206c551838099f7e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-54d215e78345e612206c551838099f7e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/54d215e78345e612206c551838099f7e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-54d215e78345e612206c551838099f7e\">The connection of ubiquitous and social computing is an emerging research area which is combining two prominent areas of computer science. In this paper, we tackle this topic from different angles: We describe data mining methods for ubiquitous and social data, specifically focusing on physical and social activities, and provide exemplary analysis results. Furthermore, we give an overview on the Ubicon platform which provides a framework for the creation and hosting of ubiquitous and social applications for diverse tasks and projects. Ubicon features the collection and analysis of both physical and social activities of users for enabling inter-connected applications in ubiquitous and social contexts. We summarize three real-world systems built on top of Ubicon, and exemplarily discuss the according mining and analysis aspects.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-54d215e78345e612206c551838099f7e\"><p>@inproceedings{ABDHKMMMSS:12,<br\/>  abstract = {The connection of ubiquitous and social computing is an emerging research area which is combining two prominent areas of computer science. In this paper, we tackle this topic from different angles: We describe data mining methods for ubiquitous and social data, specifically focusing on physical and social activities, and provide exemplary analysis results. Furthermore, we give an overview on the Ubicon platform which provides a framework for the creation and hosting of ubiquitous and social applications for diverse tasks and projects. Ubicon features the collection and analysis of both physical and social activities of users for enabling inter-connected applications in ubiquitous and social contexts. We summarize three real-world systems built on top of Ubicon, and exemplarily discuss the according mining and analysis aspects.},<br\/>  address = {Los Alamitos, CA, USA},<br\/>  author = {Atzmueller, Martin and Becker, Martin and Doerfel, Stephan and Kibanov, Mark and Hotho, Andreas and Macek, Bj\u00f6rn-Elmar and Mitzlaff, Folke and Mueller, Juergen and Scholz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 2012 IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besan\u00e7on, France, 20-23 November, 2012},<br\/>  keywords = 2012,<br\/>  month = 11,<br\/>  pages = {317-324},<br\/>  publisher = {IEEE Computer Society},<br\/>  title = {Ubicon: Observing Social and Physical Activities},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-54d215e78345e612206c551838099f7e\"><p>%0 Conference Paper<br\/>%1 ABDHKMMMSS:12<br\/>%A Atzmueller, Martin<br\/>%A Becker, Martin<br\/>%A Doerfel, Stephan<br\/>%A Kibanov, Mark<br\/>%A Hotho, Andreas<br\/>%A Macek, Bj\u00f6rn-Elmar<br\/>%A Mitzlaff, Folke<br\/>%A Mueller, Juergen<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 2012 IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besan\u00e7on, France, 20-23 November, 2012<br\/>%C Los Alamitos, CA, USA<br\/>%D 2012<br\/>%I IEEE Computer Society<br\/>%P 317-324<br\/>%T Ubicon: Observing Social and Physical Activities<br\/>%U http:\/\/dx.doi.org\/10.1109\/GreenCom.2012.75<br\/>%X The connection of ubiquitous and social computing is an emerging research area which is combining two prominent areas of computer science. In this paper, we tackle this topic from different angles: We describe data mining methods for ubiquitous and social data, specifically focusing on physical and social activities, and provide exemplary analysis results. Furthermore, we give an overview on the Ubicon platform which provides a framework for the creation and hosting of ubiquitous and social applications for diverse tasks and projects. Ubicon features the collection and analysis of both physical and social activities of users for enabling inter-connected applications in ubiquitous and social contexts. We summarize three real-world systems built on top of Ubicon, and exemplarily discuss the according mining and analysis aspects.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., J\u00e4schke, R., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Leveraging Publication Metadata and Social Data into FolkRank for Scientific Publication Recommendation<\/span>.<\/span> In: Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web. pp. 9\u201316. ACM, Dublin, Ireland (2012). https:\/\/doi.org\/10.1145\/2365934.2365937.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2365934.2365937\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-64bf590675a833770b7d284871435a8d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-64bf590675a833770b7d284871435a8d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2365934.2365937\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/64bf590675a833770b7d284871435a8d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-64bf590675a833770b7d284871435a8d\">The ever-growing flood of new scientific articles requires novel retrieval mechanisms. One means for mitigating this instance of the information overload phenomenon are collaborative tagging systems, that allow users to select, share and annotate references to publications. These systems employ recommendation algorithms to present to their users personalized lists of interesting and relevant publications. In this paper we analyze different ways to incorporate social data and metadata from collaborative tagging systems into the graph-based ranking algorithm FolkRank to utilize it for recommending scientific articles to users of the social bookmarking system BibSonomy. We compare the results to those of Collaborative Filtering, which has previously been applied for resource recommendation.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-64bf590675a833770b7d284871435a8d\"><p>@inproceedings{doerfel2012leveraging,<br\/>  abstract = {The ever-growing flood of new scientific articles requires novel retrieval mechanisms. One means for mitigating this instance of the information overload phenomenon are collaborative tagging systems, that allow users to select, share and annotate references to publications. These systems employ recommendation algorithms to present to their users personalized lists of interesting and relevant publications. In this paper we analyze different ways to incorporate social data and metadata from collaborative tagging systems into the graph-based ranking algorithm FolkRank to utilize it for recommending scientific articles to users of the social bookmarking system BibSonomy. We compare the results to those of Collaborative Filtering, which has previously been applied for resource recommendation.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Doerfel, Stephan and J\u00e4schke, Robert and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web},<br\/>  keywords = {bookmarking},<br\/>  month = {09},<br\/>  pages = {9--16},<br\/>  publisher = {ACM},<br\/>  title = {Leveraging Publication Metadata and Social Data into FolkRank for Scientific Publication Recommendation},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-64bf590675a833770b7d284871435a8d\"><p>%0 Conference Paper<br\/>%1 doerfel2012leveraging<br\/>%A Doerfel, Stephan<br\/>%A J\u00e4schke, Robert<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web<br\/>%C New York, NY, USA<br\/>%D 2012<br\/>%I ACM<br\/>%P 9--16<br\/>%R 10.1145\/2365934.2365937<br\/>%T Leveraging Publication Metadata and Social Data into FolkRank for Scientific Publication Recommendation<br\/>%U http:\/\/doi.acm.org\/10.1145\/2365934.2365937<br\/>%X The ever-growing flood of new scientific articles requires novel retrieval mechanisms. One means for mitigating this instance of the information overload phenomenon are collaborative tagging systems, that allow users to select, share and annotate references to publications. These systems employ recommendation algorithms to present to their users personalized lists of interesting and relevant publications. In this paper we analyze different ways to incorporate social data and metadata from collaborative tagging systems into the graph-based ranking algorithm FolkRank to utilize it for recommending scientific articles to users of the social bookmarking system BibSonomy. We compare the results to those of Collaborative Filtering, which has previously been applied for resource recommendation.<br\/>%@ 978-1-4503-1638-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Landia, N., Anand, S.S., Hotho, A., J\u00e4schke, R., Doerfel, S., Mitzlaff, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Extending FolkRank with Content Data<\/span>.<\/span> In: Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web. pp. 1\u20138. ACM, Dublin, Ireland (2012). https:\/\/doi.org\/10.1145\/2365934.2365936.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2365934.2365936\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b16dabcd7e17b673c34608ac820ce3c7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b16dabcd7e17b673c34608ac820ce3c7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2365934.2365936\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b16dabcd7e17b673c34608ac820ce3c7\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-b16dabcd7e17b673c34608ac820ce3c7\">Real-world tagging datasets have a large proportion of new\/ untagged documents. Few approaches for recommending tags to a user for a document address this new item problem, concentrating instead on artificially created post-core datasets where it is guaranteed that the user as well as the document of each test post is known to the system and already has some tags assigned to it. In order to recommend tags for new documents, approaches are required which model documents not only based on the tags assigned to them in the past (if any), but also the content. In this paper we present a novel adaptation to the widely recognised FolkRank tag recommendation algorithm by including content data. We adapt the FolkRank graph to use word nodes instead of document nodes, enabling it to recommend tags for new documents based on their textual content. Our adaptations make FolkRank applicable to post-core 1 ie. the full real-world tagging datasets and address the new item problem in tag recommendation. For comparison, we also apply and evaluate the same methodology of including content on a simpler tag recommendation algorithm. This results in a less expensive recommender which suggests a combination of user related and document content related tags. Including content data into FolkRank shows an improvement over plain FolkRank on full tagging datasets. However, we also observe that our simpler content-aware tag recommender outperforms FolkRank with content data. Our results suggest that an optimisation of the weighting method of FolkRank is required to achieve better results.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b16dabcd7e17b673c34608ac820ce3c7\"><p>@inproceedings{landia2012extending,<br\/>  abstract = {Real-world tagging datasets have a large proportion of new\/ untagged documents. Few approaches for recommending tags to a user for a document address this new item problem, concentrating instead on artificially created post-core datasets where it is guaranteed that the user as well as the document of each test post is known to the system and already has some tags assigned to it. In order to recommend tags for new documents, approaches are required which model documents not only based on the tags assigned to them in the past (if any), but also the content. In this paper we present a novel adaptation to the widely recognised FolkRank tag recommendation algorithm by including content data. We adapt the FolkRank graph to use word nodes instead of document nodes, enabling it to recommend tags for new documents based on their textual content. Our adaptations make FolkRank applicable to post-core 1 ie. the full real-world tagging datasets and address the new item problem in tag recommendation. For comparison, we also apply and evaluate the same methodology of including content on a simpler tag recommendation algorithm. This results in a less expensive recommender which suggests a combination of user related and document content related tags. Including content data into FolkRank shows an improvement over plain FolkRank on full tagging datasets. However, we also observe that our simpler content-aware tag recommender outperforms FolkRank with content data. Our results suggest that an optimisation of the weighting method of FolkRank is required to achieve better results.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Landia, Nikolas and Anand, Sarabjot Singh and Hotho, Andreas and J\u00e4schke, Robert and Doerfel, Stephan and Mitzlaff, Folke},<br\/>  booktitle = {Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web},<br\/>  keywords = {bookmarking},<br\/>  month = {09},<br\/>  pages = {1--8},<br\/>  publisher = {ACM},<br\/>  title = {Extending FolkRank with Content Data},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b16dabcd7e17b673c34608ac820ce3c7\"><p>%0 Conference Paper<br\/>%1 landia2012extending<br\/>%A Landia, Nikolas<br\/>%A Anand, Sarabjot Singh<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Doerfel, Stephan<br\/>%A Mitzlaff, Folke<br\/>%B Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web<br\/>%C New York, NY, USA<br\/>%D 2012<br\/>%I ACM<br\/>%P 1--8<br\/>%R 10.1145\/2365934.2365936<br\/>%T Extending FolkRank with Content Data<br\/>%U http:\/\/doi.acm.org\/10.1145\/2365934.2365936<br\/>%X Real-world tagging datasets have a large proportion of new\/ untagged documents. Few approaches for recommending tags to a user for a document address this new item problem, concentrating instead on artificially created post-core datasets where it is guaranteed that the user as well as the document of each test post is known to the system and already has some tags assigned to it. In order to recommend tags for new documents, approaches are required which model documents not only based on the tags assigned to them in the past (if any), but also the content. In this paper we present a novel adaptation to the widely recognised FolkRank tag recommendation algorithm by including content data. We adapt the FolkRank graph to use word nodes instead of document nodes, enabling it to recommend tags for new documents based on their textual content. Our adaptations make FolkRank applicable to post-core 1 ie. the full real-world tagging datasets and address the new item problem in tag recommendation. For comparison, we also apply and evaluate the same methodology of including content on a simpler tag recommendation algorithm. This results in a less expensive recommender which suggests a combination of user related and document content related tags. Including content data into FolkRank shows an improvement over plain FolkRank on full tagging datasets. However, we also observe that our simpler content-aware tag recommender outperforms FolkRank with content data. Our results suggest that an optimisation of the weighting method of FolkRank is required to achieve better results.<br\/>%@ 978-1-4503-1638-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kibanov, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Untersuchung von Versionsverwaltungssystemen mit Zielsetzung der Optimierung der kollaborativen Entwicklung<\/span><\/span>, (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-78749ceea6057d7f230f3d16ac9c9bb2\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-78749ceea6057d7f230f3d16ac9c9bb2\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/78749ceea6057d7f230f3d16ac9c9bb2\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-78749ceea6057d7f230f3d16ac9c9bb2\">Many new version control systems were developed in the last years. These compete with established systems as they implement some new concepts. These concepts influence the collaborative software development and even redefine it. Before a new system is introduced, it must be selected by product and process requirements. This thesis describes the evaluation of version control systems and the integration of the selected system by the example of one project of Capgemini Germany. Different properties of version control systems were examined and software development processes were analysed. The 3-staged process was applied for the selection of the control system version. This thesis also treats the problems of the integration of the selected system Git into the existing software development processes and project environment.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-78749ceea6057d7f230f3d16ac9c9bb2\"><p>@mastersthesis{kibanov2012untersuchung,<br\/>  abstract = {Many new version control systems were developed in the last years. These compete with established systems as they implement some new concepts. These concepts influence the collaborative software development and even redefine it. Before a new system is introduced, it must be selected by product and process requirements. This thesis describes the evaluation of version control systems and the integration of the selected system by the example of one project of Capgemini Germany. Different properties of version control systems were examined and software development processes were analysed. The 3-staged process was applied for the selection of the control system version. This thesis also treats the problems of the integration of the selected system Git into the existing software development processes and project environment.},<br\/>  author = {Kibanov, Mark},<br\/>  keywords = {Diplomarbeit},<br\/>  month = {05},<br\/>  school = {Humboldt-University of Berlin},<br\/>  title = {Untersuchung von Versionsverwaltungssystemen mit Zielsetzung der Optimierung der kollaborativen Entwicklung},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-78749ceea6057d7f230f3d16ac9c9bb2\"><p>%0 Thesis<br\/>%1 kibanov2012untersuchung<br\/>%A Kibanov, Mark<br\/>%D 2012<br\/>%T Untersuchung von Versionsverwaltungssystemen mit Zielsetzung der Optimierung der kollaborativen Entwicklung<br\/>%X Many new version control systems were developed in the last years. These compete with established systems as they implement some new concepts. These concepts influence the collaborative software development and even redefine it. Before a new system is introduced, it must be selected by product and process requirements. This thesis describes the evaluation of version control systems and the integration of the selected system by the example of one project of Capgemini Germany. Different properties of version control systems were examined and software development processes were analysed. The 3-staged process was applied for the selection of the control system version. This thesis also treats the problems of the integration of the selected system Git into the existing software development processes and project environment.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S., J\u00e4schke, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Publication Analysis of the Formal Concept Analysis Community<\/span>.<\/span> In: Domenach, F., Ignatov, D., and Poelmans, J. (eds.) Formal Concept Analysis. pp. 77\u201395. Springer, Berlin\/Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29892-9_12.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/doerfel2012publication.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9207cd4b1cf7d87c9ae959ac780e152c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9207cd4b1cf7d87c9ae959ac780e152c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-29892-9_12\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9207cd4b1cf7d87c9ae959ac780e152c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9207cd4b1cf7d87c9ae959ac780e152c\">We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences\u2019 history.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9207cd4b1cf7d87c9ae959ac780e152c\"><p>@inproceedings{doerfel2012publication,<br\/>  abstract = {We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences\u2019 history.},<br\/>  address = {Berlin\/Heidelberg},<br\/>  author = {Doerfel, Stephan and J\u00e4schke, Robert and Stumme, Gerd},<br\/>  booktitle = {Formal Concept Analysis},<br\/>  editor = {Domenach, F. and Ignatov, D.I. and Poelmans, J.},<br\/>  keywords = {icfca},<br\/>  month = {05},<br\/>  pages = {77--95},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Artificial Intelligence},<br\/>  title = {Publication Analysis of the Formal Concept Analysis Community},<br\/>  volume = 7278,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9207cd4b1cf7d87c9ae959ac780e152c\"><p>%0 Conference Paper<br\/>%1 doerfel2012publication<br\/>%A Doerfel, Stephan<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%B Formal Concept Analysis<br\/>%C Berlin\/Heidelberg<br\/>%D 2012<br\/>%E Domenach, F.<br\/>%E Ignatov, D.I.<br\/>%E Poelmans, J.<br\/>%I Springer<br\/>%P 77--95<br\/>%R 10.1007\/978-3-642-29892-9_12<br\/>%T Publication Analysis of the Formal Concept Analysis Community<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/doerfel2012publication.pdf<br\/>%V 7278<br\/>%X We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences\u2019 history.<br\/>%@ 978-3-642-29891-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Balby Marinho, L., Hotho, A., J\u00e4schke, R., Nanopoulos, A., Rendle, S., Schmidt-Thieme, L., Stumme, G., Symeonidis, P.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Recommender Systems for Social Tagging Systems<\/span>.<\/span> Springer (2012). https:\/\/doi.org\/10.1007\/978-1-4614-1894-8.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/link.springer.com\/book\/10.1007\/978-1-4614-1894-8\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-87d6883ebd98e8810be45d7e7e4ade96\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-87d6883ebd98e8810be45d7e7e4ade96\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-1-4614-1894-8\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/87d6883ebd98e8810be45d7e7e4ade96\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-87d6883ebd98e8810be45d7e7e4ade96\">Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the \u201cnoise\u201d that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-87d6883ebd98e8810be45d7e7e4ade96\"><p>@book{balbymarinho2012recommender,<br\/>  abstract = {Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the \u201cnoise\u201d that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.},<br\/>  author = {Balby Marinho, L. and Hotho, A. and J\u00e4schke, R. and Nanopoulos, A. and Rendle, S. and Schmidt-Thieme, L. and Stumme, G. and Symeonidis, P.},<br\/>  keywords = {bookmarking},<br\/>  month = {02},<br\/>  publisher = {Springer},<br\/>  series = {SpringerBriefs in Electrical and Computer Engineering},<br\/>  title = {Recommender Systems for Social Tagging Systems},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-87d6883ebd98e8810be45d7e7e4ade96\"><p>%0 Book<br\/>%1 balbymarinho2012recommender<br\/>%A Balby Marinho, L.<br\/>%A Hotho, A.<br\/>%A J\u00e4schke, R.<br\/>%A Nanopoulos, A.<br\/>%A Rendle, S.<br\/>%A Schmidt-Thieme, L.<br\/>%A Stumme, G.<br\/>%A Symeonidis, P.<br\/>%B SpringerBriefs in Electrical and Computer Engineering<br\/>%D 2012<br\/>%I Springer<br\/>%R 10.1007\/978-1-4614-1894-8<br\/>%T Recommender Systems for Social Tagging Systems<br\/>%U http:\/\/link.springer.com\/book\/10.1007\/978-1-4614-1894-8<br\/>%X Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the \u201cnoise\u201d that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.<br\/>%@ 978-1-4614-1893-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Behrenbruch, K., Atzmueller, M., Evers, C., Schmidt, L., Stumme, G., Geihs, K.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{A Personality Based Design Approach Using Subgroup Discovery}<\/span>.<\/span> In: Human-Centred Software Engineering. pp. 259\u2013266. Springer, Heidelberg, Germany (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-847830846b80d4507aa4b93d1c8deb83\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-847830846b80d4507aa4b93d1c8deb83\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/847830846b80d4507aa4b93d1c8deb83\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-847830846b80d4507aa4b93d1c8deb83\">To facilitate user-centered software engineering, developers need an easy to grasp understanding of the user. The use of personas helps to keep specific user needs in mind during the design process. Technology acceptance is of particular interest for the design of innovative applications previously unknown to potential users. Therefore, our research focuses on defining a typology of relevant user characteristics with respect to technology acceptance and transferring those findings to the description of personas. The presented work focuses on the statistical relationship between technology acceptance and personality. We apply sub-group discovery as a statistical tool. Based on the statistically derived subgroups and patterns we define the mentioned personas to help developers to understand different forms of technology acceptance. By integrating the specifically defined personas into existing methods in the field of software engineering the feasibility of the presented approach is demonstrated.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-847830846b80d4507aa4b93d1c8deb83\"><p>@incollection{BAESSG:12,<br\/>  abstract = {To facilitate user-centered software engineering, developers need an easy to grasp understanding of the user. The use of personas helps to keep specific user needs in mind during the design process. Technology acceptance is of particular interest for the design of innovative applications previously unknown to potential users. Therefore, our research focuses on defining a typology of relevant user characteristics with respect to technology acceptance and transferring those findings to the description of personas. The presented work focuses on the statistical relationship between technology acceptance and personality. We apply sub-group discovery as a statistical tool. Based on the statistically derived subgroups and patterns we define the mentioned personas to help developers to understand different forms of technology acceptance. By integrating the specifically defined personas into existing methods in the field of software engineering the feasibility of the presented approach is demonstrated.},<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Behrenbruch, Kay and Atzmueller, Martin and Evers, Christoph and Schmidt, Ludger and Stumme, Gerd and Geihs, Kurt},<br\/>  booktitle = {Human-Centred Software Engineering},<br\/>  keywords = {itegpub},<br\/>  pages = {259--266},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {{A Personality Based Design Approach Using Subgroup Discovery}},<br\/>  volume = 7623,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-847830846b80d4507aa4b93d1c8deb83\"><p>%0 Book Section<br\/>%1 BAESSG:12<br\/>%A Behrenbruch, Kay<br\/>%A Atzmueller, Martin<br\/>%A Evers, Christoph<br\/>%A Schmidt, Ludger<br\/>%A Stumme, Gerd<br\/>%A Geihs, Kurt<br\/>%B Human-Centred Software Engineering<br\/>%C Heidelberg, Germany<br\/>%D 2012<br\/>%I Springer<br\/>%P 259--266<br\/>%T {A Personality Based Design Approach Using Subgroup Discovery}<br\/>%V 7623<br\/>%X To facilitate user-centered software engineering, developers need an easy to grasp understanding of the user. The use of personas helps to keep specific user needs in mind during the design process. Technology acceptance is of particular interest for the design of innovative applications previously unknown to potential users. Therefore, our research focuses on defining a typology of relevant user characteristics with respect to technology acceptance and transferring those findings to the description of personas. The presented work focuses on the statistical relationship between technology acceptance and personality. We apply sub-group discovery as a statistical tool. Based on the statistically derived subgroups and patterns we define the mentioned personas to help developers to understand different forms of technology acceptance. By integrating the specifically defined personas into existing methods in the field of software engineering the feasibility of the presented approach is demonstrated.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Macek, B.E., Scholz, C., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Anatomy of a Conference<\/span>.<\/span> In: Proc. 23rd ACM Conference on Hypertext and Social Media, HT \u201912 (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/macek-anatomy-of-a-conference-hypertext-2012.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e22cd54a089b96e9218a5340d03e0be0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e22cd54a089b96e9218a5340d03e0be0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e22cd54a089b96e9218a5340d03e0be0\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e22cd54a089b96e9218a5340d03e0be0\"><p>@inproceedings{MASS:12,<br\/>  author = {Macek, Bjoern Elmar and Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {Proc. 23rd ACM Conference on Hypertext and Social Media, HT '12},<br\/>  keywords = {itegpub},<br\/>  title = {Anatomy of a Conference},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e22cd54a089b96e9218a5340d03e0be0\"><p>%0 Conference Paper<br\/>%1 MASS:12<br\/>%A Macek, Bjoern Elmar<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B Proc. 23rd ACM Conference on Hypertext and Social Media, HT '12<br\/>%D 2012<br\/>%T Anatomy of a Conference<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/macek-anatomy-of-a-conference-hypertext-2012.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Analyzing the Predictability of Human Contacts: On Influence Factors and Stronger Ties (Extended Abstract)}<\/span>.<\/span> In: Proc. LWA 2012 (KDML Special Track). University of Dortmund, Dortmund, Germany (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2012-lwa-kdml-link-predictability-f2f-extended-abstract.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e9d35722afa272b1badb6cce48a1cb78\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e9d35722afa272b1badb6cce48a1cb78\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e9d35722afa272b1badb6cce48a1cb78\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e9d35722afa272b1badb6cce48a1cb78\"><p>@inproceedings{SAS:12b,<br\/>  address = {Dortmund, Germany.},<br\/>  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {Proc. LWA 2012 (KDML Special Track)},<br\/>  keywords = {itegpub},<br\/>  publisher = {University of Dortmund},<br\/>  title = {{Analyzing the Predictability of Human Contacts: On Influence Factors and Stronger Ties (Extended Abstract)}},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e9d35722afa272b1badb6cce48a1cb78\"><p>%0 Conference Paper<br\/>%1 SAS:12b<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B Proc. LWA 2012 (KDML Special Track)<br\/>%C Dortmund, Germany.<br\/>%D 2012<br\/>%I University of Dortmund<br\/>%T {Analyzing the Predictability of Human Contacts: On Influence Factors and Stronger Ties (Extended Abstract)}<br\/>%U https:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/2012-lwa-kdml-link-predictability-f2f-extended-abstract.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Doerfel, S., Hotho, A., Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Face-to-Face Contacts at a Conference: Dynamics of Communities and Roles<\/span>.<\/span> In: {Modeling and Mining Ubiquitous Social Media}. Springer Verlag, Heidelberg, Germany (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-face-to-face-contacts-dynamics-lnai-2012.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d81d6f6ccdf3ff6572898d39c90e6354\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d81d6f6ccdf3ff6572898d39c90e6354\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d81d6f6ccdf3ff6572898d39c90e6354\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d81d6f6ccdf3ff6572898d39c90e6354\"><p>@incollection{ADHMS:12,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin and Doerfel, Stephan and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd},<br\/>  booktitle = {{Modeling and Mining Ubiquitous Social Media}},<br\/>  keywords = {contacts},<br\/>  publisher = {Springer Verlag},<br\/>  series = {LNAI},<br\/>  title = {Face-to-Face Contacts at a Conference: Dynamics of Communities and Roles},<br\/>  volume = 7472,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d81d6f6ccdf3ff6572898d39c90e6354\"><p>%0 Book Section<br\/>%1 ADHMS:12<br\/>%A Atzmueller, Martin<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%A Mitzlaff, Folke<br\/>%A Stumme, Gerd<br\/>%B {Modeling and Mining Ubiquitous Social Media}<br\/>%C Heidelberg, Germany<br\/>%D 2012<br\/>%I Springer Verlag<br\/>%T Face-to-Face Contacts at a Conference: Dynamics of Communities and Roles<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-face-to-face-contacts-dynamics-lnai-2012.pdf<br\/>%V 7472<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Atzmueller, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties}<\/span>.<\/span> In: Proc. Fourth ASE\/IEEE International Conference on Social Computing (SocialCom). IEEE Computer Society, Boston, MA, USA (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/scholz-on-f2f-predictability-socialcom-2012.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-be5ae4b92170e7c595f5fdcac15b4786\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-be5ae4b92170e7c595f5fdcac15b4786\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/be5ae4b92170e7c595f5fdcac15b4786\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-be5ae4b92170e7c595f5fdcac15b4786\"><p>@inproceedings{SAS:12,<br\/>  address = {Boston, MA, USA},<br\/>  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},<br\/>  booktitle = {Proc. Fourth ASE\/IEEE International Conference on Social Computing (SocialCom)},<br\/>  keywords = {socialnetworks},<br\/>  publisher = {IEEE Computer Society},<br\/>  title = {{On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties}},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-be5ae4b92170e7c595f5fdcac15b4786\"><p>%0 Conference Paper<br\/>%1 SAS:12<br\/>%A Scholz, Christoph<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%B Proc. Fourth ASE\/IEEE International Conference on Social Computing (SocialCom)<br\/>%C Boston, MA, USA<br\/>%D 2012<br\/>%I IEEE Computer Society<br\/>%T {On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/scholz-on-f2f-predictability-socialcom-2012.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Krause, B., Lerch, H., Hotho, A., Ro\u00dfnagel, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy.<\/span><\/span> Informatik Spektrum. 35, 12\u201323 (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/journals\/insk\/insk35.html#KrauseLHRS12\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-df97de393d3421ef2e20384ddde16ab1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-df97de393d3421ef2e20384ddde16ab1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/df97de393d3421ef2e20384ddde16ab1\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-df97de393d3421ef2e20384ddde16ab1\"><p>@article{journals\/insk\/KrauseLHRS12,<br\/>  author = {Krause, Beate and Lerch, Hana and Hotho, Andreas and Ro\u00dfnagel, Alexander and Stumme, Gerd},<br\/>  journal = {Informatik Spektrum},<br\/>  keywords = {bibsonomy},<br\/>  number = 1,<br\/>  pages = {12-23},<br\/>  title = {Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy.},<br\/>  volume = 35,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-df97de393d3421ef2e20384ddde16ab1\"><p>%0 Journal Article<br\/>%1 journals\/insk\/KrauseLHRS12<br\/>%A Krause, Beate<br\/>%A Lerch, Hana<br\/>%A Hotho, Andreas<br\/>%A Ro\u00dfnagel, Alexander<br\/>%A Stumme, Gerd<br\/>%D 2012<br\/>%J Informatik Spektrum<br\/>%N 1<br\/>%P 12-23<br\/>%T Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/journals\/insk\/insk35.html#KrauseLHRS12<br\/>%V 35<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Chin, A., Helic, D., Hotho, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Modeling and Mining Ubiquitous Social Media<\/span>.<\/span> Springer Verlag, Heidelberg, Germany (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.springer.com\/computer\/ai\/book\/978-3-642-33683-6\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a0e5d144b39199fa4acb6319f29e7a15\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a0e5d144b39199fa4acb6319f29e7a15\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a0e5d144b39199fa4acb6319f29e7a15\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a0e5d144b39199fa4acb6319f29e7a15\"><p>@book{ACHH:12,<br\/>  address = {Heidelberg, Germany},<br\/>  editor = {Atzmueller, Martin and Chin, Alvin and Helic, Denis and Hotho, Andreas},<br\/>  keywords = {media},<br\/>  publisher = {Springer Verlag},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Modeling and Mining Ubiquitous Social Media},<br\/>  volume = 7472,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a0e5d144b39199fa4acb6319f29e7a15\"><p>%0 Book<br\/>%1 ACHH:12<br\/>%B Lecture Notes in Computer Science<br\/>%C Heidelberg, Germany<br\/>%D 2012<br\/>%E Atzmueller, Martin<br\/>%E Chin, Alvin<br\/>%E Helic, Denis<br\/>%E Hotho, Andreas<br\/>%I Springer Verlag<br\/>%T Modeling and Mining Ubiquitous Social Media<br\/>%U http:\/\/www.springer.com\/computer\/ai\/book\/978-3-642-33683-6<br\/>%V 7472<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Hotho, A., Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Challenges in Tag Recommendations for Collaborative Tagging Systems<\/span>.<\/span> In: Pazos Arias, J.J., Fern\u00e1ndez Vilas, A., and D\u00edaz Redondo, R.P. (eds.) Recommender Systems for the Social Web. pp. 65\u201387. Springer, Berlin\/Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25694-3_3.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/978-3-642-25694-3_3\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7d41d332cccc3e7ba8e7dadfb7996337\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7d41d332cccc3e7ba8e7dadfb7996337\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-25694-3_3\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7d41d332cccc3e7ba8e7dadfb7996337\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-7d41d332cccc3e7ba8e7dadfb7996337\">Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding\/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7d41d332cccc3e7ba8e7dadfb7996337\"><p>@incollection{jaeschke2012challenges,<br\/>  abstract = {Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding\/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.},<br\/>  address = {Berlin\/Heidelberg},<br\/>  author = {J\u00e4schke, Robert and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd},<br\/>  booktitle = {Recommender Systems for the Social Web},<br\/>  editor = {Pazos Arias, Jos\u00e9 J. and Fern\u00e1ndez Vilas, Ana and D\u00edaz Redondo, Rebeca P.},<br\/>  keywords = {bookmarking},<br\/>  pages = {65--87},<br\/>  publisher = {Springer},<br\/>  series = {Intelligent Systems Reference Library},<br\/>  title = {Challenges in Tag Recommendations for Collaborative Tagging Systems},<br\/>  volume = 32,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7d41d332cccc3e7ba8e7dadfb7996337\"><p>%0 Book Section<br\/>%1 jaeschke2012challenges<br\/>%A J\u00e4schke, Robert<br\/>%A Hotho, Andreas<br\/>%A Mitzlaff, Folke<br\/>%A Stumme, Gerd<br\/>%B Recommender Systems for the Social Web<br\/>%C Berlin\/Heidelberg<br\/>%D 2012<br\/>%E Pazos Arias, Jos\u00e9 J.<br\/>%E Fern\u00e1ndez Vilas, Ana<br\/>%E D\u00edaz Redondo, Rebeca P.<br\/>%I Springer<br\/>%P 65--87<br\/>%R 10.1007\/978-3-642-25694-3_3<br\/>%T Challenges in Tag Recommendations for Collaborative Tagging Systems<br\/>%U http:\/\/dx.doi.org\/10.1007\/978-3-642-25694-3_3<br\/>%V 32<br\/>%X Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding\/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.<br\/>%@ 978-3-642-25694-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Strohmaier, M., Helic, D., Benz, D., K\u00f6rner, C., Kern, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Evaluation of Folksonomy Induction Algorithms<\/span>.<\/span> Transactions on Intelligent Systems and Technology. (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/tist.acm.org\/index.html\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-603161eb4c5b2f87f3d3a50f87015337\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-603161eb4c5b2f87f3d3a50f87015337\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/603161eb4c5b2f87f3d3a50f87015337\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-603161eb4c5b2f87f3d3a50f87015337\"><p>@article{strohmaier2011evaluation,<br\/>  author = {Strohmaier, Markus and Helic, Denis and Benz, Dominik and K\u00f6rner, Christian and Kern, Roman},<br\/>  journal = {Transactions on Intelligent Systems and Technology},<br\/>  keywords = 2012,<br\/>  title = {Evaluation of Folksonomy Induction Algorithms},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-603161eb4c5b2f87f3d3a50f87015337\"><p>%0 Journal Article<br\/>%1 strohmaier2011evaluation<br\/>%A Strohmaier, Markus<br\/>%A Helic, Denis<br\/>%A Benz, Dominik<br\/>%A K\u00f6rner, Christian<br\/>%A Kern, Roman<br\/>%D 2012<br\/>%J Transactions on Intelligent Systems and Technology<br\/>%T Evaluation of Folksonomy Induction Algorithms<br\/>%U http:\/\/tist.acm.org\/index.html<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kl\u00fcgl, P., Toepfer, M., Lemmerich, F., Hotho, A., Puppe, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Collective Information Extraction with Context-Specific Consistencies.<\/span><\/span> In: Flach, P.A., Bie, T.D., and Cristianini, N. (eds.) ECML\/PKDD (1). pp. 728\u2013743. Springer (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/pkdd\/pkdd2012-1.html#KluglTLHP12\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-afd38525dbe0f52db7389e03aa7df1f7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-afd38525dbe0f52db7389e03aa7df1f7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/afd38525dbe0f52db7389e03aa7df1f7\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-afd38525dbe0f52db7389e03aa7df1f7\"><p>@inproceedings{conf\/pkdd\/KluglTLHP12,<br\/>  author = {Kl\u00fcgl, Peter and Toepfer, Martin and Lemmerich, Florian and Hotho, Andreas and Puppe, Frank},<br\/>  booktitle = {ECML\/PKDD (1)},<br\/>  crossref = {conf\/pkdd\/2012-1},<br\/>  editor = {Flach, Peter A. and Bie, Tijl De and Cristianini, Nello},<br\/>  keywords = {extraction},<br\/>  pages = {728-743},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Collective Information Extraction with Context-Specific Consistencies.},<br\/>  volume = 7523,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-afd38525dbe0f52db7389e03aa7df1f7\"><p>%0 Conference Paper<br\/>%1 conf\/pkdd\/KluglTLHP12<br\/>%A Kl\u00fcgl, Peter<br\/>%A Toepfer, Martin<br\/>%A Lemmerich, Florian<br\/>%A Hotho, Andreas<br\/>%A Puppe, Frank<br\/>%B ECML\/PKDD (1)<br\/>%D 2012<br\/>%E Flach, Peter A.<br\/>%E Bie, Tijl De<br\/>%E Cristianini, Nello<br\/>%I Springer<br\/>%P 728-743<br\/>%T Collective Information Extraction with Context-Specific Consistencies.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/pkdd\/pkdd2012-1.html#KluglTLHP12<br\/>%V 7523<br\/>%@ 978-3-642-33459-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Lemmerich, F., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Describing Locations using Tags and Images: Explorative Pattern Mining in Social Media}<\/span>.<\/span> In: {Modeling and Mining Ubiquitous Social Media}. Springer Verlag, Heidelberg, Germany (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/lemmerich-explorative-pattern-mining-socia-media-lnai-2012.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8435f029bf0e32340e2cf44d0eeb65e7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8435f029bf0e32340e2cf44d0eeb65e7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8435f029bf0e32340e2cf44d0eeb65e7\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8435f029bf0e32340e2cf44d0eeb65e7\"><p>@incollection{LA:12,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Lemmerich, Florian and Atzmueller, Martin},<br\/>  booktitle = {{Modeling and Mining Ubiquitous Social Media}},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  series = {LNAI},<br\/>  title = {{Describing Locations using Tags and Images: Explorative Pattern Mining in Social Media}},<br\/>  volume = 7472,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8435f029bf0e32340e2cf44d0eeb65e7\"><p>%0 Book Section<br\/>%1 LA:12<br\/>%A Lemmerich, Florian<br\/>%A Atzmueller, Martin<br\/>%B {Modeling and Mining Ubiquitous Social Media}<br\/>%C Heidelberg, Germany<br\/>%D 2012<br\/>%I Springer Verlag<br\/>%T {Describing Locations using Tags and Images: Explorative Pattern Mining in Social Media}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/lemmerich-explorative-pattern-mining-socia-media-lnai-2012.pdf<br\/>%V 7472<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ranking Given Names<\/span>.<\/span> In: Marathe, M. and Contractor, N. (eds.) Proceedings of the 1st ASE International Conference on Social Informatics. pp. 185\u2013191. IEEE computer society (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c2f599000eaa568ed4d1b0b9d3f6fadd\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c2f599000eaa568ed4d1b0b9d3f6fadd\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c2f599000eaa568ed4d1b0b9d3f6fadd\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c2f599000eaa568ed4d1b0b9d3f6fadd\"><p>@inproceedings{mitzlaff2012ranking,<br\/>  author = {Mitzlaff, Folke and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 1st ASE International Conference on Social Informatics},<br\/>  editor = {Marathe, Madhav and Contractor, Noshir},<br\/>  keywords = {nameling},<br\/>  pages = {185-191},<br\/>  publisher = {IEEE computer society},<br\/>  title = {Ranking Given Names},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c2f599000eaa568ed4d1b0b9d3f6fadd\"><p>%0 Conference Paper<br\/>%1 mitzlaff2012ranking<br\/>%A Mitzlaff, Folke<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 1st ASE International Conference on Social Informatics<br\/>%D 2012<br\/>%E Marathe, Madhav<br\/>%E Contractor, Noshir<br\/>%I IEEE computer society<br\/>%P 185-191<br\/>%T Ranking Given Names<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Lemmerich, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{VIKAMINE - Open-Source Subgroup Discovery, Pattern Mining, and Analytics}<\/span>.<\/span> In: Proc. ECML\/PKDD 2012: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases. Springer Verlag, Heidelberg, Germany (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-vikamine2-ecml-pkdd-2012.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6969d1f761536f29205eb2a142c17ad7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6969d1f761536f29205eb2a142c17ad7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6969d1f761536f29205eb2a142c17ad7\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6969d1f761536f29205eb2a142c17ad7\"><p>@inproceedings{AL:12a,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Atzmueller, Martin and Lemmerich, Florian},<br\/>  booktitle = {Proc. ECML\/PKDD 2012: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{VIKAMINE - Open-Source Subgroup Discovery, Pattern Mining, and Analytics}},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6969d1f761536f29205eb2a142c17ad7\"><p>%0 Conference Paper<br\/>%1 AL:12a<br\/>%A Atzmueller, Martin<br\/>%A Lemmerich, Florian<br\/>%B Proc. ECML\/PKDD 2012: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases<br\/>%C Heidelberg, Germany<br\/>%D 2012<br\/>%I Springer Verlag<br\/>%T {VIKAMINE - Open-Source Subgroup Discovery, Pattern Mining, and Analytics}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-vikamine2-ecml-pkdd-2012.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Landia, N., Anand, S.S., Hotho, A., J{\u00e4}schke, R., Doerfel, S., Mitzlaff, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Extending FolkRank with content data<\/span>.<\/span> In: Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web. pp. 1\u20138. ACM, Dublin, Ireland (2012). https:\/\/doi.org\/10.1145\/2365934.2365936.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2365934.2365936\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a97bf903435d6fc4fc61e2bb7e3913b9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a97bf903435d6fc4fc61e2bb7e3913b9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2365934.2365936\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a97bf903435d6fc4fc61e2bb7e3913b9\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-a97bf903435d6fc4fc61e2bb7e3913b9\">Real-world tagging datasets have a large proportion of new\/ untagged documents. Few approaches for recommending tags to a user for a document address this new item problem, concentrating instead on artificially created post-core datasets where it is guaranteed that the user as well as the document of each test post is known to the system and already has some tags assigned to it. In order to recommend tags for new documents, approaches are required which model documents not only based on the tags assigned to them in the past (if any), but also the content. In this paper we present a novel adaptation to the widely recognised FolkRank tag recommendation algorithm by including content data. We adapt the FolkRank graph to use word nodes instead of document nodes, enabling it to recommend tags for new documents based on their textual content. Our adaptations make FolkRank applicable to post-core 1 ie. the full real-world tagging datasets and address the new item problem in tag recommendation. For comparison, we also apply and evaluate the same methodology of including content on a simpler tag recommendation algorithm. This results in a less expensive recommender which suggests a combination of user related and document content related tags.<\/p> <p>Including content data into FolkRank shows an improvement over plain FolkRank on full tagging datasets. However, we also observe that our simpler content-aware tag recommender outperforms FolkRank with content data. Our results suggest that an optimisation of the weighting method of FolkRank is required to achieve better results.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a97bf903435d6fc4fc61e2bb7e3913b9\"><p>@inproceedings{Landia:2012:EFC:2365934.2365936,<br\/>  abstract = {Real-world tagging datasets have a large proportion of new\/ untagged documents. Few approaches for recommending tags to a user for a document address this new item problem, concentrating instead on artificially created post-core datasets where it is guaranteed that the user as well as the document of each test post is known to the system and already has some tags assigned to it. In order to recommend tags for new documents, approaches are required which model documents not only based on the tags assigned to them in the past (if any), but also the content. In this paper we present a novel adaptation to the widely recognised FolkRank tag recommendation algorithm by including content data. We adapt the FolkRank graph to use word nodes instead of document nodes, enabling it to recommend tags for new documents based on their textual content. Our adaptations make FolkRank applicable to post-core 1 ie. the full real-world tagging datasets and address the new item problem in tag recommendation. For comparison, we also apply and evaluate the same methodology of including content on a simpler tag recommendation algorithm. This results in a less expensive recommender which suggests a combination of user related and document content related tags.<\/p> <p>Including content data into FolkRank shows an improvement over plain FolkRank on full tagging datasets. However, we also observe that our simpler content-aware tag recommender outperforms FolkRank with content data. Our results suggest that an optimisation of the weighting method of FolkRank is required to achieve better results.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Landia, Nikolas and Anand, Sarabjot Singh and Hotho, Andreas and J{\u00e4}schke, Robert and Doerfel, Stephan and Mitzlaff, Folke},<br\/>  booktitle = {Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web},<br\/>  keywords = {bookmarking},<br\/>  pages = {1--8},<br\/>  publisher = {ACM},<br\/>  series = {RSWeb '12},<br\/>  title = {Extending FolkRank with content data},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a97bf903435d6fc4fc61e2bb7e3913b9\"><p>%0 Conference Paper<br\/>%1 Landia:2012:EFC:2365934.2365936<br\/>%A Landia, Nikolas<br\/>%A Anand, Sarabjot Singh<br\/>%A Hotho, Andreas<br\/>%A J{\u00e4}schke, Robert<br\/>%A Doerfel, Stephan<br\/>%A Mitzlaff, Folke<br\/>%B Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web<br\/>%C New York, NY, USA<br\/>%D 2012<br\/>%I ACM<br\/>%P 1--8<br\/>%R 10.1145\/2365934.2365936<br\/>%T Extending FolkRank with content data<br\/>%U http:\/\/doi.acm.org\/10.1145\/2365934.2365936<br\/>%X Real-world tagging datasets have a large proportion of new\/ untagged documents. Few approaches for recommending tags to a user for a document address this new item problem, concentrating instead on artificially created post-core datasets where it is guaranteed that the user as well as the document of each test post is known to the system and already has some tags assigned to it. In order to recommend tags for new documents, approaches are required which model documents not only based on the tags assigned to them in the past (if any), but also the content. In this paper we present a novel adaptation to the widely recognised FolkRank tag recommendation algorithm by including content data. We adapt the FolkRank graph to use word nodes instead of document nodes, enabling it to recommend tags for new documents based on their textual content. Our adaptations make FolkRank applicable to post-core 1 ie. the full real-world tagging datasets and address the new item problem in tag recommendation. For comparison, we also apply and evaluate the same methodology of including content on a simpler tag recommendation algorithm. This results in a less expensive recommender which suggests a combination of user related and document content related tags.<\/p> <p>Including content data into FolkRank shows an improvement over plain FolkRank on full tagging datasets. However, we also observe that our simpler content-aware tag recommender outperforms FolkRank with content data. Our results suggest that an optimisation of the weighting method of FolkRank is required to achieve better results.<br\/>%@ 978-1-4503-1638-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kl\u00fcgl, P., Toepfer, M., Lemmerich, F., Hotho, A., Puppe, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Stacked Conditional Random Fields Exploiting Structural Consistencies<\/span>.<\/span> In: Carmona, P.L., S\u00e1nchez, J.S., and Fred, A. (eds.) Proceedings of 1st International Conference on Pattern Recognition Applications and Methods ICPRAM. pp. 240\u2013248. SciTePress, Vilamoura, Algarve, Portugal (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ki.informatik.uni-wuerzburg.de\/papers\/pkluegl\/2012-ICPRAM-StackedCRF.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7920d13d4fce68bb9a4947585083986e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7920d13d4fce68bb9a4947585083986e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7920d13d4fce68bb9a4947585083986e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-7920d13d4fce68bb9a4947585083986e\">Conditional Random Fields CRF are popular methods for labeling unstructured or textual data. Like many machine learning approaches these undirected graphical models assume the instances to be independently distributed. However, in real world applications data is grouped in a natural way, e.g., by its creation context. The instances in each group often share additional structural consistencies. This paper proposes a domain-independent method for exploiting these consistencies by combining two CRFs in a stacked learning framework. The approach incorporates three successive steps of inference: First, an initial CRF processes single instances as usual. Next, we apply rule learning collectively on all labeled outputs of one context to acquire descriptions of its specific properties. Finally, we utilize these descriptions as dynamic and high quality features in an additional stacked CRF. The presented approach is evaluated with a real-world dataset for the segmentation of references and achieves a significant reduction of the labeling error.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7920d13d4fce68bb9a4947585083986e\"><p>@inproceedings{kluegl2012stacked,<br\/>  abstract = {Conditional Random Fields CRF are popular methods for labeling unstructured or textual data. Like many machine learning approaches these undirected graphical models assume the instances to be independently distributed. However, in real world applications data is grouped in a natural way, e.g., by its creation context. The instances in each group often share additional structural consistencies. This paper proposes a domain-independent method for exploiting these consistencies by combining two CRFs in a stacked learning framework. The approach incorporates three successive steps of inference: First, an initial CRF processes single instances as usual. Next, we apply rule learning collectively on all labeled outputs of one context to acquire descriptions of its specific properties. Finally, we utilize these descriptions as dynamic and high quality features in an additional stacked CRF. The presented approach is evaluated with a real-world dataset for the segmentation of references and achieves a significant reduction of the labeling error.},<br\/>  address = {Vilamoura, Algarve, Portugal},<br\/>  author = {Kl\u00fcgl, Peter and Toepfer, Martin and Lemmerich, Florian and Hotho, Andreas and Puppe, Frank},<br\/>  booktitle = {Proceedings of 1st International Conference on Pattern Recognition Applications and Methods ICPRAM},<br\/>  editor = {Carmona, Pedro Latorre and S\u00e1nchez, J. Salvador and Fred, Ana},<br\/>  keywords = {fields},<br\/>  pages = {240-248},<br\/>  publisher = {SciTePress},<br\/>  title = {Stacked Conditional Random Fields Exploiting Structural Consistencies},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7920d13d4fce68bb9a4947585083986e\"><p>%0 Conference Paper<br\/>%1 kluegl2012stacked<br\/>%A Kl\u00fcgl, Peter<br\/>%A Toepfer, Martin<br\/>%A Lemmerich, Florian<br\/>%A Hotho, Andreas<br\/>%A Puppe, Frank<br\/>%B Proceedings of 1st International Conference on Pattern Recognition Applications and Methods ICPRAM<br\/>%C Vilamoura, Algarve, Portugal<br\/>%D 2012<br\/>%E Carmona, Pedro Latorre<br\/>%E S\u00e1nchez, J. Salvador<br\/>%E Fred, Ana<br\/>%I SciTePress<br\/>%P 240-248<br\/>%T Stacked Conditional Random Fields Exploiting Structural Consistencies<br\/>%U http:\/\/ki.informatik.uni-wuerzburg.de\/papers\/pkluegl\/2012-ICPRAM-StackedCRF.pdf<br\/>%X Conditional Random Fields CRF are popular methods for labeling unstructured or textual data. Like many machine learning approaches these undirected graphical models assume the instances to be independently distributed. However, in real world applications data is grouped in a natural way, e.g., by its creation context. The instances in each group often share additional structural consistencies. This paper proposes a domain-independent method for exploiting these consistencies by combining two CRFs in a stacked learning framework. The approach incorporates three successive steps of inference: First, an initial CRF processes single instances as usual. Next, we apply rule learning collectively on all labeled outputs of one context to acquire descriptions of its specific properties. Finally, we utilize these descriptions as dynamic and high quality features in an additional stacked CRF. The presented approach is evaluated with a real-world dataset for the segmentation of references and achieves a significant reduction of the labeling error.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Hotho, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings of the Third International Workshop on Mining Ubiquitous and Social Environments (MUSE 2012)}<\/span>.<\/span> Workshop Notes, Bristol, UK (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/muse2012\/proceedings.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5304ffe0848eccd3938b50c811d2556d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5304ffe0848eccd3938b50c811d2556d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5304ffe0848eccd3938b50c811d2556d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5304ffe0848eccd3938b50c811d2556d\"><p>@book{AH:12,<br\/>  address = {Bristol, UK},<br\/>  editor = {Atzmueller, Martin and Hotho, Andreas},<br\/>  keywords = {muse},<br\/>  publisher = {Workshop Notes},<br\/>  title = {{Proceedings of the Third International Workshop on Mining Ubiquitous and Social Environments (MUSE 2012)}},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5304ffe0848eccd3938b50c811d2556d\"><p>%0 Book<br\/>%1 AH:12<br\/>%C Bristol, UK<br\/>%D 2012<br\/>%E Atzmueller, Martin<br\/>%E Hotho, Andreas<br\/>%I Workshop Notes<br\/>%T {Proceedings of the Third International Workshop on Mining Ubiquitous and Social Environments (MUSE 2012)}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/muse2012\/proceedings.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Onto Collective Intelligence in Social Media: Exemplary Applications and Perspectives}<\/span>.<\/span> In: Proc. 3rd International Workshop on Modeling Social Media (MSM 2012), Hypertext 2012. ACM Press, New York, NY, USA (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-52600def4f1f0d36b86ed4fbd15e353a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-52600def4f1f0d36b86ed4fbd15e353a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/52600def4f1f0d36b86ed4fbd15e353a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-52600def4f1f0d36b86ed4fbd15e353a\"><p>@inproceedings{Atzmueller:12b,<br\/>  address = {New York, NY, USA},<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Proc. 3rd International Workshop on Modeling Social Media (MSM 2012), Hypertext 2012},<br\/>  keywords = {itegpub},<br\/>  publisher = {ACM Press},<br\/>  title = {{Onto Collective Intelligence in Social Media: Exemplary Applications and Perspectives}},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-52600def4f1f0d36b86ed4fbd15e353a\"><p>%0 Conference Paper<br\/>%1 Atzmueller:12b<br\/>%A Atzmueller, Martin<br\/>%B Proc. 3rd International Workshop on Modeling Social Media (MSM 2012), Hypertext 2012<br\/>%C New York, NY, USA<br\/>%D 2012<br\/>%I ACM Press<br\/>%T {Onto Collective Intelligence in Social Media: Exemplary Applications and Perspectives}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Beer, S., Puppe, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Data Mining, Validation and Collaborative Knowledge Capture}<\/span>.<\/span> In: Br\u00fcggemann, S. and d\u2019Amato, C. (eds.) Collaboration and the Semantic Web: Social Networks, Knowledge Networks, and Knowledge Resources. pp. 149\u2013167. IGI Global (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-781410de8780f9033aae08162cbdf073\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-781410de8780f9033aae08162cbdf073\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/781410de8780f9033aae08162cbdf073\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-781410de8780f9033aae08162cbdf073\"><p>@incollection{ABP:11,<br\/>  author = {Atzmueller, Martin and Beer, Stephanie and Puppe, Frank},<br\/>  booktitle = {Collaboration and the Semantic Web: Social Networks, Knowledge Networks, and Knowledge Resources},<br\/>  editor = {Br\u00fcggemann, Stefan and d\u2019Amato, Claudia},<br\/>  keywords = {itegpub},<br\/>  pages = {149-167},<br\/>  publisher = {IGI Global},<br\/>  title = {{Data Mining, Validation and Collaborative Knowledge Capture}},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-781410de8780f9033aae08162cbdf073\"><p>%0 Book Section<br\/>%1 ABP:11<br\/>%A Atzmueller, Martin<br\/>%A Beer, Stephanie<br\/>%A Puppe, Frank<br\/>%B Collaboration and the Semantic Web: Social Networks, Knowledge Networks, and Knowledge Resources<br\/>%D 2012<br\/>%E Br\u00fcggemann, Stefan<br\/>%E d\u2019Amato, Claudia<br\/>%I IGI Global<br\/>%P 149-167<br\/>%T {Data Mining, Validation and Collaborative Knowledge Capture}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mobasher, B., Jannach, D., Geyer, W., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">4th ACM RecSys workshop on recommender systems and the social web.<\/span><\/span> In: Cunningham, P., Hurley, N.J., Guy, I., and Anand, S.S. (eds.) RecSys. pp. 345\u2013346. ACM (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/recsys\/recsys2012.html#MobasherJGH12\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fe34d757dd2ec79a40d2baa55115898d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fe34d757dd2ec79a40d2baa55115898d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fe34d757dd2ec79a40d2baa55115898d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fe34d757dd2ec79a40d2baa55115898d\"><p>@inproceedings{conf\/recsys\/MobasherJGH12,<br\/>  author = {Mobasher, Bamshad and Jannach, Dietmar and Geyer, Werner and Hotho, Andreas},<br\/>  booktitle = {RecSys},<br\/>  crossref = {conf\/recsys\/2012},<br\/>  editor = {Cunningham, Padraig and Hurley, Neil J. and Guy, Ido and Anand, Sarabjot Singh},<br\/>  keywords = {recommender},<br\/>  pages = {345-346},<br\/>  publisher = {ACM},<br\/>  title = {4th ACM RecSys workshop on recommender systems and the social web.},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fe34d757dd2ec79a40d2baa55115898d\"><p>%0 Conference Paper<br\/>%1 conf\/recsys\/MobasherJGH12<br\/>%A Mobasher, Bamshad<br\/>%A Jannach, Dietmar<br\/>%A Geyer, Werner<br\/>%A Hotho, Andreas<br\/>%B RecSys<br\/>%D 2012<br\/>%E Cunningham, Padraig<br\/>%E Hurley, Neil J.<br\/>%E Guy, Ido<br\/>%E Anand, Sarabjot Singh<br\/>%I ACM<br\/>%P 345-346<br\/>%T 4th ACM RecSys workshop on recommender systems and the social web.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/recsys\/recsys2012.html#MobasherJGH12<br\/>%@ 978-1-4503-1270-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Lemmerich, F., Becker, M., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Generic Pattern Trees for Exhaustive Exceptional Model Mining}<\/span>.<\/span> In: Proc. ECML\/PKDD 2012: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases. Springer Verlag, Heidelberg, Germany (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/lemmerich-gp-growth-ecml-pkdd-2012.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-53914229c652e1298c7d69836b804aeb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-53914229c652e1298c7d69836b804aeb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/53914229c652e1298c7d69836b804aeb\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-53914229c652e1298c7d69836b804aeb\"><p>@inproceedings{LBA:12,<br\/>  address = {Heidelberg, Germany},<br\/>  author = {Lemmerich, Florian and Becker, Martin and Atzmueller, Martin},<br\/>  booktitle = {Proc. ECML\/PKDD 2012: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer Verlag},<br\/>  title = {{Generic Pattern Trees for Exhaustive Exceptional Model Mining}},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-53914229c652e1298c7d69836b804aeb\"><p>%0 Conference Paper<br\/>%1 LBA:12<br\/>%A Lemmerich, Florian<br\/>%A Becker, Martin<br\/>%A Atzmueller, Martin<br\/>%B Proc. ECML\/PKDD 2012: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases<br\/>%C Heidelberg, Germany<br\/>%D 2012<br\/>%I Springer Verlag<br\/>%T {Generic Pattern Trees for Exhaustive Exceptional Model Mining}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/lemmerich-gp-growth-ecml-pkdd-2012.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Chin, A., Atzmueller, M., Helic, D. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings MSM 2012: Workshop on Modeling Social Media -- Collective Intelligence in Social Media}<\/span>.<\/span> ACM Press, New York, NY, USA (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-338ca2515a0f6cd77996d1bbf54c7f4d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-338ca2515a0f6cd77996d1bbf54c7f4d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/338ca2515a0f6cd77996d1bbf54c7f4d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-338ca2515a0f6cd77996d1bbf54c7f4d\"><p>@proceedings{CAH:12,<br\/>  address = {New York, NY, USA},<br\/>  editor = {Chin, Alvin and Atzmueller, Martin and Helic, Denis},<br\/>  keywords = {itegpub},<br\/>  publisher = {ACM Press},<br\/>  title = {{Proceedings MSM 2012: Workshop on Modeling Social Media -- Collective Intelligence in Social Media}},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-338ca2515a0f6cd77996d1bbf54c7f4d\"><p>%0 Conference Proceedings<br\/>%1 CAH:12<br\/>%C New York, NY, USA<br\/>%D 2012<br\/>%E Chin, Alvin<br\/>%E Atzmueller, Martin<br\/>%E Helic, Denis<br\/>%I ACM Press<br\/>%T {Proceedings MSM 2012: Workshop on Modeling Social Media -- Collective Intelligence in Social Media}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Relatedness of Given Names<\/span>.<\/span> Human Journal. 1, 205\u2013217 (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/mitzlaff2012relatedness.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-63b13ff16093202c535e5aaac107e567\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-63b13ff16093202c535e5aaac107e567\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/63b13ff16093202c535e5aaac107e567\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-63b13ff16093202c535e5aaac107e567\">As a result of the author's need for help in finding a given namefor the unborn baby, nameling, a search engine for given names, based on data from the ``Social Web'' was born. Within less than six months, more than 35,000 users accessed nameling with more than 300,000 search requests, underpinning the relevance of the underlying research questions. The present work proposes a new approach for discovering relations among given names, based on co-occurrences within Wikipedia. In particular, the task of finding relevant names for a given search query is considered as a ranking task and the performance of different measures of relatedness among given names are evaluated with respect to nameling's actual usage data. We will show that a modification for the PageRank algorithm overcomes limitations imposed by global network characteristics to preferential PageRank computations. By publishing the considered usage data, the research community is stipulated for developing advanced recommendation systems and analyzing influencing factors for the choice of a given name.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-63b13ff16093202c535e5aaac107e567\"><p>@article{mitzlaff2012relatedness,<br\/>  abstract = {As a result of the author's need for help in finding a given namefor the unborn baby, nameling, a search engine for given names, based on data from the ``Social Web'' was born. Within less than six months, more than 35,000 users accessed nameling with more than 300,000 search requests, underpinning the relevance of the underlying research questions. The present work proposes a new approach for discovering relations among given names, based on co-occurrences within Wikipedia. In particular, the task of finding relevant names for a given search query is considered as a ranking task and the performance of different measures of relatedness among given names are evaluated with respect to nameling's actual usage data. We will show that a modification for the PageRank algorithm overcomes limitations imposed by global network characteristics to preferential PageRank computations. By publishing the considered usage data, the research community is stipulated for developing advanced recommendation systems and analyzing influencing factors for the choice of a given name.},<br\/>  author = {Mitzlaff, Folke and Stumme, Gerd},<br\/>  journal = {Human Journal},<br\/>  keywords = {nameling},<br\/>  number = 4,<br\/>  pages = {205-217},<br\/>  publisher = {Academy of Science and Engineering},<br\/>  title = {Relatedness of Given Names},<br\/>  volume = 1,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-63b13ff16093202c535e5aaac107e567\"><p>%0 Journal Article<br\/>%1 mitzlaff2012relatedness<br\/>%A Mitzlaff, Folke<br\/>%A Stumme, Gerd<br\/>%D 2012<br\/>%I Academy of Science and Engineering<br\/>%J Human Journal<br\/>%N 4<br\/>%P 205-217<br\/>%T Relatedness of Given Names<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/mitzlaff2012relatedness.pdf<br\/>%V 1<br\/>%X As a result of the author's need for help in finding a given namefor the unborn baby, nameling, a search engine for given names, based on data from the ``Social Web'' was born. Within less than six months, more than 35,000 users accessed nameling with more than 300,000 search requests, underpinning the relevance of the underlying research questions. The present work proposes a new approach for discovering relations among given names, based on co-occurrences within Wikipedia. In particular, the task of finding relevant names for a given search query is considered as a ranking task and the performance of different measures of relatedness among given names are evaluated with respect to nameling's actual usage data. We will show that a modification for the PageRank algorithm overcomes limitations imposed by global network characteristics to preferential PageRank computations. By publishing the considered usage data, the research community is stipulated for developing advanced recommendation systems and analyzing influencing factors for the choice of a given name.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mobasher, B., Jannach, D., Geyer, W., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">RSWeb \u201912: Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web<\/span>.<\/span> ACM, Dublin, Ireland (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-354947709c23c90b18dae862c46b2761\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-354947709c23c90b18dae862c46b2761\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/354947709c23c90b18dae862c46b2761\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-354947709c23c90b18dae862c46b2761\">The new opportunities for applying recommendation techniques within Social Web platforms and applications as well as the various new sources of information which have become available in the Web 2.0 and can be incorporated in future recommender applications are a strong driving factor in current recommender system research for various reasons:<\/p> <p>(1) Social systems by their definition encourage interaction between users and both online content and other users, thus generating new sources of knowledge for recommender systems. Web 2.0 users explicitly provide personal information and implicitly express preferences through their interactions with others and the system (e.g. commenting, friending, rating, etc.). These various new sources of knowledge can be leveraged to improve recommendation techniques and develop new strategies which focus on social recommendation.<\/p> <p>(2) New application areas for recommender systems emerge with the popularity of the Social Web. Recommenders cannot only be used to sort and filter Web 2.0 and social network information, they can also support users in the information sharing process, e.g., by recommending suitable tags during folksonomy development.<\/p> <p>(3) Recommender technology can assist Social Web systems through increasing adoption and participation and sustaining membership. Through targeted and timely intervention which stimulates traffic and interaction, recommender technology can play its role in sustaining the success of the Social Web.<\/p> <p>(4) The Social Web also presents new challenges for recommender systems, such as the complicated nature of human-to-human interaction which comes into play when recommending people and can require more interactive and richer recommender systems user interfaces.<\/p> <p>The technical papers appearing in these proceedings aim to explore and understand challenges and new opportunities for recommender systems in the Social Web and were selected in a formal review process by an international program committee.<\/p> <p>Overall, we received 13 paper submissions from 12 different countries, out of which 7 long papers and 1 short paper were selected for presentation and inclusion in the proceedings. The submitted papers addressed a variety of topics related to Social Web recommender systems from the use of microblogging data for personalization over new tag recommendation approaches to social media-based personalization of news.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-354947709c23c90b18dae862c46b2761\"><p>@proceedings{Mobasher:2012:2365934,<br\/>  abstract = {The new opportunities for applying recommendation techniques within Social Web platforms and applications as well as the various new sources of information which have become available in the Web 2.0 and can be incorporated in future recommender applications are a strong driving factor in current recommender system research for various reasons:<\/p> <p>(1) Social systems by their definition encourage interaction between users and both online content and other users, thus generating new sources of knowledge for recommender systems. Web 2.0 users explicitly provide personal information and implicitly express preferences through their interactions with others and the system (e.g. commenting, friending, rating, etc.). These various new sources of knowledge can be leveraged to improve recommendation techniques and develop new strategies which focus on social recommendation.<\/p> <p>(2) New application areas for recommender systems emerge with the popularity of the Social Web. Recommenders cannot only be used to sort and filter Web 2.0 and social network information, they can also support users in the information sharing process, e.g., by recommending suitable tags during folksonomy development.<\/p> <p>(3) Recommender technology can assist Social Web systems through increasing adoption and participation and sustaining membership. Through targeted and timely intervention which stimulates traffic and interaction, recommender technology can play its role in sustaining the success of the Social Web.<\/p> <p>(4) The Social Web also presents new challenges for recommender systems, such as the complicated nature of human-to-human interaction which comes into play when recommending people and can require more interactive and richer recommender systems user interfaces.<\/p> <p>The technical papers appearing in these proceedings aim to explore and understand challenges and new opportunities for recommender systems in the Social Web and were selected in a formal review process by an international program committee.<\/p> <p>Overall, we received 13 paper submissions from 12 different countries, out of which 7 long papers and 1 short paper were selected for presentation and inclusion in the proceedings. The submitted papers addressed a variety of topics related to Social Web recommender systems from the use of microblogging data for personalization over new tag recommendation approaches to social media-based personalization of news.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Mobasher, Bamshad and Jannach, Dietmar and Geyer, Werner and Hotho, Andreas},<br\/>  keywords = {rsweb},<br\/>  note = 609126,<br\/>  publisher = {ACM},<br\/>  title = {RSWeb '12: Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-354947709c23c90b18dae862c46b2761\"><p>%0 Conference Proceedings<br\/>%1 Mobasher:2012:2365934<br\/>%A Mobasher, Bamshad<br\/>%A Jannach, Dietmar<br\/>%A Geyer, Werner<br\/>%A Hotho, Andreas<br\/>%C New York, NY, USA<br\/>%D 2012<br\/>%I ACM<br\/>%T RSWeb '12: Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web<br\/>%X The new opportunities for applying recommendation techniques within Social Web platforms and applications as well as the various new sources of information which have become available in the Web 2.0 and can be incorporated in future recommender applications are a strong driving factor in current recommender system research for various reasons:<\/p> <p>(1) Social systems by their definition encourage interaction between users and both online content and other users, thus generating new sources of knowledge for recommender systems. Web 2.0 users explicitly provide personal information and implicitly express preferences through their interactions with others and the system (e.g. commenting, friending, rating, etc.). These various new sources of knowledge can be leveraged to improve recommendation techniques and develop new strategies which focus on social recommendation.<\/p> <p>(2) New application areas for recommender systems emerge with the popularity of the Social Web. Recommenders cannot only be used to sort and filter Web 2.0 and social network information, they can also support users in the information sharing process, e.g., by recommending suitable tags during folksonomy development.<\/p> <p>(3) Recommender technology can assist Social Web systems through increasing adoption and participation and sustaining membership. Through targeted and timely intervention which stimulates traffic and interaction, recommender technology can play its role in sustaining the success of the Social Web.<\/p> <p>(4) The Social Web also presents new challenges for recommender systems, such as the complicated nature of human-to-human interaction which comes into play when recommending people and can require more interactive and richer recommender systems user interfaces.<\/p> <p>The technical papers appearing in these proceedings aim to explore and understand challenges and new opportunities for recommender systems in the Social Web and were selected in a formal review process by an international program committee.<\/p> <p>Overall, we received 13 paper submissions from 12 different countries, out of which 7 long papers and 1 short paper were selected for presentation and inclusion in the proceedings. The submitted papers addressed a variety of topics related to Social Web recommender systems from the use of microblogging data for personalization over new tag recommendation approaches to social media-based personalization of news.<br\/>%@ 978-1-4503-1638-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Said, A., Tikk, D., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The challenge of recommender systems challenges.<\/span><\/span> In: Cunningham, P., Hurley, N.J., Guy, I., and Anand, S.S. (eds.) RecSys. pp. 9\u201310. ACM (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/recsys\/recsys2012.html#SaidTH12\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e030cb4883f2e989a903ed65d0a13308\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e030cb4883f2e989a903ed65d0a13308\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e030cb4883f2e989a903ed65d0a13308\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e030cb4883f2e989a903ed65d0a13308\"><p>@inproceedings{conf\/recsys\/SaidTH12,<br\/>  author = {Said, Alan and Tikk, Domonkos and Hotho, Andreas},<br\/>  booktitle = {RecSys},<br\/>  crossref = {conf\/recsys\/2012},<br\/>  editor = {Cunningham, Padraig and Hurley, Neil J. and Guy, Ido and Anand, Sarabjot Singh},<br\/>  keywords = {recommender},<br\/>  pages = {9-10},<br\/>  publisher = {ACM},<br\/>  title = {The challenge of recommender systems challenges.},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e030cb4883f2e989a903ed65d0a13308\"><p>%0 Conference Paper<br\/>%1 conf\/recsys\/SaidTH12<br\/>%A Said, Alan<br\/>%A Tikk, Domonkos<br\/>%A Hotho, Andreas<br\/>%B RecSys<br\/>%D 2012<br\/>%E Cunningham, Padraig<br\/>%E Hurley, Neil J.<br\/>%E Guy, Ido<br\/>%E Anand, Sarabjot Singh<br\/>%I ACM<br\/>%P 9-10<br\/>%T The challenge of recommender systems challenges.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/recsys\/recsys2012.html#SaidTH12<br\/>%@ 978-1-4503-1270-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Publikationen im Web 2.0<\/span>.<\/span> Informatik-Spektrum. 1\u20135 (2012). https:\/\/doi.org\/10.1007\/s00287-012-0653-0.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/s00287-012-0653-0\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5c84f670315f76a9e7fc9857738d571e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5c84f670315f76a9e7fc9857738d571e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s00287-012-0653-0\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5c84f670315f76a9e7fc9857738d571e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5c84f670315f76a9e7fc9857738d571e\"><p>@article{hotho2012publikationen,<br\/>  address = {Berlin \/ Heidelberg},<br\/>  author = {Hotho, Andreas},<br\/>  journal = {Informatik-Spektrum},<br\/>  keywords = {publications},<br\/>  pages = {1-5},<br\/>  publisher = {Springer},<br\/>  title = {Publikationen im Web 2.0},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5c84f670315f76a9e7fc9857738d571e\"><p>%0 Journal Article<br\/>%1 hotho2012publikationen<br\/>%A Hotho, Andreas<br\/>%C Berlin \/ Heidelberg<br\/>%D 2012<br\/>%I Springer<br\/>%J Informatik-Spektrum<br\/>%P 1-5<br\/>%R 10.1007\/s00287-012-0653-0<br\/>%T Publikationen im Web 2.0<br\/>%U http:\/\/dx.doi.org\/10.1007\/s00287-012-0653-0<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Seipel, D., Neubeck, P., K\u00f6hler, S., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Mining Complex Event Patterns in Computer Networks}<\/span>.<\/span> In: Proc. ECML\/PKDD Workshop on New Frontiers in Mining Complex Patterns. , Bristol, UK (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e80737788c869221f272dd9af03acecf\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e80737788c869221f272dd9af03acecf\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e80737788c869221f272dd9af03acecf\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e80737788c869221f272dd9af03acecf\"><p>@inproceedings{SNKA:12,<br\/>  address = {Bristol, UK},<br\/>  author = {Seipel, Dietmar and Neubeck, Philipp and K\u00f6hler, Stefan and Atzmueller, Martin},<br\/>  booktitle = {Proc. ECML\/PKDD Workshop on New Frontiers in Mining Complex Patterns},<br\/>  keywords = {event},<br\/>  title = {{Mining Complex Event Patterns in Computer Networks}},<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e80737788c869221f272dd9af03acecf\"><p>%0 Conference Paper<br\/>%1 SNKA:12<br\/>%A Seipel, Dietmar<br\/>%A Neubeck, Philipp<br\/>%A K\u00f6hler, Stefan<br\/>%A Atzmueller, Martin<br\/>%B Proc. ECML\/PKDD Workshop on New Frontiers in Mining Complex Patterns<br\/>%C Bristol, UK<br\/>%D 2012<br\/>%T {Mining Complex Event Patterns in Computer Networks}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Namelings - Discover Given Name Relatedness Based on Data from the Social Web.<\/span><\/span> In: Aberer, K., Flache, A., Jager, W., Liu, L., Tang, J., and Gu\u00e9ret, C. (eds.) SocInfo. pp. 531\u2013534. Springer (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/mitzlaff2012namelings.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e2770a8535fca7cce582148703d8980a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e2770a8535fca7cce582148703d8980a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e2770a8535fca7cce582148703d8980a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e2770a8535fca7cce582148703d8980a\"><p>@inproceedings{mitzlaff2012namelings,<br\/>  author = {Mitzlaff, Folke and Stumme, Gerd},<br\/>  booktitle = {SocInfo},<br\/>  editor = {Aberer, Karl and Flache, Andreas and Jager, Wander and Liu, Ling and Tang, Jie and Gu\u00e9ret, Christophe},<br\/>  keywords = {nameling},<br\/>  pages = {531-534},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Namelings - Discover Given Name Relatedness Based on Data from the Social Web.},<br\/>  volume = 7710,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e2770a8535fca7cce582148703d8980a\"><p>%0 Conference Paper<br\/>%1 mitzlaff2012namelings<br\/>%A Mitzlaff, Folke<br\/>%A Stumme, Gerd<br\/>%B SocInfo<br\/>%D 2012<br\/>%E Aberer, Karl<br\/>%E Flache, Andreas<br\/>%E Jager, Wander<br\/>%E Liu, Ling<br\/>%E Tang, Jie<br\/>%E Gu\u00e9ret, Christophe<br\/>%I Springer<br\/>%P 531-534<br\/>%T Namelings - Discover Given Name Relatedness Based on Data from the Social Web.<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/mitzlaff2012namelings.pdf<br\/>%V 7710<br\/>%@ 978-3-642-35385-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mining Social Media<\/span>.<\/span> Informatik Spektrum. 35, 132\u2013135 (2012).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a66dc503e2f90d0a484e0dbef5febcd3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a66dc503e2f90d0a484e0dbef5febcd3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a66dc503e2f90d0a484e0dbef5febcd3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a66dc503e2f90d0a484e0dbef5febcd3\"><p>@article{Atzmueller:12,<br\/>  author = {Atzmueller, Martin},<br\/>  journal = {Informatik Spektrum},<br\/>  keywords = {socialnetworks},<br\/>  number = 2,<br\/>  pages = {132-135},<br\/>  title = {Mining Social Media},<br\/>  volume = 35,<br\/>  year = 2012<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a66dc503e2f90d0a484e0dbef5febcd3\"><p>%0 Journal Article<br\/>%1 Atzmueller:12<br\/>%A Atzmueller, Martin<br\/>%D 2012<br\/>%J Informatik Spektrum<br\/>%N 2<br\/>%P 132-135<br\/>%T Mining Social Media<br\/>%V 35<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2011\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2011<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Context-Based Description of the Doubly Founded Concept Lattices in the Variety Generated by M_3<\/span>.<\/span> In: Valtchev, P. and J\u00e4schke, R. (eds.) Formal Concept Analysis. pp. 93\u2013106. Springer, Berlin \/ Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20514-9_9.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/978-3-642-20514-9_9\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5cee560a10f3cb4ad3cb3726b6a18ff4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5cee560a10f3cb4ad3cb3726b6a18ff4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-20514-9_9\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5cee560a10f3cb4ad3cb3726b6a18ff4\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5cee560a10f3cb4ad3cb3726b6a18ff4\">In universal algebra and in lattice theory the notion of varieties is very prominent, since varieties describe the classes of all algebras (or of all lattices) modeling a given set of equations. While a comprehensive translation of that notion to a similar notion of varieties of complete lattices \u2013 and thus to Formal Concept Analysis \u2013 has not yet been accomplished, some characterizations of the doubly founded complete lattices of some special varieties (e.g. the variety of modular or that of distributive lattices) have been discovered. In this paper we use the well-known arrow relations to give a characterization of the formal contexts of doubly founded concept lattices in the variety that is generated by M 3 \u2013 the smallest modular, non-distributive lattice variety.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5cee560a10f3cb4ad3cb3726b6a18ff4\"><p>@inproceedings{doerfel2011contextbased,<br\/>  abstract = {In universal algebra and in lattice theory the notion of varieties is very prominent, since varieties describe the classes of all algebras (or of all lattices) modeling a given set of equations. While a comprehensive translation of that notion to a similar notion of varieties of complete lattices \u2013 and thus to Formal Concept Analysis \u2013 has not yet been accomplished, some characterizations of the doubly founded complete lattices of some special varieties (e.g. the variety of modular or that of distributive lattices) have been discovered. In this paper we use the well-known arrow relations to give a characterization of the formal contexts of doubly founded concept lattices in the variety that is generated by M 3 \u2013 the smallest modular, non-distributive lattice variety.},<br\/>  address = {Berlin \/ Heidelberg},<br\/>  author = {Doerfel, Stephan},<br\/>  booktitle = {Formal Concept Analysis},<br\/>  editor = {Valtchev, Petko and J\u00e4schke, Robert},<br\/>  keywords = {itegpub},<br\/>  pages = {93-106},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {A Context-Based Description of the Doubly Founded Concept Lattices in the Variety Generated by M_3},<br\/>  volume = 6628,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5cee560a10f3cb4ad3cb3726b6a18ff4\"><p>%0 Conference Paper<br\/>%1 doerfel2011contextbased<br\/>%A Doerfel, Stephan<br\/>%B Formal Concept Analysis<br\/>%C Berlin \/ Heidelberg<br\/>%D 2011<br\/>%E Valtchev, Petko<br\/>%E J\u00e4schke, Robert<br\/>%I Springer<br\/>%P 93-106<br\/>%R 10.1007\/978-3-642-20514-9_9<br\/>%T A Context-Based Description of the Doubly Founded Concept Lattices in the Variety Generated by M_3<br\/>%U http:\/\/dx.doi.org\/10.1007\/978-3-642-20514-9_9<br\/>%V 6628<br\/>%X In universal algebra and in lattice theory the notion of varieties is very prominent, since varieties describe the classes of all algebras (or of all lattices) modeling a given set of equations. While a comprehensive translation of that notion to a similar notion of varieties of complete lattices \u2013 and thus to Formal Concept Analysis \u2013 has not yet been accomplished, some characterizations of the doubly founded complete lattices of some special varieties (e.g. the variety of modular or that of distributive lattices) have been discovered. In this paper we use the well-known arrow relations to give a characterization of the formal contexts of doubly founded concept lattices in the variety that is generated by M 3 \u2013 the smallest modular, non-distributive lattice variety.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Behrenbruch, K., Atzmueller, M., Kniewel, R., Hoberg, S., Stumme, G., Schmidt, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Gestaltung technisch-sozialer Vernetzung in der Arbeitsorganisation: Untersuchung zur Nutzerakzeptanz von RFID-Technologie<\/span>.<\/span> In: GfA-Fr\u00fchjahrskongress. , Chemnitz (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-addbaaba7aec8360e23284c849e216ad\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-addbaaba7aec8360e23284c849e216ad\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/addbaaba7aec8360e23284c849e216ad\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-addbaaba7aec8360e23284c849e216ad\"><p>@inproceedings{BAKHSS:11,<br\/>  address = {Chemnitz},<br\/>  author = {Behrenbruch, Kay and Atzmueller, Martin and Kniewel, Romy and Hoberg, Sebastian and Stumme, Gerd and Schmidt, Ludger},<br\/>  booktitle = {GfA-Fr\u00fchjahrskongress},<br\/>  keywords = {itegpub},<br\/>  title = {Gestaltung technisch-sozialer Vernetzung in der Arbeitsorganisation: Untersuchung zur Nutzerakzeptanz von RFID-Technologie},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-addbaaba7aec8360e23284c849e216ad\"><p>%0 Conference Paper<br\/>%1 BAKHSS:11<br\/>%A Behrenbruch, Kay<br\/>%A Atzmueller, Martin<br\/>%A Kniewel, Romy<br\/>%A Hoberg, Sebastian<br\/>%A Stumme, Gerd<br\/>%A Schmidt, Ludger<br\/>%B GfA-Fr\u00fchjahrskongress<br\/>%C Chemnitz<br\/>%D 2011<br\/>%T Gestaltung technisch-sozialer Vernetzung in der Arbeitsorganisation: Untersuchung zur Nutzerakzeptanz von RFID-Technologie<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzm\u00fcller, M., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Mining Semantic Maturity in Social Bookmarking Systems<\/span>.<\/span> In: Passant, A., Fern\u00e1ndez, S., Breslin, J., and Boj\u0101rs, U. (eds.) Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011) (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/atzmueller2011towards.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-689b283ba030bb78ed94146aae4bc760\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-689b283ba030bb78ed94146aae4bc760\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/689b283ba030bb78ed94146aae4bc760\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-689b283ba030bb78ed94146aae4bc760\"><p>@inproceedings{atzmueller2011towards,<br\/>  author = {Atzm\u00fcller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011)},<br\/>  editor = {Passant, Alexandre and Fern\u00e1ndez, Sergio and Breslin, John and Boj\u0101rs, Uldis},<br\/>  keywords = {itegpub},<br\/>  title = {Towards Mining Semantic Maturity in Social Bookmarking Systems},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-689b283ba030bb78ed94146aae4bc760\"><p>%0 Conference Paper<br\/>%1 atzmueller2011towards<br\/>%A Atzm\u00fcller, Martin<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011)<br\/>%D 2011<br\/>%E Passant, Alexandre<br\/>%E Fern\u00e1ndez, Sergio<br\/>%E Breslin, John<br\/>%E Boj\u0101rs, Uldis<br\/>%T Towards Mining Semantic Maturity in Social Bookmarking Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/atzmueller2011towards.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzm\u00fcller, M., Benz, D., Doerfel, S., Hotho, A., J\u00e4schke, R., Macek, B.-E., {Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Enhancing Social Interactions at Conferences<\/span>.<\/span> it - Information Technology, (53)3:101--107, Oldenbourg Wissenschaftsverlag GmbH, May 2011. (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3a9d2216617fd2c0861d24eef2c0051b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3a9d2216617fd2c0861d24eef2c0051b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3a9d2216617fd2c0861d24eef2c0051b\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3a9d2216617fd2c0861d24eef2c0051b\"><p>@article{L3S_518093b0d815c42951de5634127244d1b677c06f,<br\/>  author = {Atzm\u00fcller, Martin and Benz, Dominik and Doerfel, Stephan and Hotho, Andreas and J\u00e4schke, Robert and Macek, Bj\u00f6rn-Elmar and {Mitzlaff, Folke}, Christoph Scholz and Stumme, Gerd},<br\/>  journal = {it - Information Technology, (53)3:101--107, Oldenbourg Wissenschaftsverlag GmbH, May 2011},<br\/>  keywords = 2011,<br\/>  title = {Enhancing Social Interactions at Conferences},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3a9d2216617fd2c0861d24eef2c0051b\"><p>%0 Journal Article<br\/>%1 L3S_518093b0d815c42951de5634127244d1b677c06f<br\/>%A Atzm\u00fcller, Martin<br\/>%A Benz, Dominik<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Macek, Bj\u00f6rn-Elmar<br\/>%A {Mitzlaff, Folke}<br\/>%A Stumme, Gerd<br\/>%D 2011<br\/>%J it - Information Technology, (53)3:101--107, Oldenbourg Wissenschaftsverlag GmbH, May 2011<br\/>%T Enhancing Social Interactions at Conferences<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Illig, J., Hotho, A., J\u00e4schke, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Comparison of Content-Based Tag Recommendations in Folksonomy Systems<\/span>.<\/span> In: Wolff, K., Palchunov, D., Zagoruiko, N., and Andelfinger, U. (eds.) Knowledge Processing and Data Analysis. pp. 136\u2013149. Springer Berlin \/ Heidelberg (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/978-3-642-22140-8_9\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f5513e0daea5dd5dd5e64821f23c7577\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f5513e0daea5dd5dd5e64821f23c7577\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f5513e0daea5dd5dd5e64821f23c7577\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-f5513e0daea5dd5dd5e64821f23c7577\">Recommendation algorithms and multi-class classifiers can support users of social bookmarking systems in assigning tags to their bookmarks. Content based recommenders are the usual approach for facing the cold start problem, i.e., when a bookmark is uploaded for the first time and no information from other users can be exploited. In this paper, we evaluate several recommendation algorithms in a cold-start scenario on a large real-world dataset.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f5513e0daea5dd5dd5e64821f23c7577\"><p>@incollection{springerlink:10.1007\/978-3-642-22140-8_9,<br\/>  abstract = {Recommendation algorithms and multi-class classifiers can support users of social bookmarking systems in assigning tags to their bookmarks. Content based recommenders are the usual approach for facing the cold start problem, i.e., when a bookmark is uploaded for the first time and no information from other users can be exploited. In this paper, we evaluate several recommendation algorithms in a cold-start scenario on a large real-world dataset.},<br\/>  author = {Illig, Jens and Hotho, Andreas and J\u00e4schke, Robert and Stumme, Gerd},<br\/>  booktitle = {Knowledge Processing and Data Analysis},<br\/>  editor = {Wolff, Karl and Palchunov, Dmitry and Zagoruiko, Nikolay and Andelfinger, Urs},<br\/>  keywords = {content},<br\/>  note = {10.1007\/978-3-642-22140-8_9},<br\/>  pages = {136-149},<br\/>  publisher = {Springer Berlin \/ Heidelberg},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {A Comparison of Content-Based Tag Recommendations in Folksonomy Systems},<br\/>  volume = 6581,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f5513e0daea5dd5dd5e64821f23c7577\"><p>%0 Book Section<br\/>%1 springerlink:10.1007\/978-3-642-22140-8_9<br\/>%A Illig, Jens<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%B Knowledge Processing and Data Analysis<br\/>%D 2011<br\/>%E Wolff, Karl<br\/>%E Palchunov, Dmitry<br\/>%E Zagoruiko, Nikolay<br\/>%E Andelfinger, Urs<br\/>%I Springer Berlin \/ Heidelberg<br\/>%P 136-149<br\/>%T A Comparison of Content-Based Tag Recommendations in Folksonomy Systems<br\/>%U http:\/\/dx.doi.org\/10.1007\/978-3-642-22140-8_9<br\/>%V 6581<br\/>%X Recommendation algorithms and multi-class classifiers can support users of social bookmarking systems in assigning tags to their bookmarks. Content based recommenders are the usual approach for facing the cold start problem, i.e., when a bookmark is uploaded for the first time and no information from other users can be exploited. In this paper, we evaluate several recommendation algorithms in a cold-start scenario on a large real-world dataset.<br\/>%@ 978-3-642-22139-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Burke, R., Gemmell, J., Hotho, A., J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Recommendation in the Social Web<\/span>.<\/span> AI Magazine. 32, 46\u201356 (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.aaai.org\/ojs\/index.php\/aimagazine\/article\/view\/2373\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-41dbb2c9f71440c9aa402f8966117979\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-41dbb2c9f71440c9aa402f8966117979\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/41dbb2c9f71440c9aa402f8966117979\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-41dbb2c9f71440c9aa402f8966117979\">Recommender systems are a means of personalizing the presentation of information to ensure that users see the items most relevant to them. The social web has added new dimensions to the way people interact on the Internet, placing the emphasis on user-generated content. Users in social networks create photos, videos and other artifacts, collaborate with other users, socialize with their friends and share their opinions online. This outpouring of material has brought increased attention to recommender systems, as a means of managing this vast universe of content. At the same time, the diversity and complexity of the data has meant new challenges for researchers in recommendation. This article describes the nature of recommendation research in social web applications and provides some illustrative examples of current research directions and techniques. It is difficult to overstate the impact of the social web. This new breed of social applications is reshaping nearly every human activity from the way people watch movies to how they overthrow governments. Facebook allows its members to maintain friendships whether they live next door or on another continent. With Twitter, users from celebrities to ordinary folks can launch their 140 character messages out to a diverse horde of \u2018\u2018followers.\u201d Flickr and YouTube users upload their personal media to share with the world, while Wikipedia editors collaborate on the world\u2019s largest encyclopedia.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-41dbb2c9f71440c9aa402f8966117979\"><p>@article{burke2011recommendation,<br\/>  abstract = {Recommender systems are a means of personalizing the presentation of information to ensure that users see the items most relevant to them. The social web has added new dimensions to the way people interact on the Internet, placing the emphasis on user-generated content. Users in social networks create photos, videos and other artifacts, collaborate with other users, socialize with their friends and share their opinions online. This outpouring of material has brought increased attention to recommender systems, as a means of managing this vast universe of content. At the same time, the diversity and complexity of the data has meant new challenges for researchers in recommendation. This article describes the nature of recommendation research in social web applications and provides some illustrative examples of current research directions and techniques. It is difficult to overstate the impact of the social web. This new breed of social applications is reshaping nearly every human activity from the way people watch movies to how they overthrow governments. Facebook allows its members to maintain friendships whether they live next door or on another continent. With Twitter, users from celebrities to ordinary folks can launch their 140 character messages out to a diverse horde of \u2018\u2018followers.\u201d Flickr and YouTube users upload their personal media to share with the world, while Wikipedia editors collaborate on the world\u2019s largest encyclopedia.},<br\/>  author = {Burke, Robin and Gemmell, Jonathan and Hotho, Andreas and J\u00e4schke, Robert},<br\/>  journal = {AI Magazine},<br\/>  keywords = {recommender},<br\/>  number = 3,<br\/>  pages = {46--56},<br\/>  publisher = {Association for the Advancement of Artificial Intelligence},<br\/>  title = {Recommendation in the Social Web},<br\/>  volume = 32,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-41dbb2c9f71440c9aa402f8966117979\"><p>%0 Journal Article<br\/>%1 burke2011recommendation<br\/>%A Burke, Robin<br\/>%A Gemmell, Jonathan<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%D 2011<br\/>%I Association for the Advancement of Artificial Intelligence<br\/>%J AI Magazine<br\/>%N 3<br\/>%P 46--56<br\/>%T Recommendation in the Social Web<br\/>%U http:\/\/www.aaai.org\/ojs\/index.php\/aimagazine\/article\/view\/2373<br\/>%V 32<br\/>%X Recommender systems are a means of personalizing the presentation of information to ensure that users see the items most relevant to them. The social web has added new dimensions to the way people interact on the Internet, placing the emphasis on user-generated content. Users in social networks create photos, videos and other artifacts, collaborate with other users, socialize with their friends and share their opinions online. This outpouring of material has brought increased attention to recommender systems, as a means of managing this vast universe of content. At the same time, the diversity and complexity of the data has meant new challenges for researchers in recommendation. This article describes the nature of recommendation research in social web applications and provides some illustrative examples of current research directions and techniques. It is difficult to overstate the impact of the social web. This new breed of social applications is reshaping nearly every human activity from the way people watch movies to how they overthrow governments. Facebook allows its members to maintain friendships whether they live next door or on another continent. With Twitter, users from celebrities to ordinary folks can launch their 140 character messages out to a diverse horde of \u2018\u2018followers.\u201d Flickr and YouTube users upload their personal media to share with the world, while Wikipedia editors collaborate on the world\u2019s largest encyclopedia.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Mitzlaff, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Efficient Descriptive Community Mining<\/span>.<\/span> In: Proc. 24th Intl. FLAIRS Conference. AAAI Press (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-be5788e3988f2edeb022f5fbd12097a5\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-be5788e3988f2edeb022f5fbd12097a5\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/be5788e3988f2edeb022f5fbd12097a5\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-be5788e3988f2edeb022f5fbd12097a5\"><p>@inproceedings{atzmueller2011efficient,<br\/>  author = {Atzmueller, Martin and Mitzlaff, Folke},<br\/>  booktitle = {Proc. 24th Intl. FLAIRS Conference},<br\/>  keywords = {itegpub},<br\/>  publisher = {AAAI Press},<br\/>  title = {Efficient Descriptive Community Mining},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-be5788e3988f2edeb022f5fbd12097a5\"><p>%0 Conference Paper<br\/>%1 atzmueller2011efficient<br\/>%A Atzmueller, Martin<br\/>%A Mitzlaff, Folke<br\/>%B Proc. 24th Intl. FLAIRS Conference<br\/>%D 2011<br\/>%I AAAI Press<br\/>%T Efficient Descriptive Community Mining<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Hotho, A., Strohmaier, M., Chin, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Analysis of Social Media and Ubiquitous Data - International Workshops MSM 2010, Toronto, Canada, June 13, 2010, and MUSE 2010, Barcelona, Spain, September 20, 2010, Revised Selected Papers<\/span>.<\/span> Springer (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/ht\/msmmuse2010.html\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4cf42ebabd9a670c70bee456affda285\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4cf42ebabd9a670c70bee456affda285\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4cf42ebabd9a670c70bee456affda285\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4cf42ebabd9a670c70bee456affda285\"><p>@proceedings{conf\/ht\/2010msmmuse,<br\/>  booktitle = {MSM\/MUSE},<br\/>  editor = {Atzmueller, Martin and Hotho, Andreas and Strohmaier, Markus and Chin, Alvin},<br\/>  keywords = {media},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Analysis of Social Media and Ubiquitous Data - International Workshops MSM 2010, Toronto, Canada, June 13, 2010, and MUSE 2010, Barcelona, Spain, September 20, 2010, Revised Selected Papers},<br\/>  volume = 6904,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4cf42ebabd9a670c70bee456affda285\"><p>%0 Conference Proceedings<br\/>%1 conf\/ht\/2010msmmuse<br\/>%B MSM\/MUSE<br\/>%D 2011<br\/>%E Atzmueller, Martin<br\/>%E Hotho, Andreas<br\/>%E Strohmaier, Markus<br\/>%E Chin, Alvin<br\/>%I Springer<br\/>%T Analysis of Social Media and Ubiquitous Data - International Workshops MSM 2010, Toronto, Canada, June 13, 2010, and MUSE 2010, Barcelona, Spain, September 20, 2010, Revised Selected Papers<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/ht\/msmmuse2010.html<br\/>%V 6904<br\/>%@ 978-3-642-23598-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Navarro Bullock, B., J\u00e4schke, R., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Tagging data as implicit feedback for learning-to-rank<\/span>.<\/span> In: Proceedings of the ACM WebSci\u201911 (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/journal.webscience.org\/463\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-493e03868a98f498628cad31f9320e9f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-493e03868a98f498628cad31f9320e9f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/493e03868a98f498628cad31f9320e9f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-493e03868a98f498628cad31f9320e9f\"><p>@inproceedings{bullock2011tagging,<br\/>  author = {Navarro Bullock, Beate and J\u00e4schke, Robert and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the ACM WebSci'11},<br\/>  keywords = {logsonomy},<br\/>  month = {06},<br\/>  title = {Tagging data as implicit feedback for learning-to-rank},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-493e03868a98f498628cad31f9320e9f\"><p>%0 Conference Paper<br\/>%1 bullock2011tagging<br\/>%A Navarro Bullock, Beate<br\/>%A J\u00e4schke, Robert<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the ACM WebSci'11<br\/>%D 2011<br\/>%T Tagging data as implicit feedback for learning-to-rank<br\/>%U http:\/\/journal.webscience.org\/463\/<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Formal Concept Analysis and Tag Recommendations in Collaborative Tagging Systems<\/span>.<\/span> Akademische Verlagsgesellschaft AKA, Heidelberg, Germany (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.aka-verlag.com\/de\/detail?ean=978-3-89838-332-5\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9db90c2ff04f514ada9f6b50fde46065\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9db90c2ff04f514ada9f6b50fde46065\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9db90c2ff04f514ada9f6b50fde46065\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9db90c2ff04f514ada9f6b50fde46065\">One of the most noticeable innovation that emerged with the advent of the Web 2.0 and the focal point of this thesis are collaborative tagging systems. They allow users to annotate arbitrary resources with freely chosen keywords, so called tags. The tags are used for navigation, finding resources, and serendipitous browsing and thus provide an immediate benefit for the user. By now, several systems for tagging photos, web links, publication references, videos, etc. have attracted millions of users which in turn annotated countless resources. Tagging gained so much popularity that it spread into other applications like web browsers, software packet managers, and even file systems. Therefore, the relevance of the methods presented in this thesis goes beyond the Web 2.0. The conceptual structure underlying collaborative tagging systems is called folksonomy. It can be represented as a tripartite hypergraph with user, tag, and resource nodes. Each edge of the graph expresses the fact that a user annotated a resource with a tag. This social network constitutes a lightweight conceptual structure that is not formalized, but rather implicit and thus needs to be extracted with knowledge discovery methods. In this thesis a new data mining task \u2013 the mining of all frequent tri-concepts \u2013 is presented, together with an efficient algorithm for discovering such implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. Extending the theory of triadic Formal Concept Analysis, we provide a formal definition of the problem, and present an efficient algorithm for its solution. We show the applicability of our approach on three large real-world examples and thereby perform a conceptual clustering of two collaborative tagging systems. Finally, we introduce neighborhoods of triadic concepts as basis for a lightweight visualization of tri-lattices. The social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind, has been developed by our research group. Besides being a useful tool for many scientists, it provides interested researchers a basis for the evaluation and integration of their knowledge discovery methods. This thesis introduces BibSonomy as an exemplary collaborative tagging system and gives an overview of its architecture and some of its features. Furthermore, BibSonomy is used as foundation for evaluating and integrating some of the discussed approaches. Collaborative tagging systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In this thesis we evaluate and compare several recommendation algorithms on large-scale real-world datasets: an adaptation of user-based Collaborative Filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag co-occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag co-occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We demonstrate how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. Furthermore, we show how to integrate recommendation methods into a real tagging system, record and evaluate their performance by describing the tag recommendation framework we developed for BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. We also present an evaluation of the framework which demonstrates its power. The folksonomy graph shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Clicklogs of web search engines can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large folksonomy snapshot and on query logs of two large search engines. We find that all of the three datasets exhibit similar structural properties and thus conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of collaborative tagging users is driven by similar dynamics. In this thesis we further transfer the folksonomy paradigm to the Social Semantic Desktop \u2013 a new model of computer desktop that uses Semantic Web technologies to better link information items. There we apply community support methods to the folksonomy found in the network of social semantic desktops. Thus, we connect knowledge discovery for folksonomies with semantic technologies. Alltogether, the research in this thesis is centered around collaborative tagging systems and their underlying datastructure \u2013 folksonomies \u2013 and thereby paves the way for the further dissemination of this successful knowledge management paradigm.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9db90c2ff04f514ada9f6b50fde46065\"><p>@book{jaeschke2011formal,<br\/>  abstract = {One of the most noticeable innovation that emerged with the advent of the Web 2.0 and the focal point of this thesis are collaborative tagging systems. They allow users to annotate arbitrary resources with freely chosen keywords, so called tags. The tags are used for navigation, finding resources, and serendipitous browsing and thus provide an immediate benefit for the user. By now, several systems for tagging photos, web links, publication references, videos, etc. have attracted millions of users which in turn annotated countless resources. Tagging gained so much popularity that it spread into other applications like web browsers, software packet managers, and even file systems. Therefore, the relevance of the methods presented in this thesis goes beyond the Web 2.0. The conceptual structure underlying collaborative tagging systems is called folksonomy. It can be represented as a tripartite hypergraph with user, tag, and resource nodes. Each edge of the graph expresses the fact that a user annotated a resource with a tag. This social network constitutes a lightweight conceptual structure that is not formalized, but rather implicit and thus needs to be extracted with knowledge discovery methods. In this thesis a new data mining task \u2013 the mining of all frequent tri-concepts \u2013 is presented, together with an efficient algorithm for discovering such implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. Extending the theory of triadic Formal Concept Analysis, we provide a formal definition of the problem, and present an efficient algorithm for its solution. We show the applicability of our approach on three large real-world examples and thereby perform a conceptual clustering of two collaborative tagging systems. Finally, we introduce neighborhoods of triadic concepts as basis for a lightweight visualization of tri-lattices. The social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind, has been developed by our research group. Besides being a useful tool for many scientists, it provides interested researchers a basis for the evaluation and integration of their knowledge discovery methods. This thesis introduces BibSonomy as an exemplary collaborative tagging system and gives an overview of its architecture and some of its features. Furthermore, BibSonomy is used as foundation for evaluating and integrating some of the discussed approaches. Collaborative tagging systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In this thesis we evaluate and compare several recommendation algorithms on large-scale real-world datasets: an adaptation of user-based Collaborative Filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag co-occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag co-occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We demonstrate how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. Furthermore, we show how to integrate recommendation methods into a real tagging system, record and evaluate their performance by describing the tag recommendation framework we developed for BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. We also present an evaluation of the framework which demonstrates its power. The folksonomy graph shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Clicklogs of web search engines can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large folksonomy snapshot and on query logs of two large search engines. We find that all of the three datasets exhibit similar structural properties and thus conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of collaborative tagging users is driven by similar dynamics. In this thesis we further transfer the folksonomy paradigm to the Social Semantic Desktop \u2013 a new model of computer desktop that uses Semantic Web technologies to better link information items. There we apply community support methods to the folksonomy found in the network of social semantic desktops. Thus, we connect knowledge discovery for folksonomies with semantic technologies. Alltogether, the research in this thesis is centered around collaborative tagging systems and their underlying datastructure \u2013 folksonomies \u2013 and thereby paves the way for the further dissemination of this successful knowledge management paradigm.},<br\/>  address = {Heidelberg, Germany},<br\/>  author = {J\u00e4schke, Robert},<br\/>  keywords = {recommender},<br\/>  month = {01},<br\/>  publisher = {Akademische Verlagsgesellschaft AKA},<br\/>  series = {Dissertationen zur K\u00fcnstlichen Intelligenz},<br\/>  title = {Formal Concept Analysis and Tag Recommendations in Collaborative Tagging Systems},<br\/>  volume = 332,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9db90c2ff04f514ada9f6b50fde46065\"><p>%0 Book<br\/>%1 jaeschke2011formal<br\/>%A J\u00e4schke, Robert<br\/>%B Dissertationen zur K\u00fcnstlichen Intelligenz<br\/>%C Heidelberg, Germany<br\/>%D 2011<br\/>%I Akademische Verlagsgesellschaft AKA<br\/>%T Formal Concept Analysis and Tag Recommendations in Collaborative Tagging Systems<br\/>%U http:\/\/www.aka-verlag.com\/de\/detail?ean=978-3-89838-332-5<br\/>%V 332<br\/>%X One of the most noticeable innovation that emerged with the advent of the Web 2.0 and the focal point of this thesis are collaborative tagging systems. They allow users to annotate arbitrary resources with freely chosen keywords, so called tags. The tags are used for navigation, finding resources, and serendipitous browsing and thus provide an immediate benefit for the user. By now, several systems for tagging photos, web links, publication references, videos, etc. have attracted millions of users which in turn annotated countless resources. Tagging gained so much popularity that it spread into other applications like web browsers, software packet managers, and even file systems. Therefore, the relevance of the methods presented in this thesis goes beyond the Web 2.0. The conceptual structure underlying collaborative tagging systems is called folksonomy. It can be represented as a tripartite hypergraph with user, tag, and resource nodes. Each edge of the graph expresses the fact that a user annotated a resource with a tag. This social network constitutes a lightweight conceptual structure that is not formalized, but rather implicit and thus needs to be extracted with knowledge discovery methods. In this thesis a new data mining task \u2013 the mining of all frequent tri-concepts \u2013 is presented, together with an efficient algorithm for discovering such implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. Extending the theory of triadic Formal Concept Analysis, we provide a formal definition of the problem, and present an efficient algorithm for its solution. We show the applicability of our approach on three large real-world examples and thereby perform a conceptual clustering of two collaborative tagging systems. Finally, we introduce neighborhoods of triadic concepts as basis for a lightweight visualization of tri-lattices. The social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind, has been developed by our research group. Besides being a useful tool for many scientists, it provides interested researchers a basis for the evaluation and integration of their knowledge discovery methods. This thesis introduces BibSonomy as an exemplary collaborative tagging system and gives an overview of its architecture and some of its features. Furthermore, BibSonomy is used as foundation for evaluating and integrating some of the discussed approaches. Collaborative tagging systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In this thesis we evaluate and compare several recommendation algorithms on large-scale real-world datasets: an adaptation of user-based Collaborative Filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag co-occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag co-occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We demonstrate how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. Furthermore, we show how to integrate recommendation methods into a real tagging system, record and evaluate their performance by describing the tag recommendation framework we developed for BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. We also present an evaluation of the framework which demonstrates its power. The folksonomy graph shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Clicklogs of web search engines can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large folksonomy snapshot and on query logs of two large search engines. We find that all of the three datasets exhibit similar structural properties and thus conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of collaborative tagging users is driven by similar dynamics. In this thesis we further transfer the folksonomy paradigm to the Social Semantic Desktop \u2013 a new model of computer desktop that uses Semantic Web technologies to better link information items. There we apply community support methods to the folksonomy found in the network of social semantic desktops. Thus, we connect knowledge discovery for folksonomies with semantic technologies. Alltogether, the research in this thesis is centered around collaborative tagging systems and their underlying datastructure \u2013 folksonomies \u2013 and thereby paves the way for the further dissemination of this successful knowledge management paradigm.<br\/>%@ 978-3-89838-332-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Benz, D., Doerfel, S., Hotho, A., J\u00e4schke, R., Macek, B.E., Mitzlaff, F., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Enhancing Social Interactions at Conferences<\/span>.<\/span> it - Information Technology. 53, 101\u2013107 (2011). https:\/\/doi.org\/10.1524\/itit.2011.0631.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1524\/itit.2011.0631\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1dc34c1620c45a9bbd548bb73f989aea\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1dc34c1620c45a9bbd548bb73f989aea\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1524\/itit.2011.0631\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1dc34c1620c45a9bbd548bb73f989aea\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1dc34c1620c45a9bbd548bb73f989aea\"><p>@article{martin2011enhancing,<br\/>  author = {Atzmueller, Martin and Benz, Dominik and Doerfel, Stephan and Hotho, Andreas and J\u00e4schke, Robert and Macek, Bjoern Elmar and Mitzlaff, Folke and Scholz, Christoph and Stumme, Gerd},<br\/>  booktitle = {it - Information Technology},<br\/>  journal = {it - Information Technology},<br\/>  keywords = {conferences},<br\/>  month = {05},<br\/>  number = 3,<br\/>  pages = {101--107},<br\/>  publisher = {Oldenbourg Wissenschaftsverlag GmbH},<br\/>  title = {Enhancing Social Interactions at Conferences},<br\/>  volume = 53,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1dc34c1620c45a9bbd548bb73f989aea\"><p>%0 Journal Article<br\/>%1 martin2011enhancing<br\/>%A Atzmueller, Martin<br\/>%A Benz, Dominik<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Macek, Bjoern Elmar<br\/>%A Mitzlaff, Folke<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%B it - Information Technology<br\/>%D 2011<br\/>%I Oldenbourg Wissenschaftsverlag GmbH<br\/>%J it - Information Technology<br\/>%N 3<br\/>%P 101--107<br\/>%R 10.1524\/itit.2011.0631<br\/>%T Enhancing Social Interactions at Conferences<br\/>%U http:\/\/dx.doi.org\/10.1524\/itit.2011.0631<br\/>%V 53<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Valtchev, P., J\u00e4schke, R. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Formal Concept Analysis<\/span>.<\/span> Springer, Berlin\/Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20514-9_2.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.springer.com\/computer\/ai\/book\/978-3-642-20513-2\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-afd54a24a2eeca1a07f811bd89800d28\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-afd54a24a2eeca1a07f811bd89800d28\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-20514-9_2\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/afd54a24a2eeca1a07f811bd89800d28\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-afd54a24a2eeca1a07f811bd89800d28\">The present volume features a selection of the papers presented at the 9th International Conference on Formal Concept Analysis (ICFCA 2011). Over the years, the ICFCA conference series has grown into the premier forum for dissemination of research on topics from formal concept analysis (FCA) theory and applications, as well as from the related fields of lattices and partially ordered structures. FCA is a multi-disciplinary field with strong roots in the mathematical theory of partial orders and lattices, with tools originating in computer science and artificial intelligence. FCA emerged in the early 1980s from efforts to restructure lattice theory to promote better communication between lattice theorists and potential users of lattice-based methods for data management. Initially, the central theme was the mathematical formalization of concept and conceptual hierarchy. Since then, the field has developed into a constantly growing research area in its own right with a thriving theoretical community and an increasing number of applications in data and knowledge processing including disciplines such as data visualization, information retrieval, machine learning, software engineering, data analysis, data mining, social networks analysis, etc. ICFCA 2011 was held from May 2 to May 6, 2011, in Nicosia, Cyprus. The program committee received 49 high-quality submissions that were subjected to a highly competitive selection process. Each paper was reviewed by three referees (exceptionally two or four). After a first round, some papers got a definitive acceptance status, while others got accepted conditionally to improvements in their content. The latter got to a second round of reviewing. The overall outcome was the acceptance of 16 papers as regular ones for presentation at the conference and publication in this volume. Another seven papers have still been assessed as valuable for discussion at the conference and were therefore collected in the supplementary proceedings. The regular papers presented hereafter cover advances on a wide range of subjects from FCA and related fields. A first group of papers tackled mathematical problems within the FCA field. A subset thereof focused on factor identification within the incidence relation or its lattice representation (papers by Glodeanu and by Krupka). The remainder of the group proposed characterizations of particular classes of ordered structures (papers by Doerfel and by Meschke et al.). A second group of papers addressed algorithmic problems from FCA and related fields. Two papers approached their problems from an algorithmic complexity viewpoint (papers by Distel and by Babin and Kuznetsov) while the final paper in this group addressed algorithmic problems for general lattices, i.e., not represented as formal contexts, with an FCA-based approach (work by Balc\u00e1zar and T\u00eern\u0103uc\u0103). A third group studied alternative approaches for extending the expressive power of the core FCA, e.g., by generalizing the standard one-valued attributes to attributes valued in algebraic rings (work by Gonz\u00c3\u00a1lez Calabozo et al.), by introducing pointer-like attributes, a.k.a. links (paper by K\u00f6tters), or by substituting set-shaped concept intents with modal logic expressions (paper by Soldano and Ventos). A fourth group focused on data mining-oriented aspects of FCA: agreement lattices in structured data mining (paper by Nedjar et al.), triadic association rule mining (work by Missaoui and Kwuida) and bi-clustering of numerical data (Kaytoue et al.). An addional paper shed some initial light on a key aspect of FCA-based data analysis and mining, i.e., the filtering of interesting concepts (paper by Belohlavek and Macko). Finally, a set of exciting applications of both basic and enhanced FCA frameworks to practical problems have beed described: in analysis of gene expression data (the already mentioned work by Gonz\u00c3\u00a1lez Calabozo et al.), in web services composition (paper by Azmeh et al.) and in browsing and retrieval of structured data (work by Wray and Eklund). This volume also contains three keynote papers submitted by the invited speakers of the conference. All these contributions constitute a volume of high quality which is the result of the hard work done by the authors, the invited speakers and the reviewers. We therefore wish to thank the members of the Program Committee and of the Editorial Board whose steady involvement and professionalism helped a lot. We would also like to acknowledge the participation of all the external reviewers who sent many valuable comments. Kudos also go to EasyChair for having made the reviewing\/editing process a real pleasure. Special thanks go to the Cyprus Tourism Organisation for sponsoring the conference and to the University of Nicosia for hosting it. Finally we wish to thank the Conference Chair Florent Domenach and his colleagues from the Organization Committee for the mountains of energy they put behind the conference organization process right from the beginning in order to make it a total success. We would also like to express our gratitude towards Dr. Peristianis, President of the University of Nicosia, for his personal support.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-afd54a24a2eeca1a07f811bd89800d28\"><p>@proceedings{valtchev2011formal,<br\/>  abstract = {The present volume features a selection of the papers presented at the 9th International Conference on Formal Concept Analysis (ICFCA 2011). Over the years, the ICFCA conference series has grown into the premier forum for dissemination of research on topics from formal concept analysis (FCA) theory and applications, as well as from the related fields of lattices and partially ordered structures. FCA is a multi-disciplinary field with strong roots in the mathematical theory of partial orders and lattices, with tools originating in computer science and artificial intelligence. FCA emerged in the early 1980s from efforts to restructure lattice theory to promote better communication between lattice theorists and potential users of lattice-based methods for data management. Initially, the central theme was the mathematical formalization of concept and conceptual hierarchy. Since then, the field has developed into a constantly growing research area in its own right with a thriving theoretical community and an increasing number of applications in data and knowledge processing including disciplines such as data visualization, information retrieval, machine learning, software engineering, data analysis, data mining, social networks analysis, etc. ICFCA 2011 was held from May 2 to May 6, 2011, in Nicosia, Cyprus. The program committee received 49 high-quality submissions that were subjected to a highly competitive selection process. Each paper was reviewed by three referees (exceptionally two or four). After a first round, some papers got a definitive acceptance status, while others got accepted conditionally to improvements in their content. The latter got to a second round of reviewing. The overall outcome was the acceptance of 16 papers as regular ones for presentation at the conference and publication in this volume. Another seven papers have still been assessed as valuable for discussion at the conference and were therefore collected in the supplementary proceedings. The regular papers presented hereafter cover advances on a wide range of subjects from FCA and related fields. A first group of papers tackled mathematical problems within the FCA field. A subset thereof focused on factor identification within the incidence relation or its lattice representation (papers by Glodeanu and by Krupka). The remainder of the group proposed characterizations of particular classes of ordered structures (papers by Doerfel and by Meschke et al.). A second group of papers addressed algorithmic problems from FCA and related fields. Two papers approached their problems from an algorithmic complexity viewpoint (papers by Distel and by Babin and Kuznetsov) while the final paper in this group addressed algorithmic problems for general lattices, i.e., not represented as formal contexts, with an FCA-based approach (work by Balc\u00e1zar and T\u00eern\u0103uc\u0103). A third group studied alternative approaches for extending the expressive power of the core FCA, e.g., by generalizing the standard one-valued attributes to attributes valued in algebraic rings (work by Gonz\u00c3\u00a1lez Calabozo et al.), by introducing pointer-like attributes, a.k.a. links (paper by K\u00f6tters), or by substituting set-shaped concept intents with modal logic expressions (paper by Soldano and Ventos). A fourth group focused on data mining-oriented aspects of FCA: agreement lattices in structured data mining (paper by Nedjar et al.), triadic association rule mining (work by Missaoui and Kwuida) and bi-clustering of numerical data (Kaytoue et al.). An addional paper shed some initial light on a key aspect of FCA-based data analysis and mining, i.e., the filtering of interesting concepts (paper by Belohlavek and Macko). Finally, a set of exciting applications of both basic and enhanced FCA frameworks to practical problems have beed described: in analysis of gene expression data (the already mentioned work by Gonz\u00c3\u00a1lez Calabozo et al.), in web services composition (paper by Azmeh et al.) and in browsing and retrieval of structured data (work by Wray and Eklund). This volume also contains three keynote papers submitted by the invited speakers of the conference. All these contributions constitute a volume of high quality which is the result of the hard work done by the authors, the invited speakers and the reviewers. We therefore wish to thank the members of the Program Committee and of the Editorial Board whose steady involvement and professionalism helped a lot. We would also like to acknowledge the participation of all the external reviewers who sent many valuable comments. Kudos also go to EasyChair for having made the reviewing\/editing process a real pleasure. Special thanks go to the Cyprus Tourism Organisation for sponsoring the conference and to the University of Nicosia for hosting it. Finally we wish to thank the Conference Chair Florent Domenach and his colleagues from the Organization Committee for the mountains of energy they put behind the conference organization process right from the beginning in order to make it a total success. We would also like to express our gratitude towards Dr. Peristianis, President of the University of Nicosia, for his personal support.},<br\/>  address = {Berlin\/Heidelberg},<br\/>  editor = {Valtchev, Petko and J\u00e4schke, Robert},<br\/>  keywords = {icfca},<br\/>  month = {05},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Artificial Intelligence},<br\/>  title = {Formal Concept Analysis},<br\/>  volume = 6628,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-afd54a24a2eeca1a07f811bd89800d28\"><p>%0 Conference Proceedings<br\/>%1 valtchev2011formal<br\/>%B Lecture Notes in Artificial Intelligence<br\/>%C Berlin\/Heidelberg<br\/>%D 2011<br\/>%E Valtchev, Petko<br\/>%E J\u00e4schke, Robert<br\/>%I Springer<br\/>%R 10.1007\/978-3-642-20514-9_2<br\/>%T Formal Concept Analysis<br\/>%U http:\/\/www.springer.com\/computer\/ai\/book\/978-3-642-20513-2<br\/>%V 6628<br\/>%X The present volume features a selection of the papers presented at the 9th International Conference on Formal Concept Analysis (ICFCA 2011). Over the years, the ICFCA conference series has grown into the premier forum for dissemination of research on topics from formal concept analysis (FCA) theory and applications, as well as from the related fields of lattices and partially ordered structures. FCA is a multi-disciplinary field with strong roots in the mathematical theory of partial orders and lattices, with tools originating in computer science and artificial intelligence. FCA emerged in the early 1980s from efforts to restructure lattice theory to promote better communication between lattice theorists and potential users of lattice-based methods for data management. Initially, the central theme was the mathematical formalization of concept and conceptual hierarchy. Since then, the field has developed into a constantly growing research area in its own right with a thriving theoretical community and an increasing number of applications in data and knowledge processing including disciplines such as data visualization, information retrieval, machine learning, software engineering, data analysis, data mining, social networks analysis, etc. ICFCA 2011 was held from May 2 to May 6, 2011, in Nicosia, Cyprus. The program committee received 49 high-quality submissions that were subjected to a highly competitive selection process. Each paper was reviewed by three referees (exceptionally two or four). After a first round, some papers got a definitive acceptance status, while others got accepted conditionally to improvements in their content. The latter got to a second round of reviewing. The overall outcome was the acceptance of 16 papers as regular ones for presentation at the conference and publication in this volume. Another seven papers have still been assessed as valuable for discussion at the conference and were therefore collected in the supplementary proceedings. The regular papers presented hereafter cover advances on a wide range of subjects from FCA and related fields. A first group of papers tackled mathematical problems within the FCA field. A subset thereof focused on factor identification within the incidence relation or its lattice representation (papers by Glodeanu and by Krupka). The remainder of the group proposed characterizations of particular classes of ordered structures (papers by Doerfel and by Meschke et al.). A second group of papers addressed algorithmic problems from FCA and related fields. Two papers approached their problems from an algorithmic complexity viewpoint (papers by Distel and by Babin and Kuznetsov) while the final paper in this group addressed algorithmic problems for general lattices, i.e., not represented as formal contexts, with an FCA-based approach (work by Balc\u00e1zar and T\u00eern\u0103uc\u0103). A third group studied alternative approaches for extending the expressive power of the core FCA, e.g., by generalizing the standard one-valued attributes to attributes valued in algebraic rings (work by Gonz\u00c3\u00a1lez Calabozo et al.), by introducing pointer-like attributes, a.k.a. links (paper by K\u00f6tters), or by substituting set-shaped concept intents with modal logic expressions (paper by Soldano and Ventos). A fourth group focused on data mining-oriented aspects of FCA: agreement lattices in structured data mining (paper by Nedjar et al.), triadic association rule mining (work by Missaoui and Kwuida) and bi-clustering of numerical data (Kaytoue et al.). An addional paper shed some initial light on a key aspect of FCA-based data analysis and mining, i.e., the filtering of interesting concepts (paper by Belohlavek and Macko). Finally, a set of exciting applications of both basic and enhanced FCA frameworks to practical problems have beed described: in analysis of gene expression data (the already mentioned work by Gonz\u00c3\u00a1lez Calabozo et al.), in web services composition (paper by Azmeh et al.) and in browsing and retrieval of structured data (work by Wray and Eklund). This volume also contains three keynote papers submitted by the invited speakers of the conference. All these contributions constitute a volume of high quality which is the result of the hard work done by the authors, the invited speakers and the reviewers. We therefore wish to thank the members of the Program Committee and of the Editorial Board whose steady involvement and professionalism helped a lot. We would also like to acknowledge the participation of all the external reviewers who sent many valuable comments. Kudos also go to EasyChair for having made the reviewing\/editing process a real pleasure. Special thanks go to the Cyprus Tourism Organisation for sponsoring the conference and to the University of Nicosia for hosting it. Finally we wish to thank the Conference Chair Florent Domenach and his colleagues from the Organization Committee for the mountains of energy they put behind the conference organization process right from the beginning in order to make it a total success. We would also like to express our gratitude towards Dr. Peristianis, President of the University of Nicosia, for his personal support.<br\/>%@ 978-3-642-20513-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzm\u00fcller, M., Benz, D., Doerfel, S., Hotho, A., J\u00e4schke, R., Macek, B.E., Mitzlaff, F., Scholz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Enhancing Social Interactions at Conferences<\/span>.<\/span> it - Information Technology. 53, 101\u2013107 (2011). https:\/\/doi.org\/10.1524\/itit.2011.0631.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1524\/itit.2011.0631\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9db791bb583b94f3cccdcbc69eff86a0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9db791bb583b94f3cccdcbc69eff86a0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1524\/itit.2011.0631\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9db791bb583b94f3cccdcbc69eff86a0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9db791bb583b94f3cccdcbc69eff86a0\"><p>@article{martin2011enhancing,<br\/>  author = {Atzm\u00fcller, Martin and Benz, Dominik and Doerfel, Stephan and Hotho, Andreas and J\u00e4schke, Robert and Macek, Bjoern Elmar and Mitzlaff, Folke and Scholz, Christoph and Stumme, Gerd},<br\/>  booktitle = {it - Information Technology},<br\/>  journal = {it - Information Technology},<br\/>  keywords = {conferator},<br\/>  month = {05},<br\/>  number = 3,<br\/>  pages = {101--107},<br\/>  publisher = {Oldenbourg Wissenschaftsverlag GmbH},<br\/>  title = {Enhancing Social Interactions at Conferences},<br\/>  volume = 53,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9db791bb583b94f3cccdcbc69eff86a0\"><p>%0 Journal Article<br\/>%1 martin2011enhancing<br\/>%A Atzm\u00fcller, Martin<br\/>%A Benz, Dominik<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Macek, Bjoern Elmar<br\/>%A Mitzlaff, Folke<br\/>%A Scholz, Christoph<br\/>%A Stumme, Gerd<br\/>%B it - Information Technology<br\/>%D 2011<br\/>%I Oldenbourg Wissenschaftsverlag GmbH<br\/>%J it - Information Technology<br\/>%N 3<br\/>%P 101--107<br\/>%R 10.1524\/itit.2011.0631<br\/>%T Enhancing Social Interactions at Conferences<br\/>%U http:\/\/dx.doi.org\/10.1524\/itit.2011.0631<br\/>%V 53<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., K\u00f6rner, C., Hotho, A., Stumme, G., Strohmaier, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">One Tag to Bind Them All : Measuring Term Abstractness in Social Metadata<\/span>.<\/span> In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., Pan, J., and Leenheer, P.D. (eds.) Proceedings of the 8th Extended Semantic Web Conference (ESWC 2011). , Heraklion, Crete (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2011measuring.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-67b4cd173ae1f6d98d80561b5f0289a4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-67b4cd173ae1f6d98d80561b5f0289a4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/67b4cd173ae1f6d98d80561b5f0289a4\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-67b4cd173ae1f6d98d80561b5f0289a4\">Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tag abstractness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of word abstractness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-67b4cd173ae1f6d98d80561b5f0289a4\"><p>@inproceedings{benz2011measuring,<br\/>  abstract = {Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tag abstractness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of word abstractness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.},<br\/>  address = {Heraklion, Crete},<br\/>  author = {Benz, Dominik and K\u00f6rner, Christian and Hotho, Andreas and Stumme, Gerd and Strohmaier, Markus},<br\/>  booktitle = {Proceedings of the 8th Extended Semantic Web Conference (ESWC 2011)},<br\/>  editor = {Antoniou, Grigoris and Grobelnik, Marko and Simperl, Elena and Parsia, Bijan and Plexousakis, Dimitris and Pan, Jeff and Leenheer, Pieter De},<br\/>  keywords = 2011,<br\/>  month = {05},<br\/>  title = {One Tag to Bind Them All : Measuring Term Abstractness in Social Metadata},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-67b4cd173ae1f6d98d80561b5f0289a4\"><p>%0 Conference Paper<br\/>%1 benz2011measuring<br\/>%A Benz, Dominik<br\/>%A K\u00f6rner, Christian<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%A Strohmaier, Markus<br\/>%B Proceedings of the 8th Extended Semantic Web Conference (ESWC 2011)<br\/>%C Heraklion, Crete<br\/>%D 2011<br\/>%E Antoniou, Grigoris<br\/>%E Grobelnik, Marko<br\/>%E Simperl, Elena<br\/>%E Parsia, Bijan<br\/>%E Plexousakis, Dimitris<br\/>%E Pan, Jeff<br\/>%E Leenheer, Pieter De<br\/>%T One Tag to Bind Them All : Measuring Term Abstractness in Social Metadata<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2011measuring.pdf<br\/>%X Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tag abstractness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of word abstractness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C., Doerfel, S., Atzmueller, M., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Resource-Aware On-Line RFID Localization Using Proximity Data<\/span>.<\/span> In: Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-56b6a20c253a6f23dc2005d3820e793a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-56b6a20c253a6f23dc2005d3820e793a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/56b6a20c253a6f23dc2005d3820e793a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-56b6a20c253a6f23dc2005d3820e793a\"><p>@inproceedings{scholz2011resourceaware,<br\/>  author = {Scholz, Christoph and Doerfel, Stephan and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation},<br\/>  keywords = {itegpub},<br\/>  title = {Resource-Aware On-Line RFID Localization Using Proximity Data},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-56b6a20c253a6f23dc2005d3820e793a\"><p>%0 Conference Paper<br\/>%1 scholz2011resourceaware<br\/>%A Scholz, Christoph<br\/>%A Doerfel, Stephan<br\/>%A Atzmueller, Martin<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation<br\/>%D 2011<br\/>%T Resource-Aware On-Line RFID Localization Using Proximity Data<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kartal, A., Doerfel, S., Ro\u00dfnagel, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Privatsph\u00e4ren- und Datenschutz in Community-Plattformen: Gestaltung von Online-Bewertungsportalen<\/span>.<\/span> In: Hei\u00df, H.-U., Pepper, P., Schlingloff, H., and Schneider, J. (eds.) Informatik 2011 - Informatik schafft Communities - Proceedings der 41. GI-Jahrestagung. p. 412. Bonner K\u00f6llen Verlag (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.informatik2011.de\/541.html\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5437cc15cb914c2abbb9d47c382bf33d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5437cc15cb914c2abbb9d47c382bf33d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5437cc15cb914c2abbb9d47c382bf33d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5437cc15cb914c2abbb9d47c382bf33d\">Aufgrund der mittlerweile un\u00fcberschaubaren Vielfalt von Anwendungsm\u00f6glichkeiten des Web 2.0, findet man fast zu jedem Lebensbereich eine passende Community im Netz. Dabei steigt auch die Anzahl der Bewertungsportale stetig und betrifft l\u00e4ngst nicht mehr nur die Bewertung von Waren, sondern erstreckt sich unterdessen auch auf Beurteilungen von Leistungen und Eigenschaften von zu bestimmten Berufsgruppen geh\u00f6renden Personen. Diese Entwicklung birgt die Gefahr, dass die dadurch gewonnenen pers\u00f6nlichen Daten durchaus geeignet sind, wahrheitswidrig ein \u00fcberm\u00e4\u00dfig positives oder \u00fcberm\u00e4\u00dfig negatives Pers\u00f6nlichkeitsbild des Betroffenen zu konstruieren und dadurch sein Ansehen zu beeinflussen. Im Hinblick auf Fragen im Zusammenhang mit dem Pers\u00f6nlichkeits- und Datenschutz soll der folgende Beitrag Ma\u00dfst\u00e4be an eine verfassungs- und datenschutzkonforme technische Gestaltung von Online-Bewertungsportalen aufzeigen.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5437cc15cb914c2abbb9d47c382bf33d\"><p>@inproceedings{kartal2011privatsphren,<br\/>  abstract = {Aufgrund der mittlerweile un\u00fcberschaubaren Vielfalt von Anwendungsm\u00f6glichkeiten des Web 2.0, findet man fast zu jedem Lebensbereich eine passende Community im Netz. Dabei steigt auch die Anzahl der Bewertungsportale stetig und betrifft l\u00e4ngst nicht mehr nur die Bewertung von Waren, sondern erstreckt sich unterdessen auch auf Beurteilungen von Leistungen und Eigenschaften von zu bestimmten Berufsgruppen geh\u00f6renden Personen. Diese Entwicklung birgt die Gefahr, dass die dadurch gewonnenen pers\u00f6nlichen Daten durchaus geeignet sind, wahrheitswidrig ein \u00fcberm\u00e4\u00dfig positives oder \u00fcberm\u00e4\u00dfig negatives Pers\u00f6nlichkeitsbild des Betroffenen zu konstruieren und dadurch sein Ansehen zu beeinflussen. Im Hinblick auf Fragen im Zusammenhang mit dem Pers\u00f6nlichkeits- und Datenschutz soll der folgende Beitrag Ma\u00dfst\u00e4be an eine verfassungs- und datenschutzkonforme technische Gestaltung von Online-Bewertungsportalen aufzeigen.},<br\/>  author = {Kartal, Aliye and Doerfel, Stephan and Ro\u00dfnagel, Alexander and Stumme, Gerd},<br\/>  booktitle = {Informatik 2011 - Informatik schafft Communities - Proceedings der 41. GI-Jahrestagung},<br\/>  editor = {Hei\u00df, Hans-Ulrich and Pepper, Peter and Schlingloff, Holger and Schneider, J\u00f6rg},<br\/>  keywords = {itegpub},<br\/>  month = 10,<br\/>  organization = {Gesellschaft f\u00fcr Informatik e.V. (GI)},<br\/>  pages = 412,<br\/>  publisher = {Bonner K\u00f6llen Verlag},<br\/>  series = {Lecture Notes in Informatics},<br\/>  title = {Privatsph\u00e4ren- und Datenschutz in Community-Plattformen: Gestaltung von Online-Bewertungsportalen},<br\/>  volume = 192,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5437cc15cb914c2abbb9d47c382bf33d\"><p>%0 Conference Paper<br\/>%1 kartal2011privatsphren<br\/>%A Kartal, Aliye<br\/>%A Doerfel, Stephan<br\/>%A Ro\u00dfnagel, Alexander<br\/>%A Stumme, Gerd<br\/>%B Informatik 2011 - Informatik schafft Communities - Proceedings der 41. GI-Jahrestagung<br\/>%D 2011<br\/>%E Hei\u00df, Hans-Ulrich<br\/>%E Pepper, Peter<br\/>%E Schlingloff, Holger<br\/>%E Schneider, J\u00f6rg<br\/>%I Bonner K\u00f6llen Verlag<br\/>%P 412<br\/>%T Privatsph\u00e4ren- und Datenschutz in Community-Plattformen: Gestaltung von Online-Bewertungsportalen<br\/>%U http:\/\/www.informatik2011.de\/541.html<br\/>%V 192<br\/>%X Aufgrund der mittlerweile un\u00fcberschaubaren Vielfalt von Anwendungsm\u00f6glichkeiten des Web 2.0, findet man fast zu jedem Lebensbereich eine passende Community im Netz. Dabei steigt auch die Anzahl der Bewertungsportale stetig und betrifft l\u00e4ngst nicht mehr nur die Bewertung von Waren, sondern erstreckt sich unterdessen auch auf Beurteilungen von Leistungen und Eigenschaften von zu bestimmten Berufsgruppen geh\u00f6renden Personen. Diese Entwicklung birgt die Gefahr, dass die dadurch gewonnenen pers\u00f6nlichen Daten durchaus geeignet sind, wahrheitswidrig ein \u00fcberm\u00e4\u00dfig positives oder \u00fcberm\u00e4\u00dfig negatives Pers\u00f6nlichkeitsbild des Betroffenen zu konstruieren und dadurch sein Ansehen zu beeinflussen. Im Hinblick auf Fragen im Zusammenhang mit dem Pers\u00f6nlichkeits- und Datenschutz soll der folgende Beitrag Ma\u00dfst\u00e4be an eine verfassungs- und datenschutzkonforme technische Gestaltung von Online-Bewertungsportalen aufzeigen.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Navarro Bullock, B., Lerch, H., Ro\\ssnagel, A., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Privacy-aware spam detection in social bookmarking systems<\/span>.<\/span> In: Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies. pp. 15:1\u201315:8. ACM, Graz, Austria (2011). https:\/\/doi.org\/10.1145\/2024288.2024306.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2024288.2024306\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-00a8f31185a34957eb16d500d7d51398\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-00a8f31185a34957eb16d500d7d51398\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2024288.2024306\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/00a8f31185a34957eb16d500d7d51398\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-00a8f31185a34957eb16d500d7d51398\">With the increased popularity of Web 2.0 services in the last years data privacy has become a major concern for users. The more personal data users reveal, the more difficult it becomes to control its disclosure in the web. However, for Web 2.0 service providers, the data provided by users is a valuable source for offering effective, personalised data mining services. One major application is the detection of spam in social bookmarking systems: in order to prevent a decrease of content quality, providers need to distinguish spammers and exclude them from the system. They thereby experience a conflict of interests: on the one hand, they need to identify spammers based on the information they collect about users, on the other hand, they need to respect privacy concerns and process as few personal data as possible. It would therefore be of tremendous help for system developers and users to know which personal data are needed for spam detection and which can be ignored. In this paper we address these questions by presenting a data privacy aware feature engineering approach. It consists of the design of features for spam classification which are evaluated according to both, performance and privacy conditions. Experiments using data from the social bookmarking system BibSonomy show that both conditions must not exclude each other.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-00a8f31185a34957eb16d500d7d51398\"><p>@inproceedings{bullock2011privacyaware,<br\/>  abstract = {With the increased popularity of Web 2.0 services in the last years data privacy has become a major concern for users. The more personal data users reveal, the more difficult it becomes to control its disclosure in the web. However, for Web 2.0 service providers, the data provided by users is a valuable source for offering effective, personalised data mining services. One major application is the detection of spam in social bookmarking systems: in order to prevent a decrease of content quality, providers need to distinguish spammers and exclude them from the system. They thereby experience a conflict of interests: on the one hand, they need to identify spammers based on the information they collect about users, on the other hand, they need to respect privacy concerns and process as few personal data as possible. It would therefore be of tremendous help for system developers and users to know which personal data are needed for spam detection and which can be ignored. In this paper we address these questions by presenting a data privacy aware feature engineering approach. It consists of the design of features for spam classification which are evaluated according to both, performance and privacy conditions. Experiments using data from the social bookmarking system BibSonomy show that both conditions must not exclude each other.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Navarro Bullock, Beate and Lerch, Hana and Ro\\ssnagel, Alexander and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies},<br\/>  keywords = {classification},<br\/>  pages = {15:1--15:8},<br\/>  publisher = {ACM},<br\/>  series = {i-KNOW '11},<br\/>  title = {Privacy-aware spam detection in social bookmarking systems},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-00a8f31185a34957eb16d500d7d51398\"><p>%0 Conference Paper<br\/>%1 bullock2011privacyaware<br\/>%A Navarro Bullock, Beate<br\/>%A Lerch, Hana<br\/>%A Ro\\ssnagel, Alexander<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies<br\/>%C New York, NY, USA<br\/>%D 2011<br\/>%I ACM<br\/>%P 15:1--15:8<br\/>%R 10.1145\/2024288.2024306<br\/>%T Privacy-aware spam detection in social bookmarking systems<br\/>%U http:\/\/doi.acm.org\/10.1145\/2024288.2024306<br\/>%X With the increased popularity of Web 2.0 services in the last years data privacy has become a major concern for users. The more personal data users reveal, the more difficult it becomes to control its disclosure in the web. However, for Web 2.0 service providers, the data provided by users is a valuable source for offering effective, personalised data mining services. One major application is the detection of spam in social bookmarking systems: in order to prevent a decrease of content quality, providers need to distinguish spammers and exclude them from the system. They thereby experience a conflict of interests: on the one hand, they need to identify spammers based on the information they collect about users, on the other hand, they need to respect privacy concerns and process as few personal data as possible. It would therefore be of tremendous help for system developers and users to know which personal data are needed for spam detection and which can be ignored. In this paper we address these questions by presenting a data privacy aware feature engineering approach. It consists of the design of features for spam classification which are evaluated according to both, performance and privacy conditions. Experiments using data from the social bookmarking system BibSonomy show that both conditions must not exclude each other.<br\/>%@ 978-1-4503-0732-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Doerfel, S., Hotho, A., Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Face-to-Face Contacts during a Conference: Communities, Roles, and Key Players<\/span>.<\/span> In: Proc. Workshop on Mining Ubiquitous and Social Environments (MUSE 2011) at ECML\/PKDD 2011 (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1fe037ea2712b205c564243d67840059\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1fe037ea2712b205c564243d67840059\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1fe037ea2712b205c564243d67840059\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1fe037ea2712b205c564243d67840059\"><p>@inproceedings{atzmueller2011facetoface,<br\/>  author = {Atzmueller, Martin and Doerfel, Stephan and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd},<br\/>  booktitle = {Proc. Workshop on Mining Ubiquitous and Social Environments (MUSE 2011) at ECML\/PKDD 2011},<br\/>  keywords = {communities},<br\/>  title = {Face-to-Face Contacts during a Conference: Communities, Roles, and Key Players},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1fe037ea2712b205c564243d67840059\"><p>%0 Conference Paper<br\/>%1 atzmueller2011facetoface<br\/>%A Atzmueller, Martin<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%A Mitzlaff, Folke<br\/>%A Stumme, Gerd<br\/>%B Proc. Workshop on Mining Ubiquitous and Social Environments (MUSE 2011) at ECML\/PKDD 2011<br\/>%D 2011<br\/>%T Face-to-Face Contacts during a Conference: Communities, Roles, and Key Players<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cattuto, C., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Introduction to the Special Issue on Social Linking and Hypermedia<\/span>.<\/span> New Review of Hypermedia and Multimedia. 17, 241\u2013242 (2011). https:\/\/doi.org\/10.1080\/13614568.2011.641407.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/13614568.2011.641407\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-609f9a53f856c8e05e193d39e87ae443\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-609f9a53f856c8e05e193d39e87ae443\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1080\/13614568.2011.641407\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/609f9a53f856c8e05e193d39e87ae443\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-609f9a53f856c8e05e193d39e87ae443\"><p>@article{doi:10.1080\/13614568.2011.641407,<br\/>  author = {Cattuto, Ciro and Hotho, Andreas},<br\/>  journal = {New Review of Hypermedia and Multimedia},<br\/>  keywords = 2011,<br\/>  number = 3,<br\/>  pages = {241-242},<br\/>  title = {Introduction to the Special Issue on Social Linking and Hypermedia},<br\/>  volume = 17,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-609f9a53f856c8e05e193d39e87ae443\"><p>%0 Journal Article<br\/>%1 doi:10.1080\/13614568.2011.641407<br\/>%A Cattuto, Ciro<br\/>%A Hotho, Andreas<br\/>%D 2011<br\/>%J New Review of Hypermedia and Multimedia<br\/>%N 3<br\/>%P 241-242<br\/>%R 10.1080\/13614568.2011.641407<br\/>%T Introduction to the Special Issue on Social Linking and Hypermedia<br\/>%U http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/13614568.2011.641407<br\/>%V 17<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">{Bj\u00f6rn-Elmar Macek, M.A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Profile Mining in CVS-Logs and Face-to-Face Contacts for Recommending Software Developers<\/span>.<\/span> In: Proc. of the third Inernational Conference on Social Computing. pp. 250\u2013257. IEEE Computer Society, Boston, MA, USA (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1fc9d7e360b0bf436646ddc100ac6cc8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1fc9d7e360b0bf436646ddc100ac6cc8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1fc9d7e360b0bf436646ddc100ac6cc8\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1fc9d7e360b0bf436646ddc100ac6cc8\"><p>@inproceedings{bjrnelmarmacek2011profile,<br\/>  address = {Boston, MA, USA},<br\/>  author = {{Bj\u00f6rn-Elmar Macek, Martin Atzmueller, Gerd Stumme}},<br\/>  booktitle = {Proc. of the third Inernational Conference on Social Computing},<br\/>  keywords = {itegpub},<br\/>  pages = {250 - 257},<br\/>  publisher = {IEEE Computer Society},<br\/>  title = {Profile Mining in CVS-Logs and Face-to-Face Contacts for Recommending Software Developers},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1fc9d7e360b0bf436646ddc100ac6cc8\"><p>%0 Conference Paper<br\/>%1 bjrnelmarmacek2011profile<br\/>%A {Bj\u00f6rn-Elmar Macek, Martin Atzmueller<br\/>%B Proc. of the third Inernational Conference on Social Computing<br\/>%C Boston, MA, USA<br\/>%D 2011<br\/>%I IEEE Computer Society<br\/>%P 250 - 257<br\/>%T Profile Mining in CVS-Logs and Face-to-Face Contacts for Recommending Software Developers<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzmueller, M., Stumme, G., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{On the Semantics of User Interaction in Social Media (Extended Abstract, Resubmission)}<\/span>.<\/span> In: Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-820ffb2166b330bf60bb30b16e426553\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-820ffb2166b330bf60bb30b16e426553\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/820ffb2166b330bf60bb30b16e426553\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-820ffb2166b330bf60bb30b16e426553\"><p>@inproceedings{mitzlaff2011semantics,<br\/>  address = {Bamberg, Germany},<br\/>  author = {Mitzlaff, Folke and Atzmueller, Martin and Stumme, Gerd and Hotho, Andreas},<br\/>  booktitle = {Proc. LWA 2013 (KDML Special Track)},<br\/>  keywords = {itegpub},<br\/>  publisher = {University of Bamberg},<br\/>  title = {{On the Semantics of User Interaction in Social Media (Extended Abstract, Resubmission)}},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-820ffb2166b330bf60bb30b16e426553\"><p>%0 Conference Paper<br\/>%1 mitzlaff2011semantics<br\/>%A Mitzlaff, Folke<br\/>%A Atzmueller, Martin<br\/>%A Stumme, Gerd<br\/>%A Hotho, Andreas<br\/>%B Proc. LWA 2013 (KDML Special Track)<br\/>%C Bamberg, Germany<br\/>%D 2011<br\/>%I University of Bamberg<br\/>%T {On the Semantics of User Interaction in Social Media (Extended Abstract, Resubmission)}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">From Semantic Web Mining to Social and Ubiquitous Mining - A Subjective View on Past, Current, and Future Research.<\/span><\/span> In: Fensel, D. (ed.) Foundations for the Web of Information and Services. pp. 143\u2013153. Springer (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/birthday\/studer2011.html#HothoS11\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-845a2a6bf9a43be9e85741a6c7d2aa2d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-845a2a6bf9a43be9e85741a6c7d2aa2d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/845a2a6bf9a43be9e85741a6c7d2aa2d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-845a2a6bf9a43be9e85741a6c7d2aa2d\"><p>@inproceedings{conf\/birthday\/HothoS11,<br\/>  author = {Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Foundations for the Web of Information and Services},<br\/>  crossref = {conf\/birthday\/2011studer},<br\/>  editor = {Fensel, Dieter},<br\/>  keywords = 2011,<br\/>  pages = {143-153},<br\/>  publisher = {Springer},<br\/>  title = {From Semantic Web Mining to Social and Ubiquitous Mining - A Subjective View on Past, Current, and Future Research.},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-845a2a6bf9a43be9e85741a6c7d2aa2d\"><p>%0 Conference Paper<br\/>%1 conf\/birthday\/HothoS11<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Foundations for the Web of Information and Services<br\/>%D 2011<br\/>%E Fensel, Dieter<br\/>%I Springer<br\/>%P 143-153<br\/>%T From Semantic Web Mining to Social and Ubiquitous Mining - A Subjective View on Past, Current, and Future Research.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/birthday\/studer2011.html#HothoS11<br\/>%@ 978-3-642-19796-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Freyne, J., Anand, S.S., Guy, I., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">3rd workshop on recommender systems and the social web<\/span>.<\/span> In: Proceedings of the fifth ACM conference on Recommender systems. pp. 383\u2013384. ACM, Chicago, Illinois, USA (2011). https:\/\/doi.org\/10.1145\/2043932.2044014.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/doi.acm.org\/10.1145\/2043932.2044014\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-11fe6dd3da33f0aa0a40c998e5193ab8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-11fe6dd3da33f0aa0a40c998e5193ab8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/2043932.2044014\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/11fe6dd3da33f0aa0a40c998e5193ab8\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-11fe6dd3da33f0aa0a40c998e5193ab8\">The exponential growth of the social web poses challenges and new opportunities for recommender systems. The social web has turned information consumers into active contributors creating massive amounts of information. Finding relevant and interesting content at the right time and in the right context is challenging for existing recommender approaches. At the same time, social systems by their definition encourage interaction between users and both online content and other users, thus generating new sources of knowledge for recommender systems. Web 2.0 users explicitly provide personal information and implicitly express preferences through their interactions with others and the system (e.g. commenting, friending, rating, etc.). These various new sources of knowledge can be leveraged to improve recommendation techniques and develop new strategies which focus on social recommendation. The Social Web provides huge opportunities for recommender technology and in turn recommender technologies can play a part in fuelling the success of the Social Web phenomenon.<\/p> <p>The goal of this one day workshop was to bring together researchers and practitioners to explore, discuss, and understand challenges and new opportunities for Recommender Systems and the Social Web. The workshop consisted both of technical sessions, in which selected participants presented their results or ongoing research, as well as informal breakout sessions on more focused topics.<\/p> <p>Papers discussing various aspects of recommender system in the Social Web were submitted and selected for presentation and discussion in the workshop in a formal reviewing process: Case studies and novel fielded social recommender applications; Economy of community-based systems: Using recommenders to encourage users to contribute and sustain participation.; Social network and folksonomy development: Recommending friends, tags, bookmarks, blogs, music, communities etc.; Recommender systems mash-ups, Web 2.0 user interfaces, rich media recommender systems; Collaborative knowledge authoring, collective intelligence; Recommender applications involving users or groups directly in the recommendation process; Exploiting folksonomies, social network information, interaction, user context and communities or groups for recommendations; Trust and reputation aware social recommendations; Semantic Web recommender systems, use of ontologies or microformats; Empirical evaluation of social recommender techniques, success and failure measures<\/p> <p>Full workshop details are available at http:\/\/www.dcs.warwick.ac.uk\/~ssanand\/RSWeb11\/index.htm<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-11fe6dd3da33f0aa0a40c998e5193ab8\"><p>@inproceedings{Freyne:2011:WRS:2043932.2044014,<br\/>  abstract = {The exponential growth of the social web poses challenges and new opportunities for recommender systems. The social web has turned information consumers into active contributors creating massive amounts of information. Finding relevant and interesting content at the right time and in the right context is challenging for existing recommender approaches. At the same time, social systems by their definition encourage interaction between users and both online content and other users, thus generating new sources of knowledge for recommender systems. Web 2.0 users explicitly provide personal information and implicitly express preferences through their interactions with others and the system (e.g. commenting, friending, rating, etc.). These various new sources of knowledge can be leveraged to improve recommendation techniques and develop new strategies which focus on social recommendation. The Social Web provides huge opportunities for recommender technology and in turn recommender technologies can play a part in fuelling the success of the Social Web phenomenon.<\/p> <p>The goal of this one day workshop was to bring together researchers and practitioners to explore, discuss, and understand challenges and new opportunities for Recommender Systems and the Social Web. The workshop consisted both of technical sessions, in which selected participants presented their results or ongoing research, as well as informal breakout sessions on more focused topics.<\/p> <p>Papers discussing various aspects of recommender system in the Social Web were submitted and selected for presentation and discussion in the workshop in a formal reviewing process: Case studies and novel fielded social recommender applications; Economy of community-based systems: Using recommenders to encourage users to contribute and sustain participation.; Social network and folksonomy development: Recommending friends, tags, bookmarks, blogs, music, communities etc.; Recommender systems mash-ups, Web 2.0 user interfaces, rich media recommender systems; Collaborative knowledge authoring, collective intelligence; Recommender applications involving users or groups directly in the recommendation process; Exploiting folksonomies, social network information, interaction, user context and communities or groups for recommendations; Trust and reputation aware social recommendations; Semantic Web recommender systems, use of ontologies or microformats; Empirical evaluation of social recommender techniques, success and failure measures<\/p> <p>Full workshop details are available at http:\/\/www.dcs.warwick.ac.uk\/~ssanand\/RSWeb11\/index.htm},<br\/>  address = {New York, NY, USA},<br\/>  author = {Freyne, Jill and Anand, Sarabjot Singh and Guy, Ido and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the fifth ACM conference on Recommender systems},<br\/>  keywords = {cochair},<br\/>  pages = {383--384},<br\/>  publisher = {ACM},<br\/>  series = {RecSys '11},<br\/>  title = {3rd workshop on recommender systems and the social web},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-11fe6dd3da33f0aa0a40c998e5193ab8\"><p>%0 Conference Paper<br\/>%1 Freyne:2011:WRS:2043932.2044014<br\/>%A Freyne, Jill<br\/>%A Anand, Sarabjot Singh<br\/>%A Guy, Ido<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the fifth ACM conference on Recommender systems<br\/>%C New York, NY, USA<br\/>%D 2011<br\/>%I ACM<br\/>%P 383--384<br\/>%R 10.1145\/2043932.2044014<br\/>%T 3rd workshop on recommender systems and the social web<br\/>%U http:\/\/doi.acm.org\/10.1145\/2043932.2044014<br\/>%X The exponential growth of the social web poses challenges and new opportunities for recommender systems. The social web has turned information consumers into active contributors creating massive amounts of information. Finding relevant and interesting content at the right time and in the right context is challenging for existing recommender approaches. At the same time, social systems by their definition encourage interaction between users and both online content and other users, thus generating new sources of knowledge for recommender systems. Web 2.0 users explicitly provide personal information and implicitly express preferences through their interactions with others and the system (e.g. commenting, friending, rating, etc.). These various new sources of knowledge can be leveraged to improve recommendation techniques and develop new strategies which focus on social recommendation. The Social Web provides huge opportunities for recommender technology and in turn recommender technologies can play a part in fuelling the success of the Social Web phenomenon.<\/p> <p>The goal of this one day workshop was to bring together researchers and practitioners to explore, discuss, and understand challenges and new opportunities for Recommender Systems and the Social Web. The workshop consisted both of technical sessions, in which selected participants presented their results or ongoing research, as well as informal breakout sessions on more focused topics.<\/p> <p>Papers discussing various aspects of recommender system in the Social Web were submitted and selected for presentation and discussion in the workshop in a formal reviewing process: Case studies and novel fielded social recommender applications; Economy of community-based systems: Using recommenders to encourage users to contribute and sustain participation.; Social network and folksonomy development: Recommending friends, tags, bookmarks, blogs, music, communities etc.; Recommender systems mash-ups, Web 2.0 user interfaces, rich media recommender systems; Collaborative knowledge authoring, collective intelligence; Recommender applications involving users or groups directly in the recommendation process; Exploiting folksonomies, social network information, interaction, user context and communities or groups for recommendations; Trust and reputation aware social recommendations; Semantic Web recommender systems, use of ontologies or microformats; Empirical evaluation of social recommender techniques, success and failure measures<\/p> <p>Full workshop details are available at http:\/\/www.dcs.warwick.ac.uk\/~ssanand\/RSWeb11\/index.htm<br\/>%@ 978-1-4503-0683-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Krohn, M., Klein, N., Jandt, S., Atzmueller, M., Scholz, C., Hoffmann, H., Kniewel, R., Evers, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Das Forschungszentrum f\u00fcr Informationstechnik-Gestaltung (ITeG)<\/span>.<\/span> Praxis der Informationsverarbeitung und Kommunikation. 34, 238\u2013240 (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cb16be899e3a5f45892ed91a405b2b76\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cb16be899e3a5f45892ed91a405b2b76\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cb16be899e3a5f45892ed91a405b2b76\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cb16be899e3a5f45892ed91a405b2b76\"><p>@article{DBLP:journals\/pik\/KJASHKE11,<br\/>  author = {Krohn, Michael and Klein, Niklas and Jandt, Silke and Atzmueller, Martin and Scholz, Christoph and Hoffmann, Holger and Kniewel, Romy and Evers, Christoph},<br\/>  journal = {Praxis der Informationsverarbeitung und Kommunikation},<br\/>  keywords = {itegpub},<br\/>  number = 4,<br\/>  pages = {238-240},<br\/>  title = {Das Forschungszentrum f\u00fcr Informationstechnik-Gestaltung (ITeG)},<br\/>  volume = 34,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cb16be899e3a5f45892ed91a405b2b76\"><p>%0 Journal Article<br\/>%1 DBLP:journals\/pik\/KJASHKE11<br\/>%A Krohn, Michael<br\/>%A Klein, Niklas<br\/>%A Jandt, Silke<br\/>%A Atzmueller, Martin<br\/>%A Scholz, Christoph<br\/>%A Hoffmann, Holger<br\/>%A Kniewel, Romy<br\/>%A Evers, Christoph<br\/>%D 2011<br\/>%J Praxis der Informationsverarbeitung und Kommunikation<br\/>%N 4<br\/>%P 238-240<br\/>%T Das Forschungszentrum f\u00fcr Informationstechnik-Gestaltung (ITeG)<br\/>%V 34<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bloehdorn, S., Blohm, S., Cimiano, P., Giesbrecht, E., Hotho, A., L\u00f6sch, U., M\u00e4dche, A., M\u00f6nch, E., Sorg, P., Staab, S., V\u00f6lker, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Combining Data-Driven and Semantic Approaches for Text Mining.<\/span><\/span> In: Fensel, D. (ed.) Foundations for the Web of Information and Services. pp. 115\u2013142. Springer (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/birthday\/studer2011.html#BloehdornBCGHLMMSSV11\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-21be5153a8f491c9f209d57ce7662387\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-21be5153a8f491c9f209d57ce7662387\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/21be5153a8f491c9f209d57ce7662387\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-21be5153a8f491c9f209d57ce7662387\"><p>@inproceedings{conf\/birthday\/BloehdornBCGHLMMSSV11,<br\/>  author = {Bloehdorn, Stephan and Blohm, Sebastian and Cimiano, Philipp and Giesbrecht, Eugenie and Hotho, Andreas and L\u00f6sch, Uta and M\u00e4dche, Alexander and M\u00f6nch, Eddie and Sorg, Philipp and Staab, Steffen and V\u00f6lker, Johanna},<br\/>  booktitle = {Foundations for the Web of Information and Services},<br\/>  crossref = {conf\/birthday\/2011studer},<br\/>  editor = {Fensel, Dieter},<br\/>  keywords = {text},<br\/>  pages = {115-142},<br\/>  publisher = {Springer},<br\/>  title = {Combining Data-Driven and Semantic Approaches for Text Mining.},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-21be5153a8f491c9f209d57ce7662387\"><p>%0 Conference Paper<br\/>%1 conf\/birthday\/BloehdornBCGHLMMSSV11<br\/>%A Bloehdorn, Stephan<br\/>%A Blohm, Sebastian<br\/>%A Cimiano, Philipp<br\/>%A Giesbrecht, Eugenie<br\/>%A Hotho, Andreas<br\/>%A L\u00f6sch, Uta<br\/>%A M\u00e4dche, Alexander<br\/>%A M\u00f6nch, Eddie<br\/>%A Sorg, Philipp<br\/>%A Staab, Steffen<br\/>%A V\u00f6lker, Johanna<br\/>%B Foundations for the Web of Information and Services<br\/>%D 2011<br\/>%E Fensel, Dieter<br\/>%I Springer<br\/>%P 115-142<br\/>%T Combining Data-Driven and Semantic Approaches for Text Mining.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/birthday\/studer2011.html#BloehdornBCGHLMMSSV11<br\/>%@ 978-3-642-19796-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Hotho, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings of the 2011 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2011)}<\/span>.<\/span> ECML\/PKDD 2011, Athens, Greece (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-87b0576f542aa6de352a2bff1428ce6b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-87b0576f542aa6de352a2bff1428ce6b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/87b0576f542aa6de352a2bff1428ce6b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-87b0576f542aa6de352a2bff1428ce6b\"><p>@book{AH:11,<br\/>  address = {Athens, Greece},<br\/>  editor = {Atzmueller, Martin and Hotho, Andreas},<br\/>  keywords = {muse},<br\/>  publisher = {ECML\/PKDD 2011},<br\/>  title = {{Proceedings of the 2011 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2011)}},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-87b0576f542aa6de352a2bff1428ce6b\"><p>%0 Book<br\/>%1 AH:11<br\/>%C Athens, Greece<br\/>%D 2011<br\/>%E Atzmueller, Martin<br\/>%E Hotho, Andreas<br\/>%I ECML\/PKDD 2011<br\/>%T {Proceedings of the 2011 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2011)}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Doerfel, S., Hotho, A., Mitzlaff, F., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Face-to-Face Contacts during LWA 2010 - Communities, Roles, and Key Players<\/span>.<\/span> In: Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-84840e0e94320b5742df381f2ec033b7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-84840e0e94320b5742df381f2ec033b7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/84840e0e94320b5742df381f2ec033b7\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-84840e0e94320b5742df381f2ec033b7\"><p>@inproceedings{atzmueller2011facetoface,<br\/>  author = {Atzmueller, Martin and Doerfel, Stephan and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd},<br\/>  booktitle = {Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation},<br\/>  keywords = {contacts},<br\/>  title = {Face-to-Face Contacts during LWA 2010 - Communities, Roles, and Key Players},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-84840e0e94320b5742df381f2ec033b7\"><p>%0 Conference Paper<br\/>%1 atzmueller2011facetoface<br\/>%A Atzmueller, Martin<br\/>%A Doerfel, Stephan<br\/>%A Hotho, Andreas<br\/>%A Mitzlaff, Folke<br\/>%A Stumme, Gerd<br\/>%B Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation<br\/>%D 2011<br\/>%T Face-to-Face Contacts during LWA 2010 - Communities, Roles, and Key Players<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Mining Semantic Maturity in Social Bookmarking Systems<\/span>.<\/span> In: Passant, A., Fern\u00e1ndez, S., Breslin, J., and Boj\u0101rs, U. (eds.) Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011) (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/atzmueller2011towards.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a47a41658592202811f0139d4bb65871\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a47a41658592202811f0139d4bb65871\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a47a41658592202811f0139d4bb65871\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a47a41658592202811f0139d4bb65871\"><p>@inproceedings{atzmueller2011towards,<br\/>  author = {Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011)},<br\/>  editor = {Passant, Alexandre and Fern\u00e1ndez, Sergio and Breslin, John and Boj\u0101rs, Uldis},<br\/>  keywords = {bookmarking},<br\/>  title = {Towards Mining Semantic Maturity in Social Bookmarking Systems},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a47a41658592202811f0139d4bb65871\"><p>%0 Conference Paper<br\/>%1 atzmueller2011towards<br\/>%A Atzmueller, Martin<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011)<br\/>%D 2011<br\/>%E Passant, Alexandre<br\/>%E Fern\u00e1ndez, Sergio<br\/>%E Breslin, John<br\/>%E Boj\u0101rs, Uldis<br\/>%T Towards Mining Semantic Maturity in Social Bookmarking Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/atzmueller2011towards.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Toepfer, M., Kluegl, P., Hotho, A., Puppe, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Segmentation of References with Skip-Chain Conditional Random Fields for Consistent Label Transitions<\/span>.<\/span> In: Workshop Notes of the LWA 2011 - Learning, Knowledge, Adaptation (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ki.informatik.uni-wuerzburg.de\/papers\/pkluegl\/2011-LWA-SkYp.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b707fa6ddf5b3010827868ecebc60d6a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b707fa6ddf5b3010827868ecebc60d6a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b707fa6ddf5b3010827868ecebc60d6a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b707fa6ddf5b3010827868ecebc60d6a\"><p>@inproceedings{toepfer2011segmentation,<br\/>  author = {Toepfer, Martin and Kluegl, Peter and Hotho, Andreas and Puppe, Frank},<br\/>  booktitle = {Workshop Notes of the LWA 2011 - Learning, Knowledge, Adaptation},<br\/>  keywords = {references},<br\/>  title = {Segmentation of References with Skip-Chain Conditional Random Fields for Consistent Label Transitions},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b707fa6ddf5b3010827868ecebc60d6a\"><p>%0 Conference Paper<br\/>%1 toepfer2011segmentation<br\/>%A Toepfer, Martin<br\/>%A Kluegl, Peter<br\/>%A Hotho, Andreas<br\/>%A Puppe, Frank<br\/>%B Workshop Notes of the LWA 2011 - Learning, Knowledge, Adaptation<br\/>%D 2011<br\/>%T Segmentation of References with Skip-Chain Conditional Random Fields for Consistent Label Transitions<br\/>%U http:\/\/ki.informatik.uni-wuerzburg.de\/papers\/pkluegl\/2011-LWA-SkYp.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Data Mining<\/span>.<\/span> In: McCarthy, P.M. and Boonthum, C. (eds.) Applied Natural Language Processing and Content Analysis: Advances in Identification, Investigation and Resolution. IGI Global (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c930dbfed60e5a6d20e8785181f42feb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c930dbfed60e5a6d20e8785181f42feb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c930dbfed60e5a6d20e8785181f42feb\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c930dbfed60e5a6d20e8785181f42feb\"><p>@incollection{Atzmueller:11,<br\/>  author = {Atzmueller, Martin},<br\/>  booktitle = {Applied Natural Language Processing and Content Analysis: Advances in Identification, Investigation and Resolution.},<br\/>  editor = {McCarthy, Philip M. and Boonthum, Chutima},<br\/>  keywords = {itegpub},<br\/>  publisher = {IGI Global},<br\/>  title = {Data Mining},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c930dbfed60e5a6d20e8785181f42feb\"><p>%0 Book Section<br\/>%1 Atzmueller:11<br\/>%A Atzmueller, Martin<br\/>%B Applied Natural Language Processing and Content Analysis: Advances in Identification, Investigation and Resolution.<br\/>%D 2011<br\/>%E McCarthy, Philip M.<br\/>%E Boonthum, Chutima<br\/>%I IGI Global<br\/>%T Data Mining<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ackermann, M.R., Bl\u00f6mer, J., Scholz, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Hardness and Non-Approximability of Bregman Clustering Problems.<\/span><\/span> Electronic Colloquium on Computational Complexity (ECCC). 18, 20 (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/eccc.hpi-web.de\/report\/2011\/015\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-762c0e94b3be12bff214b24ffeb2e38b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-762c0e94b3be12bff214b24ffeb2e38b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/762c0e94b3be12bff214b24ffeb2e38b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-762c0e94b3be12bff214b24ffeb2e38b\"><p>@article{journals\/eccc\/TR11-015,<br\/>  author = {Ackermann, Marcel R. and Bl\u00f6mer, Johannes and Scholz, Christoph},<br\/>  journal = {Electronic Colloquium on Computational Complexity (ECCC)},<br\/>  keywords = {k-median},<br\/>  pages = 20,<br\/>  title = {Hardness and Non-Approximability of Bregman Clustering Problems.},<br\/>  volume = 18,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-762c0e94b3be12bff214b24ffeb2e38b\"><p>%0 Journal Article<br\/>%1 journals\/eccc\/TR11-015<br\/>%A Ackermann, Marcel R.<br\/>%A Bl\u00f6mer, Johannes<br\/>%A Scholz, Christoph<br\/>%D 2011<br\/>%J Electronic Colloquium on Computational Complexity (ECCC)<br\/>%P 20<br\/>%T Hardness and Non-Approximability of Bregman Clustering Problems.<br\/>%U http:\/\/eccc.hpi-web.de\/report\/2011\/015\/<br\/>%V 18<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Structure and Consistency: Assessment of Social Bookmarking Communities<\/span>.<\/span> In: Proceedings from Sunbelt XXXI. , Trade Winds Beach Resort (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-dca9a97f90443ccc52e14e40c373bb68\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-dca9a97f90443ccc52e14e40c373bb68\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/dca9a97f90443ccc52e14e40c373bb68\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-dca9a97f90443ccc52e14e40c373bb68\"><p>@inproceedings{mitzlaff2011social,<br\/>  address = {Trade Winds Beach Resort},<br\/>  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings from Sunbelt XXXI},<br\/>  keywords = 2011,<br\/>  title = {Structure and Consistency: Assessment of Social Bookmarking Communities},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-dca9a97f90443ccc52e14e40c373bb68\"><p>%0 Conference Paper<br\/>%1 mitzlaff2011social<br\/>%A Mitzlaff, Folke<br\/>%A Atzmueller, Martin<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings from Sunbelt XXXI<br\/>%C Trade Winds Beach Resort<br\/>%D 2011<br\/>%T Structure and Consistency: Assessment of Social Bookmarking Communities<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Community Assessment using Evidence Networks}<\/span>.<\/span> In: Analysis of Social Media and Ubiquitous Data (2011).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0f45e870093c053e6f41f54c14bda46b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0f45e870093c053e6f41f54c14bda46b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0f45e870093c053e6f41f54c14bda46b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0f45e870093c053e6f41f54c14bda46b\"><p>@inproceedings{mitzlaff2011community,<br\/>  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Analysis of Social Media and Ubiquitous Data},<br\/>  keywords = {itegpub},<br\/>  series = {LNAI},<br\/>  title = {{Community Assessment using Evidence Networks}},<br\/>  volume = 6904,<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0f45e870093c053e6f41f54c14bda46b\"><p>%0 Conference Paper<br\/>%1 mitzlaff2011community<br\/>%A Mitzlaff, Folke<br\/>%A Atzmueller, Martin<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Analysis of Social Media and Ubiquitous Data<br\/>%D 2011<br\/>%T {Community Assessment using Evidence Networks}<br\/>%V 6904<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Balby Marinho, L., Nanopoulos, A., Schmidt-Thieme, L., J\u00e4schke, R., Hotho, A., Stumme, G., Symeonidis, P.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Social Tagging Recommender Systems<\/span>.<\/span> In: Ricci, F., Rokach, L., Shapira, B., and Kantor, P.B. (eds.) Recommender Systems Handbook. pp. 615\u2013644. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-0-387-85820-3_19.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/978-0-387-85820-3_19\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-708be7b5c269bd3a9d3d2334f858d52d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-708be7b5c269bd3a9d3d2334f858d52d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-0-387-85820-3_19\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/708be7b5c269bd3a9d3d2334f858d52d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-708be7b5c269bd3a9d3d2334f858d52d\">The new generation of Web applications known as (STS) is successfully established and poised for continued growth. STS are open and inherently social; features that have been proven to encourage participation. But while STS bring new opportunities, they revive old problems, such as information overload. Recommender Systems are well known applications for increasing the level of relevant content over the noise that continuously grows as more and more content becomes available online. In STS however, we face new challenges. Users are interested in finding not only content, but also tags and even other users. Moreover, while traditional recommender systems usually operate over 2-way data arrays, STS data is represented as a third-order tensor or a hypergraph with hyperedges denoting (user, resource, tag) triples. In this chapter, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve STS.We describe (a) novel facets of recommenders for STS, such as user, resource, and tag recommenders, (b) new approaches and algorithms for dealing with the ternary nature of STS data, and (c) recommender systems deployed in real world STS. Moreover, a concise comparison between existing works is presented, through which we identify and point out new research directions.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-708be7b5c269bd3a9d3d2334f858d52d\"><p>@incollection{marinho2011social,<br\/>  abstract = {The new generation of Web applications known as (STS) is successfully established and poised for continued growth. STS are open and inherently social; features that have been proven to encourage participation. But while STS bring new opportunities, they revive old problems, such as information overload. Recommender Systems are well known applications for increasing the level of relevant content over the noise that continuously grows as more and more content becomes available online. In STS however, we face new challenges. Users are interested in finding not only content, but also tags and even other users. Moreover, while traditional recommender systems usually operate over 2-way data arrays, STS data is represented as a third-order tensor or a hypergraph with hyperedges denoting (user, resource, tag) triples. In this chapter, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve STS.We describe (a) novel facets of recommenders for STS, such as user, resource, and tag recommenders, (b) new approaches and algorithms for dealing with the ternary nature of STS data, and (c) recommender systems deployed in real world STS. Moreover, a concise comparison between existing works is presented, through which we identify and point out new research directions.},<br\/>  address = {New York},<br\/>  author = {Balby Marinho, Leandro and Nanopoulos, Alexandros and Schmidt-Thieme, Lars and J\u00e4schke, Robert and Hotho, Andreas and Stumme, Gerd and Symeonidis, Panagiotis},<br\/>  booktitle = {Recommender Systems Handbook},<br\/>  editor = {Ricci, Francesco and Rokach, Lior and Shapira, Bracha and Kantor, Paul B.},<br\/>  keywords = {itegpub},<br\/>  pages = {615--644},<br\/>  publisher = {Springer},<br\/>  title = {Social Tagging Recommender Systems},<br\/>  year = 2011<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-708be7b5c269bd3a9d3d2334f858d52d\"><p>%0 Book Section<br\/>%1 marinho2011social<br\/>%A Balby Marinho, Leandro<br\/>%A Nanopoulos, Alexandros<br\/>%A Schmidt-Thieme, Lars<br\/>%A J\u00e4schke, Robert<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%A Symeonidis, Panagiotis<br\/>%B Recommender Systems Handbook<br\/>%C New York<br\/>%D 2011<br\/>%E Ricci, Francesco<br\/>%E Rokach, Lior<br\/>%E Shapira, Bracha<br\/>%E Kantor, Paul B.<br\/>%I Springer<br\/>%P 615--644<br\/>%R 10.1007\/978-0-387-85820-3_19<br\/>%T Social Tagging Recommender Systems<br\/>%U http:\/\/dx.doi.org\/10.1007\/978-0-387-85820-3_19<br\/>%X The new generation of Web applications known as (STS) is successfully established and poised for continued growth. STS are open and inherently social; features that have been proven to encourage participation. But while STS bring new opportunities, they revive old problems, such as information overload. Recommender Systems are well known applications for increasing the level of relevant content over the noise that continuously grows as more and more content becomes available online. In STS however, we face new challenges. Users are interested in finding not only content, but also tags and even other users. Moreover, while traditional recommender systems usually operate over 2-way data arrays, STS data is represented as a third-order tensor or a hypergraph with hyperedges denoting (user, resource, tag) triples. In this chapter, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve STS.We describe (a) novel facets of recommenders for STS, such as user, resource, and tag recommenders, (b) new approaches and algorithms for dealing with the ternary nature of STS data, and (c) recommender systems deployed in real world STS. Moreover, a concise comparison between existing works is presented, through which we identify and point out new research directions.<br\/>%@ 978-0-387-85820-3<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2010\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2010<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Roth-Berghofer, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Explanation-Aware Social Software: Applying the Mining and Analysis Continuum of Explaining<\/span>.<\/span> In: Proc. Workshop on Explanation-aware Computing ExaCt 2010 @ ECAI 2010 (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d958a4e9a180a47b82c279a727ac53a5\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d958a4e9a180a47b82c279a727ac53a5\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d958a4e9a180a47b82c279a727ac53a5\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d958a4e9a180a47b82c279a727ac53a5\"><p>@inproceedings{AR:10b,<br\/>  author = {Atzmueller, Martin and Roth-Berghofer, Thomas},<br\/>  booktitle = {Proc. Workshop on Explanation-aware Computing ExaCt 2010 @ ECAI 2010},<br\/>  keywords = {itegpub},<br\/>  title = {Towards Explanation-Aware Social Software: Applying the Mining and Analysis Continuum of Explaining},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d958a4e9a180a47b82c279a727ac53a5\"><p>%0 Conference Paper<br\/>%1 AR:10b<br\/>%A Atzmueller, Martin<br\/>%A Roth-Berghofer, Thomas<br\/>%B Proc. Workshop on Explanation-aware Computing ExaCt 2010 @ ECAI 2010<br\/>%D 2010<br\/>%T Towards Explanation-Aware Social Software: Applying the Mining and Analysis Continuum of Explaining<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Benz, D., Hotho, A., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings of the LWA 2010 - Lernen, Wissen, Adaptivit\u00e4t}<\/span>.<\/span> Department of Electrical Engineering\/Computer Science, Kassel University (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-060c675871a5e2173af200bd12f6f3ff\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-060c675871a5e2173af200bd12f6f3ff\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/060c675871a5e2173af200bd12f6f3ff\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-060c675871a5e2173af200bd12f6f3ff\"><p>@book{ABHS:10,<br\/>  editor = {Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  publisher = {Department of Electrical Engineering\/Computer Science, Kassel University},<br\/>  series = {Technical report (KIS), 2010-10},<br\/>  title = {{Proceedings of the LWA 2010 - Lernen, Wissen, Adaptivit\u00e4t}},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-060c675871a5e2173af200bd12f6f3ff\"><p>%0 Book<br\/>%1 ABHS:10<br\/>%B Technical report (KIS), 2010-10<br\/>%D 2010<br\/>%E Atzmueller, Martin<br\/>%E Benz, Dominik<br\/>%E Hotho, Andreas<br\/>%E Stumme, Gerd<br\/>%I Department of Electrical Engineering\/Computer Science, Kassel University<br\/>%T {Proceedings of the LWA 2010 - Lernen, Wissen, Adaptivit\u00e4t}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Community Assessment using Evidence Networks<\/span>.<\/span> In: Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010). , Barcelona, Spain (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/mitzlaff-community-assessment-muse-2010.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d93c7cc72cd40e027d5421fdafe90a9a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d93c7cc72cd40e027d5421fdafe90a9a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d93c7cc72cd40e027d5421fdafe90a9a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-d93c7cc72cd40e027d5421fdafe90a9a\">Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d93c7cc72cd40e027d5421fdafe90a9a\"><p>@inproceedings{mitzlaff2010community,<br\/>  abstract = {Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.},<br\/>  address = {Barcelona, Spain},<br\/>  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010)},<br\/>  keywords = {itegpub},<br\/>  title = {Community Assessment using Evidence Networks},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d93c7cc72cd40e027d5421fdafe90a9a\"><p>%0 Conference Paper<br\/>%1 mitzlaff2010community<br\/>%A Mitzlaff, Folke<br\/>%A Atzmueller, Martin<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010)<br\/>%C Barcelona, Spain<br\/>%D 2010<br\/>%T Community Assessment using Evidence Networks<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/mitzlaff-community-assessment-muse-2010.pdf<br\/>%X Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Hotho, A., J\u00e4schke, R., Stumme, G., Halle, A., Lima-Gerlach, A.S., Steenweg, H., Stefani, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Academic Publication Management with PUMA - collect, organize and share publications<\/span>.<\/span> In: Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries. pp. 417\u2013420 (2010). https:\/\/doi.org\/10.1007.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-792ef6888aaf686f744eaa414260bc43\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-792ef6888aaf686f744eaa414260bc43\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/792ef6888aaf686f744eaa414260bc43\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-792ef6888aaf686f744eaa414260bc43\">The PUMA project fosters the Open Access movement und aims at a better support of the researcher\u2019s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-792ef6888aaf686f744eaa414260bc43\"><p>@inproceedings{Halle:2010,<br\/>  abstract = {The PUMA project fosters the Open Access movement und aims at a better support of the researcher\u2019s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.},<br\/>  author = {Benz, Dominik and Hotho, Andreas and J\u00e4schke, Robert and Stumme, Gerd and Halle, Axel and Lima-Gerlach, Angela Sanches and Steenweg, Helge and Stefani, Sven},<br\/>  booktitle = {Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries},<br\/>  keywords = {Publication},<br\/>  pages = {417-420},<br\/>  title = {Academic Publication Management with PUMA - collect, organize and share publications},<br\/>  volume = {6273\/2010},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-792ef6888aaf686f744eaa414260bc43\"><p>%0 Conference Paper<br\/>%1 Halle:2010<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%A Halle, Axel<br\/>%A Lima-Gerlach, Angela Sanches<br\/>%A Steenweg, Helge<br\/>%A Stefani, Sven<br\/>%B Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries<br\/>%D 2010<br\/>%P 417-420<br\/>%R 10.1007<br\/>%T Academic Publication Management with PUMA - collect, organize and share publications<br\/>%V 6273\/2010<br\/>%X The PUMA project fosters the Open Access movement und aims at a better support of the researcher\u2019s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.<br\/>%@ 978-3-642-15464-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">K\u00f6rner, C., Benz, D., Hotho, A., Strohmaier, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Social Bookmarking Systems: Verbosity Improves Semantics<\/span>.<\/span> In: Proceedings of INSNA Sunbelt XXX. , Riva del Garda Fierecongressi, Trento, Italy (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-593732c613cbfd7a139c10a005822d77\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-593732c613cbfd7a139c10a005822d77\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/593732c613cbfd7a139c10a005822d77\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-593732c613cbfd7a139c10a005822d77\"><p>@inproceedings{koerner2010social,<br\/>  address = {Riva del Garda Fierecongressi, Trento, Italy},<br\/>  author = {K\u00f6rner, Christian and Benz, Dominik and Hotho, Andreas and Strohmaier, Markus and Stumme, Gerd},<br\/>  booktitle = {Proceedings of INSNA Sunbelt XXX},<br\/>  keywords = 2010,<br\/>  title = {Social Bookmarking Systems: Verbosity Improves Semantics},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-593732c613cbfd7a139c10a005822d77\"><p>%0 Conference Paper<br\/>%1 koerner2010social<br\/>%A K\u00f6rner, Christian<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Strohmaier, Markus<br\/>%A Stumme, Gerd<br\/>%B Proceedings of INSNA Sunbelt XXX<br\/>%C Riva del Garda Fierecongressi, Trento, Italy<br\/>%D 2010<br\/>%T Social Bookmarking Systems: Verbosity Improves Semantics<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Benz, D., Stumme, G., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Visit me, click me, be my friend: an analysis of evidence networks of user relationships in BibSonomy<\/span>.<\/span> In: Proceedings of the 21st ACM conference on Hypertext and hypermedia. pp. 265\u2013270. ACM, New York, NY, USA (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6596855a55ab198092bc1bc08151632d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6596855a55ab198092bc1bc08151632d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6596855a55ab198092bc1bc08151632d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6596855a55ab198092bc1bc08151632d\"><p>@inproceedings{mitzlaff2010visit,<br\/>  address = {New York, NY, USA},<br\/>  author = {Mitzlaff, Folke and Benz, Dominik and Stumme, Gerd and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the 21st ACM conference on Hypertext and hypermedia},<br\/>  keywords = {itegpub},<br\/>  pages = {265--270},<br\/>  publisher = {ACM},<br\/>  series = {HT '10},<br\/>  title = {Visit me, click me, be my friend: an analysis of evidence networks of user relationships in BibSonomy},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6596855a55ab198092bc1bc08151632d\"><p>%0 Conference Paper<br\/>%1 mitzlaff2010visit<br\/>%A Mitzlaff, Folke<br\/>%A Benz, Dominik<br\/>%A Stumme, Gerd<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the 21st ACM conference on Hypertext and hypermedia<br\/>%C New York, NY, USA<br\/>%D 2010<br\/>%I ACM<br\/>%P 265--270<br\/>%T Visit me, click me, be my friend: an analysis of evidence networks of user relationships in BibSonomy<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Hotho, A., J\u00e4schke, R., Krause, B., Mitzlaff, F., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Social Bookmark and Publication Management System {BibSonomy}<\/span>.<\/span> The VLDB Journal. 19, 849\u2013875 (2010). https:\/\/doi.org\/10.1007\/s00778-010-0208-4.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2010social.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c9437d5ec56ba949f533aeec00f571e3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c9437d5ec56ba949f533aeec00f571e3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s00778-010-0208-4\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c9437d5ec56ba949f533aeec00f571e3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-c9437d5ec56ba949f533aeec00f571e3\">Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c9437d5ec56ba949f533aeec00f571e3\"><p>@article{benz2010social,<br\/>  abstract = {Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.},<br\/>  address = {Berlin\/Heidelberg},<br\/>  author = {Benz, Dominik and Hotho, Andreas and J\u00e4schke, Robert and Krause, Beate and Mitzlaff, Folke and Schmitz, Christoph and Stumme, Gerd},<br\/>  journal = {The VLDB Journal},<br\/>  keywords = {bibsonomy},<br\/>  month = 12,<br\/>  number = 6,<br\/>  pages = {849--875},<br\/>  publisher = {Springer},<br\/>  title = {The Social Bookmark and Publication Management System {BibSonomy}},<br\/>  volume = 19,<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c9437d5ec56ba949f533aeec00f571e3\"><p>%0 Journal Article<br\/>%1 benz2010social<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Krause, Beate<br\/>%A Mitzlaff, Folke<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%C Berlin\/Heidelberg<br\/>%D 2010<br\/>%I Springer<br\/>%J The VLDB Journal<br\/>%N 6<br\/>%P 849--875<br\/>%R 10.1007\/s00778-010-0208-4<br\/>%T The Social Bookmark and Publication Management System {BibSonomy}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2010social.pdf<br\/>%V 19<br\/>%X Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Roth-Berghofer, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Mining and Analysis Continuum of Explaining Uncovered<\/span>.<\/span> In: Proc. 30th SGAI International Conference on Artificial Intelligence (AI-2010) (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-mace-ai-2010.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-18d53f93993aff7d941de9df7089bd4b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-18d53f93993aff7d941de9df7089bd4b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/18d53f93993aff7d941de9df7089bd4b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-18d53f93993aff7d941de9df7089bd4b\"><p>@inproceedings{AR:10a,<br\/>  author = {Atzmueller, Martin and Roth-Berghofer, Thomas},<br\/>  booktitle = {Proc. 30th SGAI International Conference on Artificial Intelligence (AI-2010)},<br\/>  keywords = {itegpub},<br\/>  title = {The Mining and Analysis Continuum of Explaining Uncovered},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-18d53f93993aff7d941de9df7089bd4b\"><p>%0 Conference Paper<br\/>%1 AR:10a<br\/>%A Atzmueller, Martin<br\/>%A Roth-Berghofer, Thomas<br\/>%B Proc. 30th SGAI International Conference on Artificial Intelligence (AI-2010)<br\/>%D 2010<br\/>%T The Mining and Analysis Continuum of Explaining Uncovered<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/atzmueller\/paper\/atzmueller-mace-ai-2010.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Knauf, R., Bode, S., Farooq, Q.-U.-A., Riebisch, M. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The IWK2010 Workshops: DERIS2010 and EMDT2010. Proceedings of the IWK2010 Workshops: International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS2010) and the First International Workshop on Evolution Support for Model-Based Development and Testing (EMDT2010)<\/span>.<\/span> RWTH Aachen University (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-864ca9616f4b078125961d4289755ef3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-864ca9616f4b078125961d4289755ef3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/864ca9616f4b078125961d4289755ef3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-864ca9616f4b078125961d4289755ef3\"><p>@book{AKBFR:10,<br\/>  editor = {Atzmueller, Martin and Knauf, Rainer and Bode, Stephan and Farooq, Qurat-Ul-Ann and Riebisch, Matthias},<br\/>  keywords = {itegpub},<br\/>  publisher = {RWTH Aachen University},<br\/>  series = {CEUR-WS},<br\/>  title = {The IWK2010 Workshops: DERIS2010 and EMDT2010. Proceedings of the IWK2010 Workshops: International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS2010) and the First International Workshop on Evolution Support for Model-Based Development and Testing (EMDT2010)},<br\/>  volume = 646,<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-864ca9616f4b078125961d4289755ef3\"><p>%0 Book<br\/>%1 AKBFR:10<br\/>%B CEUR-WS<br\/>%D 2010<br\/>%E Atzmueller, Martin<br\/>%E Knauf, Rainer<br\/>%E Bode, Stephan<br\/>%E Farooq, Qurat-Ul-Ann<br\/>%E Riebisch, Matthias<br\/>%I RWTH Aachen University<br\/>%T The IWK2010 Workshops: DERIS2010 and EMDT2010. Proceedings of the IWK2010 Workshops: International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS2010) and the First International Workshop on Evolution Support for Model-Based Development and Testing (EMDT2010)<br\/>%V 646<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Krause, B., Kolbe-Nusser, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Intelligent scientific authoring tools: interactive data mining for constructive uses of citation networks<\/span>.<\/span> Information Processing \\&amp; Management. 46, 1\u201310 (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/lirias.kuleuven.be\/handle\/123456789\/255612\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4d3bf12ae82b54271a4b059c11023965\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4d3bf12ae82b54271a4b059c11023965\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4d3bf12ae82b54271a4b059c11023965\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4d3bf12ae82b54271a4b059c11023965\"><p>@article{berendt2009authoring,<br\/>  author = {Berendt, Bettina and Krause, Beate and Kolbe-Nusser, Sebastian},<br\/>  journal = {Information Processing \\& Management},<br\/>  keywords = 2010,<br\/>  month = {01},<br\/>  number = 1,<br\/>  pages = {1--10},<br\/>  title = {Intelligent scientific authoring tools: interactive data mining for constructive uses of citation networks},<br\/>  volume = 46,<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4d3bf12ae82b54271a4b059c11023965\"><p>%0 Journal Article<br\/>%1 berendt2009authoring<br\/>%A Berendt, Bettina<br\/>%A Krause, Beate<br\/>%A Kolbe-Nusser, Sebastian<br\/>%D 2010<br\/>%J Information Processing \\& Management<br\/>%N 1<br\/>%P 1--10<br\/>%T Intelligent scientific authoring tools: interactive data mining for constructive uses of citation networks<br\/>%U https:\/\/lirias.kuleuven.be\/handle\/123456789\/255612<br\/>%V 46<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Benz, D., Eisterlehner, F., J\u00e4schke, R., Krause, B., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f\u00fcr Wissenschaftler}<\/span>.<\/span> HMD -- Praxis der Wirtschaftsinformatik. Heft 271, 47\u201358 (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5bd066ff04cf63bc44fc6c8e72d58560\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5bd066ff04cf63bc44fc6c8e72d58560\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5bd066ff04cf63bc44fc6c8e72d58560\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5bd066ff04cf63bc44fc6c8e72d58560\">Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr\u00f6\u00dferer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw\u00e4rtigkeit, die st\u00e4ndige Verf\u00fcgbarkeit, aber auch die M\u00f6glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr\u00fcnde f\u00fcr ihren gegenw\u00e4rtigen Erfolg. Der Artikel f\u00fchrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl\u00e4ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schlie\u00dft mit Querbez\u00fcgen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5bd066ff04cf63bc44fc6c8e72d58560\"><p>@article{HothoBenzEtAl10hmd,<br\/>  abstract = {Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr\u00f6\u00dferer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw\u00e4rtigkeit, die st\u00e4ndige Verf\u00fcgbarkeit, aber auch die M\u00f6glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr\u00fcnde f\u00fcr ihren gegenw\u00e4rtigen Erfolg. Der Artikel f\u00fchrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl\u00e4ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schlie\u00dft mit Querbez\u00fcgen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.},<br\/>  author = {Hotho, Andreas and Benz, Dominik and Eisterlehner, Folke and J\u00e4schke, Robert and Krause, Beate and Schmitz, Christoph and Stumme, Gerd},<br\/>  journal = {HMD -- Praxis der Wirtschaftsinformatik},<br\/>  keywords = {social-bookmarking},<br\/>  month = {02},<br\/>  pages = {47-58},<br\/>  title = {{Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f\u00fcr Wissenschaftler}},<br\/>  volume = {Heft 271},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5bd066ff04cf63bc44fc6c8e72d58560\"><p>%0 Journal Article<br\/>%1 HothoBenzEtAl10hmd<br\/>%A Hotho, Andreas<br\/>%A Benz, Dominik<br\/>%A Eisterlehner, Folke<br\/>%A J\u00e4schke, Robert<br\/>%A Krause, Beate<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%D 2010<br\/>%J HMD -- Praxis der Wirtschaftsinformatik<br\/>%P 47-58<br\/>%T {Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f\u00fcr Wissenschaftler}<br\/>%V Heft 271<br\/>%X Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr\u00f6\u00dferer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw\u00e4rtigkeit, die st\u00e4ndige Verf\u00fcgbarkeit, aber auch die M\u00f6glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr\u00fcnde f\u00fcr ihren gegenw\u00e4rtigen Erfolg. Der Artikel f\u00fchrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl\u00e4ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schlie\u00dft mit Querbez\u00fcgen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Benz, D., Eisterlehner, F., J{\u00e4}schke, R., Krause, B., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f{\u00fc}r Wissenschaftler}<\/span>.<\/span> HMD -- Praxis der Wirtschaftsinformatik. Heft 271, 47\u201358 (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-250d83c41fb10b89c73f54bd7040bd6e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-250d83c41fb10b89c73f54bd7040bd6e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/250d83c41fb10b89c73f54bd7040bd6e\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-250d83c41fb10b89c73f54bd7040bd6e\">Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr{\u00f6}\u00dferer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw{\u00e4}rtigkeit, die st{\u00e4}ndige Verf{\u00fc}gbarkeit, aber auch die M{\u00f6}glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr{\u00fc}nde f{\u00fc}r ihren gegenw{\u00e4}rtigen Erfolg. Der Artikel f{\u00fc}hrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl{\u00e4}ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schlie\u00dft mit Querbez{\u00fc}gen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-250d83c41fb10b89c73f54bd7040bd6e\"><p>@article{hotho2010publikationsmanagement,<br\/>  abstract = {Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr{\u00f6}\u00dferer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw{\u00e4}rtigkeit, die st{\u00e4}ndige Verf{\u00fc}gbarkeit, aber auch die M{\u00f6}glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr{\u00fc}nde f{\u00fc}r ihren gegenw{\u00e4}rtigen Erfolg. Der Artikel f{\u00fc}hrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl{\u00e4}ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schlie\u00dft mit Querbez{\u00fc}gen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.},<br\/>  author = {Hotho, Andreas and Benz, Dominik and Eisterlehner, Folke and J{\u00e4}schke, Robert and Krause, Beate and Schmitz, Christoph and Stumme, Gerd},<br\/>  journal = {HMD -- Praxis der Wirtschaftsinformatik},<br\/>  keywords = {itegpub},<br\/>  month = {02},<br\/>  pages = {47-58},<br\/>  title = {{Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f{\u00fc}r Wissenschaftler}},<br\/>  volume = {Heft 271},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-250d83c41fb10b89c73f54bd7040bd6e\"><p>%0 Journal Article<br\/>%1 hotho2010publikationsmanagement<br\/>%A Hotho, Andreas<br\/>%A Benz, Dominik<br\/>%A Eisterlehner, Folke<br\/>%A J{\u00e4}schke, Robert<br\/>%A Krause, Beate<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%D 2010<br\/>%J HMD -- Praxis der Wirtschaftsinformatik<br\/>%P 47-58<br\/>%T {Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f{\u00fc}r Wissenschaftler}<br\/>%V Heft 271<br\/>%X Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr{\u00f6}\u00dferer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw{\u00e4}rtigkeit, die st{\u00e4}ndige Verf{\u00fc}gbarkeit, aber auch die M{\u00f6}glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr{\u00fc}nde f{\u00fc}r ihren gegenw{\u00e4}rtigen Erfolg. Der Artikel f{\u00fc}hrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl{\u00e4}ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schlie\u00dft mit Querbez{\u00fc}gen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">K\u00f6rner, C., Benz, D., Strohmaier, M., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Stop Thinking, start Tagging - Tag Semantics emerge from Collaborative Verbosity<\/span>.<\/span> In: Proceedings of the 19th International World Wide Web Conference (WWW 2010). ACM, Raleigh, NC, USA (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/benz\/papers\/2010\/koerner2010thinking.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-45f8d8f2a8251a5e988c596a5ebb3f2d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-45f8d8f2a8251a5e988c596a5ebb3f2d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/45f8d8f2a8251a5e988c596a5ebb3f2d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-45f8d8f2a8251a5e988c596a5ebb3f2d\">Recent research provides evidence for the presence of emergent semantics in collaborative tagging systems. While several methods have been proposed, little is known about the factors that influence the evolution of semantic structures in these systems. A natural hypothesis is that the quality of the emergent semantics depends on the pragmatics of tagging: Users with certain usage patterns might contribute more to the resulting semantics than others. In this work, we propose several measures which enable a pragmatic differentiation of taggers by their degree of contribution to emerging semantic structures. We distinguish between categorizers, who typically use a small set of tags as a replacement for hierarchical classification schemes, and describers, who are annotating resources with a wealth of freely associated, descriptive keywords. To study our hypothesis, we apply semantic similarity measures to 64 different partitions of a real-world and large-scale folksonomy containing different ratios of categorizers and describers. Our results not only show that \u2018verbose\u2019 taggers are most useful for the emergence of tag semantics, but also that a subset containing only 40% of the most \u2018verbose\u2019 taggers can produce results that match and even outperform the semantic precision obtained from the whole dataset. Moreover, the results suggest that there exists a causal link between the pragmatics of tagging and resulting emergent semantics. This work is relevant for designers and analysts of tagging systems interested (i) in fostering the semantic development of their platforms, (ii) in identifying users introducing \u201csemantic noise\u201d, and (iii) in learning ontologies.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-45f8d8f2a8251a5e988c596a5ebb3f2d\"><p>@inproceedings{koerner2010thinking,<br\/>  abstract = {Recent research provides evidence for the presence of emergent semantics in collaborative tagging systems. While several methods have been proposed, little is known about the factors that influence the evolution of semantic structures in these systems. A natural hypothesis is that the quality of the emergent semantics depends on the pragmatics of tagging: Users with certain usage patterns might contribute more to the resulting semantics than others. In this work, we propose several measures which enable a pragmatic differentiation of taggers by their degree of contribution to emerging semantic structures. We distinguish between categorizers, who typically use a small set of tags as a replacement for hierarchical classification schemes, and describers, who are annotating resources with a wealth of freely associated, descriptive keywords. To study our hypothesis, we apply semantic similarity measures to 64 different partitions of a real-world and large-scale folksonomy containing different ratios of categorizers and describers. Our results not only show that \u2018verbose\u2019 taggers are most useful for the emergence of tag semantics, but also that a subset containing only 40% of the most \u2018verbose\u2019 taggers can produce results that match and even outperform the semantic precision obtained from the whole dataset. Moreover, the results suggest that there exists a causal link between the pragmatics of tagging and resulting emergent semantics. This work is relevant for designers and analysts of tagging systems interested (i) in fostering the semantic development of their platforms, (ii) in identifying users introducing \u201csemantic noise\u201d, and (iii) in learning ontologies.},<br\/>  address = {Raleigh, NC, USA},<br\/>  author = {K\u00f6rner, Christian and Benz, Dominik and Strohmaier, Markus and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 19th International World Wide Web Conference (WWW 2010)},<br\/>  keywords = {collaborative_verbosity},<br\/>  month = {04},<br\/>  publisher = {ACM},<br\/>  title = {Stop Thinking, start Tagging - Tag Semantics emerge from Collaborative Verbosity},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-45f8d8f2a8251a5e988c596a5ebb3f2d\"><p>%0 Conference Paper<br\/>%1 koerner2010thinking<br\/>%A K\u00f6rner, Christian<br\/>%A Benz, Dominik<br\/>%A Strohmaier, Markus<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 19th International World Wide Web Conference (WWW 2010)<br\/>%C Raleigh, NC, USA<br\/>%D 2010<br\/>%I ACM<br\/>%T Stop Thinking, start Tagging - Tag Semantics emerge from Collaborative Verbosity<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/benz\/papers\/2010\/koerner2010thinking.pdf<br\/>%X Recent research provides evidence for the presence of emergent semantics in collaborative tagging systems. While several methods have been proposed, little is known about the factors that influence the evolution of semantic structures in these systems. A natural hypothesis is that the quality of the emergent semantics depends on the pragmatics of tagging: Users with certain usage patterns might contribute more to the resulting semantics than others. In this work, we propose several measures which enable a pragmatic differentiation of taggers by their degree of contribution to emerging semantic structures. We distinguish between categorizers, who typically use a small set of tags as a replacement for hierarchical classification schemes, and describers, who are annotating resources with a wealth of freely associated, descriptive keywords. To study our hypothesis, we apply semantic similarity measures to 64 different partitions of a real-world and large-scale folksonomy containing different ratios of categorizers and describers. Our results not only show that \u2018verbose\u2019 taggers are most useful for the emergence of tag semantics, but also that a subset containing only 40% of the most \u2018verbose\u2019 taggers can produce results that match and even outperform the semantic precision obtained from the whole dataset. Moreover, the results suggest that there exists a causal link between the pragmatics of tagging and resulting emergent semantics. This work is relevant for designers and analysts of tagging systems interested (i) in fostering the semantic development of their platforms, (ii) in identifying users introducing \u201csemantic noise\u201d, and (iii) in learning ontologies.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Hotho, A., J\u00e4schke, R., Krause, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Query Logs as Folksonomies<\/span>.<\/span> Datenbank-Spektrum. 10, 15\u201324 (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/s13222-010-0004-8\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bf96c01262d15fb6eaaf558ecb9a9e69\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bf96c01262d15fb6eaaf558ecb9a9e69\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bf96c01262d15fb6eaaf558ecb9a9e69\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-bf96c01262d15fb6eaaf558ecb9a9e69\">Query logs provide a valuable resource for preference information in search. A user clicking on a specific resource after submitting a query indicates that the resource has some relevance with respect to the query. To leverage the information ofquery logs, one can relate submitted queries from specific users to their clicked resources and build a tripartite graph ofusers, resources and queries. This graph resembles the folksonomy structure of social bookmarking systems, where users addtags to resources. In this article, we summarize our work on building folksonomies from query log files. The focus is on threecomparative studies of the system\u2019s content, structure and semantics. Our results show that query logs incorporate typicalfolksonomy properties and that approaches to leverage the inherent semantics of folksonomies can be applied to query logsas well.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bf96c01262d15fb6eaaf558ecb9a9e69\"><p>@article{benz2010query,<br\/>  abstract = {Query logs provide a valuable resource for preference information in search. A user clicking on a specific resource after submitting a query indicates that the resource has some relevance with respect to the query. To leverage the information ofquery logs, one can relate submitted queries from specific users to their clicked resources and build a tripartite graph ofusers, resources and queries. This graph resembles the folksonomy structure of social bookmarking systems, where users addtags to resources. In this article, we summarize our work on building folksonomies from query log files. The focus is on threecomparative studies of the system\u2019s content, structure and semantics. Our results show that query logs incorporate typicalfolksonomy properties and that approaches to leverage the inherent semantics of folksonomies can be applied to query logsas well.},<br\/>  author = {Benz, Dominik and Hotho, Andreas and J\u00e4schke, Robert and Krause, Beate and Stumme, Gerd},<br\/>  journal = {Datenbank-Spektrum},<br\/>  keywords = {folsonomy},<br\/>  month = {06},<br\/>  number = 1,<br\/>  pages = {15--24},<br\/>  title = {Query Logs as Folksonomies},<br\/>  volume = 10,<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bf96c01262d15fb6eaaf558ecb9a9e69\"><p>%0 Journal Article<br\/>%1 benz2010query<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Krause, Beate<br\/>%A Stumme, Gerd<br\/>%D 2010<br\/>%J Datenbank-Spektrum<br\/>%N 1<br\/>%P 15--24<br\/>%T Query Logs as Folksonomies<br\/>%U http:\/\/dx.doi.org\/10.1007\/s13222-010-0004-8<br\/>%V 10<br\/>%X Query logs provide a valuable resource for preference information in search. A user clicking on a specific resource after submitting a query indicates that the resource has some relevance with respect to the query. To leverage the information ofquery logs, one can relate submitted queries from specific users to their clicked resources and build a tripartite graph ofusers, resources and queries. This graph resembles the folksonomy structure of social bookmarking systems, where users addtags to resources. In this article, we summarize our work on building folksonomies from query log files. The focus is on threecomparative studies of the system\u2019s content, structure and semantics. Our results show that query logs incorporate typicalfolksonomy properties and that approaches to leverage the inherent semantics of folksonomies can be applied to query logsas well.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Scaffolding of a Formal Context<\/span>.<\/span> In: Kryszkiewicz, M. and Obiedkov, S. (eds.) Concept Lattices and Their Applications 2010 - Proceedings of the 7th International Conference on Concept Lattices and Their Applications Sevilla, Spain, October 19-21, 2010. pp. 283\u2013293. CEUR-WS (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-672\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-edd4fd5ae8f94efe992b30fb8e32d2bd\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-edd4fd5ae8f94efe992b30fb8e32d2bd\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/edd4fd5ae8f94efe992b30fb8e32d2bd\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-edd4fd5ae8f94efe992b30fb8e32d2bd\">The scaffolding of a complete lattice L of finite length was introduced by Rudolf Wille in 1976 as a relative subsemilattice of L that can be constructed using subdirect decomposition. The lattice is uniquely defined by its scaffolding and can be reconstructed from it. Using bonds, we demonstrate how the scaffolding can be constructed from a given formal context and thereby extend the notion of the scaffolding to doubly founded lattices. Further, we explain the creation of a suitable graphical representation of the scaffolding from the context.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-edd4fd5ae8f94efe992b30fb8e32d2bd\"><p>@inproceedings{doerfel2010scaffolding,<br\/>  abstract = {The scaffolding of a complete lattice L of finite length was introduced by Rudolf Wille in 1976 as a relative subsemilattice of L that can be constructed using subdirect decomposition. The lattice is uniquely defined by its scaffolding and can be reconstructed from it. Using bonds, we demonstrate how the scaffolding can be constructed from a given formal context and thereby extend the notion of the scaffolding to doubly founded lattices. Further, we explain the creation of a suitable graphical representation of the scaffolding from the context.},<br\/>  author = {Doerfel, Stephan},<br\/>  booktitle = {Concept Lattices and Their Applications 2010 - Proceedings of the 7th International Conference on Concept Lattices and Their Applications Sevilla, Spain, October 19-21, 2010.},<br\/>  editor = {Kryszkiewicz, Marzena and Obiedkov, Sergei},<br\/>  keywords = {itegpub},<br\/>  month = 11,<br\/>  pages = {283-293},<br\/>  publisher = {CEUR-WS},<br\/>  title = {The Scaffolding of a Formal Context},<br\/>  volume = 672,<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-edd4fd5ae8f94efe992b30fb8e32d2bd\"><p>%0 Conference Paper<br\/>%1 doerfel2010scaffolding<br\/>%A Doerfel, Stephan<br\/>%B Concept Lattices and Their Applications 2010 - Proceedings of the 7th International Conference on Concept Lattices and Their Applications Sevilla, Spain, October 19-21, 2010.<br\/>%D 2010<br\/>%E Kryszkiewicz, Marzena<br\/>%E Obiedkov, Sergei<br\/>%I CEUR-WS<br\/>%P 283-293<br\/>%T The Scaffolding of a Formal Context<br\/>%U http:\/\/ceur-ws.org\/Vol-672\/<br\/>%V 672<br\/>%X The scaffolding of a complete lattice L of finite length was introduced by Rudolf Wille in 1976 as a relative subsemilattice of L that can be constructed using subdirect decomposition. The lattice is uniquely defined by its scaffolding and can be reconstructed from it. Using bonds, we demonstrate how the scaffolding can be constructed from a given formal context and thereby extend the notion of the scaffolding to doubly founded lattices. Further, we explain the creation of a suitable graphical representation of the scaffolding from the context.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Hotho, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Proceedings of the 2010 Workshop on Mining Ubiquitous and Social Environments (MUSE 2010)}<\/span>.<\/span> ECML\/PKDD 2010, Barcelona, Spain (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-684691da3230424a4b6aef804cd27579\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-684691da3230424a4b6aef804cd27579\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/684691da3230424a4b6aef804cd27579\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-684691da3230424a4b6aef804cd27579\"><p>@book{AH:10,<br\/>  address = {Barcelona, Spain},<br\/>  editor = {Atzmueller, Martin and Hotho, Andreas},<br\/>  keywords = 2010,<br\/>  publisher = {ECML\/PKDD 2010},<br\/>  title = {{Proceedings of the 2010 Workshop on Mining Ubiquitous and Social Environments (MUSE 2010)}},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-684691da3230424a4b6aef804cd27579\"><p>%0 Book<br\/>%1 AH:10<br\/>%C Barcelona, Spain<br\/>%D 2010<br\/>%E Atzmueller, Martin<br\/>%E Hotho, Andreas<br\/>%I ECML\/PKDD 2010<br\/>%T {Proceedings of the 2010 Workshop on Mining Ubiquitous and Social Environments (MUSE 2010)}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Hotho, A., J\u00e4schke, R., Stumme, G., Halle, A., Lima, A.G.S., Steenweg, H., Stefani, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Academic Publication Management with PUMA - collect, organize and share publications<\/span>.<\/span> In: Lalmas, M., Jose, J., Rauber, A., Sebastiani, F., and Frommholz, I. (eds.) Proceedings of the European Conference on Research and Advanced Technology for Digital Libraries (ECDL) 2010. pp. 417\u2013420. Springer, Berlin\/Heidelberg (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-11bdf4636bc92aed96461eace25484f7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-11bdf4636bc92aed96461eace25484f7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/11bdf4636bc92aed96461eace25484f7\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-11bdf4636bc92aed96461eace25484f7\">The PUMA project fosters the Open Access movement und aims at a better support of the researcher\u2019s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-11bdf4636bc92aed96461eace25484f7\"><p>@inproceedings{benz2010academic,<br\/>  abstract = {The PUMA project fosters the Open Access movement und aims at a better support of the researcher\u2019s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.},<br\/>  address = {Berlin\/Heidelberg},<br\/>  author = {Benz, Dominik and Hotho, Andreas and J\u00e4schke, Robert and Stumme, Gerd and Halle, Axel and Lima, Angela Gerlach Sanches and Steenweg, Helge and Stefani, Sven},<br\/>  booktitle = {Proceedings of the European Conference on Research and Advanced Technology for Digital Libraries (ECDL) 2010},<br\/>  editor = {Lalmas, M. and Jose, J. and Rauber, A. and Sebastiani, F. and Frommholz, I.},<br\/>  keywords = {itegpub},<br\/>  pages = {417--420},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Academic Publication Management with PUMA - collect, organize and share publications},<br\/>  volume = 6273,<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-11bdf4636bc92aed96461eace25484f7\"><p>%0 Conference Paper<br\/>%1 benz2010academic<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%A Halle, Axel<br\/>%A Lima, Angela Gerlach Sanches<br\/>%A Steenweg, Helge<br\/>%A Stefani, Sven<br\/>%B Proceedings of the European Conference on Research and Advanced Technology for Digital Libraries (ECDL) 2010<br\/>%C Berlin\/Heidelberg<br\/>%D 2010<br\/>%E Lalmas, M.<br\/>%E Jose, J.<br\/>%E Rauber, A.<br\/>%E Sebastiani, F.<br\/>%E Frommholz, I.<br\/>%I Springer<br\/>%P 417--420<br\/>%T Academic Publication Management with PUMA - collect, organize and share publications<br\/>%V 6273<br\/>%X The PUMA project fosters the Open Access movement und aims at a better support of the researcher\u2019s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Hotho, A., St\u00fctzer, S., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge<\/span>.<\/span> In: Proceedings of the 2nd Web Science Conference (WebSci10). , Raleigh, NC, USA (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2010semantics.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-16c77e486fb8bc527eb7734b153932ab\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-16c77e486fb8bc527eb7734b153932ab\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/16c77e486fb8bc527eb7734b153932ab\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-16c77e486fb8bc527eb7734b153932ab\"><p>@inproceedings{benz2010semantics,<br\/>  address = {Raleigh, NC, USA},<br\/>  author = {Benz, Dominik and Hotho, Andreas and St\u00fctzer, Stefan and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 2nd Web Science Conference (WebSci10)},<br\/>  keywords = {itegpub},<br\/>  title = {Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-16c77e486fb8bc527eb7734b153932ab\"><p>%0 Conference Paper<br\/>%1 benz2010semantics<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A St\u00fctzer, Stefan<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 2nd Web Science Conference (WebSci10)<br\/>%C Raleigh, NC, USA<br\/>%D 2010<br\/>%T Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2010semantics.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kluegl, P., Hotho, A., Puppe, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Local Adaptive Extraction of References<\/span>.<\/span> In: Dillmann, R., Beyerer, J., Hanebeck, U.D., and Schultz, T. (eds.) KI 2010: Advances in Artificial Intelligence, 33rd Annual German Conference on AI. pp. 40\u201347. Springer (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ki.informatik.uni-wuerzburg.de\/papers\/pkluegl\/2010-KI-LAER.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-174791d9668705cbf0052224694f5366\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-174791d9668705cbf0052224694f5366\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/174791d9668705cbf0052224694f5366\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-174791d9668705cbf0052224694f5366\">The accurate extraction of scholarly reference information from scientific publications is essential for many useful applications like BibTeX management systems or citation analysis. Automatic extraction methods suffer from the heterogeneity of reference notation, no matter wether the extraction model was handcrafted or learnt from labeled data. However, references of the same paper or journal are usually homogeneous. We exploit this local consistency with a novel approach. Given some initial information from such a reference section, we try to derived generalized patterns. These patterns are used to create a local model of the current document. The local model helps to identify errors and to improve the extracted information incrementally during the extraction process. Our approach is implemented with handcrafted transformation rules working on a meta-level being able to correct the information independent of the applied layout style. The experimental results compete very well with the state of the art methods and show an extremely high performance on consistent reference sections.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-174791d9668705cbf0052224694f5366\"><p>@inproceedings{2010-KI-KHP,<br\/>  abstract = {The accurate extraction of scholarly reference information from scientific publications is essential for many useful applications like BibTeX management systems or citation analysis. Automatic extraction methods suffer from the heterogeneity of reference notation, no matter wether the extraction model was handcrafted or learnt from labeled data. However, references of the same paper or journal are usually homogeneous. We exploit this local consistency with a novel approach. Given some initial information from such a reference section, we try to derived generalized patterns. These patterns are used to create a local model of the current document. The local model helps to identify errors and to improve the extracted information incrementally during the extraction process. Our approach is implemented with handcrafted transformation rules working on a meta-level being able to correct the information independent of the applied layout style. The experimental results compete very well with the state of the art methods and show an extremely high performance on consistent reference sections.},<br\/>  author = {Kluegl, Peter and Hotho, Andreas and Puppe, Frank},<br\/>  booktitle = {KI 2010: Advances in Artificial Intelligence, 33rd Annual German Conference on AI},<br\/>  editor = {Dillmann, R\u00fcdiger and Beyerer, J\u00fcrgen and Hanebeck, Uwe D. and Schultz, Tanja},<br\/>  keywords = {ie},<br\/>  pages = {40-47},<br\/>  publisher = {Springer},<br\/>  series = {LNAI 6359},<br\/>  title = {Local Adaptive Extraction of References},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-174791d9668705cbf0052224694f5366\"><p>%0 Conference Paper<br\/>%1 2010-KI-KHP<br\/>%A Kluegl, Peter<br\/>%A Hotho, Andreas<br\/>%A Puppe, Frank<br\/>%B KI 2010: Advances in Artificial Intelligence, 33rd Annual German Conference on AI<br\/>%D 2010<br\/>%E Dillmann, R\u00fcdiger<br\/>%E Beyerer, J\u00fcrgen<br\/>%E Hanebeck, Uwe D.<br\/>%E Schultz, Tanja<br\/>%I Springer<br\/>%P 40-47<br\/>%T Local Adaptive Extraction of References<br\/>%U http:\/\/ki.informatik.uni-wuerzburg.de\/papers\/pkluegl\/2010-KI-LAER.pdf<br\/>%X The accurate extraction of scholarly reference information from scientific publications is essential for many useful applications like BibTeX management systems or citation analysis. Automatic extraction methods suffer from the heterogeneity of reference notation, no matter wether the extraction model was handcrafted or learnt from labeled data. However, references of the same paper or journal are usually homogeneous. We exploit this local consistency with a novel approach. Given some initial information from such a reference section, we try to derived generalized patterns. These patterns are used to create a local model of the current document. The local model helps to identify errors and to improve the extracted information incrementally during the extraction process. Our approach is implemented with handcrafted transformation rules working on a meta-level being able to correct the information independent of the applied layout style. The experimental results compete very well with the state of the art methods and show an extremely high performance on consistent reference sections.<br\/>%@ 978-3-642-16110-0<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mitzlaff, F., Atzm\u00fcller, M., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Community Assessment using Evidence Networks<\/span>.<\/span> In: Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010). , Barcelona, Spain (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/muse2010\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-34d79867b23f41ca2e9f481ee894630f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-34d79867b23f41ca2e9f481ee894630f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/34d79867b23f41ca2e9f481ee894630f\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-34d79867b23f41ca2e9f481ee894630f\">Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-34d79867b23f41ca2e9f481ee894630f\"><p>@inproceedings{mitzlaff2010community,<br\/>  abstract = {Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.},<br\/>  address = {Barcelona, Spain},<br\/>  author = {Mitzlaff, Folke and Atzm\u00fcller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010)},<br\/>  keywords = {itegpub},<br\/>  title = {Community Assessment using Evidence Networks},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-34d79867b23f41ca2e9f481ee894630f\"><p>%0 Conference Paper<br\/>%1 mitzlaff2010community<br\/>%A Mitzlaff, Folke<br\/>%A Atzm\u00fcller, Martin<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010)<br\/>%C Barcelona, Spain<br\/>%D 2010<br\/>%T Community Assessment using Evidence Networks<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/muse2010<br\/>%X Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0<\/span>.<\/span> Web Semantics: Science, Services and Agents on the World Wide Web. 8, 95\u201396 (2010). https:\/\/doi.org\/DOI: 10.1016\/j.websem.2010.04.008.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.sciencedirect.com\/science\/article\/B758F-4YXK4HW-1\/2\/4cb514565477c54160b5e6eb716c32d7\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f8d7bc2af5753906dc3897196daac18c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f8d7bc2af5753906dc3897196daac18c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/DOI: 10.1016\/j.websem.2010.04.008\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f8d7bc2af5753906dc3897196daac18c\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f8d7bc2af5753906dc3897196daac18c\"><p>@article{berendt2010bridging,<br\/>  author = {Berendt, Bettina and Hotho, Andreas and Stumme, Gerd},<br\/>  journal = {Web Semantics: Science, Services and Agents on the World Wide Web},<br\/>  keywords = {itegpub},<br\/>  note = {Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0; The Future of Knowledge Dissemination: The Elsevier Grand Challenge for the Life Sciences},<br\/>  number = {2-3},<br\/>  pages = {95 - 96},<br\/>  title = {Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0},<br\/>  volume = 8,<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f8d7bc2af5753906dc3897196daac18c\"><p>%0 Journal Article<br\/>%1 berendt2010bridging<br\/>%A Berendt, Bettina<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%D 2010<br\/>%J Web Semantics: Science, Services and Agents on the World Wide Web<br\/>%N 2-3<br\/>%P 95 - 96<br\/>%R DOI: 10.1016\/j.websem.2010.04.008<br\/>%T Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0<br\/>%U http:\/\/www.sciencedirect.com\/science\/article\/B758F-4YXK4HW-1\/2\/4cb514565477c54160b5e6eb716c32d7<br\/>%V 8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Lemmerich, F., Rohlfs, M., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Fast Discovery of Relevant Subgroup Patterns<\/span>.<\/span> In: Proc. 23rd FLAIRS Conference (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ba24dc0e2b9d59e05b34fb57176a6f41\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ba24dc0e2b9d59e05b34fb57176a6f41\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ba24dc0e2b9d59e05b34fb57176a6f41\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ba24dc0e2b9d59e05b34fb57176a6f41\"><p>@inproceedings{LA:10,<br\/>  author = {Lemmerich, Florian and Rohlfs, Matthias and Atzmueller, Martin},<br\/>  booktitle = {Proc. 23rd FLAIRS Conference},<br\/>  keywords = {local},<br\/>  title = {Fast Discovery of Relevant Subgroup Patterns},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ba24dc0e2b9d59e05b34fb57176a6f41\"><p>%0 Conference Paper<br\/>%1 LA:10<br\/>%A Lemmerich, Florian<br\/>%A Rohlfs, Matthias<br\/>%A Atzmueller, Martin<br\/>%B Proc. 23rd FLAIRS Conference<br\/>%D 2010<br\/>%T Fast Discovery of Relevant Subgroup Patterns<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., {Ulslev Pedersen}, R., Wurst, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ubiquitous Data<\/span>.<\/span> Lecture Notes in Computer Science. 61\u201374 (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/rd.springer.com\/content\/pdf\/10.1007%2F978-3-642-16392-0_4.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-56f2940d5d0f2ce59c342d3b8ad42ca1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-56f2940d5d0f2ce59c342d3b8ad42ca1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/56f2940d5d0f2ce59c342d3b8ad42ca1\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-56f2940d5d0f2ce59c342d3b8ad42ca1\"><p>@article{hotho2010ubiquitous,<br\/>  author = {Hotho, Andreas and {Ulslev Pedersen}, Rasmus and Wurst, Michael},<br\/>  journal = {Lecture Notes in Computer Science},<br\/>  keywords = 2010,<br\/>  number = 6202,<br\/>  pages = {61--74},<br\/>  publisher = {Springer},<br\/>  title = {Ubiquitous Data},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-56f2940d5d0f2ce59c342d3b8ad42ca1\"><p>%0 Journal Article<br\/>%1 hotho2010ubiquitous<br\/>%A Hotho, Andreas<br\/>%A {Ulslev Pedersen}, Rasmus<br\/>%A Wurst, Michael<br\/>%D 2010<br\/>%I Springer<br\/>%J Lecture Notes in Computer Science<br\/>%N 6202<br\/>%P 61--74<br\/>%T Ubiquitous Data<br\/>%U http:\/\/rd.springer.com\/content\/pdf\/10.1007%2F978-3-642-16392-0_4.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Mitzlaff, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Towards Mining Descriptive Community Patterns}<\/span>.<\/span> In: Workshop on Mining Patterns and Subgroups. Lorentz Center, Leiden, The Netherlands. Awarded with the Best Discovery Award (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2f61938116e8b239fbff58520ecc284c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2f61938116e8b239fbff58520ecc284c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2f61938116e8b239fbff58520ecc284c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2f61938116e8b239fbff58520ecc284c\"><p>@inproceedings{atzmueller2010towards,<br\/>  author = {Atzmueller, Martin and Mitzlaff, Folke},<br\/>  booktitle = {Workshop on Mining Patterns and Subgroups},<br\/>  keywords = {itegpub},<br\/>  publisher = {Lorentz Center, Leiden, The Netherlands. Awarded with the Best Discovery Award},<br\/>  title = {{Towards Mining Descriptive Community Patterns}},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2f61938116e8b239fbff58520ecc284c\"><p>%0 Conference Paper<br\/>%1 atzmueller2010towards<br\/>%A Atzmueller, Martin<br\/>%A Mitzlaff, Folke<br\/>%B Workshop on Mining Patterns and Subgroups<br\/>%D 2010<br\/>%I Lorentz Center, Leiden, The Netherlands. Awarded with the Best Discovery Award<br\/>%T {Towards Mining Descriptive Community Patterns}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Beer, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Validation of Mixed-Structured Data Using Pattern Mining and Information Extraction<\/span>.<\/span> In: Proc. 55th IWK, International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS). University of Ilmenau (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a735dbe20e7e04c577c3eb4e67ebede2\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a735dbe20e7e04c577c3eb4e67ebede2\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a735dbe20e7e04c577c3eb4e67ebede2\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a735dbe20e7e04c577c3eb4e67ebede2\"><p>@inproceedings{AB:10,<br\/>  author = {Atzmueller, Martin and Beer, Stephanie},<br\/>  booktitle = {Proc. 55th IWK, International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS)},<br\/>  keywords = {itegpub},<br\/>  publisher = {University of Ilmenau},<br\/>  title = {Validation of Mixed-Structured Data Using Pattern Mining and Information Extraction},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a735dbe20e7e04c577c3eb4e67ebede2\"><p>%0 Conference Paper<br\/>%1 AB:10<br\/>%A Atzmueller, Martin<br\/>%A Beer, Stephanie<br\/>%B Proc. 55th IWK, International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS)<br\/>%D 2010<br\/>%I University of Ilmenau<br\/>%T Validation of Mixed-Structured Data Using Pattern Mining and Information Extraction<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Kaempgen, B., Lemmerich, F., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Decision-Maker-Aware Design of Descriptive Data Mining<\/span>.<\/span> In: Proc. 55th IWK, International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS) (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f5965d05c7d74d2db0ee3da004d9f2ea\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f5965d05c7d74d2db0ee3da004d9f2ea\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f5965d05c7d74d2db0ee3da004d9f2ea\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f5965d05c7d74d2db0ee3da004d9f2ea\"><p>@inproceedings{KLA:10,<br\/>  author = {Kaempgen, Benedikt and Lemmerich, Florian and Atzmueller, Martin},<br\/>  booktitle = {Proc. 55th IWK, International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS)},<br\/>  keywords = {itegpub},<br\/>  title = {Decision-Maker-Aware Design of Descriptive Data Mining},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f5965d05c7d74d2db0ee3da004d9f2ea\"><p>%0 Conference Paper<br\/>%1 KLA:10<br\/>%A Kaempgen, Benedikt<br\/>%A Lemmerich, Florian<br\/>%A Atzmueller, Martin<br\/>%B Proc. 55th IWK, International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS)<br\/>%D 2010<br\/>%T Decision-Maker-Aware Design of Descriptive Data Mining<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Weiss, C., Atzmueller, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">EWMA Control Charts for Monitoring Binary Processes with Applications to Medical Diagnosis Data<\/span>.<\/span> Quality and Reliability Engineering. (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4edcf7521be16ba8fb819d2e13f8e4d6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4edcf7521be16ba8fb819d2e13f8e4d6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4edcf7521be16ba8fb819d2e13f8e4d6\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4edcf7521be16ba8fb819d2e13f8e4d6\"><p>@article{WA:10,<br\/>  author = {Weiss, Christian and Atzmueller, Martin},<br\/>  journal = {Quality and Reliability Engineering},<br\/>  keywords = {itegpub},<br\/>  title = {EWMA Control Charts for Monitoring Binary Processes with Applications to Medical Diagnosis Data},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4edcf7521be16ba8fb819d2e13f8e4d6\"><p>%0 Journal Article<br\/>%1 WA:10<br\/>%A Weiss, Christian<br\/>%A Atzmueller, Martin<br\/>%D 2010<br\/>%J Quality and Reliability Engineering<br\/>%T EWMA Control Charts for Monitoring Binary Processes with Applications to Medical Diagnosis Data<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Toepfer, M., Kluegl, P., Hotho, A., Puppe., F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conditional Random Fields For Local Adaptive Reference Extraction<\/span>.<\/span> In: Atzm\u00fcller, M., Benz, D., Hotho, A., and Stumme, G. (eds.) Proceedings of LWA2010 - Workshop-Woche: Lernen, Wissen {\\&amp;} Adaptivitaet. , Kassel, Germany (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/conf\/lwa10\/papers\/kdml21.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-37242cd584805b2e4cea0c486008889d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-37242cd584805b2e4cea0c486008889d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/37242cd584805b2e4cea0c486008889d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-37242cd584805b2e4cea0c486008889d\">The accurate extraction of bibliographic information from scientific publications is an active field of research. Machine learning and sequence labeling approaches like Conditional Random Fields (CRF) are often applied for this reference extraction task, but still suffer from the ambiguity of reference notation. Reference sections apply a predefined style guide and contain only homogeneous references. Therefore, other references of the same paper or journal often provide evidence how the fields of a reference are correctly labeled. We propose a novel approach that exploits the similarities within a document. Our process model uses information of unlabeled documents directly during the extraction task in order to automatically adapt to the perceived style guide. This is implemented by changing the manifestation of the features for the applied CRF. The experimental results show considerable improvements compared to the common approach. We achieve an average F1 score of 96.7% and an instance accuracy of 85.4% on the test data set.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-37242cd584805b2e4cea0c486008889d\"><p>@inproceedings{kdml21,<br\/>  abstract = {The accurate extraction of bibliographic information from scientific publications is an active field of research. Machine learning and sequence labeling approaches like Conditional Random Fields (CRF) are often applied for this reference extraction task, but still suffer from the ambiguity of reference notation. Reference sections apply a predefined style guide and contain only homogeneous references. Therefore, other references of the same paper or journal often provide evidence how the fields of a reference are correctly labeled. We propose a novel approach that exploits the similarities within a document. Our process model uses information of unlabeled documents directly during the extraction task in order to automatically adapt to the perceived style guide. This is implemented by changing the manifestation of the features for the applied CRF. The experimental results show considerable improvements compared to the common approach. We achieve an average F1 score of 96.7% and an instance accuracy of 85.4% on the test data set.},<br\/>  address = {Kassel, Germany},<br\/>  author = {Toepfer, Martin and Kluegl, Peter and Hotho, Andreas and Puppe., Frank},<br\/>  booktitle = {Proceedings of LWA2010 - Workshop-Woche: Lernen, Wissen {\\&} Adaptivitaet},<br\/>  crossref = {lwa2010},<br\/>  editor = {Atzm\u00fcller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  keywords = {extraction},<br\/>  title = {Conditional Random Fields For Local Adaptive Reference Extraction},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-37242cd584805b2e4cea0c486008889d\"><p>%0 Conference Paper<br\/>%1 kdml21<br\/>%A Toepfer, Martin<br\/>%A Kluegl, Peter<br\/>%A Hotho, Andreas<br\/>%A Puppe., Frank<br\/>%B Proceedings of LWA2010 - Workshop-Woche: Lernen, Wissen {\\&} Adaptivitaet<br\/>%C Kassel, Germany<br\/>%D 2010<br\/>%E Atzm\u00fcller, Martin<br\/>%E Benz, Dominik<br\/>%E Hotho, Andreas<br\/>%E Stumme, Gerd<br\/>%T Conditional Random Fields For Local Adaptive Reference Extraction<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/conf\/lwa10\/papers\/kdml21.pdf<br\/>%X The accurate extraction of bibliographic information from scientific publications is an active field of research. Machine learning and sequence labeling approaches like Conditional Random Fields (CRF) are often applied for this reference extraction task, but still suffer from the ambiguity of reference notation. Reference sections apply a predefined style guide and contain only homogeneous references. Therefore, other references of the same paper or journal often provide evidence how the fields of a reference are correctly labeled. We propose a novel approach that exploits the similarities within a document. Our process model uses information of unlabeled documents directly during the extraction task in order to automatically adapt to the perceived style guide. This is implemented by changing the manifestation of the features for the applied CRF. The experimental results show considerable improvements compared to the common approach. We achieve an average F1 score of 96.7% and an instance accuracy of 85.4% on the test data set.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Roth-Berghofer, T.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ready for the MACE? The Mining and Analysis Continuum of Explaining Uncovered<\/span>.<\/span> Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8d48df8503de54b5ce138a85a1db60bd\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8d48df8503de54b5ce138a85a1db60bd\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8d48df8503de54b5ce138a85a1db60bd\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8d48df8503de54b5ce138a85a1db60bd\"><p>@techreport{AR:10c,<br\/>  author = {Atzmueller, Martin and Roth-Berghofer, Thomas},<br\/>  institution = {Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz},<br\/>  keywords = {itegpub},<br\/>  number = {RR-10-02},<br\/>  title = {Ready for the MACE? The Mining and Analysis Continuum of Explaining Uncovered},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8d48df8503de54b5ce138a85a1db60bd\"><p>%0 Report<br\/>%1 AR:10c<br\/>%A Atzmueller, Martin<br\/>%A Roth-Berghofer, Thomas<br\/>%D 2010<br\/>%N RR-10-02<br\/>%T Ready for the MACE? The Mining and Analysis Continuum of Explaining Uncovered<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Data Mining on Folksonomies<\/span>.<\/span> In: Armano, G., de Gemmis, M., Semeraro, G., and Vargiu, E. (eds.) Intelligent Information Access. pp. 57\u201382. Springer, Berlin \/ Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14000-6_4.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/978-3-642-14000-6_4\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1a7906f61b76a87f618e0db657f5c6d9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1a7906f61b76a87f618e0db657f5c6d9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-642-14000-6_4\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1a7906f61b76a87f618e0db657f5c6d9\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-1a7906f61b76a87f618e0db657f5c6d9\">Social resource sharing systems are central elements of the Web 2.0 and use all the same kind of lightweight knowledge representation, called folksonomy. As these systems are easy to use, they attract huge masses of users. Data Mining provides methods to analyze data and to learn models which can be used to support users. The application and adaptation of known data mining algorithms to folksonomies with the goal to support the users of such systems and to extract valuable information with a special focus on the Semantic Web is the main target of this paper. In this work we give a short introduction into folksonomies with a focus on our own system BibSonomy. Based on the analysis we made on a large folksonomy dataset, we present the application of data mining algorithms on three different tasks, namely spam detection, ranking and recommendation. To bridge the gap between folksonomies and the Semantic Web, we apply association rule mining to extract relations and present a deeper analysis of statistical measures which can be used to extract tag relations. This approach is complemented by presenting two approaches to extract conceptualizations from folksonomies.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1a7906f61b76a87f618e0db657f5c6d9\"><p>@incollection{springerlink:10.1007\/978-3-642-14000-6_4,<br\/>  abstract = {Social resource sharing systems are central elements of the Web 2.0 and use all the same kind of lightweight knowledge representation, called folksonomy. As these systems are easy to use, they attract huge masses of users. Data Mining provides methods to analyze data and to learn models which can be used to support users. The application and adaptation of known data mining algorithms to folksonomies with the goal to support the users of such systems and to extract valuable information with a special focus on the Semantic Web is the main target of this paper. In this work we give a short introduction into folksonomies with a focus on our own system BibSonomy. Based on the analysis we made on a large folksonomy dataset, we present the application of data mining algorithms on three different tasks, namely spam detection, ranking and recommendation. To bridge the gap between folksonomies and the Semantic Web, we apply association rule mining to extract relations and present a deeper analysis of statistical measures which can be used to extract tag relations. This approach is complemented by presenting two approaches to extract conceptualizations from folksonomies.},<br\/>  address = {Berlin \/ Heidelberg},<br\/>  author = {Hotho, Andreas},<br\/>  booktitle = {Intelligent Information Access},<br\/>  editor = {Armano, Giuliano and de Gemmis, Marco and Semeraro, Giovanni and Vargiu, Eloisa},<br\/>  keywords = 2010,<br\/>  pages = {57-82},<br\/>  publisher = {Springer},<br\/>  series = {Studies in Computational Intelligence},<br\/>  title = {Data Mining on Folksonomies},<br\/>  volume = 301,<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1a7906f61b76a87f618e0db657f5c6d9\"><p>%0 Book Section<br\/>%1 springerlink:10.1007\/978-3-642-14000-6_4<br\/>%A Hotho, Andreas<br\/>%B Intelligent Information Access<br\/>%C Berlin \/ Heidelberg<br\/>%D 2010<br\/>%E Armano, Giuliano<br\/>%E de Gemmis, Marco<br\/>%E Semeraro, Giovanni<br\/>%E Vargiu, Eloisa<br\/>%I Springer<br\/>%P 57-82<br\/>%R 10.1007\/978-3-642-14000-6_4<br\/>%T Data Mining on Folksonomies<br\/>%U http:\/\/dx.doi.org\/10.1007\/978-3-642-14000-6_4<br\/>%V 301<br\/>%X Social resource sharing systems are central elements of the Web 2.0 and use all the same kind of lightweight knowledge representation, called folksonomy. As these systems are easy to use, they attract huge masses of users. Data Mining provides methods to analyze data and to learn models which can be used to support users. The application and adaptation of known data mining algorithms to folksonomies with the goal to support the users of such systems and to extract valuable information with a special focus on the Semantic Web is the main target of this paper. In this work we give a short introduction into folksonomies with a focus on our own system BibSonomy. Based on the analysis we made on a large folksonomy dataset, we present the application of data mining algorithms on three different tasks, namely spam detection, ranking and recommendation. To bridge the gap between folksonomies and the Semantic Web, we apply association rule mining to extract relations and present a deeper analysis of statistical measures which can be used to extract tag relations. This approach is complemented by presenting two approaches to extract conceptualizations from folksonomies.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Krause, B., Lerch, H., Hotho, A., Ro\u00dfnagel, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy<\/span>.<\/span> Informatik-Spektrum. 1\u201312 (2010). https:\/\/doi.org\/10.1007\/s00287-010-0485-8.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/s00287-010-0485-8\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-69f3738deecd73594907183aa874ec1a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-69f3738deecd73594907183aa874ec1a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/s00287-010-0485-8\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/69f3738deecd73594907183aa874ec1a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-69f3738deecd73594907183aa874ec1a\">Soziale Tagging-Systeme geh\u00f6ren zu den in den vergangenen Jahren entstandenen Web2.0-Systemen. Sie erm\u00f6glichen es Anwendern, beliebige Informationen in das Internet einzustellen und untereinander auszutauschen. Je nach Anbieter verlinken Nutzer Videos, Fotos oder Webseiten und beschreiben die eingestellten Medien mit entsprechenden Schlagw\u00f6rtern (Tags). Die damit einhergehende freiwillige Preisgabe oftmals pers\u00f6nlicher Informationen wirft Fragen im Bereich der informationellen Selbstbestimmung auf. Dieses Grundrecht gew\u00e4hrleistet dem Einzelnen, grunds\u00e4tzlich selbst \u00fcber die Preisgabe und Verwendung seiner pers\u00f6nlichen Daten zu bestimmen. F\u00fcr viele Funktionalit\u00e4ten, wie beispielsweise Empfehlungsdienste oder die Bereitstellung einer API, ist eine solche Kontrolle allerdings schwierig zu gestalten. Oftmals existieren keine Richtlinien, inwieweit Dienstanbieter und weitere Dritte diese \u00f6ffentlichen Daten (und weitere Daten, die bei der Nutzung des Systems anfallen) nutzen d\u00fcrfen. Dieser Artikel diskutiert anhand eines konkreten Systems typische, f\u00fcr den Datenschutz relevante Funktionalit\u00e4ten und gibt Handlungsanweisungen f\u00fcr eine datenschutzkonforme technische Gestaltung.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-69f3738deecd73594907183aa874ec1a\"><p>@article{springerlink:10.1007\/s00287-010-0485-8,<br\/>  abstract = {Soziale Tagging-Systeme geh\u00f6ren zu den in den vergangenen Jahren entstandenen Web2.0-Systemen. Sie erm\u00f6glichen es Anwendern, beliebige Informationen in das Internet einzustellen und untereinander auszutauschen. Je nach Anbieter verlinken Nutzer Videos, Fotos oder Webseiten und beschreiben die eingestellten Medien mit entsprechenden Schlagw\u00f6rtern (Tags). Die damit einhergehende freiwillige Preisgabe oftmals pers\u00f6nlicher Informationen wirft Fragen im Bereich der informationellen Selbstbestimmung auf. Dieses Grundrecht gew\u00e4hrleistet dem Einzelnen, grunds\u00e4tzlich selbst \u00fcber die Preisgabe und Verwendung seiner pers\u00f6nlichen Daten zu bestimmen. F\u00fcr viele Funktionalit\u00e4ten, wie beispielsweise Empfehlungsdienste oder die Bereitstellung einer API, ist eine solche Kontrolle allerdings schwierig zu gestalten. Oftmals existieren keine Richtlinien, inwieweit Dienstanbieter und weitere Dritte diese \u00f6ffentlichen Daten (und weitere Daten, die bei der Nutzung des Systems anfallen) nutzen d\u00fcrfen. Dieser Artikel diskutiert anhand eines konkreten Systems typische, f\u00fcr den Datenschutz relevante Funktionalit\u00e4ten und gibt Handlungsanweisungen f\u00fcr eine datenschutzkonforme technische Gestaltung.},<br\/>  address = {Berlin \/ Heidelberg},<br\/>  author = {Krause, Beate and Lerch, Hana and Hotho, Andreas and Ro\u00dfnagel, Alexander and Stumme, Gerd},<br\/>  journal = {Informatik-Spektrum},<br\/>  keywords = {bibsonomy},<br\/>  pages = {1-12},<br\/>  publisher = {Springer},<br\/>  title = {Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-69f3738deecd73594907183aa874ec1a\"><p>%0 Journal Article<br\/>%1 springerlink:10.1007\/s00287-010-0485-8<br\/>%A Krause, Beate<br\/>%A Lerch, Hana<br\/>%A Hotho, Andreas<br\/>%A Ro\u00dfnagel, Alexander<br\/>%A Stumme, Gerd<br\/>%C Berlin \/ Heidelberg<br\/>%D 2010<br\/>%I Springer<br\/>%J Informatik-Spektrum<br\/>%P 1-12<br\/>%R 10.1007\/s00287-010-0485-8<br\/>%T Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy<br\/>%U http:\/\/dx.doi.org\/10.1007\/s00287-010-0485-8<br\/>%X Soziale Tagging-Systeme geh\u00f6ren zu den in den vergangenen Jahren entstandenen Web2.0-Systemen. Sie erm\u00f6glichen es Anwendern, beliebige Informationen in das Internet einzustellen und untereinander auszutauschen. Je nach Anbieter verlinken Nutzer Videos, Fotos oder Webseiten und beschreiben die eingestellten Medien mit entsprechenden Schlagw\u00f6rtern (Tags). Die damit einhergehende freiwillige Preisgabe oftmals pers\u00f6nlicher Informationen wirft Fragen im Bereich der informationellen Selbstbestimmung auf. Dieses Grundrecht gew\u00e4hrleistet dem Einzelnen, grunds\u00e4tzlich selbst \u00fcber die Preisgabe und Verwendung seiner pers\u00f6nlichen Daten zu bestimmen. F\u00fcr viele Funktionalit\u00e4ten, wie beispielsweise Empfehlungsdienste oder die Bereitstellung einer API, ist eine solche Kontrolle allerdings schwierig zu gestalten. Oftmals existieren keine Richtlinien, inwieweit Dienstanbieter und weitere Dritte diese \u00f6ffentlichen Daten (und weitere Daten, die bei der Nutzung des Systems anfallen) nutzen d\u00fcrfen. Dieser Artikel diskutiert anhand eines konkreten Systems typische, f\u00fcr den Datenschutz relevante Funktionalit\u00e4ten und gibt Handlungsanweisungen f\u00fcr eine datenschutzkonforme technische Gestaltung.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Lerch, H., Krause, B., Hotho, A., Ro\u00dfnagel, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Social Bookmarking-Systeme \u2013 die unerkannten Datensammler - Ungewollte personenbezogene Datenverabeitung?<\/span>.<\/span> MultiMedia und Recht. 7, 454\u2013458 (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fc44b1bdc724bbda45d08e35cba8b0ec\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fc44b1bdc724bbda45d08e35cba8b0ec\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fc44b1bdc724bbda45d08e35cba8b0ec\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fc44b1bdc724bbda45d08e35cba8b0ec\"><p>@article{lerch2010datenschutz,<br\/>  author = {Lerch, Hana and Krause, Beate and Hotho, Andreas and Ro\u00dfnagel, Alexander and Stumme, Gerd},<br\/>  journal = {MultiMedia und Recht},<br\/>  keywords = {social-bookmarking},<br\/>  pages = {454-458},<br\/>  title = {Social Bookmarking-Systeme \u2013 die unerkannten Datensammler - Ungewollte personenbezogene Datenverabeitung?},<br\/>  volume = 7,<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fc44b1bdc724bbda45d08e35cba8b0ec\"><p>%0 Journal Article<br\/>%1 lerch2010datenschutz<br\/>%A Lerch, Hana<br\/>%A Krause, Beate<br\/>%A Hotho, Andreas<br\/>%A Ro\u00dfnagel, Alexander<br\/>%A Stumme, Gerd<br\/>%D 2010<br\/>%J MultiMedia und Recht<br\/>%P 454-458<br\/>%T Social Bookmarking-Systeme \u2013 die unerkannten Datensammler - Ungewollte personenbezogene Datenverabeitung?<br\/>%V 7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge<\/span>.<\/span> In: Proceedings of the 2nd Web Science Conference (WebSci10). , Raleigh, NC, USA (2010).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ba43b0db4b8f7cb091fd55d59e170477\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ba43b0db4b8f7cb091fd55d59e170477\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ba43b0db4b8f7cb091fd55d59e170477\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ba43b0db4b8f7cb091fd55d59e170477\"><p>@inproceedings{benz2010semantics,<br\/>  address = {Raleigh, NC, USA},<br\/>  author = {Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 2nd Web Science Conference (WebSci10)},<br\/>  keywords = {ontology},<br\/>  title = {Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge},<br\/>  year = 2010<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ba43b0db4b8f7cb091fd55d59e170477\"><p>%0 Conference Paper<br\/>%1 benz2010semantics<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 2nd Web Science Conference (WebSci10)<br\/>%C Raleigh, NC, USA<br\/>%D 2010<br\/>%T Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2009\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2009<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Markines, B., Cattuto, C., Menczer, F., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Evaluating Similarity Measures for Emergent Semantics of Social Tagging<\/span>.<\/span> In: 18th International World Wide Web Conference. pp. 641\u2013641 (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www2009.eprints.org\/65\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d16e752a8295d5dad7e26b199d9f614f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d16e752a8295d5dad7e26b199d9f614f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d16e752a8295d5dad7e26b199d9f614f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-d16e752a8295d5dad7e26b199d9f614f\">Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focus on similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We ?nd that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable; per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d16e752a8295d5dad7e26b199d9f614f\"><p>@inproceedings{www200965,<br\/>  abstract = {Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focus on similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We ?nd that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable; per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity.},<br\/>  author = {Markines, Benjamin and Cattuto, Ciro and Menczer, Filippo and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {18th International World Wide Web Conference},<br\/>  keywords = {social_similarity},<br\/>  month = {04},<br\/>  pages = {641--641},<br\/>  title = {Evaluating Similarity Measures for Emergent Semantics of Social Tagging},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d16e752a8295d5dad7e26b199d9f614f\"><p>%0 Conference Paper<br\/>%1 www200965<br\/>%A Markines, Benjamin<br\/>%A Cattuto, Ciro<br\/>%A Menczer, Filippo<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B 18th International World Wide Web Conference<br\/>%D 2009<br\/>%P 641--641<br\/>%T Evaluating Similarity Measures for Emergent Semantics of Social Tagging<br\/>%U http:\/\/www2009.eprints.org\/65\/<br\/>%X Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focus on similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We ?nd that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable; per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Voss, J., Hotho, A., J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mapping Bibliographic Records with Bibliographic Hash Keys<\/span>.<\/span> In: Kuhlen, R. (ed.) Information: Droge, Ware oder Commons?. Verlag Werner H\u00fclsbusch (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/hdl.handle.net\/10760\/12697\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-01f6fe57f46e4b92fe02869341efdd8d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-01f6fe57f46e4b92fe02869341efdd8d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/01f6fe57f46e4b92fe02869341efdd8d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-01f6fe57f46e4b92fe02869341efdd8d\">This poster presents a set of hash keys for bibliographic records called bibkeys. Unlike other methods of duplicate detection, bibkeys can directly be calculated from a set of basic metadata fields (title, authors\/editors, year). It is shown how bibkeys are used to map similar bibliographic records in BibSonomy and among distributed library catalogs and other distributed databases.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-01f6fe57f46e4b92fe02869341efdd8d\"><p>@inproceedings{voss2009mapping,<br\/>  abstract = {This poster presents a set of hash keys for bibliographic records called bibkeys. Unlike other methods of duplicate detection, bibkeys can directly be calculated from a set of basic metadata fields (title, authors\/editors, year). It is shown how bibkeys are used to map similar bibliographic records in BibSonomy and among distributed library catalogs and other distributed databases.},<br\/>  author = {Voss, Jakob and Hotho, Andreas and J\u00e4schke, Robert},<br\/>  booktitle = {Information: Droge, Ware oder Commons?},<br\/>  editor = {Kuhlen, Rainer},<br\/>  keywords = {key},<br\/>  organization = {Hochschulverband Informationswissenschaft},<br\/>  publisher = {Verlag Werner H\u00fclsbusch},<br\/>  series = {Proceedings of the ISI},<br\/>  title = {Mapping Bibliographic Records with Bibliographic Hash Keys},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-01f6fe57f46e4b92fe02869341efdd8d\"><p>%0 Conference Paper<br\/>%1 voss2009mapping<br\/>%A Voss, Jakob<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%B Information: Droge, Ware oder Commons?<br\/>%D 2009<br\/>%E Kuhlen, Rainer<br\/>%I Verlag Werner H\u00fclsbusch<br\/>%T Mapping Bibliographic Records with Bibliographic Hash Keys<br\/>%U http:\/\/hdl.handle.net\/10760\/12697<br\/>%X This poster presents a set of hash keys for bibliographic records called bibkeys. Unlike other methods of duplicate detection, bibkeys can directly be calculated from a set of basic metadata fields (title, authors\/editors, year). It is shown how bibkeys are used to map similar bibliographic records in BibSonomy and among distributed library catalogs and other distributed databases.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Scholz, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Die Schwierigkeit des k-Median Clusterings f\u00fcr Bregman-Divergenzen<\/span><\/span>, (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1a1dbee3146ac36603631f62dbf68592\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1a1dbee3146ac36603631f62dbf68592\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1a1dbee3146ac36603631f62dbf68592\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1a1dbee3146ac36603631f62dbf68592\"><p>@mastersthesis{scholz2009schwierigkeit,<br\/>  author = {Scholz, Christoph},<br\/>  keywords = {k-median},<br\/>  school = {University of Paderborn},<br\/>  title = {Die Schwierigkeit des k-Median Clusterings f\u00fcr Bregman-Divergenzen},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1a1dbee3146ac36603631f62dbf68592\"><p>%0 Thesis<br\/>%1 scholz2009schwierigkeit<br\/>%A Scholz, Christoph<br\/>%D 2009<br\/>%T Die Schwierigkeit des k-Median Clusterings f\u00fcr Bregman-Divergenzen<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., J\u00e4schke, R., Benz, D., Grahl, M., Krause, B., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Social Bookmarking am Beispiel BibSonomy<\/span>.<\/span> In: Blumauer, A. and Pellegrini, T. (eds.) Social Semantic Web. pp. 363\u2013391. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-72216-8.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/978-3-540-72216-8_18\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5ccf05a86e7f1a089ae83dd47568e6de\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5ccf05a86e7f1a089ae83dd47568e6de\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-540-72216-8\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5ccf05a86e7f1a089ae83dd47568e6de\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5ccf05a86e7f1a089ae83dd47568e6de\">BibSonomy ist ein kooperatives Verschlagwortungssystem (Social Bookmarking System), betrieben vom Fachgebiet Wissensverarbeitung der Universit\u00e4t Kassel. Es erlaubt das Speichern und Organisieren von Web-Lesezeichen und Metadaten f\u00fcr wissenschaftlichePublikationen. In diesem Beitrag beschreiben wir die von BibSonomy bereitgestellte Funktionalit\u00e4t, die dahinter stehende Architektursowie das zugrunde liegende Datenmodell. Ferner erl\u00e4utern wir Anwendungsbeispiele und gehen auf Methoden zur Analyse der in BibSonomy und \u00e4hnlichen Systemen enthaltenen Daten ein.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5ccf05a86e7f1a089ae83dd47568e6de\"><p>@incollection{hotho2008social,<br\/>  abstract = {BibSonomy ist ein kooperatives Verschlagwortungssystem (Social Bookmarking System), betrieben vom Fachgebiet Wissensverarbeitung der Universit\u00e4t Kassel. Es erlaubt das Speichern und Organisieren von Web-Lesezeichen und Metadaten f\u00fcr wissenschaftlichePublikationen. In diesem Beitrag beschreiben wir die von BibSonomy bereitgestellte Funktionalit\u00e4t, die dahinter stehende Architektursowie das zugrunde liegende Datenmodell. Ferner erl\u00e4utern wir Anwendungsbeispiele und gehen auf Methoden zur Analyse der in BibSonomy und \u00e4hnlichen Systemen enthaltenen Daten ein.},<br\/>  address = {Berlin, Heidelberg},<br\/>  author = {Hotho, Andreas and J\u00e4schke, Robert and Benz, Dominik and Grahl, Miranda and Krause, Beate and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Social Semantic Web},<br\/>  chapter = 18,<br\/>  editor = {Blumauer, Andreas and Pellegrini, Tassilo},<br\/>  keywords = {bookmarking},<br\/>  pages = {363--391},<br\/>  publisher = {Springer},<br\/>  series = {X.media.press},<br\/>  title = {Social Bookmarking am Beispiel BibSonomy},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5ccf05a86e7f1a089ae83dd47568e6de\"><p>%0 Book Section<br\/>%1 hotho2008social<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Benz, Dominik<br\/>%A Grahl, Miranda<br\/>%A Krause, Beate<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Social Semantic Web<br\/>%C Berlin, Heidelberg<br\/>%D 2009<br\/>%E Blumauer, Andreas<br\/>%E Pellegrini, Tassilo<br\/>%I Springer<br\/>%P 363--391<br\/>%R 10.1007\/978-3-540-72216-8<br\/>%T Social Bookmarking am Beispiel BibSonomy<br\/>%U http:\/\/dx.doi.org\/10.1007\/978-3-540-72216-8_18<br\/>%X BibSonomy ist ein kooperatives Verschlagwortungssystem (Social Bookmarking System), betrieben vom Fachgebiet Wissensverarbeitung der Universit\u00e4t Kassel. Es erlaubt das Speichern und Organisieren von Web-Lesezeichen und Metadaten f\u00fcr wissenschaftlichePublikationen. In diesem Beitrag beschreiben wir die von BibSonomy bereitgestellte Funktionalit\u00e4t, die dahinter stehende Architektursowie das zugrunde liegende Datenmodell. Ferner erl\u00e4utern wir Anwendungsbeispiele und gehen auf Methoden zur Analyse der in BibSonomy und \u00e4hnlichen Systemen enthaltenen Daten ein.<br\/>%& 18<br\/>%@ 978-3-540-72215-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Lemmerich, F., Krause, B., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Towards Understanding Spammers - Discovering Local Patterns for Concept Characterization and Description}<\/span>.<\/span> In: Knobbe, J.F.A. (ed.) 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).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.ke.tu-darmstadt.de\/events\/LeGo-09\/04-Atzmueller.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bb80bdcc06c8886968c453fd920dfe05\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bb80bdcc06c8886968c453fd920dfe05\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bb80bdcc06c8886968c453fd920dfe05\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bb80bdcc06c8886968c453fd920dfe05\"><p>@inproceedings{ALKH:09,<br\/>  author = {Atzmueller, Martin and Lemmerich, Florian and Krause, Beate and Hotho, Andreas},<br\/>  booktitle = {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},<br\/>  editor = {Knobbe, Johannes F\u00fcrnkranz Arno},<br\/>  keywords = {bibsonomy},<br\/>  note = {accepted},<br\/>  title = {{Towards Understanding Spammers - Discovering Local Patterns for Concept Characterization and Description}},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bb80bdcc06c8886968c453fd920dfe05\"><p>%0 Conference Paper<br\/>%1 ALKH:09<br\/>%A Atzmueller, Martin<br\/>%A Lemmerich, Florian<br\/>%A Krause, Beate<br\/>%A Hotho, Andreas<br\/>%B 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<br\/>%D 2009<br\/>%E Knobbe, Johannes F\u00fcrnkranz Arno<br\/>%T {Towards Understanding Spammers - Discovering Local Patterns for Concept Characterization and Description}<br\/>%U http:\/\/www.ke.tu-darmstadt.de\/events\/LeGo-09\/04-Atzmueller.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Doerfel, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ger\u00fcste Formaler Kontexte<\/span><\/span>, (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-21b513aafc43309f88a7ffa715c475b6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-21b513aafc43309f88a7ffa715c475b6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/21b513aafc43309f88a7ffa715c475b6\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-21b513aafc43309f88a7ffa715c475b6\">1976 wurde von Rudolf Wille das Ger\u00fcst eines vollst\u00e4ndigen Verbandes V endlicher L\u00e4nge eingef\u00fchrt. Dieses besteht aus einer (geordneten) Teilmenge von V, aus der der gesamte Verband rekonstruiert werden kann. In der Formalen Begriffsanalyse werden vollst\u00e4ndige Verb\u00e4nde durch Kontexte beschrieben. Um mit diesen arbeiten zu k\u00f6nnen, wurden diverse verbandstheoretische Konzepte und Resultate f\u00fcr vollst\u00e4ndige Verb\u00e4nde adaptiert und begriffsanalytisch, d. h. mit Hilfe von Kontexten formuliert. Ein Ziel dieser Diplomarbeit ist es, die Konstruktion des Ger\u00fcstes eines Begriffsverbandes aus einem Kontext heraus beschreiben zu k\u00f6nnen. Die Anwendbarkeit des Ger\u00fcstes wird dabei von vollst\u00e4ndigen Verb\u00e4nden endlicher L\u00e4nge auf doppelt fundierte vollst\u00e4ndige Verb\u00e4nde (bzw. deren reduzierte Kontexte) erweitert. Im zweiten Teil der Arbeit wird die von M_3 erzeugte Variet\u00e4t betrachtet. Die darin enthaltenen doppelt fundierten vollst\u00e4ndigen Verb\u00e4nde werden anhand ihrer reduzierten Kontexte charakterisiert.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-21b513aafc43309f88a7ffa715c475b6\"><p>@mastersthesis{doerfel2009gerste,<br\/>  abstract = {1976 wurde von Rudolf Wille das Ger\u00fcst eines vollst\u00e4ndigen Verbandes V endlicher L\u00e4nge eingef\u00fchrt. Dieses besteht aus einer (geordneten) Teilmenge von V, aus der der gesamte Verband rekonstruiert werden kann. In der Formalen Begriffsanalyse werden vollst\u00e4ndige Verb\u00e4nde durch Kontexte beschrieben. Um mit diesen arbeiten zu k\u00f6nnen, wurden diverse verbandstheoretische Konzepte und Resultate f\u00fcr vollst\u00e4ndige Verb\u00e4nde adaptiert und begriffsanalytisch, d. h. mit Hilfe von Kontexten formuliert. Ein Ziel dieser Diplomarbeit ist es, die Konstruktion des Ger\u00fcstes eines Begriffsverbandes aus einem Kontext heraus beschreiben zu k\u00f6nnen. Die Anwendbarkeit des Ger\u00fcstes wird dabei von vollst\u00e4ndigen Verb\u00e4nden endlicher L\u00e4nge auf doppelt fundierte vollst\u00e4ndige Verb\u00e4nde (bzw. deren reduzierte Kontexte) erweitert. Im zweiten Teil der Arbeit wird die von M_3 erzeugte Variet\u00e4t betrachtet. Die darin enthaltenen doppelt fundierten vollst\u00e4ndigen Verb\u00e4nde werden anhand ihrer reduzierten Kontexte charakterisiert.},<br\/>  author = {Doerfel, Stephan},<br\/>  howpublished = {Diplomarbeit},<br\/>  institution = {TU Dresden},<br\/>  keywords = {diplomarbeit},<br\/>  school = {TU Dresden},<br\/>  title = {Ger\u00fcste Formaler Kontexte},<br\/>  type = {Diplomarbeit},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-21b513aafc43309f88a7ffa715c475b6\"><p>%0 Thesis<br\/>%1 doerfel2009gerste<br\/>%A Doerfel, Stephan<br\/>%D 2009<br\/>%T Ger\u00fcste Formaler Kontexte<br\/>%X 1976 wurde von Rudolf Wille das Ger\u00fcst eines vollst\u00e4ndigen Verbandes V endlicher L\u00e4nge eingef\u00fchrt. Dieses besteht aus einer (geordneten) Teilmenge von V, aus der der gesamte Verband rekonstruiert werden kann. In der Formalen Begriffsanalyse werden vollst\u00e4ndige Verb\u00e4nde durch Kontexte beschrieben. Um mit diesen arbeiten zu k\u00f6nnen, wurden diverse verbandstheoretische Konzepte und Resultate f\u00fcr vollst\u00e4ndige Verb\u00e4nde adaptiert und begriffsanalytisch, d. h. mit Hilfe von Kontexten formuliert. Ein Ziel dieser Diplomarbeit ist es, die Konstruktion des Ger\u00fcstes eines Begriffsverbandes aus einem Kontext heraus beschreiben zu k\u00f6nnen. Die Anwendbarkeit des Ger\u00fcstes wird dabei von vollst\u00e4ndigen Verb\u00e4nden endlicher L\u00e4nge auf doppelt fundierte vollst\u00e4ndige Verb\u00e4nde (bzw. deren reduzierte Kontexte) erweitert. Im zweiten Teil der Arbeit wird die von M_3 erzeugte Variet\u00e4t betrachtet. Die darin enthaltenen doppelt fundierten vollst\u00e4ndigen Verb\u00e4nde werden anhand ihrer reduzierten Kontexte charakterisiert.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Krause, B., Kumar, G.P., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Characterizing Semantic Relatedness of Search Query Terms<\/span>.<\/span> In: Proceedings of the 1st Workshop on Explorative Analytics of Information Networks (EIN2009). , Bled, Slovenia (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b697a98a7340585594455ee2e81d238a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b697a98a7340585594455ee2e81d238a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b697a98a7340585594455ee2e81d238a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b697a98a7340585594455ee2e81d238a\"><p>@inproceedings{benz2009characterizing,<br\/>  address = {Bled, Slovenia},<br\/>  author = {Benz, Dominik and Krause, Beate and Kumar, G. Praveen and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 1st Workshop on Explorative Analytics of Information Networks (EIN2009)},<br\/>  keywords = {pkdd},<br\/>  month = {09},<br\/>  title = {Characterizing Semantic Relatedness of Search Query Terms},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b697a98a7340585594455ee2e81d238a\"><p>%0 Conference Paper<br\/>%1 benz2009characterizing<br\/>%A Benz, Dominik<br\/>%A Krause, Beate<br\/>%A Kumar, G. Praveen<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 1st Workshop on Explorative Analytics of Information Networks (EIN2009)<br\/>%C Bled, Slovenia<br\/>%D 2009<br\/>%T Characterizing Semantic Relatedness of Search Query Terms<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Eisterlehner, F., Hotho, A., J\u00e4schke, R., Krause, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Managing publications and bookmarks with BibSonomy<\/span>.<\/span> In: Cattuto, C., Ruffo, G., and Menczer, F. (eds.) HT \u201909: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia. pp. 323\u2013324. ACM, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1557914.1557969.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/portal.acm.org\/citation.cfm?doid=1557914.1557969#\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-99cafad8ce2afb5879c6c85c14cc5259\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-99cafad8ce2afb5879c6c85c14cc5259\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/1557914.1557969\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/99cafad8ce2afb5879c6c85c14cc5259\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-99cafad8ce2afb5879c6c85c14cc5259\">In this demo we present BibSonomy, a social bookmark and publication sharing system.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-99cafad8ce2afb5879c6c85c14cc5259\"><p>@inproceedings{benz2009managing,<br\/>  abstract = {In this demo we present BibSonomy, a social bookmark and publication sharing system.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Benz, Dominik and Eisterlehner, Folke and Hotho, Andreas and J\u00e4schke, Robert and Krause, Beate and Stumme, Gerd},<br\/>  booktitle = {HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia},<br\/>  editor = {Cattuto, Ciro and Ruffo, Giancarlo and Menczer, Filippo},<br\/>  keywords = {itegpub},<br\/>  month = {06},<br\/>  pages = {323--324},<br\/>  publisher = {ACM},<br\/>  title = {Managing publications and bookmarks with BibSonomy},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-99cafad8ce2afb5879c6c85c14cc5259\"><p>%0 Conference Paper<br\/>%1 benz2009managing<br\/>%A Benz, Dominik<br\/>%A Eisterlehner, Folke<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Krause, Beate<br\/>%A Stumme, Gerd<br\/>%B HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia<br\/>%C New York, NY, USA<br\/>%D 2009<br\/>%E Cattuto, Ciro<br\/>%E Ruffo, Giancarlo<br\/>%E Menczer, Filippo<br\/>%I ACM<br\/>%P 323--324<br\/>%R 10.1145\/1557914.1557969<br\/>%T Managing publications and bookmarks with BibSonomy<br\/>%U http:\/\/portal.acm.org\/citation.cfm?doid=1557914.1557969#<br\/>%X In this demo we present BibSonomy, a social bookmark and publication sharing system.<br\/>%@ 978-1-60558-486-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Eisterlehner, F., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Testing and Evaluating Tag Recommenders in a Live System<\/span>.<\/span> In: Benz, D. and Janssen, F. (eds.) Workshop on Knowledge Discovery, Data Mining, and Machine Learning. pp. 44\u201351 (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/lwa09.informatik.tu-darmstadt.de\/pub\/KDML\/WebHome\/kdml09_R.Jaeschke_et_al.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5e8f40e610e723e966676772aa205f80\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5e8f40e610e723e966676772aa205f80\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5e8f40e610e723e966676772aa205f80\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5e8f40e610e723e966676772aa205f80\">The challenge to provide tag recommendations for collaborative tagging systems has attracted quite some attention of researchers lately. However, most research focused on evaluation and development of appropriate methods rather than tackling the practical challenges of how to integrate recommendation methods into real tagging systems, record and evaluate their performance. In this paper we describe the tag recommendation framework we developed for our social bookmark and publication sharing system BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. Furthermore, this paper presents an evaluation of two exemplarily deployed recommendation methods, demonstrating the power of the framework.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5e8f40e610e723e966676772aa205f80\"><p>@inproceedings{jaeschke2009testingKDML,<br\/>  abstract = {The challenge to provide tag recommendations for collaborative tagging systems has attracted quite some attention of researchers lately. However, most research focused on evaluation and development of appropriate methods rather than tackling the practical challenges of how to integrate recommendation methods into real tagging systems, record and evaluate their performance. In this paper we describe the tag recommendation framework we developed for our social bookmark and publication sharing system BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. Furthermore, this paper presents an evaluation of two exemplarily deployed recommendation methods, demonstrating the power of the framework.},<br\/>  author = {J\u00e4schke, Robert and Eisterlehner, Folke and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Workshop on Knowledge Discovery, Data Mining, and Machine Learning},<br\/>  editor = {Benz, Dominik and Janssen, Frederik},<br\/>  keywords = {bibsonomy},<br\/>  month = {09},<br\/>  pages = {44--51},<br\/>  title = {Testing and Evaluating Tag Recommenders in a Live System},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5e8f40e610e723e966676772aa205f80\"><p>%0 Conference Paper<br\/>%1 jaeschke2009testingKDML<br\/>%A J\u00e4schke, Robert<br\/>%A Eisterlehner, Folke<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Workshop on Knowledge Discovery, Data Mining, and Machine Learning<br\/>%D 2009<br\/>%E Benz, Dominik<br\/>%E Janssen, Frederik<br\/>%P 44--51<br\/>%T Testing and Evaluating Tag Recommenders in a Live System<br\/>%U http:\/\/lwa09.informatik.tu-darmstadt.de\/pub\/KDML\/WebHome\/kdml09_R.Jaeschke_et_al.pdf<br\/>%X The challenge to provide tag recommendations for collaborative tagging systems has attracted quite some attention of researchers lately. However, most research focused on evaluation and development of appropriate methods rather than tackling the practical challenges of how to integrate recommendation methods into real tagging systems, record and evaluate their performance. In this paper we describe the tag recommendation framework we developed for our social bookmark and publication sharing system BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. Furthermore, this paper presents an evaluation of two exemplarily deployed recommendation methods, demonstrating the power of the framework.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Eisterlehner, F., Hotho, A., J\u00e4schke, R. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">ECML PKDD Discovery Challenge 2009 (DC09)<\/span>.<\/span> (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-497\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c64b98851f270a50717e107d25c9014a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c64b98851f270a50717e107d25c9014a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c64b98851f270a50717e107d25c9014a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c64b98851f270a50717e107d25c9014a\"><p>@proceedings{eisterlehner2009ecmlpkdd,<br\/>  editor = {Eisterlehner, Folke and Hotho, Andreas and J\u00e4schke, Robert},<br\/>  keywords = {pkdd},<br\/>  month = {09},<br\/>  series = {CEUR-WS.org},<br\/>  title = {ECML PKDD Discovery Challenge 2009 (DC09)},<br\/>  volume = 497,<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c64b98851f270a50717e107d25c9014a\"><p>%0 Conference Proceedings<br\/>%1 eisterlehner2009ecmlpkdd<br\/>%B CEUR-WS.org<br\/>%D 2009<br\/>%E Eisterlehner, Folke<br\/>%E Hotho, Andreas<br\/>%E J\u00e4schke, Robert<br\/>%T ECML PKDD Discovery Challenge 2009 (DC09)<br\/>%U http:\/\/ceur-ws.org\/Vol-497<br\/>%V 497<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Lemmerich, F., Krause, B., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Spammer Discrimination: Discovering Local Patterns for Concept Characterization and Description<\/span>.<\/span> In: F\u00fcrnkranz, J. and Knobbe, A. (eds.) 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. , Bled, Slovenia (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-23d61080328d5e143484a0fadd223c91\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-23d61080328d5e143484a0fadd223c91\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/23d61080328d5e143484a0fadd223c91\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-23d61080328d5e143484a0fadd223c91\"><p>@inproceedings{atzmueller09,<br\/>  address = {Bled, Slovenia},<br\/>  author = {Atzmueller, Martin and Lemmerich, Florian and Krause, Beate and Hotho, Andreas},<br\/>  booktitle = {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},<br\/>  editor = {F\u00fcrnkranz, Johannes and Knobbe, Arno},<br\/>  keywords = {relevancy},<br\/>  month = {09},<br\/>  note = {accepted},<br\/>  title = {Spammer Discrimination: Discovering Local Patterns for Concept Characterization and Description},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-23d61080328d5e143484a0fadd223c91\"><p>%0 Conference Paper<br\/>%1 atzmueller09<br\/>%A Atzmueller, Martin<br\/>%A Lemmerich, Florian<br\/>%A Krause, Beate<br\/>%A Hotho, Andreas<br\/>%B 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<br\/>%C Bled, Slovenia<br\/>%D 2009<br\/>%E F\u00fcrnkranz, Johannes<br\/>%E Knobbe, Arno<br\/>%T Spammer Discrimination: Discovering Local Patterns for Concept Characterization and Description<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzm\u00fcller, M., Lemmerich, F., Krause, B., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Who are the Spammers - Understandable Local Patterns for Concept Description<\/span>.<\/span> In: 7th Conference on Computer Methods and Systems. , Krakow, Poland (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.cms.agh.edu.pl\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ddb43c532ffc1c5ed8b7e7cfb54510a3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ddb43c532ffc1c5ed8b7e7cfb54510a3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ddb43c532ffc1c5ed8b7e7cfb54510a3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ddb43c532ffc1c5ed8b7e7cfb54510a3\"><p>@inproceedings{atze09,<br\/>  address = {Krakow, Poland},<br\/>  author = {Atzm\u00fcller, Martin and Lemmerich, Florian and Krause, Beate and Hotho, Andreas},<br\/>  booktitle = {7th Conference on Computer Methods and Systems},<br\/>  keywords = {spam},<br\/>  month = 11,<br\/>  note = {ISBN 83-916420-5-4},<br\/>  title = {Who are the Spammers - Understandable Local Patterns for Concept Description},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ddb43c532ffc1c5ed8b7e7cfb54510a3\"><p>%0 Conference Paper<br\/>%1 atze09<br\/>%A Atzm\u00fcller, Martin<br\/>%A Lemmerich, Florian<br\/>%A Krause, Beate<br\/>%A Hotho, Andreas<br\/>%B 7th Conference on Computer Methods and Systems<br\/>%C Krakow, Poland<br\/>%D 2009<br\/>%T Who are the Spammers - Understandable Local Patterns for Concept Description<br\/>%U http:\/\/www.cms.agh.edu.pl\/<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Atzmueller, M., Lemmerich, F., Krause, B., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Who are the Spammers? Understandable Local Patterns for Concept Description<\/span>.<\/span> In: 7th Conference on Computer Methods and Systems. , Krakow, Poland (2009).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.cms.agh.edu.pl\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-014dbd07807e05a5ea9aafb2dbead39b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-014dbd07807e05a5ea9aafb2dbead39b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/014dbd07807e05a5ea9aafb2dbead39b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-014dbd07807e05a5ea9aafb2dbead39b\"><p>@inproceedings{atze09,<br\/>  address = {Krakow, Poland},<br\/>  author = {Atzmueller, Martin and Lemmerich, Florian and Krause, Beate and Hotho, Andreas},<br\/>  booktitle = {7th Conference on Computer Methods and Systems},<br\/>  keywords = {bibsonomy},<br\/>  month = 11,<br\/>  note = {ISBN 83-916420-5-4},<br\/>  title = {Who are the Spammers? Understandable Local Patterns for Concept Description},<br\/>  year = 2009<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-014dbd07807e05a5ea9aafb2dbead39b\"><p>%0 Conference Paper<br\/>%1 atze09<br\/>%A Atzmueller, Martin<br\/>%A Lemmerich, Florian<br\/>%A Krause, Beate<br\/>%A Hotho, Andreas<br\/>%B 7th Conference on Computer Methods and Systems<br\/>%C Krakow, Poland<br\/>%D 2009<br\/>%T Who are the Spammers? Understandable Local Patterns for Concept Description<br\/>%U http:\/\/www.cms.agh.edu.pl\/<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2008\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2008<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Social Bookmarking<\/span>.<\/span> In: Back, A., Gronau, N., and Tochtermann, K. (eds.) Web 2.0 in der Unternehmenspraxis: Grundlagen, Fallstudien und Trends zum Einsatz von Social Software. pp. 26\u201338. Oldenbourg Verlag, M\u00fcnchen (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.amazon.de\/gp\/redirect.html%3FASIN=3486585797%26tag=ws%26lcode=xm2%26cID=2025%26ccmID=165953%26location=\/Web-2-0-Unternehmenspraxis-Grundlagen-Fallstudien\/dp\/3486585797%253FSubscriptionId=13CT5CVB80YFWJEPWS02\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b54f6557893e3ab9d1eb83b0baeb136e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b54f6557893e3ab9d1eb83b0baeb136e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b54f6557893e3ab9d1eb83b0baeb136e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b54f6557893e3ab9d1eb83b0baeb136e\"><p>@inbook{hotho2008bookmarking,<br\/>  address = {M\u00fcnchen},<br\/>  author = {Hotho, Andreas},<br\/>  booktitle = {Web 2.0 in der Unternehmenspraxis: Grundlagen, Fallstudien und Trends zum Einsatz von Social Software},<br\/>  editor = {Back, Andrea and Gronau, Norbert and Tochtermann, Klaus},<br\/>  keywords = {bookmarking},<br\/>  pages = {26-38},<br\/>  publisher = {Oldenbourg Verlag},<br\/>  title = {Social Bookmarking},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b54f6557893e3ab9d1eb83b0baeb136e\"><p>%0 Book Section<br\/>%1 hotho2008bookmarking<br\/>%A Hotho, Andreas<br\/>%B Web 2.0 in der Unternehmenspraxis: Grundlagen, Fallstudien und Trends zum Einsatz von Social Software<br\/>%C M\u00fcnchen<br\/>%D 2008<br\/>%E Back, Andrea<br\/>%E Gronau, Norbert<br\/>%E Tochtermann, Klaus<br\/>%I Oldenbourg Verlag<br\/>%P 26-38<br\/>%T Social Bookmarking<br\/>%U http:\/\/www.amazon.de\/gp\/redirect.html%3FASIN=3486585797%26tag=ws%26lcode=xm2%26cID=2025%26ccmID=165953%26location=\/Web-2-0-Unternehmenspraxis-Grundlagen-Fallstudien\/dp\/3486585797%253FSubscriptionId=13CT5CVB80YFWJEPWS02<br\/>%@ 9783486585797<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cattuto, C., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems<\/span>.<\/span> In: Proceedings of the 3rd Workshop on Ontology Learning and Population (OLP3). pp. 39\u201343. , Patras, Greece (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/cattuto2008semantic.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3b0aca61b24e4343bd80390614e3066e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3b0aca61b24e4343bd80390614e3066e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3b0aca61b24e4343bd80390614e3066e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-3b0aca61b24e4343bd80390614e3066e\">Social bookmarking systems allow users to organise collections of resources on the Web in a collaborative fashion. The increasing popularity of these systems as well as first insights into their emergent semantics have made them relevant to disciplines like knowledge extraction and ontology learning. The problem of devising methods to measure the semantic relatedness between tags and characterizing it semantically is still largely open. Here we analyze three measures of tag relatedness: tag co-occurrence, cosine similarity of co-occurrence distributions, and FolkRank, an adaptation of the PageRank algorithm to folksonomies. Each measure is computed on tags from a large-scale dataset crawled from the social bookmarking system del.icio.us. To provide a semantic grounding of our findings, a connection to WordNet (a semantic lexicon for the English language) is established by mapping tags into synonym sets of WordNet, and applying there well-known metrics of semantic similarity. Our results clearly expose different characteristics of the selected measures of relatedness, making them applicable to different subtasks of knowledge extraction such as synonym detection or discovery of concept hierarchies.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3b0aca61b24e4343bd80390614e3066e\"><p>@inproceedings{cattuto2008semantic,<br\/>  abstract = {Social bookmarking systems allow users to organise collections of resources on the Web in a collaborative fashion. The increasing popularity of these systems as well as first insights into their emergent semantics have made them relevant to disciplines like knowledge extraction and ontology learning. The problem of devising methods to measure the semantic relatedness between tags and characterizing it semantically is still largely open. Here we analyze three measures of tag relatedness: tag co-occurrence, cosine similarity of co-occurrence distributions, and FolkRank, an adaptation of the PageRank algorithm to folksonomies. Each measure is computed on tags from a large-scale dataset crawled from the social bookmarking system del.icio.us. To provide a semantic grounding of our findings, a connection to WordNet (a semantic lexicon for the English language) is established by mapping tags into synonym sets of WordNet, and applying there well-known metrics of semantic similarity. Our results clearly expose different characteristics of the selected measures of relatedness, making them applicable to different subtasks of knowledge extraction such as synonym detection or discovery of concept hierarchies.},<br\/>  address = {Patras, Greece},<br\/>  author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 3rd Workshop on Ontology Learning and Population (OLP3)},<br\/>  keywords = {itegpub},<br\/>  month = {07},<br\/>  note = {ISBN 978-960-89282-6-8},<br\/>  pages = {39--43},<br\/>  title = {Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3b0aca61b24e4343bd80390614e3066e\"><p>%0 Conference Paper<br\/>%1 cattuto2008semantic<br\/>%A Cattuto, Ciro<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 3rd Workshop on Ontology Learning and Population (OLP3)<br\/>%C Patras, Greece<br\/>%D 2008<br\/>%P 39--43<br\/>%T Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/cattuto2008semantic.pdf<br\/>%X Social bookmarking systems allow users to organise collections of resources on the Web in a collaborative fashion. The increasing popularity of these systems as well as first insights into their emergent semantics have made them relevant to disciplines like knowledge extraction and ontology learning. The problem of devising methods to measure the semantic relatedness between tags and characterizing it semantically is still largely open. Here we analyze three measures of tag relatedness: tag co-occurrence, cosine similarity of co-occurrence distributions, and FolkRank, an adaptation of the PageRank algorithm to folksonomies. Each measure is computed on tags from a large-scale dataset crawled from the social bookmarking system del.icio.us. To provide a semantic grounding of our findings, a connection to WordNet (a semantic lexicon for the English language) is established by mapping tags into synonym sets of WordNet, and applying there well-known metrics of semantic similarity. Our results clearly expose different characteristics of the selected measures of relatedness, making them applicable to different subtasks of knowledge extraction such as synonym detection or discovery of concept hierarchies.<br\/>%@ 978-960-89282-6-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Discovering Shared Conceptualizations in Folksonomies<\/span>.<\/span> Web Semantics: Science, Services and Agents on the World Wide Web. 6, 38\u201353 (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.sciencedirect.com\/science\/article\/B758F-4R53WD4-1\/2\/ae56bd6e7132074272ca2035be13781b\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-63901930c137df0c2dad84075c564b14\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-63901930c137df0c2dad84075c564b14\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/63901930c137df0c2dad84075c564b14\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-63901930c137df0c2dad84075c564b14\">Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-63901930c137df0c2dad84075c564b14\"><p>@article{jaeschke2008discovering,<br\/>  abstract = {Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.},<br\/>  author = {J\u00e4schke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},<br\/>  booktitle = {Semantic Web and Web 2.0},<br\/>  journal = {Web Semantics: Science, Services and Agents on the World Wide Web},<br\/>  keywords = {bibsonomy},<br\/>  month = {02},<br\/>  number = 1,<br\/>  pages = {38--53},<br\/>  title = {Discovering Shared Conceptualizations in Folksonomies},<br\/>  volume = 6,<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-63901930c137df0c2dad84075c564b14\"><p>%0 Journal Article<br\/>%1 jaeschke2008discovering<br\/>%A J\u00e4schke, Robert<br\/>%A Hotho, Andreas<br\/>%A Schmitz, Christoph<br\/>%A Ganter, Bernhard<br\/>%A Stumme, Gerd<br\/>%B Semantic Web and Web 2.0<br\/>%D 2008<br\/>%J Web Semantics: Science, Services and Agents on the World Wide Web<br\/>%N 1<br\/>%P 38--53<br\/>%T Discovering Shared Conceptualizations in Folksonomies<br\/>%U http:\/\/www.sciencedirect.com\/science\/article\/B758F-4R53WD4-1\/2\/ae56bd6e7132074272ca2035be13781b<br\/>%V 6<br\/>%X Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stefani, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Entwicklung modularer, wiederverwendbarer Simulationsbausteine zur Unterst\u00fctzung von Hardware-in-the-Loop Tests eingebetteter Systeme im Maschinen- und Anlagenbau<\/span><\/span>, http:\/\/www.svenstefani.de\/publ\/diplom2\/da2-svenstefani.pdf, (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.svenstefani.de\/publ\/diplom2\/da2-svenstefani.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ae58845077f030cfb8560b524bbfb0a6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ae58845077f030cfb8560b524bbfb0a6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ae58845077f030cfb8560b524bbfb0a6\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ae58845077f030cfb8560b524bbfb0a6\"><p>@mastersthesis{uniksdiplom2,<br\/>  address = {Kassel},<br\/>  author = {Stefani, Sven},<br\/>  editor = {Stefani, Sven},<br\/>  keywords = {diplom},<br\/>  month = {03},<br\/>  school = {Universit\u00e4t Kassel},<br\/>  title = {Entwicklung modularer, wiederverwendbarer Simulationsbausteine zur Unterst\u00fctzung von Hardware-in-the-Loop Tests eingebetteter Systeme im Maschinen- und Anlagenbau},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ae58845077f030cfb8560b524bbfb0a6\"><p>%0 Thesis<br\/>%1 uniksdiplom2<br\/>%A Stefani, Sven<br\/>%C Kassel<br\/>%D 2008<br\/>%E Stefani, Sven<br\/>%T Entwicklung modularer, wiederverwendbarer Simulationsbausteine zur Unterst\u00fctzung von Hardware-in-the-Loop Tests eingebetteter Systeme im Maschinen- und Anlagenbau<br\/>%U http:\/\/www.svenstefani.de\/publ\/diplom2\/da2-svenstefani.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Krause, B., Schmitz, C., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems<\/span>.<\/span> In: AIRWeb \u201908: Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web. pp. 61\u201368. ACM, Beijing, China (2008). https:\/\/doi.org\/10.1145\/1451983.1451998.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/airweb.cse.lehigh.edu\/2008\/submissions\/krause_2008_anti_social_tagger.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5b6b648fd25c15d594404ae26fcda6b4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5b6b648fd25c15d594404ae26fcda6b4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/1451983.1451998\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5b6b648fd25c15d594404ae26fcda6b4\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-5b6b648fd25c15d594404ae26fcda6b4\">The annotation of web sites in social bookmarking systemshas become a popular way to manage and find informationon the web. The community structure of such systems attractsspammers: recent post pages, popular pages or specifictag pages can be manipulated easily. As a result, searchingor tracking recent posts does not deliver quality resultsannotated in the community, but rather unsolicited, oftencommercial, web sites. To retain the benefits of sharingone\u2019s web content, spam-fighting mechanisms that can facethe flexible strategies of spammers need to be developed.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5b6b648fd25c15d594404ae26fcda6b4\"><p>@inproceedings{krause2008antisocial,<br\/>  abstract = {The annotation of web sites in social bookmarking systemshas become a popular way to manage and find informationon the web. The community structure of such systems attractsspammers: recent post pages, popular pages or specifictag pages can be manipulated easily. As a result, searchingor tracking recent posts does not deliver quality resultsannotated in the community, but rather unsolicited, oftencommercial, web sites. To retain the benefits of sharingone\u2019s web content, spam-fighting mechanisms that can facethe flexible strategies of spammers need to be developed.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Krause, Beate and Schmitz, Christoph and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {AIRWeb '08: Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web},<br\/>  keywords = {summer},<br\/>  month = {04},<br\/>  pages = {61--68},<br\/>  publisher = {ACM},<br\/>  title = {The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5b6b648fd25c15d594404ae26fcda6b4\"><p>%0 Conference Paper<br\/>%1 krause2008antisocial<br\/>%A Krause, Beate<br\/>%A Schmitz, Christoph<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B AIRWeb '08: Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web<br\/>%C New York, NY, USA<br\/>%D 2008<br\/>%I ACM<br\/>%P 61--68<br\/>%R 10.1145\/1451983.1451998<br\/>%T The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems<br\/>%U http:\/\/airweb.cse.lehigh.edu\/2008\/submissions\/krause_2008_anti_social_tagger.pdf<br\/>%X The annotation of web sites in social bookmarking systemshas become a popular way to manage and find informationon the web. The community structure of such systems attractsspammers: recent post pages, popular pages or specifictag pages can be manipulated easily. As a result, searchingor tracking recent posts does not deliver quality resultsannotated in the community, but rather unsolicited, oftencommercial, web sites. To retain the benefits of sharingone\u2019s web content, spam-fighting mechanisms that can facethe flexible strategies of spammers need to be developed.<br\/>%@ 978-1-60558-159-0<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Krause, B., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Comparison of Social Bookmarking with Traditional Search<\/span>.<\/span> In: Macdonald, C., Ounis, I., Plachouras, V., Ruthven, I., and White, R.W. (eds.) 30th European Conference on IR Research, ECIR 2008. pp. 101\u2013113. Springer, Glasgow, UK (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ad5f4664d1f5b967a0793b4a26a0edbb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ad5f4664d1f5b967a0793b4a26a0edbb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ad5f4664d1f5b967a0793b4a26a0edbb\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ad5f4664d1f5b967a0793b4a26a0edbb\"><p>@inproceedings{krause08social,<br\/>  address = {Glasgow, UK},<br\/>  author = {Krause, Beate and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {30th European Conference on IR Research, ECIR 2008},<br\/>  editor = {Macdonald, Craig and Ounis, Iadh and Plachouras, Vassilis and Ruthven, Ian and White, Ryen W.},<br\/>  keywords = {bookmarking},<br\/>  month = {04},<br\/>  pages = {101-113},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {A Comparison of Social Bookmarking with Traditional Search},<br\/>  volume = 4956,<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ad5f4664d1f5b967a0793b4a26a0edbb\"><p>%0 Conference Paper<br\/>%1 krause08social<br\/>%A Krause, Beate<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B 30th European Conference on IR Research, ECIR 2008<br\/>%C Glasgow, UK<br\/>%D 2008<br\/>%E Macdonald, Craig<br\/>%E Ounis, Iadh<br\/>%E Plachouras, Vassilis<br\/>%E Ruthven, Ian<br\/>%E White, Ryen W.<br\/>%I Springer<br\/>%P 101-113<br\/>%T A Comparison of Social Bookmarking with Traditional Search<br\/>%V 4956<br\/>%@ 978-3-540-78645-0<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Marinho, L., Hotho, A., Schmidt-Thieme, L., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Tag Recommendations in Social Bookmarking Systems<\/span>.<\/span> AI Communications. 21, 231\u2013247 (2008). https:\/\/doi.org\/10.3233\/AIC-2008-0438.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/jaeschke2008tag.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-955bcf14f3272ba6eaf3dadbef6c0b10\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-955bcf14f3272ba6eaf3dadbef6c0b10\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.3233\/AIC-2008-0438\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/955bcf14f3272ba6eaf3dadbef6c0b10\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-955bcf14f3272ba6eaf3dadbef6c0b10\">Collaborative tagging systems allow users to assign keywords - so called \"tags\" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-955bcf14f3272ba6eaf3dadbef6c0b10\"><p>@article{jaeschke2008tag,<br\/>  abstract = {Collaborative tagging systems allow users to assign keywords - so called \"tags\" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender.},<br\/>  address = {Amsterdam},<br\/>  author = {J\u00e4schke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd},<br\/>  editor = {Giunchiglia, Enrico},<br\/>  journal = {AI Communications},<br\/>  keywords = {selected},<br\/>  month = 12,<br\/>  number = 4,<br\/>  pages = {231--247},<br\/>  publisher = {IOS Press},<br\/>  title = {Tag Recommendations in Social Bookmarking Systems},<br\/>  volume = 21,<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-955bcf14f3272ba6eaf3dadbef6c0b10\"><p>%0 Journal Article<br\/>%1 jaeschke2008tag<br\/>%A J\u00e4schke, Robert<br\/>%A Marinho, Leandro<br\/>%A Hotho, Andreas<br\/>%A Schmidt-Thieme, Lars<br\/>%A Stumme, Gerd<br\/>%C Amsterdam<br\/>%D 2008<br\/>%E Giunchiglia, Enrico<br\/>%I IOS Press<br\/>%J AI Communications<br\/>%N 4<br\/>%P 231--247<br\/>%R 10.3233\/AIC-2008-0438<br\/>%T Tag Recommendations in Social Bookmarking Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/jaeschke2008tag.pdf<br\/>%V 21<br\/>%X Collaborative tagging systems allow users to assign keywords - so called \"tags\" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Grobelnik, M., Hotho, A., J\u00e4schke, R., Mladenic, D., Servedio, V.D.P., Sizov, S., Szomszor, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Analyzing Tag Semantics Across Collaborative Tagging Systems<\/span>.<\/span> In: Alani, H., Staab, S., and Stumme, G. (eds.) Social Web Communities. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2008\/1785\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7ab57438aa5a68137e46dab8dadd4b2c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7ab57438aa5a68137e46dab8dadd4b2c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7ab57438aa5a68137e46dab8dadd4b2c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-7ab57438aa5a68137e46dab8dadd4b2c\">The objective of our group was to exploit state-of-the-art Information Retrieval methods for finding associations and dependencies between tags, capturing and representing differences in tagging behavior and vocabulary of various folksonomies, with the overall aim to better understand the semantics of tags and the tagging process. Therefore we analyze the semantic content of tags in the Flickr and Delicious folksonomies. We find that: tag context similarity leads to meaningful results in Flickr, despite its narrow folksonomy character; the comparison of tags across Flickr and Delicious shows little semantic overlap, being tags in Flickr associated more to visual aspects rather than technological as it seems to be in Delicious; there are regions in the tag-tag space, provided with the cosine similarity metric, that are characterized by high density; the order of tags inside a post has a semantic relevance.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7ab57438aa5a68137e46dab8dadd4b2c\"><p>@inproceedings{benz2008analyzing,<br\/>  abstract = {The objective of our group was to exploit state-of-the-art Information Retrieval methods for finding associations and dependencies between tags, capturing and representing differences in tagging behavior and vocabulary of various folksonomies, with the overall aim to better understand the semantics of tags and the tagging process. Therefore we analyze the semantic content of tags in the Flickr and Delicious folksonomies. We find that: tag context similarity leads to meaningful results in Flickr, despite its narrow folksonomy character; the comparison of tags across Flickr and Delicious shows little semantic overlap, being tags in Flickr associated more to visual aspects rather than technological as it seems to be in Delicious; there are regions in the tag-tag space, provided with the cosine similarity metric, that are characterized by high density; the order of tags inside a post has a semantic relevance.},<br\/>  address = {Dagstuhl, Germany},<br\/>  author = {Benz, Dominik and Grobelnik, Marko and Hotho, Andreas and J\u00e4schke, Robert and Mladenic, Dunja and Servedio, Vito D. P. and Sizov, Sergej and Szomszor, Martin},<br\/>  booktitle = {Social Web Communities},<br\/>  editor = {Alani, Harith and Staab, Steffen and Stumme, Gerd},<br\/>  keywords = {dagstuhl},<br\/>  month = {09},<br\/>  number = {08391},<br\/>  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},<br\/>  series = {Dagstuhl Seminar Proceedings},<br\/>  title = {Analyzing Tag Semantics Across Collaborative Tagging Systems},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7ab57438aa5a68137e46dab8dadd4b2c\"><p>%0 Conference Paper<br\/>%1 benz2008analyzing<br\/>%A Benz, Dominik<br\/>%A Grobelnik, Marko<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Mladenic, Dunja<br\/>%A Servedio, Vito D. P.<br\/>%A Sizov, Sergej<br\/>%A Szomszor, Martin<br\/>%B Social Web Communities<br\/>%C Dagstuhl, Germany<br\/>%D 2008<br\/>%E Alani, Harith<br\/>%E Staab, Steffen<br\/>%E Stumme, Gerd<br\/>%I Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik<br\/>%N 08391<br\/>%T Analyzing Tag Semantics Across Collaborative Tagging Systems<br\/>%U http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2008\/1785<br\/>%X The objective of our group was to exploit state-of-the-art Information Retrieval methods for finding associations and dependencies between tags, capturing and representing differences in tagging behavior and vocabulary of various folksonomies, with the overall aim to better understand the semantics of tags and the tagging process. Therefore we analyze the semantic content of tags in the Flickr and Delicious folksonomies. We find that: tag context similarity leads to meaningful results in Flickr, despite its narrow folksonomy character; the comparison of tags across Flickr and Delicious shows little semantic overlap, being tags in Flickr associated more to visual aspects rather than technological as it seems to be in Delicious; there are regions in the tag-tag space, provided with the cosine similarity metric, that are characterized by high density; the order of tags inside a post has a semantic relevance.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Alani, H., Staab, S., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the Dagstuhl Seminar on Social Web Communities<\/span>.<\/span> Schloss Dagstuhl (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.dagstuhl.de\/en\/program\/calendar\/semhp\/?semnr=08391\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3b7c7ecfeb23871fae0e361f16e7f8de\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3b7c7ecfeb23871fae0e361f16e7f8de\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3b7c7ecfeb23871fae0e361f16e7f8de\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3b7c7ecfeb23871fae0e361f16e7f8de\"><p>@book{alani2008proceedings,<br\/>  editor = {Alani, Harith and Staab, Steffen and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  month = {09},<br\/>  publisher = {Schloss Dagstuhl},<br\/>  title = {Proceedings of the Dagstuhl Seminar on Social Web Communities},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3b7c7ecfeb23871fae0e361f16e7f8de\"><p>%0 Book<br\/>%1 alani2008proceedings<br\/>%D 2008<br\/>%E Alani, Harith<br\/>%E Staab, Steffen<br\/>%E Stumme, Gerd<br\/>%I Schloss Dagstuhl<br\/>%T Proceedings of the Dagstuhl Seminar on Social Web Communities<br\/>%U http:\/\/www.dagstuhl.de\/en\/program\/calendar\/semhp\/?semnr=08391<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J{\u00e4}schke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Discovering shared conceptualizations in folksonomies<\/span>.<\/span> Web Semant. 6, 38\u201353 (2008). https:\/\/doi.org\/http:\/\/dx.doi.org\/10.1016\/j.websem.2007.11.004.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/portal.acm.org\/citation.cfm?id=1346701\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4e27c7e9fff8c5663c4263de19001a94\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4e27c7e9fff8c5663c4263de19001a94\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1016\/j.websem.2007.11.004\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4e27c7e9fff8c5663c4263de19001a94\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-4e27c7e9fff8c5663c4263de19001a94\">Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4e27c7e9fff8c5663c4263de19001a94\"><p>@article{1346701,<br\/>  abstract = {Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.},<br\/>  address = {Amsterdam, The Netherlands, The Netherlands},<br\/>  author = {J{\u00e4}schke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},<br\/>  journal = {Web Semant.},<br\/>  keywords = {analysis},<br\/>  number = 1,<br\/>  pages = {38--53},<br\/>  publisher = {Elsevier Science Publishers B. V.},<br\/>  title = {Discovering shared conceptualizations in folksonomies},<br\/>  volume = 6,<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4e27c7e9fff8c5663c4263de19001a94\"><p>%0 Journal Article<br\/>%1 1346701<br\/>%A J{\u00e4}schke, Robert<br\/>%A Hotho, Andreas<br\/>%A Schmitz, Christoph<br\/>%A Ganter, Bernhard<br\/>%A Stumme, Gerd<br\/>%C Amsterdam, The Netherlands, The Netherlands<br\/>%D 2008<br\/>%I Elsevier Science Publishers B. V.<br\/>%J Web Semant.<br\/>%N 1<br\/>%P 38--53<br\/>%R http:\/\/dx.doi.org\/10.1016\/j.websem.2007.11.004<br\/>%T Discovering shared conceptualizations in folksonomies<br\/>%U http:\/\/portal.acm.org\/citation.cfm?id=1346701<br\/>%V 6<br\/>%X Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bade, K., Benz, D.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Evaluation Strategies for Learning Algorithms of Hierarchical Structures<\/span>.<\/span> In: Proceedings of the 32nd Annual Conference of the German Classification Society - Advances in Data Analysis, Data Handling and Business Intelligence (GfKl 2008). Springer, Berlin-Heidelberg (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/bade2008evaluation.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ec033805bc90ab87c99860e29f0d00dd\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ec033805bc90ab87c99860e29f0d00dd\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ec033805bc90ab87c99860e29f0d00dd\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-ec033805bc90ab87c99860e29f0d00dd\">Several learning tasks comprise hierarchies. Comparison with a \"goldstandard\" is often performed to evaluate the quality of a learned hierarchy. We assembled various similarity metrics that have been proposed in different disciplines and compared them in a unified interdisciplinary framework for hierarchical evaluation which is based on the distinction of three fundamental dimensions. Identifying deficiencies for measuring structural similarity, we suggest three new measures for this purpose, either extending existing ones or based on new ideas. Experiments with an artificial dataset were performed to compare the different measures. As shown by our results, the measures vary greatly in their properties.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ec033805bc90ab87c99860e29f0d00dd\"><p>@inproceedings{bade2008evaluation,<br\/>  abstract = {Several learning tasks comprise hierarchies. Comparison with a \"goldstandard\" is often performed to evaluate the quality of a learned hierarchy. We assembled various similarity metrics that have been proposed in different disciplines and compared them in a unified interdisciplinary framework for hierarchical evaluation which is based on the distinction of three fundamental dimensions. Identifying deficiencies for measuring structural similarity, we suggest three new measures for this purpose, either extending existing ones or based on new ideas. Experiments with an artificial dataset were performed to compare the different measures. As shown by our results, the measures vary greatly in their properties.},<br\/>  address = {Berlin-Heidelberg},<br\/>  author = {Bade, Korinna and Benz, Dominik},<br\/>  booktitle = {Proceedings of the 32nd Annual Conference of the German Classification Society - Advances in Data Analysis, Data Handling and Business Intelligence (GfKl 2008)},<br\/>  keywords = {itegpub},<br\/>  note = {in press},<br\/>  publisher = {Springer},<br\/>  series = {Studies in Classification, Data Analysis, and Knowledge Organization},<br\/>  title = {Evaluation Strategies for Learning Algorithms of Hierarchical Structures},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ec033805bc90ab87c99860e29f0d00dd\"><p>%0 Conference Paper<br\/>%1 bade2008evaluation<br\/>%A Bade, Korinna<br\/>%A Benz, Dominik<br\/>%B Proceedings of the 32nd Annual Conference of the German Classification Society - Advances in Data Analysis, Data Handling and Business Intelligence (GfKl 2008)<br\/>%C Berlin-Heidelberg<br\/>%D 2008<br\/>%I Springer<br\/>%T Evaluation Strategies for Learning Algorithms of Hierarchical Structures<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/bade2008evaluation.pdf<br\/>%X Several learning tasks comprise hierarchies. Comparison with a \"goldstandard\" is often performed to evaluate the quality of a learned hierarchy. We assembled various similarity metrics that have been proposed in different disciplines and compared them in a unified interdisciplinary framework for hierarchical evaluation which is based on the distinction of three fundamental dimensions. Identifying deficiencies for measuring structural similarity, we suggest three new measures for this purpose, either extending existing ones or based on new ideas. Experiments with an artificial dataset were performed to compare the different measures. As shown by our results, the measures vary greatly in their properties.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Glance, N., Hotho, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Wikis, Blogs, Bookmarking Tools - Mining the Web 2.0 Workshop<\/span>.<\/span> Workshop at 18th Europ. Conf. on Machine Learning (ECML\u201908) \/ 11th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD\u201908) (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/wbbtmine2008\/pdf\/all_wbbtmine2008.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-50f6cd75018d7ee98f49c5ab4ef0faaf\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-50f6cd75018d7ee98f49c5ab4ef0faaf\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/50f6cd75018d7ee98f49c5ab4ef0faaf\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-50f6cd75018d7ee98f49c5ab4ef0faaf\"><p>@book{berendt2008challenge,<br\/>  editor = {Berendt, Bettina and Glance, Natalie and Hotho, Andreas},<br\/>  keywords = {blog},<br\/>  publisher = {Workshop at 18th Europ. Conf. on Machine Learning (ECML'08) \/ 11th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'08)},<br\/>  title = {Wikis, Blogs, Bookmarking Tools - Mining the Web 2.0 Workshop},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-50f6cd75018d7ee98f49c5ab4ef0faaf\"><p>%0 Book<br\/>%1 berendt2008challenge<br\/>%D 2008<br\/>%E Berendt, Bettina<br\/>%E Glance, Natalie<br\/>%E Hotho, Andreas<br\/>%I Workshop at 18th Europ. Conf. on Machine Learning (ECML'08) \/ 11th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'08)<br\/>%T Wikis, Blogs, Bookmarking Tools - Mining the Web 2.0 Workshop<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/wbbtmine2008\/pdf\/all_wbbtmine2008.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Benz, D., J\u00e4schke, R., Krause, B. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">ECML PKDD Discovery Challenge 2008 (RSDC\u201908)<\/span>.<\/span> Workshop at 18th Europ. Conf. on Machine Learning (ECML\u201908) \/ 11th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD\u201908) (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/rsdc08\/pdf\/all_rsdc_v2.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1d5d5ef0bb222cb2f3adef4d6b06f1ea\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1d5d5ef0bb222cb2f3adef4d6b06f1ea\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1d5d5ef0bb222cb2f3adef4d6b06f1ea\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1d5d5ef0bb222cb2f3adef4d6b06f1ea\"><p>@book{hotho2008challenge,<br\/>  editor = {Hotho, Andreas and Benz, Dominik and J\u00e4schke, Robert and Krause, Beate},<br\/>  keywords = {PKDD},<br\/>  publisher = {Workshop at 18th Europ. Conf. on Machine Learning (ECML'08) \/ 11th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'08)},<br\/>  title = {ECML PKDD Discovery Challenge 2008 (RSDC'08)},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1d5d5ef0bb222cb2f3adef4d6b06f1ea\"><p>%0 Book<br\/>%1 hotho2008challenge<br\/>%D 2008<br\/>%E Hotho, Andreas<br\/>%E Benz, Dominik<br\/>%E J\u00e4schke, Robert<br\/>%E Krause, Beate<br\/>%I Workshop at 18th Europ. Conf. on Machine Learning (ECML'08) \/ 11th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'08)<br\/>%T ECML PKDD Discovery Challenge 2008 (RSDC'08)<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/rsdc08\/pdf\/all_rsdc_v2.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Krause, B., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Logsonomy \u2014 A Search Engine Folksonomy<\/span>.<\/span> In: Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008). AAAI Press (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2008\/Krause2008logsonomy_short.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-359e1eccdc524334d4a2ad51330f76ae\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-359e1eccdc524334d4a2ad51330f76ae\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/359e1eccdc524334d4a2ad51330f76ae\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-359e1eccdc524334d4a2ad51330f76ae\">In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Search engines filter the vast information of the web. Queries describe a user\u2019s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. The clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. This poster analyzes the topological characteristics of the resulting tripartite hypergraph of queries, users and bookmarks of two query logs and compares it two a snapshot of the folksonomy del.icio.us.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-359e1eccdc524334d4a2ad51330f76ae\"><p>@inproceedings{Jaeschke2008logsonomy,<br\/>  abstract = {In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Search engines filter the vast information of the web. Queries describe a user\u2019s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. The clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. This poster analyzes the topological characteristics of the resulting tripartite hypergraph of queries, users and bookmarks of two query logs and compares it two a snapshot of the folksonomy del.icio.us.},<br\/>  author = {J\u00e4schke, Robert and Krause, Beate and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008)},<br\/>  keywords = {search},<br\/>  publisher = {AAAI Press},<br\/>  title = {Logsonomy \u2014 A Search Engine Folksonomy},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-359e1eccdc524334d4a2ad51330f76ae\"><p>%0 Conference Paper<br\/>%1 Jaeschke2008logsonomy<br\/>%A J\u00e4schke, Robert<br\/>%A Krause, Beate<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008)<br\/>%D 2008<br\/>%I AAAI Press<br\/>%T Logsonomy \u2014 A Search Engine Folksonomy<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2008\/Krause2008logsonomy_short.pdf<br\/>%X In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Search engines filter the vast information of the web. Queries describe a user\u2019s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. The clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. This poster analyzes the topological characteristics of the resulting tripartite hypergraph of queries, users and bookmarks of two query logs and compares it two a snapshot of the folksonomy del.icio.us.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Macek, B.-E.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Synopsen-Sharing zur effizienten Anfrageverarbeitung in Datenstr\u00f6men<\/span>.<\/span> (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d04e3fb723ea8d3e2860591c894899ea\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d04e3fb723ea8d3e2860591c894899ea\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d04e3fb723ea8d3e2860591c894899ea\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d04e3fb723ea8d3e2860591c894899ea\"><p>@article{macek2008synopsensharing,<br\/>  author = {Macek, Bj\u00f6rn-Elmar},<br\/>  keywords = {MyOwn},<br\/>  title = {Synopsen-Sharing zur effizienten Anfrageverarbeitung in Datenstr\u00f6men},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d04e3fb723ea8d3e2860591c894899ea\"><p>%0 Journal Article<br\/>%1 macek2008synopsensharing<br\/>%A Macek, Bj\u00f6rn-Elmar<br\/>%D 2008<br\/>%T Synopsen-Sharing zur effizienten Anfrageverarbeitung in Datenstr\u00f6men<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Illig, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Machine Learnability Analysis of Textclassifications in a Social Bookmarking Folksonomy<\/span><\/span>, (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9a65067da65e8301182b33b4ae292141\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9a65067da65e8301182b33b4ae292141\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9a65067da65e8301182b33b4ae292141\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9a65067da65e8301182b33b4ae292141\">Social-bookmarking systems such as del.icio.us let users label resources with freely chosen key- words that they find most useful for their intentions. These keywords are also known as tags. The cumulated information from tag assignments by a large community of users constitutes a folksonomy. This thesis analyses how well tag assignments in a folksonomy, that are assigned to semistructured English texts can be found by automatic text classification systems. Therefore, the machine learning algorithms SVM, k-NN, multinomial naive Bayes, and Rocchio have been evaluated for their effectiveness with such data.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9a65067da65e8301182b33b4ae292141\"><p>@mastersthesis{dipl1,<br\/>  abstract = {Social-bookmarking systems such as del.icio.us let users label resources with freely chosen key- words that they find most useful for their intentions. These keywords are also known as tags. The cumulated information from tag assignments by a large community of users constitutes a folksonomy. This thesis analyses how well tag assignments in a folksonomy, that are assigned to semistructured English texts can be found by automatic text classification systems. Therefore, the machine learning algorithms SVM, k-NN, multinomial naive Bayes, and Rocchio have been evaluated for their effectiveness with such data.},<br\/>  address = {Kassel},<br\/>  author = {Illig, Jens},<br\/>  keywords = {bookmarking},<br\/>  school = {University of Kassel},<br\/>  title = {Machine Learnability Analysis of Textclassifications in a Social Bookmarking Folksonomy},<br\/>  type = {Bachelor Thesis},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9a65067da65e8301182b33b4ae292141\"><p>%0 Thesis<br\/>%1 dipl1<br\/>%A Illig, Jens<br\/>%C Kassel<br\/>%D 2008<br\/>%T Machine Learnability Analysis of Textclassifications in a Social Bookmarking Folksonomy<br\/>%X Social-bookmarking systems such as del.icio.us let users label resources with freely chosen key- words that they find most useful for their intentions. These keywords are also known as tags. The cumulated information from tag assignments by a large community of users constitutes a folksonomy. This thesis analyses how well tag assignments in a folksonomy, that are assigned to semistructured English texts can be found by automatic text classification systems. Therefore, the machine learning algorithms SVM, k-NN, multinomial naive Bayes, and Rocchio have been evaluated for their effectiveness with such data.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Krause, B., J\u00e4schke, R., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Logsonomy - Social Information Retrieval with Logdata<\/span>.<\/span> In: HT \u201908: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia. pp. 157\u2013166. ACM, Pittsburgh, PA, USA (2008). https:\/\/doi.org\/10.1145\/1379092.1379123.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/krause2008logsonomy.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e64d14f3207766f4afc65983fa759ffe\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e64d14f3207766f4afc65983fa759ffe\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1145\/1379092.1379123\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e64d14f3207766f4afc65983fa759ffe\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-e64d14f3207766f4afc65983fa759ffe\">Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Today\u2019s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user\u2019s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. This clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large snapshot of del.icio.us and on query logs of two large search engines. All of the three datasets show small world properties. The tagging behavior of users, which is explained by preferential attachment of the tags in social bookmark systems, is reflected in the distribution of single query words in search engines. We can conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of social bookmarking users is driven by similar dynamics.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e64d14f3207766f4afc65983fa759ffe\"><p>@inproceedings{krause2008logsonomy,<br\/>  abstract = {Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Today\u2019s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user\u2019s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. This clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large snapshot of del.icio.us and on query logs of two large search engines. All of the three datasets show small world properties. The tagging behavior of users, which is explained by preferential attachment of the tags in social bookmark systems, is reflected in the distribution of single query words in search engines. We can conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of social bookmarking users is driven by similar dynamics.},<br\/>  address = {New York, NY, USA},<br\/>  author = {Krause, Beate and J\u00e4schke, Robert and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia},<br\/>  keywords = {information},<br\/>  pages = {157--166},<br\/>  publisher = {ACM},<br\/>  title = {Logsonomy - Social Information Retrieval with Logdata},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e64d14f3207766f4afc65983fa759ffe\"><p>%0 Conference Paper<br\/>%1 krause2008logsonomy<br\/>%A Krause, Beate<br\/>%A J\u00e4schke, Robert<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia<br\/>%C New York, NY, USA<br\/>%D 2008<br\/>%I ACM<br\/>%P 157--166<br\/>%R 10.1145\/1379092.1379123<br\/>%T Logsonomy - Social Information Retrieval with Logdata<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/krause2008logsonomy.pdf<br\/>%X Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Today\u2019s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user\u2019s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. This clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large snapshot of del.icio.us and on query logs of two large search engines. All of the three datasets show small world properties. The tagging behavior of users, which is explained by preferential attachment of the tags in social bookmark systems, is reflected in the distribution of single query words in search engines. We can conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of social bookmarking users is driven by similar dynamics.<br\/>%@ 978-1-59593-985-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Brulic, S., Brulic, S., Deppe, P., Eschweiler, D., Etemadi, R., Herbold, K., Konersmann, C., Meiche, R., Scholz, C., Timm, N., Uckermann, A., Weber, E., Zorn, R.C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">CSI: PC2 - A High Performance Biometrie System<\/span>.<\/span> In: Informatiktage. pp. 209\u2013212. GI (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7f262c1d252fca6bce6c5fc795fd1cba\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7f262c1d252fca6bce6c5fc795fd1cba\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7f262c1d252fca6bce6c5fc795fd1cba\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7f262c1d252fca6bce6c5fc795fd1cba\"><p>@inproceedings{DBLP:conf\/informatiktage\/BrulicBDEEHKMSTUWZ08,<br\/>  author = {Brulic, Samir and Brulic, Samira and Deppe, Pascal and Eschweiler, Dominic and Etemadi, Rosbeh and Herbold, Klaus and Konersmann, Christian and Meiche, Robert and Scholz, Christoph and Timm, Nils and Uckermann, Andre and Weber, Elmar and Zorn, Rene C.},<br\/>  booktitle = {Informatiktage},<br\/>  crossref = {DBLP:conf\/informatiktage\/2008},<br\/>  keywords = {pc2},<br\/>  pages = {209-212},<br\/>  publisher = {GI},<br\/>  series = {LNI},<br\/>  title = {CSI: PC2 - A High Performance Biometrie System},<br\/>  volume = {S-6},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7f262c1d252fca6bce6c5fc795fd1cba\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/informatiktage\/BrulicBDEEHKMSTUWZ08<br\/>%A Brulic, Samir<br\/>%A Brulic, Samira<br\/>%A Deppe, Pascal<br\/>%A Eschweiler, Dominic<br\/>%A Etemadi, Rosbeh<br\/>%A Herbold, Klaus<br\/>%A Konersmann, Christian<br\/>%A Meiche, Robert<br\/>%A Scholz, Christoph<br\/>%A Timm, Nils<br\/>%A Uckermann, Andre<br\/>%A Weber, Elmar<br\/>%A Zorn, Rene C.<br\/>%B Informatiktage<br\/>%D 2008<br\/>%I GI<br\/>%P 209-212<br\/>%T CSI: PC2 - A High Performance Biometrie System<br\/>%V S-6<br\/>%@ 978-3-88579-440-0<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">V\u00f6lker, J., Vrande\u010di\u0107, D., Sure, Y., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">AEON - An approach to the automatic evaluation of ontologies<\/span>.<\/span> Applied Ontology. 3, 41\u201362 (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/portal.acm.org\/citation.cfm?id=1412422\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f8f0bb3e3495e7627770b470d1a5f1a3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f8f0bb3e3495e7627770b470d1a5f1a3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f8f0bb3e3495e7627770b470d1a5f1a3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-f8f0bb3e3495e7627770b470d1a5f1a3\">OntoClean is an approach towards the formal evaluation of taxonomic relations in ontologies. The application of OntoClean consists of two main steps. First, concepts are tagged according to meta-properties known as rigidity, unity, dependency and identity. Second, the tagged concepts are checked according to predefined constraints to discover taxonomic errors. Although OntoClean is well documented in numerous publications, it is still used rather infrequently due to the high costs of application. Especially, the manual tagging of concepts with the correct meta-properties requires substantial efforts of highly experienced ontology engineers. In order to facilitate the use of OntoClean and to enable the evaluation of real-world ontologies, we provide AEON, a tool which automatically tags concepts with appropriate OntoClean meta-properties and performs the constraint checking. We use the Web as an embodiment of world knowledge, where we search for patterns that indicate how to properly tag concepts. We thoroughly evaluated our approach against a manually created gold standard. The evaluation shows the competitiveness of our approach while at the same time significantly lowering the costs. All of our results, i.e. the tool AEON as well as the experiment data, are publicly available.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f8f0bb3e3495e7627770b470d1a5f1a3\"><p>@article{voelker2008aeon,<br\/>  abstract = {OntoClean is an approach towards the formal evaluation of taxonomic relations in ontologies. The application of OntoClean consists of two main steps. First, concepts are tagged according to meta-properties known as rigidity, unity, dependency and identity. Second, the tagged concepts are checked according to predefined constraints to discover taxonomic errors. Although OntoClean is well documented in numerous publications, it is still used rather infrequently due to the high costs of application. Especially, the manual tagging of concepts with the correct meta-properties requires substantial efforts of highly experienced ontology engineers. In order to facilitate the use of OntoClean and to enable the evaluation of real-world ontologies, we provide AEON, a tool which automatically tags concepts with appropriate OntoClean meta-properties and performs the constraint checking. We use the Web as an embodiment of world knowledge, where we search for patterns that indicate how to properly tag concepts. We thoroughly evaluated our approach against a manually created gold standard. The evaluation shows the competitiveness of our approach while at the same time significantly lowering the costs. All of our results, i.e. the tool AEON as well as the experiment data, are publicly available.},<br\/>  address = {Amsterdam, The Netherlands, The Netherlands},<br\/>  author = {V\u00f6lker, Johanna and Vrande\u010di\u0107, Denny and Sure, York and Hotho, Andreas},<br\/>  journal = {Applied Ontology},<br\/>  keywords = {ontology},<br\/>  number = {1-2},<br\/>  pages = {41--62},<br\/>  publisher = {IOS Press},<br\/>  title = {AEON - An approach to the automatic evaluation of ontologies},<br\/>  volume = 3,<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f8f0bb3e3495e7627770b470d1a5f1a3\"><p>%0 Journal Article<br\/>%1 voelker2008aeon<br\/>%A V\u00f6lker, Johanna<br\/>%A Vrande\u010di\u0107, Denny<br\/>%A Sure, York<br\/>%A Hotho, Andreas<br\/>%C Amsterdam, The Netherlands, The Netherlands<br\/>%D 2008<br\/>%I IOS Press<br\/>%J Applied Ontology<br\/>%N 1-2<br\/>%P 41--62<br\/>%T AEON - An approach to the automatic evaluation of ontologies<br\/>%U http:\/\/portal.acm.org\/citation.cfm?id=1412422<br\/>%V 3<br\/>%X OntoClean is an approach towards the formal evaluation of taxonomic relations in ontologies. The application of OntoClean consists of two main steps. First, concepts are tagged according to meta-properties known as rigidity, unity, dependency and identity. Second, the tagged concepts are checked according to predefined constraints to discover taxonomic errors. Although OntoClean is well documented in numerous publications, it is still used rather infrequently due to the high costs of application. Especially, the manual tagging of concepts with the correct meta-properties requires substantial efforts of highly experienced ontology engineers. In order to facilitate the use of OntoClean and to enable the evaluation of real-world ontologies, we provide AEON, a tool which automatically tags concepts with appropriate OntoClean meta-properties and performs the constraint checking. We use the Web as an embodiment of world knowledge, where we search for patterns that indicate how to properly tag concepts. We thoroughly evaluated our approach against a manually created gold standard. The evaluation shows the competitiveness of our approach while at the same time significantly lowering the costs. All of our results, i.e. the tool AEON as well as the experiment data, are publicly available.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">May, M., Berendt, B., Cornu\u00e9jols, A., Gama, J., Giannotti, F., Hotho, A., Malerba, D., Menesalvas, E., Morik, K., Pedersen, R., Saitta, L., Saygin, Y., Schuster, A., Vanhoof, K.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Research Challenges in Ubiquitous Knowledge Discovery<\/span>.<\/span> In: Next Generation of Data Mining (Chapman &amp; Hall\/Crc Data Mining and Knowledge Discovery Series). Chapman &amp; Hall\/CRC (2008).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/208.254.79.11\/shopping_cart\/products\/product_contents.asp?id=&parent_id=497&sku=C5867&isbn=9781420085860&pc=\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-be3c753af98ab591b4f31d349513b461\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-be3c753af98ab591b4f31d349513b461\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/be3c753af98ab591b4f31d349513b461\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-be3c753af98ab591b4f31d349513b461\"><p>@incollection{1420085867,<br\/>  author = {May, Michael and Berendt, Bettina and Cornu\u00e9jols, Antoine and Gama, J\u00f5ao and Giannotti, Fosca and Hotho, Andreas and Malerba, Donato and Menesalvas, Ernestina and Morik, Katharina and Pedersen, Rasmus and Saitta, Lorenza and Saygin, Y\u00fccel and Schuster, Assaf and Vanhoof, Koen},<br\/>  booktitle = {Next Generation of Data Mining (Chapman & Hall\/Crc Data Mining and Knowledge Discovery Series)},<br\/>  edition = 1,<br\/>  keywords = {kdd},<br\/>  publisher = {Chapman & Hall\/CRC},<br\/>  title = {Research Challenges in Ubiquitous Knowledge Discovery},<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-be3c753af98ab591b4f31d349513b461\"><p>%0 Book Section<br\/>%1 1420085867<br\/>%A May, Michael<br\/>%A Berendt, Bettina<br\/>%A Cornu\u00e9jols, Antoine<br\/>%A Gama, J\u00f5ao<br\/>%A Giannotti, Fosca<br\/>%A Hotho, Andreas<br\/>%A Malerba, Donato<br\/>%A Menesalvas, Ernestina<br\/>%A Morik, Katharina<br\/>%A Pedersen, Rasmus<br\/>%A Saitta, Lorenza<br\/>%A Saygin, Y\u00fccel<br\/>%A Schuster, Assaf<br\/>%A Vanhoof, Koen<br\/>%B Next Generation of Data Mining (Chapman & Hall\/Crc Data Mining and Knowledge Discovery Series)<br\/>%D 2008<br\/>%I Chapman & Hall\/CRC<br\/>%T Research Challenges in Ubiquitous Knowledge Discovery<br\/>%U http:\/\/208.254.79.11\/shopping_cart\/products\/product_contents.asp?id=&parent_id=497&sku=C5867&isbn=9781420085860&pc=<br\/>%7 1<br\/>%@ 1420085867<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cattuto, C., Benz, D., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}<\/span>.<\/span> In: Sheth, A., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., and Thirunarayan, K. (eds.) The Semantic Web - ISWC 2008. pp. 615\u2013631. Springer Berlin \/ Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88564-1\\_39.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/tagora-project.eu\/wp-content\/2009\/09\/cattuto_iswc2008.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-022ccb7184fcd0e43092fca13fd56a00\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-022ccb7184fcd0e43092fca13fd56a00\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-540-88564-1\\_39\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/022ccb7184fcd0e43092fca13fd56a00\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-022ccb7184fcd0e43092fca13fd56a00\">{Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Even though most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptions on the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity in terms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures of tag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding is provided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measures of semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of the investigated similarity measures and indicates which ones are better suited in the context of a given semantic application.}<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-022ccb7184fcd0e43092fca13fd56a00\"><p>@incollection{tagging-cattuto,<br\/>  abstract = {{Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Even though most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptions on the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity in terms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures of tag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding is provided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measures of semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of the investigated similarity measures and indicates which ones are better suited in the context of a given semantic application.}},<br\/>  author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {The Semantic Web - ISWC 2008},<br\/>  editor = {Sheth, Amit and Staab, Steffen and Dean, Mike and Paolucci, Massimo and Maynard, Diana and Finin, Timothy and Thirunarayan, Krishnaprasad},<br\/>  journal = {The Semantic Web - ISWC 2008},<br\/>  keywords = {grounding},<br\/>  pages = {615--631},<br\/>  publisher = {Springer Berlin \/ Heidelberg},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {{Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}},<br\/>  volume = 5318,<br\/>  year = 2008<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-022ccb7184fcd0e43092fca13fd56a00\"><p>%0 Book Section<br\/>%1 tagging-cattuto<br\/>%A Cattuto, Ciro<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B The Semantic Web - ISWC 2008<br\/>%D 2008<br\/>%E Sheth, Amit<br\/>%E Staab, Steffen<br\/>%E Dean, Mike<br\/>%E Paolucci, Massimo<br\/>%E Maynard, Diana<br\/>%E Finin, Timothy<br\/>%E Thirunarayan, Krishnaprasad<br\/>%I Springer Berlin \/ Heidelberg<br\/>%J The Semantic Web - ISWC 2008<br\/>%P 615--631<br\/>%R 10.1007\/978-3-540-88564-1\\_39<br\/>%T {Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}<br\/>%U http:\/\/tagora-project.eu\/wp-content\/2009\/09\/cattuto_iswc2008.pdf<br\/>%V 5318<br\/>%X {Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Even though most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptions on the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity in terms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures of tag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding is provided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measures of semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of the investigated similarity measures and indicates which ones are better suited in the context of a given semantic application.}<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2007\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2007<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Tso, K.H.L., Schmidt-Thieme, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Supporting Collaborative Hierarchical Classification: Bookmarks as an Example<\/span>.<\/span> Special Issue of the Computer Networks journal on Innovations in Web Communications Infrastructure. 51, 4574\u20134585 (2007). https:\/\/doi.org\/http:\/\/dx.doi.org\/10.1016\/j.comnet.2007.06.014.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2007supporting.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ec4387ab22950b38a0c152d4f33b0987\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ec4387ab22950b38a0c152d4f33b0987\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1016\/j.comnet.2007.06.014\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ec4387ab22950b38a0c152d4f33b0987\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-ec4387ab22950b38a0c152d4f33b0987\">Bookmarks (or favorites, hotlists) are popular strategies to relocate interesting websites on the WWW by creating a personalized URL repository. Most current browsers offer a facility to locally store and manage bookmarks in a hierarchy of folders; though, with growing size, users reportedly have trouble to create and maintain a stable organization structure. This paper presents a novel collaborative approach to ease bookmark management, especially the \u201cclassification\ufffd? of new bookmarks into a folder. We propose a methodology to realize the collaborative classification idea of considering how similar users have classified a bookmark. A combination of nearest-neighbor-classifiers is used to derive a recommendation from similar users on where to store a new bookmark. A prototype system called CariBo has been implemented as a plugin for the central bookmark server software SiteBar. All findings have been evaluated on a reasonably large scale, real user dataset with promising results, and possible implications for shared and social bookmarking systems are discussed.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ec4387ab22950b38a0c152d4f33b0987\"><p>@article{benz2007supporting,<br\/>  abstract = {Bookmarks (or favorites, hotlists) are popular strategies to relocate interesting websites on the WWW by creating a personalized URL repository. Most current browsers offer a facility to locally store and manage bookmarks in a hierarchy of folders; though, with growing size, users reportedly have trouble to create and maintain a stable organization structure. This paper presents a novel collaborative approach to ease bookmark management, especially the \u201cclassification\ufffd? of new bookmarks into a folder. We propose a methodology to realize the collaborative classification idea of considering how similar users have classified a bookmark. A combination of nearest-neighbor-classifiers is used to derive a recommendation from similar users on where to store a new bookmark. A prototype system called CariBo has been implemented as a plugin for the central bookmark server software SiteBar. All findings have been evaluated on a reasonably large scale, real user dataset with promising results, and possible implications for shared and social bookmarking systems are discussed.},<br\/>  author = {Benz, Dominik and Tso, Karen H. L. and Schmidt-Thieme, Lars},<br\/>  journal = {Special Issue of the Computer Networks journal on Innovations in Web Communications Infrastructure},<br\/>  keywords = {itegpub},<br\/>  number = 16,<br\/>  pages = {4574--4585},<br\/>  title = {Supporting Collaborative Hierarchical Classification: Bookmarks as an Example},<br\/>  volume = 51,<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ec4387ab22950b38a0c152d4f33b0987\"><p>%0 Journal Article<br\/>%1 benz2007supporting<br\/>%A Benz, Dominik<br\/>%A Tso, Karen H. L.<br\/>%A Schmidt-Thieme, Lars<br\/>%D 2007<br\/>%J Special Issue of the Computer Networks journal on Innovations in Web Communications Infrastructure<br\/>%N 16<br\/>%P 4574--4585<br\/>%R http:\/\/dx.doi.org\/10.1016\/j.comnet.2007.06.014<br\/>%T Supporting Collaborative Hierarchical Classification: Bookmarks as an Example<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2007supporting.pdf<br\/>%V 51<br\/>%X Bookmarks (or favorites, hotlists) are popular strategies to relocate interesting websites on the WWW by creating a personalized URL repository. Most current browsers offer a facility to locally store and manage bookmarks in a hierarchy of folders; though, with growing size, users reportedly have trouble to create and maintain a stable organization structure. This paper presents a novel collaborative approach to ease bookmark management, especially the \u201cclassification\ufffd? of new bookmarks into a folder. We propose a methodology to realize the collaborative classification idea of considering how similar users have classified a bookmark. A combination of nearest-neighbor-classifiers is used to derive a recommendation from similar users on where to store a new bookmark. A prototype system called CariBo has been implemented as a plugin for the central bookmark server software SiteBar. All findings have been evaluated on a reasonably large scale, real user dataset with promising results, and possible implications for shared and social bookmarking systems are discussed.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cattuto, C., Schmitz, C., Baldassarri, A., Servedio, V.D.P., Loreto, V., Hotho, A., Grahl, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Network Properties of Folksonomies<\/span>.<\/span> AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering\u2019\u2019. 20, 245\u2013262 (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2007\/cattuto2007network.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-da6c676c5664017247c7564fc247b190\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-da6c676c5664017247c7564fc247b190\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/da6c676c5664017247c7564fc247b190\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-da6c676c5664017247c7564fc247b190\"><p>@article{cattuto2007network,<br\/>  author = {Cattuto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and Hotho, Andreas and Grahl, Miranda and Stumme, Gerd},<br\/>  editor = {Hoche, Susanne and N\u00fcrnberger, Andreas and Flach, J\u00fcrgen},<br\/>  journal = {AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering''},<br\/>  keywords = {itegpub},<br\/>  number = 4,<br\/>  pages = {245-262},<br\/>  publisher = {IOS Press},<br\/>  title = {Network Properties of Folksonomies},<br\/>  volume = 20,<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-da6c676c5664017247c7564fc247b190\"><p>%0 Journal Article<br\/>%1 cattuto2007network<br\/>%A Cattuto, Ciro<br\/>%A Schmitz, Christoph<br\/>%A Baldassarri, Andrea<br\/>%A Servedio, Vito D. P.<br\/>%A Loreto, Vittorio<br\/>%A Hotho, Andreas<br\/>%A Grahl, Miranda<br\/>%A Stumme, Gerd<br\/>%D 2007<br\/>%E Hoche, Susanne<br\/>%E N\u00fcrnberger, Andreas<br\/>%E Flach, J\u00fcrgen<br\/>%I IOS Press<br\/>%J AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering''<br\/>%N 4<br\/>%P 245-262<br\/>%T Network Properties of Folksonomies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2007\/cattuto2007network.pdf<br\/>%V 20<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Grahl, M., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Clustering of Social Bookmarking Sites<\/span>.<\/span> In: 7th International Conference on Knowledge Management (I-KNOW \u201907). pp. 356\u2013364. Know-Center, Graz, Austria (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-334d3ab11400c4a3ea3ed5b1e95c1855\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-334d3ab11400c4a3ea3ed5b1e95c1855\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/334d3ab11400c4a3ea3ed5b1e95c1855\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-334d3ab11400c4a3ea3ed5b1e95c1855\">Currently, social bookmarking systems provide intuitive support for browsing locally their content. A global view is usually presented by the tag cloud of the system, but it does not allow a conceptual drill-down, e. g., along a conceptual hierarchy. In this paper, we present a clustering approach for computing such a conceptual hierarchy for a given folksonomy. The hierarchy is complemented with ranked lists of users and resources most related to each cluster. The rankings are computed using our FolkRank algorithm. We have evaluated our approach on large scale data from the del.icio.us bookmarking system.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-334d3ab11400c4a3ea3ed5b1e95c1855\"><p>@inproceedings{grahl2007clustering,<br\/>  abstract = {Currently, social bookmarking systems provide intuitive support for browsing locally their content. A global view is usually presented by the tag cloud of the system, but it does not allow a conceptual drill-down, e. g., along a conceptual hierarchy. In this paper, we present a clustering approach for computing such a conceptual hierarchy for a given folksonomy. The hierarchy is complemented with ranked lists of users and resources most related to each cluster. The rankings are computed using our FolkRank algorithm. We have evaluated our approach on large scale data from the del.icio.us bookmarking system.},<br\/>  address = {Graz, Austria},<br\/>  author = {Grahl, Miranda and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {7th International Conference on Knowledge Management (I-KNOW '07)},<br\/>  keywords = {itegpub},<br\/>  month = {09},<br\/>  pages = {356-364},<br\/>  publisher = {Know-Center},<br\/>  title = {Conceptual Clustering of Social Bookmarking Sites},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-334d3ab11400c4a3ea3ed5b1e95c1855\"><p>%0 Conference Paper<br\/>%1 grahl2007clustering<br\/>%A Grahl, Miranda<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B 7th International Conference on Knowledge Management (I-KNOW '07)<br\/>%C Graz, Austria<br\/>%D 2007<br\/>%I Know-Center<br\/>%P 356-364<br\/>%T Conceptual Clustering of Social Bookmarking Sites<br\/>%X Currently, social bookmarking systems provide intuitive support for browsing locally their content. A global view is usually presented by the tag cloud of the system, but it does not allow a conceptual drill-down, e. g., along a conceptual hierarchy. In this paper, we present a clustering approach for computing such a conceptual hierarchy for a given folksonomy. The hierarchy is complemented with ranked lists of users and resources most related to each cluster. The rankings are computed using our FolkRank algorithm. We have evaluated our approach on large scale data from the del.icio.us bookmarking system.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Self-Organized Collaborative Knowledge Management<\/span><\/span>, http:\/\/www.uni-kassel.de\/upress\/online\/frei\/978-3-89958-325-0.volltext.frei.pdf, (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.uni-kassel.de\/upress\/online\/frei\/978-3-89958-325-0.volltext.frei.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c4b8b978143d4e9b7c677b5945f2973d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c4b8b978143d4e9b7c677b5945f2973d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c4b8b978143d4e9b7c677b5945f2973d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c4b8b978143d4e9b7c677b5945f2973d\"><p>@phdthesis{schmitz2007self,<br\/>  author = {Schmitz, Christoph},<br\/>  keywords = {peertopeer},<br\/>  month = {09},<br\/>  pages = 217,<br\/>  publisher = {Kassel University Press},<br\/>  school = {Universit\u00e4t Kassel},<br\/>  title = {Self-Organized Collaborative Knowledge Management},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c4b8b978143d4e9b7c677b5945f2973d\"><p>%0 Thesis<br\/>%1 schmitz2007self<br\/>%A Schmitz, Christoph<br\/>%D 2007<br\/>%I Kassel University Press<br\/>%P 217<br\/>%T Self-Organized Collaborative Knowledge Management<br\/>%U http:\/\/www.uni-kassel.de\/upress\/online\/frei\/978-3-89958-325-0.volltext.frei.pdf<br\/>%@ 978-3-89958-325-0<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Jaeschke, R., Marinho, L., Hotho, A., Schmidt-Thieme, L., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Tag Recommendations in Folksonomies<\/span>.<\/span> In: Hinneburg, A. (ed.) Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivit\u00e4t (LWA 2007). pp. 13\u201320. Martin-Luther-Universit\u00e4t Halle-Wittenberg (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2007\/jaeschke07tagrecommendationsKDML.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-71bc9f8ae1a53632dc9a2b98b017f152\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-71bc9f8ae1a53632dc9a2b98b017f152\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/71bc9f8ae1a53632dc9a2b98b017f152\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-71bc9f8ae1a53632dc9a2b98b017f152\"><p>@inproceedings{jaeschke07tagKdml,<br\/>  author = {Jaeschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd},<br\/>  booktitle = {Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivit\u00e4t (LWA 2007)},<br\/>  editor = {Hinneburg, Alexander},<br\/>  keywords = {bookmarking},<br\/>  month = {09},<br\/>  pages = {13-20},<br\/>  publisher = {Martin-Luther-Universit\u00e4t Halle-Wittenberg},<br\/>  title = {Tag Recommendations in Folksonomies},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-71bc9f8ae1a53632dc9a2b98b017f152\"><p>%0 Conference Paper<br\/>%1 jaeschke07tagKdml<br\/>%A Jaeschke, Robert<br\/>%A Marinho, Leandro<br\/>%A Hotho, Andreas<br\/>%A Schmidt-Thieme, Lars<br\/>%A Stumme, Gerd<br\/>%B Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivit\u00e4t (LWA 2007)<br\/>%D 2007<br\/>%E Hinneburg, Alexander<br\/>%I Martin-Luther-Universit\u00e4t Halle-Wittenberg<br\/>%P 13-20<br\/>%T Tag Recommendations in Folksonomies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2007\/jaeschke07tagrecommendationsKDML.pdf<br\/>%@ 978-3-86010-907-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Position Paper: Ontology Learning from Folksonomies<\/span>.<\/span> In: Hinneburg, A. (ed.) Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivit\u00e4t (LWA 2007). pp. 109\u2013112. Martin-Luther-Universit\u00e4t Halle-Wittenberg (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2007position.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-72bff5ebe5dfb5023f62ba9b94e6ed01\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-72bff5ebe5dfb5023f62ba9b94e6ed01\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/72bff5ebe5dfb5023f62ba9b94e6ed01\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-72bff5ebe5dfb5023f62ba9b94e6ed01\">The emergence of collaborative tagging systems with their underlying flat and uncontrolled resource organization paradigm has led to a large number of research activities focussing on a formal description and analysis of the resulting \u201cfolksonomies\ufffd?. An interesting outcome is that the characteristic qualities of these systems seem to be inverse to more traditional knowledge structuring approaches like taxonomies or ontologies: The latter provide rich and precise semantics, but suffer - amongst others - from a knowledge acquisition bottleneck. An important step towards exploiting the possible synergies by bridging the gap between both paradigms is the automatic extraction of relations between tags in a folksonomy. This position paper presents preliminary results of ongoing work to induce hierarchical relationships among tags by analyzing the aggregated data of collaborative tagging systems as a basis for an ontology learning procedure.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-72bff5ebe5dfb5023f62ba9b94e6ed01\"><p>@inproceedings{benz2007position,<br\/>  abstract = {The emergence of collaborative tagging systems with their underlying flat and uncontrolled resource organization paradigm has led to a large number of research activities focussing on a formal description and analysis of the resulting \u201cfolksonomies\ufffd?. An interesting outcome is that the characteristic qualities of these systems seem to be inverse to more traditional knowledge structuring approaches like taxonomies or ontologies: The latter provide rich and precise semantics, but suffer - amongst others - from a knowledge acquisition bottleneck. An important step towards exploiting the possible synergies by bridging the gap between both paradigms is the automatic extraction of relations between tags in a folksonomy. This position paper presents preliminary results of ongoing work to induce hierarchical relationships among tags by analyzing the aggregated data of collaborative tagging systems as a basis for an ontology learning procedure.},<br\/>  author = {Benz, Dominik and Hotho, Andreas},<br\/>  booktitle = {Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivit\u00e4t (LWA 2007)},<br\/>  editor = {Hinneburg, Alexander},<br\/>  keywords = {itegpub},<br\/>  month = {09},<br\/>  note = {http:\/\/lwa07.informatik.uni-halle.de\/kdml07\/kdml07.htm},<br\/>  pages = {109--112},<br\/>  publisher = {Martin-Luther-Universit\u00e4t Halle-Wittenberg},<br\/>  title = {Position Paper: Ontology Learning from Folksonomies},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-72bff5ebe5dfb5023f62ba9b94e6ed01\"><p>%0 Conference Paper<br\/>%1 benz2007position<br\/>%A Benz, Dominik<br\/>%A Hotho, Andreas<br\/>%B Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivit\u00e4t (LWA 2007)<br\/>%D 2007<br\/>%E Hinneburg, Alexander<br\/>%I Martin-Luther-Universit\u00e4t Halle-Wittenberg<br\/>%P 109--112<br\/>%T Position Paper: Ontology Learning from Folksonomies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2007position.pdf<br\/>%X The emergence of collaborative tagging systems with their underlying flat and uncontrolled resource organization paradigm has led to a large number of research activities focussing on a formal description and analysis of the resulting \u201cfolksonomies\ufffd?. An interesting outcome is that the characteristic qualities of these systems seem to be inverse to more traditional knowledge structuring approaches like taxonomies or ontologies: The latter provide rich and precise semantics, but suffer - amongst others - from a knowledge acquisition bottleneck. An important step towards exploiting the possible synergies by bridging the gap between both paradigms is the automatic extraction of relations between tags in a folksonomy. This position paper presents preliminary results of ongoing work to induce hierarchical relationships among tags by analyzing the aggregated data of collaborative tagging systems as a basis for an ontology learning procedure.<br\/>%@ 978-3-86010-907-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Marinho, L., Hotho, A., Schmidt-Thieme, L., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Tag Recommendations in Folksonomies<\/span>.<\/span> In: Hinneburg, A. (ed.) Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivit\u00e4t (LWA 2007). pp. 13\u201320. Martin-Luther-Universit\u00e4t Halle-Wittenberg (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2007\/jaeschke07tagrecommendationsKDML.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bfc43dfe59f9c0935ac3364b12e6d795\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bfc43dfe59f9c0935ac3364b12e6d795\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bfc43dfe59f9c0935ac3364b12e6d795\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-bfc43dfe59f9c0935ac3364b12e6d795\">Collaborative tagging systems allow users to assign keywords\u2014so called \u201ctags\u201d\u2014to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we present two tag recommendation algorithms: an adaptation of user-based collaborative filtering and a graph-based recommender built on top of FolkRank, an adaptation of the well-known PageRank algorithm that can cope with undirected triadic hyperedges. We evaluate and compare both algorithms on large-scale real life datasets and show that both provide better results than non-personalized baseline methods. Especially the graph-based recommender outperforms existing methods considerably.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bfc43dfe59f9c0935ac3364b12e6d795\"><p>@inproceedings{jaeschke07tagKdml,<br\/>  abstract = {Collaborative tagging systems allow users to assign keywords\u2014so called \u201ctags\u201d\u2014to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we present two tag recommendation algorithms: an adaptation of user-based collaborative filtering and a graph-based recommender built on top of FolkRank, an adaptation of the well-known PageRank algorithm that can cope with undirected triadic hyperedges. We evaluate and compare both algorithms on large-scale real life datasets and show that both provide better results than non-personalized baseline methods. Especially the graph-based recommender outperforms existing methods considerably.},<br\/>  author = {J\u00e4schke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd},<br\/>  booktitle = {Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivit\u00e4t (LWA 2007)},<br\/>  editor = {Hinneburg, Alexander},<br\/>  keywords = {bookmarking},<br\/>  month = {09},<br\/>  pages = {13-20},<br\/>  publisher = {Martin-Luther-Universit\u00e4t Halle-Wittenberg},<br\/>  title = {Tag Recommendations in Folksonomies},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bfc43dfe59f9c0935ac3364b12e6d795\"><p>%0 Conference Paper<br\/>%1 jaeschke07tagKdml<br\/>%A J\u00e4schke, Robert<br\/>%A Marinho, Leandro<br\/>%A Hotho, Andreas<br\/>%A Schmidt-Thieme, Lars<br\/>%A Stumme, Gerd<br\/>%B Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivit\u00e4t (LWA 2007)<br\/>%D 2007<br\/>%E Hinneburg, Alexander<br\/>%I Martin-Luther-Universit\u00e4t Halle-Wittenberg<br\/>%P 13-20<br\/>%T Tag Recommendations in Folksonomies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2007\/jaeschke07tagrecommendationsKDML.pdf<br\/>%X Collaborative tagging systems allow users to assign keywords\u2014so called \u201ctags\u201d\u2014to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we present two tag recommendation algorithms: an adaptation of user-based collaborative filtering and a graph-based recommender built on top of FolkRank, an adaptation of the well-known PageRank algorithm that can cope with undirected triadic hyperedges. We evaluate and compare both algorithms on large-scale real life datasets and show that both provide better results than non-personalized baseline methods. Especially the graph-based recommender outperforms existing methods considerably.<br\/>%@ 978-3-86010-907-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Grahl, M., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Clustering of Social Bookmark Sites<\/span>.<\/span> In: Hinneburg, A. (ed.) Workshop Proceedings of Lernen -- Wissensentdeckung -- Adaptivit\u00e4t (LWA 2007). pp. 50\u201354. Martin-Luther-Universit\u00e4t Halle-Wittenberg (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2007\/kdml_recommender_final.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6d5188d66564fe4ed7386e28868504de\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6d5188d66564fe4ed7386e28868504de\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6d5188d66564fe4ed7386e28868504de\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6d5188d66564fe4ed7386e28868504de\"><p>@inproceedings{grahl07conceptualKdml,<br\/>  author = {Grahl, Miranda and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Workshop Proceedings of Lernen -- Wissensentdeckung -- Adaptivit\u00e4t (LWA 2007)},<br\/>  editor = {Hinneburg, Alexander},<br\/>  keywords = {bookmarking},<br\/>  month = {09},<br\/>  pages = {50-54},<br\/>  publisher = {Martin-Luther-Universit\u00e4t Halle-Wittenberg},<br\/>  title = {Conceptual Clustering of Social Bookmark Sites},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6d5188d66564fe4ed7386e28868504de\"><p>%0 Conference Paper<br\/>%1 grahl07conceptualKdml<br\/>%A Grahl, Miranda<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Workshop Proceedings of Lernen -- Wissensentdeckung -- Adaptivit\u00e4t (LWA 2007)<br\/>%D 2007<br\/>%E Hinneburg, Alexander<br\/>%I Martin-Luther-Universit\u00e4t Halle-Wittenberg<br\/>%P 50-54<br\/>%T Conceptual Clustering of Social Bookmark Sites<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2007\/kdml_recommender_final.pdf<br\/>%@ 978-3-86010-907-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Hotho, A., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Analysis of the Publication Sharing Behaviour in {BibSonomy}<\/span>.<\/span> In: Priss, U., Polovina, S., and Hill, R. (eds.) Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007). pp. 283\u2013295. Springer-Verlag, Berlin, Heidelberg (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0c2b212b9ea3d822bf4729fd5fe6b6e1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0c2b212b9ea3d822bf4729fd5fe6b6e1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0c2b212b9ea3d822bf4729fd5fe6b6e1\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-0c2b212b9ea3d822bf4729fd5fe6b6e1\">BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0c2b212b9ea3d822bf4729fd5fe6b6e1\"><p>@inproceedings{jaeschke2007analysis,<br\/>  abstract = {BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.},<br\/>  address = {Berlin, Heidelberg},<br\/>  author = {J\u00e4schke, Robert and Hotho, Andreas and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)},<br\/>  editor = {Priss, U. and Polovina, S. and Hill, R.},<br\/>  keywords = {bookmarking},<br\/>  month = {07},<br\/>  pages = {283--295},<br\/>  publisher = {Springer-Verlag},<br\/>  series = {Lecture Notes in Artificial Intelligence},<br\/>  title = {Analysis of the Publication Sharing Behaviour in {BibSonomy}},<br\/>  volume = 4604,<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0c2b212b9ea3d822bf4729fd5fe6b6e1\"><p>%0 Conference Paper<br\/>%1 jaeschke2007analysis<br\/>%A J\u00e4schke, Robert<br\/>%A Hotho, Andreas<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)<br\/>%C Berlin, Heidelberg<br\/>%D 2007<br\/>%E Priss, U.<br\/>%E Polovina, S.<br\/>%E Hill, R.<br\/>%I Springer-Verlag<br\/>%P 283--295<br\/>%T Analysis of the Publication Sharing Behaviour in {BibSonomy}<br\/>%V 4604<br\/>%X BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.<br\/>%@ 3-540-73680-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">V\u00f6lker, J., Vrandecic, D., Sure, Y., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Learning Disjointness}<\/span>.<\/span> In: Franconi, E., Kifer, M., and May, W. (eds.) Proceedings of the European Semantic Web Conference, ESWC2007. Springer-Verlag (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.eswc2007.org\/pdf\/eswc07-voelker1.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c5c43ae4a719e6e935a9ca1a4aca906b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c5c43ae4a719e6e935a9ca1a4aca906b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c5c43ae4a719e6e935a9ca1a4aca906b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c5c43ae4a719e6e935a9ca1a4aca906b\"><p>@inproceedings{voelker1:07:eswc,<br\/>  author = {V\u00f6lker, Johanna and Vrandecic, Denny and Sure, York and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the European Semantic Web Conference, ESWC2007},<br\/>  editor = {Franconi, Enrico and Kifer, Michael and May, Wolfgang},<br\/>  keywords = {ontology},<br\/>  month = {07},<br\/>  publisher = {Springer-Verlag},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {{Learning Disjointness}},<br\/>  volume = 4519,<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c5c43ae4a719e6e935a9ca1a4aca906b\"><p>%0 Conference Paper<br\/>%1 voelker1:07:eswc<br\/>%A V\u00f6lker, Johanna<br\/>%A Vrandecic, Denny<br\/>%A Sure, York<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the European Semantic Web Conference, ESWC2007<br\/>%D 2007<br\/>%E Franconi, Enrico<br\/>%E Kifer, Michael<br\/>%E May, Wolfgang<br\/>%I Springer-Verlag<br\/>%T {Learning Disjointness}<br\/>%U http:\/\/www.eswc2007.org\/pdf\/eswc07-voelker1.pdf<br\/>%V 4519<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Catutto, C., Schmitz, C., Baldassarri, A., Servedio, V.D.P., Loreto, V., Hotho, and A., Grahl, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Network Properties of Folksonomies<\/span>.<\/span> AI Communications Journal, Special Issue on \"Network Analysis in Natural Sciences and Engineering\". (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2835c71a94a365b22477f4d42d263671\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2835c71a94a365b22477f4d42d263671\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2835c71a94a365b22477f4d42d263671\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2835c71a94a365b22477f4d42d263671\"><p>@article{cattuto2007network,<br\/>  author = {Catutto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and and Andreas Hotho and Grahl, Miranda and Stumme, Gerd},<br\/>  editor = {Hoche, Susanne and N\u00fcrnberger, Andreas and Flach, J\u00fcrgen},<br\/>  journal = {AI Communications Journal, Special Issue on \"Network Analysis in Natural Sciences and Engineering\"},<br\/>  keywords = {collective},<br\/>  publisher = {IOS Press},<br\/>  title = {Network Properties of Folksonomies},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2835c71a94a365b22477f4d42d263671\"><p>%0 Journal Article<br\/>%1 cattuto2007network<br\/>%A Catutto, Ciro<br\/>%A Schmitz, Christoph<br\/>%A Baldassarri, Andrea<br\/>%A Servedio, Vito D. P.<br\/>%A Loreto, Vittorio<br\/>%A Hotho, and Andreas<br\/>%A Grahl, Miranda<br\/>%A Stumme, Gerd<br\/>%D 2007<br\/>%E Hoche, Susanne<br\/>%E N\u00fcrnberger, Andreas<br\/>%E Flach, J\u00fcrgen<br\/>%I IOS Press<br\/>%J AI Communications Journal, Special Issue on \"Network Analysis in Natural Sciences and Engineering\"<br\/>%T Network Properties of Folksonomies<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Eckert, K., Stuckenschmidt, H., Pfeffer, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{Interactive Thesaurus Assessment for Automatic Document Annotation}<\/span>.<\/span> In: {Proceedings of The Fourth International Conference on Knowledge Capture (K-CAP 2007), Whistler, Canada} (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0ecbdca910d24d374cb83d2a06f8669d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0ecbdca910d24d374cb83d2a06f8669d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0ecbdca910d24d374cb83d2a06f8669d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0ecbdca910d24d374cb83d2a06f8669d\"><p>@inproceedings{eckert2007interactive,<br\/>  author = {Eckert, Kai and Stuckenschmidt, Heiner and Pfeffer, Magnus},<br\/>  booktitle = {{Proceedings of The Fourth International Conference on Knowledge Capture (K-CAP 2007), Whistler, Canada}},<br\/>  keywords = 2007,<br\/>  title = {{Interactive Thesaurus Assessment for Automatic Document Annotation}},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0ecbdca910d24d374cb83d2a06f8669d\"><p>%0 Conference Paper<br\/>%1 eckert2007interactive<br\/>%A Eckert, Kai<br\/>%A Stuckenschmidt, Heiner<br\/>%A Pfeffer, Magnus<br\/>%B {Proceedings of The Fourth International Conference on Knowledge Capture (K-CAP 2007), Whistler, Canada}<br\/>%D 2007<br\/>%T {Interactive Thesaurus Assessment for Automatic Document Annotation}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mining the World Wide Web<\/span>.<\/span> K\u00fcnstliche Intelligenz. 5\u20138 (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/kobra.bibliothek.uni-kassel.de\/bitstream\/urn:nbn:de:hebis:34-2008021320337\/3\/HothoStummeMiningWWW.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-92d3a5fdd786086fa12787e3e350b6af\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-92d3a5fdd786086fa12787e3e350b6af\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/92d3a5fdd786086fa12787e3e350b6af\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-92d3a5fdd786086fa12787e3e350b6af\"><p>@article{hotho2007mining,<br\/>  author = {Hotho, Andreas and Stumme, Gerd},<br\/>  journal = {K\u00fcnstliche Intelligenz},<br\/>  keywords = {ml},<br\/>  number = 3,<br\/>  pages = {5-8},<br\/>  title = {Mining the World Wide Web},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-92d3a5fdd786086fa12787e3e350b6af\"><p>%0 Journal Article<br\/>%1 hotho2007mining<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%D 2007<br\/>%J K\u00fcnstliche Intelligenz<br\/>%N 3<br\/>%P 5-8<br\/>%T Mining the World Wide Web<br\/>%U http:\/\/kobra.bibliothek.uni-kassel.de\/bitstream\/urn:nbn:de:hebis:34-2008021320337\/3\/HothoStummeMiningWWW.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Chen, L., Cudr\u00e9-Mauroux, P., Haase, P., Hotho, A., Ong, E. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the First International Workshop on Emergent Semantics and Ontology Evolution, ESOE 2007, co-located with ISWC 2007 + ASWC 2007, Busan, Korea, November 12th, 2007<\/span>.<\/span> CEUR-WS.org (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/semweb\/esoe2007.html\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6a076256fc0fbf774cd5e67addc13641\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6a076256fc0fbf774cd5e67addc13641\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6a076256fc0fbf774cd5e67addc13641\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6a076256fc0fbf774cd5e67addc13641\"><p>@proceedings{semweb2007esoe,<br\/>  booktitle = {ESOE},<br\/>  editor = {Chen, Liming and Cudr\u00e9-Mauroux, Philippe and Haase, Peter and Hotho, Andreas and Ong, Ernie},<br\/>  keywords = {ontology},<br\/>  publisher = {CEUR-WS.org},<br\/>  series = {CEUR Workshop Proceedings},<br\/>  title = {Proceedings of the First International Workshop on Emergent Semantics and Ontology Evolution, ESOE 2007, co-located with ISWC 2007 + ASWC 2007, Busan, Korea, November 12th, 2007},<br\/>  volume = 292,<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6a076256fc0fbf774cd5e67addc13641\"><p>%0 Conference Proceedings<br\/>%1 semweb2007esoe<br\/>%B ESOE<br\/>%D 2007<br\/>%E Chen, Liming<br\/>%E Cudr\u00e9-Mauroux, Philippe<br\/>%E Haase, Peter<br\/>%E Hotho, Andreas<br\/>%E Ong, Ernie<br\/>%I CEUR-WS.org<br\/>%T Proceedings of the First International Workshop on Emergent Semantics and Ontology Evolution, ESOE 2007, co-located with ISWC 2007 + ASWC 2007, Busan, Korea, November 12th, 2007<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/semweb\/esoe2007.html<br\/>%V 292<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Alani, H., Noy, N., Stumme, G., Mika, P., Sure, Y., Vrandecic, D. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007<\/span>.<\/span> , Banff, Canada (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www2007.org\/workshop-W7.php\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-aac9110f5a4e2e00028f0466555ce8d4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-aac9110f5a4e2e00028f0466555ce8d4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/aac9110f5a4e2e00028f0466555ce8d4\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-aac9110f5a4e2e00028f0466555ce8d4\"><p>@proceedings{alani2007workshop,<br\/>  address = {Banff, Canada},<br\/>  editor = {Alani, Harith and Noy, Natasha and Stumme, Gerd and Mika, Peter and Sure, York and Vrandecic, Denny},<br\/>  keywords = {itegpub},<br\/>  title = {Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-aac9110f5a4e2e00028f0466555ce8d4\"><p>%0 Conference Proceedings<br\/>%1 alani2007workshop<br\/>%C Banff, Canada<br\/>%D 2007<br\/>%E Alani, Harith<br\/>%E Noy, Natasha<br\/>%E Stumme, Gerd<br\/>%E Mika, Peter<br\/>%E Sure, York<br\/>%E Vrandecic, Denny<br\/>%T Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007<br\/>%U http:\/\/www2007.org\/workshop-W7.php<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cao, Y., Ehms, K., Fiedler, S., Hofer, M., Kaiamo, A.-K., Kieslinger, B., Klamma, R., Krause, B., Kravcik, M., Ryypp\u00f6, T., Spaniol, M., Stumme, G., Wild, F.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Case study on social software use in distributed working environments<\/span><\/span>, http:\/\/www.prolearn-project.org\/deliverables\/view?id=1432, (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.prolearn-project.org\/deliverables\/view?id=1432\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5dc735281a6be72a54186018e0166740\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5dc735281a6be72a54186018e0166740\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5dc735281a6be72a54186018e0166740\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5dc735281a6be72a54186018e0166740\"><p>@misc{cao07casestudy,<br\/>  author = {Cao, Yiwei and Ehms, Karsten and Fiedler, Sebastian and Hofer, Margit and Kaiamo, Anna-Kaarina and Kieslinger, Barbara and Klamma, Ralf and Krause, Beate and Kravcik, Milos and Ryypp\u00f6, Tommi and Spaniol, Marc and Stumme, Gerd and Wild, Fridolin},<br\/>  keywords = {itegpub},<br\/>  note = {Deliverable 15.2, European Network of Excellence ``Prolearn - Professional E-Learning''},<br\/>  title = {Case study on social software use in distributed working environments},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5dc735281a6be72a54186018e0166740\"><p>%0 Generic<br\/>%1 cao07casestudy<br\/>%A Cao, Yiwei<br\/>%A Ehms, Karsten<br\/>%A Fiedler, Sebastian<br\/>%A Hofer, Margit<br\/>%A Kaiamo, Anna-Kaarina<br\/>%A Kieslinger, Barbara<br\/>%A Klamma, Ralf<br\/>%A Krause, Beate<br\/>%A Kravcik, Milos<br\/>%A Ryypp\u00f6, Tommi<br\/>%A Spaniol, Marc<br\/>%A Stumme, Gerd<br\/>%A Wild, Fridolin<br\/>%D 2007<br\/>%T Case study on social software use in distributed working environments<br\/>%U http:\/\/www.prolearn-project.org\/deliverables\/view?id=1432<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mining the World Wide Web --- Methods, Applications, and Perspectives<\/span>.<\/span> K\u00fcnstliche Intelligenz. 5\u20138 (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kuenstliche-intelligenz.de\/index.php?id=7758\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7fc7deda8f80da99c4e3d26bd32dca9c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7fc7deda8f80da99c4e3d26bd32dca9c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7fc7deda8f80da99c4e3d26bd32dca9c\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7fc7deda8f80da99c4e3d26bd32dca9c\"><p>@article{hotho2007webmining,<br\/>  author = {Hotho, Andreas and Stumme, Gerd},<br\/>  editor = {Hotho, Andreas and Stumme, Gerd},<br\/>  journal = {K\u00fcnstliche Intelligenz},<br\/>  keywords = {itegpub},<br\/>  number = 3,<br\/>  pages = {5-8},<br\/>  title = {Mining the World Wide Web --- Methods, Applications, and Perspectives},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7fc7deda8f80da99c4e3d26bd32dca9c\"><p>%0 Journal Article<br\/>%1 hotho2007webmining<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%D 2007<br\/>%E Hotho, Andreas<br\/>%E Stumme, Gerd<br\/>%J K\u00fcnstliche Intelligenz<br\/>%N 3<br\/>%P 5-8<br\/>%T Mining the World Wide Web --- Methods, Applications, and Perspectives<br\/>%U http:\/\/www.kuenstliche-intelligenz.de\/index.php?id=7758<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Themenheft Web Mining, K\u00fcnstliche Intelligenz<\/span>.<\/span> (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kuenstliche-intelligenz.de\/index.php?id=7758\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c73311bb72ad480d74125dbc9d94c450\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c73311bb72ad480d74125dbc9d94c450\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c73311bb72ad480d74125dbc9d94c450\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c73311bb72ad480d74125dbc9d94c450\"><p>@proceedings{themenheft2007webmining,<br\/>  editor = {Hotho, Andreas and Stumme, Gerd},<br\/>  journal = {K\u00fcnstliche Intelligenz},<br\/>  keywords = {itegpub},<br\/>  number = 3,<br\/>  pages = {5-8},<br\/>  title = {Themenheft Web Mining, K\u00fcnstliche Intelligenz},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c73311bb72ad480d74125dbc9d94c450\"><p>%0 Conference Proceedings<br\/>%1 themenheft2007webmining<br\/>%D 2007<br\/>%E Hotho, Andreas<br\/>%E Stumme, Gerd<br\/>%J K\u00fcnstliche Intelligenz<br\/>%N 3<br\/>%P 5-8<br\/>%T Themenheft Web Mining, K\u00fcnstliche Intelligenz<br\/>%U http:\/\/www.kuenstliche-intelligenz.de\/index.php?id=7758<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Mladenic, D., Semeraro, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">From Web to Social Web: Discovering and Deploying User and Content Profiles<\/span>.<\/span> Springer, Berlin, Germany (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.springer.com\/dal\/home?SGWID=1-102-22-173759307-0&changeHeader=true&referer=www.springeronline.com&SHORTCUT=www.springer.com\/978-3-540-74950-9\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-12a5e3f0763e92c4f2bf007f259f52c8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-12a5e3f0763e92c4f2bf007f259f52c8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/12a5e3f0763e92c4f2bf007f259f52c8\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-12a5e3f0763e92c4f2bf007f259f52c8\">This book constitutes the refereed proceedings of the Workshop on Web Mining, WebMine 2006, held in Berlin, Germany, September 18th, 2006. Topics included are data mining based on analysis of bloggers and tagging, web mining, XML mining and further techniques of knowledge discovery. The book is especially valuable for those interested in the aspects of the Social Web (Web 2.0) and its inherent dynamic and diversity of user-generated content.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-12a5e3f0763e92c4f2bf007f259f52c8\"><p>@book{Berendt2007,<br\/>  abstract = {This book constitutes the refereed proceedings of the Workshop on Web Mining, WebMine 2006, held in Berlin, Germany, September 18th, 2006. Topics included are data mining based on analysis of bloggers and tagging, web mining, XML mining and further techniques of knowledge discovery. The book is especially valuable for those interested in the aspects of the Social Web (Web 2.0) and its inherent dynamic and diversity of user-generated content.},<br\/>  editor = {Berendt, B. and Hotho, A. and Mladenic, D. and Semeraro, G.},<br\/>  keywords = {tm},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {From Web to Social Web: Discovering and Deploying User and Content Profiles},<br\/>  volume = 4736,<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-12a5e3f0763e92c4f2bf007f259f52c8\"><p>%0 Book<br\/>%1 Berendt2007<br\/>%B LNCS<br\/>%D 2007<br\/>%E Berendt, B.<br\/>%E Hotho, A.<br\/>%E Mladenic, D.<br\/>%E Semeraro, G.<br\/>%I Springer<br\/>%T From Web to Social Web: Discovering and Deploying User and Content Profiles<br\/>%U http:\/\/www.springer.com\/dal\/home?SGWID=1-102-22-173759307-0&changeHeader=true&referer=www.springeronline.com&SHORTCUT=www.springer.com\/978-3-540-74950-9<br\/>%V 4736<br\/>%X This book constitutes the refereed proceedings of the Workshop on Web Mining, WebMine 2006, held in Berlin, Germany, September 18th, 2006. Topics included are data mining based on analysis of bloggers and tagging, web mining, XML mining and further techniques of knowledge discovery. The book is especially valuable for those interested in the aspects of the Social Web (Web 2.0) and its inherent dynamic and diversity of user-generated content.<br\/>%@ 978-3-540-74950-9<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Grahl, M., Hotho, A., Krause, B., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Organizing Publications and Bookmarks in BibSonomy<\/span>.<\/span> In: Alani, H., Noy, N., Stumme, G., Mika, P., Sure, Y., and Vrandecic, D. (eds.) Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007. , Banff, Canada (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www2007.org\/workshops\/paper_25.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b3a5e9851647ca0a7dfb62f041872504\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b3a5e9851647ca0a7dfb62f041872504\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b3a5e9851647ca0a7dfb62f041872504\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b3a5e9851647ca0a7dfb62f041872504\"><p>@inproceedings{jaeschke07organizing,<br\/>  address = {Banff, Canada},<br\/>  author = {J\u00e4schke, Robert and Grahl, Miranda and Hotho, Andreas and Krause, Beate and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007},<br\/>  editor = {Alani, Harith and Noy, Natasha and Stumme, Gerd and Mika, Peter and Sure, York and Vrandecic, Denny},<br\/>  keywords = {itegpub},<br\/>  title = {Organizing Publications and Bookmarks in BibSonomy},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b3a5e9851647ca0a7dfb62f041872504\"><p>%0 Conference Paper<br\/>%1 jaeschke07organizing<br\/>%A J\u00e4schke, Robert<br\/>%A Grahl, Miranda<br\/>%A Hotho, Andreas<br\/>%A Krause, Beate<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007<br\/>%C Banff, Canada<br\/>%D 2007<br\/>%E Alani, Harith<br\/>%E Noy, Natasha<br\/>%E Stumme, Gerd<br\/>%E Mika, Peter<br\/>%E Sure, York<br\/>%E Vrandecic, Denny<br\/>%T Organizing Publications and Bookmarks in BibSonomy<br\/>%U http:\/\/www2007.org\/workshops\/paper_25.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C., Grahl, M., Hotho, A., Stumme, G., Catutto, C., Baldassarri, A., Loreto, V., Servedio, V.D.P.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Network Properties of Folksonomies<\/span>.<\/span> In: Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization\u2019\u2019. , Banff (2007).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2007\/schmitz07network.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-23a0a0cd67ab0014e0346527e986caeb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-23a0a0cd67ab0014e0346527e986caeb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/23a0a0cd67ab0014e0346527e986caeb\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-23a0a0cd67ab0014e0346527e986caeb\"><p>@inproceedings{schmitz07network,<br\/>  address = {Banff},<br\/>  author = {Schmitz, Christoph and Grahl, Miranda and Hotho, Andreas and Stumme, Gerd and Catutto, Ciro and Baldassarri, Andrea and Loreto, Vittorio and Servedio, Vito D. P.},<br\/>  booktitle = {Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''},<br\/>  keywords = {itegpub},<br\/>  month = {05},<br\/>  title = {Network Properties of Folksonomies},<br\/>  year = 2007<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-23a0a0cd67ab0014e0346527e986caeb\"><p>%0 Conference Paper<br\/>%1 schmitz07network<br\/>%A Schmitz, Christoph<br\/>%A Grahl, Miranda<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%A Catutto, Ciro<br\/>%A Baldassarri, Andrea<br\/>%A Loreto, Vittorio<br\/>%A Servedio, Vito D. P.<br\/>%B Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''<br\/>%C Banff<br\/>%D 2007<br\/>%T Network Properties of Folksonomies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2007\/schmitz07network.pdf<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2006\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2006<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Benz, D., Tso, K.H.L., Schmidt-Thieme, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Automatic Bookmark Classification - A Collaborative Approach<\/span>.<\/span> In: Proceedings of the 2nd Workshop in Innovations in Web Infrastructure (IWI2) at WWW2006. , Edinburgh, Scotland (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2006automatic.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9d685c05008804a45b72a43586777b3b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9d685c05008804a45b72a43586777b3b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9d685c05008804a45b72a43586777b3b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9d685c05008804a45b72a43586777b3b\">Bookmarks (or Favorites, Hotlists) are a popular strategy to relocate interesting websites on the WWW by creating a personalized local URL repository. Most current browsers offer a facility to store and manage bookmarks in a hierarchy of folders; though, with growing size, users reportedly have trouble to create and maintain a stable taxonomy. This paper presents a novel collaborative approach to ease bookmark management, especially the \u201cclassification\ufffd? of new bookmarks into a folder. We propose a methodology to realize the collaborative classification idea of considering how similar users have classified a bookmark. A combination of nearest-neighbour-classifiers is used to derive a recommendation from similar users on where to store a new bookmark. Additionally, a procedure to generate keyword recommendations is proposed to ease the annotation of new bookmarks. A prototype system called CariBo has been implemented as a plugin of the central bookmark server software SiteBar. A case study conducted with real user data supports the validity of the approach.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9d685c05008804a45b72a43586777b3b\"><p>@inproceedings{benz2006automatic,<br\/>  abstract = {Bookmarks (or Favorites, Hotlists) are a popular strategy to relocate interesting websites on the WWW by creating a personalized local URL repository. Most current browsers offer a facility to store and manage bookmarks in a hierarchy of folders; though, with growing size, users reportedly have trouble to create and maintain a stable taxonomy. This paper presents a novel collaborative approach to ease bookmark management, especially the \u201cclassification\ufffd? of new bookmarks into a folder. We propose a methodology to realize the collaborative classification idea of considering how similar users have classified a bookmark. A combination of nearest-neighbour-classifiers is used to derive a recommendation from similar users on where to store a new bookmark. Additionally, a procedure to generate keyword recommendations is proposed to ease the annotation of new bookmarks. A prototype system called CariBo has been implemented as a plugin of the central bookmark server software SiteBar. A case study conducted with real user data supports the validity of the approach.},<br\/>  address = {Edinburgh, Scotland},<br\/>  author = {Benz, Dominik and Tso, Karen H. L. and Schmidt-Thieme, Lars},<br\/>  booktitle = {Proceedings of the 2nd Workshop in Innovations in Web Infrastructure (IWI2) at WWW2006},<br\/>  keywords = {itegpub},<br\/>  month = {05},<br\/>  note = {isbn = {085432853X}},<br\/>  title = {Automatic Bookmark Classification - A Collaborative Approach},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9d685c05008804a45b72a43586777b3b\"><p>%0 Conference Paper<br\/>%1 benz2006automatic<br\/>%A Benz, Dominik<br\/>%A Tso, Karen H. L.<br\/>%A Schmidt-Thieme, Lars<br\/>%B Proceedings of the 2nd Workshop in Innovations in Web Infrastructure (IWI2) at WWW2006<br\/>%C Edinburgh, Scotland<br\/>%D 2006<br\/>%T Automatic Bookmark Classification - A Collaborative Approach<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/benz2006automatic.pdf<br\/>%X Bookmarks (or Favorites, Hotlists) are a popular strategy to relocate interesting websites on the WWW by creating a personalized local URL repository. Most current browsers offer a facility to store and manage bookmarks in a hierarchy of folders; though, with growing size, users reportedly have trouble to create and maintain a stable taxonomy. This paper presents a novel collaborative approach to ease bookmark management, especially the \u201cclassification\ufffd? of new bookmarks into a folder. We propose a methodology to realize the collaborative classification idea of considering how similar users have classified a bookmark. A combination of nearest-neighbour-classifiers is used to derive a recommendation from similar users on where to store a new bookmark. Additionally, a procedure to generate keyword recommendations is proposed to ease the annotation of new bookmarks. A prototype system called CariBo has been implemented as a plugin of the central bookmark server software SiteBar. A case study conducted with real user data supports the validity of the approach.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C., Hotho, A., J\u00e4schke, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mining Association Rules in Folksonomies<\/span>.<\/span> In: Proc. IFCS 2006 Conference. , Ljubljana (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f3254d8f1ded630a4225ab824804e837\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f3254d8f1ded630a4225ab824804e837\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f3254d8f1ded630a4225ab824804e837\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f3254d8f1ded630a4225ab824804e837\"><p>@inproceedings{schmitz2006mining,<br\/>  address = {Ljubljana},<br\/>  author = {Schmitz, Christoph and Hotho, Andreas and J\u00e4schke, Robert and Stumme, Gerd},<br\/>  booktitle = {Proc. IFCS 2006 Conference},<br\/>  keywords = {network},<br\/>  month = {07},<br\/>  title = {Mining Association Rules in Folksonomies},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f3254d8f1ded630a4225ab824804e837\"><p>%0 Conference Paper<br\/>%1 schmitz2006mining<br\/>%A Schmitz, Christoph<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%B Proc. IFCS 2006 Conference<br\/>%C Ljubljana<br\/>%D 2006<br\/>%T Mining Association Rules in Folksonomies<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., J\u00e4schke, R., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Information Retrieval in Folksonomies: Search and Ranking<\/span>.<\/span> In: Sure, Y. and Domingue, J. (eds.) The Semantic Web: Research and Applications. pp. 411\u2013426. Springer, Berlin\/Heidelberg (2006). https:\/\/doi.org\/10.1007\/11762256_31.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2006\/seach2006hotho_eswc.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3c301945817681d637ee43901c016939\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3c301945817681d637ee43901c016939\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/11762256_31\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3c301945817681d637ee43901c016939\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-3c301945817681d637ee43901c016939\">Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. At the moment, however, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3c301945817681d637ee43901c016939\"><p>@inproceedings{hotho2006information,<br\/>  abstract = {Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. At the moment, however, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset.},<br\/>  address = {Berlin\/Heidelberg},<br\/>  author = {Hotho, Andreas and J\u00e4schke, Robert and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {The Semantic Web: Research and Applications},<br\/>  editor = {Sure, York and Domingue, John},<br\/>  keywords = {rank},<br\/>  month = {06},<br\/>  pages = {411--426},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Information Retrieval in Folksonomies: Search and Ranking},<br\/>  volume = 4011,<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3c301945817681d637ee43901c016939\"><p>%0 Conference Paper<br\/>%1 hotho2006information<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B The Semantic Web: Research and Applications<br\/>%C Berlin\/Heidelberg<br\/>%D 2006<br\/>%E Sure, York<br\/>%E Domingue, John<br\/>%I Springer<br\/>%P 411--426<br\/>%R 10.1007\/11762256_31<br\/>%T Information Retrieval in Folksonomies: Search and Ranking<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2006\/seach2006hotho_eswc.pdf<br\/>%V 4011<br\/>%X Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. At the moment, however, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C., Hotho, A., J\u00e4schke, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Content Aggregation on Knowledge Bases using Graph Clustering<\/span>.<\/span> In: Sure, Y. and Domingue, J. (eds.) The Semantic Web: Research and Applications. pp. 530\u2013544. Springer, Berlin\/Heidelberg (2006). https:\/\/doi.org\/10.1007\/11762256_39.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.springerlink.com\/content\/u121v1827v286398\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1788c88e04112a4491f19dfffb8dc39e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1788c88e04112a4491f19dfffb8dc39e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/11762256_39\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1788c88e04112a4491f19dfffb8dc39e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-1788c88e04112a4491f19dfffb8dc39e\">Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper provides a graph clustering technique on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1788c88e04112a4491f19dfffb8dc39e\"><p>@inproceedings{schmitz2006content,<br\/>  abstract = {Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper provides a graph clustering technique on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.},<br\/>  address = {Berlin\/Heidelberg},<br\/>  author = {Schmitz, Christoph and Hotho, Andreas and J\u00e4schke, Robert and Stumme, Gerd},<br\/>  booktitle = {The Semantic Web: Research and Applications},<br\/>  editor = {Sure, York and Domingue, John},<br\/>  keywords = {graph},<br\/>  month = {06},<br\/>  pages = {530--544},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Content Aggregation on Knowledge Bases using Graph Clustering},<br\/>  volume = 4011,<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1788c88e04112a4491f19dfffb8dc39e\"><p>%0 Conference Paper<br\/>%1 schmitz2006content<br\/>%A Schmitz, Christoph<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%B The Semantic Web: Research and Applications<br\/>%C Berlin\/Heidelberg<br\/>%D 2006<br\/>%E Sure, York<br\/>%E Domingue, John<br\/>%I Springer<br\/>%P 530--544<br\/>%R 10.1007\/11762256_39<br\/>%T Content Aggregation on Knowledge Bases using Graph Clustering<br\/>%U http:\/\/www.springerlink.com\/content\/u121v1827v286398\/<br\/>%V 4011<br\/>%X Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper provides a graph clustering technique on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.<br\/>%@ 978-3-540-34544-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hoser, B., Hotho, A., J\u00e4schke, R., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Network Analysis of Ontologies<\/span>.<\/span> In: Sure, Y. and Domingue, J. (eds.) The Semantic Web: Research and Applications. pp. 514\u2013529. Springer, Heidelberg (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hoser2006semantic.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c0cdbeab23ce0fc1bff5e02c99aab012\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c0cdbeab23ce0fc1bff5e02c99aab012\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c0cdbeab23ce0fc1bff5e02c99aab012\/kde\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-c0cdbeab23ce0fc1bff5e02c99aab012\">A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as (labeled, directed) graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA). While social network structures in general currently receive high attention in the Semantic Web community, there are only very few SNA applications up to now, and virtually none for analyzing the structure of ontologies. We illustrate in this paper the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality based on Hermitian matrices, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c0cdbeab23ce0fc1bff5e02c99aab012\"><p>@inproceedings{hoser2006semantic,<br\/>  abstract = {A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as (labeled, directed) graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA). While social network structures in general currently receive high attention in the Semantic Web community, there are only very few SNA applications up to now, and virtually none for analyzing the structure of ontologies. We illustrate in this paper the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality based on Hermitian matrices, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size.},<br\/>  address = {Heidelberg},<br\/>  author = {Hoser, Bettina and Hotho, Andreas and J\u00e4schke, Robert and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {The Semantic Web: Research and Applications},<br\/>  editor = {Sure, York and Domingue, John},<br\/>  keywords = {ontology},<br\/>  month = {06},<br\/>  pages = {514-529},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Semantic Network Analysis of Ontologies},<br\/>  volume = 4011,<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c0cdbeab23ce0fc1bff5e02c99aab012\"><p>%0 Conference Paper<br\/>%1 hoser2006semantic<br\/>%A Hoser, Bettina<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B The Semantic Web: Research and Applications<br\/>%C Heidelberg<br\/>%D 2006<br\/>%E Sure, York<br\/>%E Domingue, John<br\/>%I Springer<br\/>%P 514-529<br\/>%T Semantic Network Analysis of Ontologies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hoser2006semantic.pdf<br\/>%V 4011<br\/>%X A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as (labeled, directed) graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA). While social network structures in general currently receive high attention in the Semantic Web community, there are only very few SNA applications up to now, and virtually none for analyzing the structure of ontologies. We illustrate in this paper the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality based on Hermitian matrices, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., J\u00e4schke, R., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{BibSonomy}: A Social Bookmark and Publication Sharing System<\/span>.<\/span> In: de Moor, A., Polovina, S., and Delugach, H. (eds.) Proceedings of the Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures. Aalborg University Press, Aalborg, Denmark (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2cbd8e3236adea7c54779605a5aa4fd6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2cbd8e3236adea7c54779605a5aa4fd6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2cbd8e3236adea7c54779605a5aa4fd6\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2cbd8e3236adea7c54779605a5aa4fd6\"><p>@inproceedings{hjss06bibsonomy,<br\/>  address = {Aalborg, Denmark},<br\/>  author = {Hotho, Andreas and J\u00e4schke, Robert and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures},<br\/>  editor = {de Moor, Aldo and Polovina, Simon and Delugach, Harry},<br\/>  keywords = {bookmarking},<br\/>  month = {07},<br\/>  publisher = {Aalborg University Press},<br\/>  title = {{BibSonomy}: A Social Bookmark and Publication Sharing System},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2cbd8e3236adea7c54779605a5aa4fd6\"><p>%0 Conference Paper<br\/>%1 hjss06bibsonomy<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures<br\/>%C Aalborg, Denmark<br\/>%D 2006<br\/>%E de Moor, Aldo<br\/>%E Polovina, Simon<br\/>%E Delugach, Harry<br\/>%I Aalborg University Press<br\/>%T {BibSonomy}: A Social Bookmark and Publication Sharing System<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., J\u00e4schke, R., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Trend Detection in Folksonomies<\/span>.<\/span> In: Avrithis, Y.S., Kompatsiaris, Y., Staab, S., and O\u2019Connor, N.E. (eds.) Proc. First International Conference on Semantics And Digital Media Technology (SAMT). pp. 56\u201370. Springer, Heidelberg (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hotho2006trend.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-42cda5911e901eadd0ac6a106a6aa1dc\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-42cda5911e901eadd0ac6a106a6aa1dc\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/42cda5911e901eadd0ac6a106a6aa1dc\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-42cda5911e901eadd0ac6a106a6aa1dc\">As the number of resources on the web exceeds by far the number of documents one can track, it becomes increasingly difficult to remain up to date on ones own areas of interest. The problem becomes more severe with the increasing fraction of multimedia data, from which it is difficult to extract some conceptual description of their contents. One way to overcome this problem are social bookmark tools, which are rapidly emerging on the web. In such systems, users are setting up lightweight conceptual structures called folksonomies, and overcome thus the knowledge acquisition bottleneck. As more and more people participate in the effort, the use of a common vocabulary becomes more and more stable. We present an approach for discovering topic-specific trends within folksonomies. It is based on a differential adaptation of the PageRank algorithm to the triadic hypergraph structure of a folksonomy. The approach allows for any kind of data, as it does not rely on the internal structure of the documents. In particular, this allows to consider different data types in the same analysis step. We run experiments on a large-scale real-world snapshot of a social bookmarking system.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-42cda5911e901eadd0ac6a106a6aa1dc\"><p>@inproceedings{hotho2006trend,<br\/>  abstract = {As the number of resources on the web exceeds by far the number of documents one can track, it becomes increasingly difficult to remain up to date on ones own areas of interest. The problem becomes more severe with the increasing fraction of multimedia data, from which it is difficult to extract some conceptual description of their contents. One way to overcome this problem are social bookmark tools, which are rapidly emerging on the web. In such systems, users are setting up lightweight conceptual structures called folksonomies, and overcome thus the knowledge acquisition bottleneck. As more and more people participate in the effort, the use of a common vocabulary becomes more and more stable. We present an approach for discovering topic-specific trends within folksonomies. It is based on a differential adaptation of the PageRank algorithm to the triadic hypergraph structure of a folksonomy. The approach allows for any kind of data, as it does not rely on the internal structure of the documents. In particular, this allows to consider different data types in the same analysis step. We run experiments on a large-scale real-world snapshot of a social bookmarking system.},<br\/>  address = {Heidelberg},<br\/>  author = {Hotho, Andreas and J\u00e4schke, Robert and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proc. First International Conference on Semantics And Digital Media Technology (SAMT)},<br\/>  editor = {Avrithis, Yannis S. and Kompatsiaris, Yiannis and Staab, Steffen and O'Connor, Noel E.},<br\/>  keywords = {folksonomy},<br\/>  month = 12,<br\/>  pages = {56-70},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Trend Detection in Folksonomies},<br\/>  volume = 4306,<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-42cda5911e901eadd0ac6a106a6aa1dc\"><p>%0 Conference Paper<br\/>%1 hotho2006trend<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proc. First International Conference on Semantics And Digital Media Technology (SAMT)<br\/>%C Heidelberg<br\/>%D 2006<br\/>%E Avrithis, Yannis S.<br\/>%E Kompatsiaris, Yiannis<br\/>%E Staab, Steffen<br\/>%E O'Connor, Noel E.<br\/>%I Springer<br\/>%P 56-70<br\/>%T Trend Detection in Folksonomies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hotho2006trend.pdf<br\/>%V 4306<br\/>%X As the number of resources on the web exceeds by far the number of documents one can track, it becomes increasingly difficult to remain up to date on ones own areas of interest. The problem becomes more severe with the increasing fraction of multimedia data, from which it is difficult to extract some conceptual description of their contents. One way to overcome this problem are social bookmark tools, which are rapidly emerging on the web. In such systems, users are setting up lightweight conceptual structures called folksonomies, and overcome thus the knowledge acquisition bottleneck. As more and more people participate in the effort, the use of a common vocabulary becomes more and more stable. We present an approach for discovering topic-specific trends within folksonomies. It is based on a differential adaptation of the PageRank algorithm to the triadic hypergraph structure of a folksonomy. The approach allows for any kind of data, as it does not rely on the internal structure of the documents. In particular, this allows to consider different data types in the same analysis step. We run experiments on a large-scale real-world snapshot of a social bookmarking system.<br\/>%@ 3-540-49335-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C., L\u00f6ser, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">How to model Semantic Peer-to-Peer Overlays?<\/span>.<\/span> In: Proc. P2PIR Workshop, Informatik 2006. , Dresden (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-af4e9264db9b7a77a75c9e2b70cbc56c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-af4e9264db9b7a77a75c9e2b70cbc56c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/af4e9264db9b7a77a75c9e2b70cbc56c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-af4e9264db9b7a77a75c9e2b70cbc56c\"><p>@inproceedings{schmitz2006howto,<br\/>  address = {Dresden},<br\/>  author = {Schmitz, Christoph and L\u00f6ser, Alexander},<br\/>  booktitle = {Proc. P2PIR Workshop, Informatik 2006},<br\/>  keywords = {p2p},<br\/>  month = 10,<br\/>  title = {How to model Semantic Peer-to-Peer Overlays?},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-af4e9264db9b7a77a75c9e2b70cbc56c\"><p>%0 Conference Paper<br\/>%1 schmitz2006howto<br\/>%A Schmitz, Christoph<br\/>%A L\u00f6ser, Alexander<br\/>%B Proc. P2PIR Workshop, Informatik 2006<br\/>%C Dresden<br\/>%D 2006<br\/>%T How to model Semantic Peer-to-Peer Overlays?<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., J\u00e4schke, R., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Emergent Semantics in BibSonomy<\/span>.<\/span> In: Hochberger, C. and Liskowsky, R. (eds.) Informatik 2006 - Informatik f\u00fcr Menschen. pp. 305\u2013312. Gesellschaft f\u00fcr Informatik, Bonn (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hotho2006emergent.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7a05c4bf8b724bc02841bd58c7eea90d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7a05c4bf8b724bc02841bd58c7eea90d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7a05c4bf8b724bc02841bd58c7eea90d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-7a05c4bf8b724bc02841bd58c7eea90d\">Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies, briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references, and discuss first steps towards emergent semantics.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7a05c4bf8b724bc02841bd58c7eea90d\"><p>@inproceedings{hotho2006emergent,<br\/>  abstract = {Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies, briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references, and discuss first steps towards emergent semantics.},<br\/>  address = {Bonn},<br\/>  author = {Hotho, Andreas and J\u00e4schke, Robert and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Informatik 2006 - Informatik f\u00fcr Menschen},<br\/>  editor = {Hochberger, Christian and Liskowsky, R\u00fcdiger},<br\/>  keywords = {bibsonomy},<br\/>  month = 10,<br\/>  pages = {305--312},<br\/>  publisher = {Gesellschaft f\u00fcr Informatik},<br\/>  series = {Lecture Notes in Informatics},<br\/>  title = {Emergent Semantics in BibSonomy},<br\/>  volume = 94,<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7a05c4bf8b724bc02841bd58c7eea90d\"><p>%0 Conference Paper<br\/>%1 hotho2006emergent<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Informatik 2006 - Informatik f\u00fcr Menschen<br\/>%C Bonn<br\/>%D 2006<br\/>%E Hochberger, Christian<br\/>%E Liskowsky, R\u00fcdiger<br\/>%I Gesellschaft f\u00fcr Informatik<br\/>%P 305--312<br\/>%T Emergent Semantics in BibSonomy<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hotho2006emergent.pdf<br\/>%V 94<br\/>%X Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies, briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references, and discuss first steps towards emergent semantics.<br\/>%@ 978-3-88579-188-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">TRIAS - An Algorithm for Mining Iceberg Tri-Lattices<\/span>.<\/span> In: Proc. 6th ICDM conference. , Hong Kong (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-26ff196335caf137b1862d050bc1c515\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-26ff196335caf137b1862d050bc1c515\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/26ff196335caf137b1862d050bc1c515\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-26ff196335caf137b1862d050bc1c515\"><p>@inproceedings{trias06jaeschke,<br\/>  address = {Hong Kong},<br\/>  author = {J\u00e4schke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},<br\/>  journal = {Proc. 6th ICDM conference},<br\/>  keywords = {algorithm},<br\/>  month = 12,<br\/>  note = {(to appear)},<br\/>  title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-26ff196335caf137b1862d050bc1c515\"><p>%0 Conference Paper<br\/>%1 trias06jaeschke<br\/>%A J\u00e4schke, Robert<br\/>%A Hotho, Andreas<br\/>%A Schmitz, Christoph<br\/>%A Ganter, Bernhard<br\/>%A Stumme, Gerd<br\/>%C Hong Kong<br\/>%D 2006<br\/>%J Proc. 6th ICDM conference<br\/>%T TRIAS - An Algorithm for Mining Iceberg Tri-Lattices<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., J\ufffdschke, R., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Information Retrieval in Folksonomies: Search and Ranking<\/span>.<\/span> In: Sure, Y. and Domingue, J. (eds.) The Semantic Web: Research and Applications. pp. 411\u2013426. Springer, Heidelberg (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b1e4dabc5b558aeea1b839a7f123eef1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b1e4dabc5b558aeea1b839a7f123eef1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b1e4dabc5b558aeea1b839a7f123eef1\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b1e4dabc5b558aeea1b839a7f123eef1\"><p>@inproceedings{hotho2006information,<br\/>  address = {Heidelberg},<br\/>  author = {Hotho, Andreas and J\ufffdschke, Robert and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {The Semantic Web: Research and Applications},<br\/>  editor = {Sure, York and Domingue, John},<br\/>  keywords = {pagerank},<br\/>  month = {06},<br\/>  pages = {411-426},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Information Retrieval in Folksonomies: Search and Ranking},<br\/>  volume = 4011,<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b1e4dabc5b558aeea1b839a7f123eef1\"><p>%0 Conference Paper<br\/>%1 hotho2006information<br\/>%A Hotho, Andreas<br\/>%A J\ufffdschke, Robert<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B The Semantic Web: Research and Applications<br\/>%C Heidelberg<br\/>%D 2006<br\/>%E Sure, York<br\/>%E Domingue, John<br\/>%I Springer<br\/>%P 411-426<br\/>%T Information Retrieval in Folksonomies: Search and Ranking<br\/>%V 4011<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C., Hotho, A., J\u00e4schke, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Content Aggregation on Knowledge Bases using Graph Clustering<\/span>.<\/span> In: Proceedings of the 3rd European Semantic Web Conference. pp. 530\u2013544. Springer, Budva, Montenegro (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2006\/schmitz2006sumarize_eswc.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9a06428ec3bd72e3ea6c7a8f08e2bb85\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9a06428ec3bd72e3ea6c7a8f08e2bb85\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9a06428ec3bd72e3ea6c7a8f08e2bb85\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9a06428ec3bd72e3ea6c7a8f08e2bb85\"><p>@inproceedings{schmitz2006content,<br\/>  address = {Budva, Montenegro},<br\/>  author = {Schmitz, Christoph and Hotho, Andreas and J\u00e4schke, Robert and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 3rd European Semantic Web Conference},<br\/>  keywords = {theory},<br\/>  month = {06},<br\/>  pages = {530-544},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {Content Aggregation on Knowledge Bases using Graph Clustering},<br\/>  volume = 4011,<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9a06428ec3bd72e3ea6c7a8f08e2bb85\"><p>%0 Conference Paper<br\/>%1 schmitz2006content<br\/>%A Schmitz, Christoph<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 3rd European Semantic Web Conference<br\/>%C Budva, Montenegro<br\/>%D 2006<br\/>%I Springer<br\/>%P 530-544<br\/>%T Content Aggregation on Knowledge Bases using Graph Clustering<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2006\/schmitz2006sumarize_eswc.pdf<br\/>%V 4011<br\/>%@ 3-540-34544-2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bloehdorn, S., Cimiano, P., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Learning Ontologies to Improve Text Clustering and Classification<\/span>.<\/span> In: From Data and Information Analysis to Knowledge Engineering. pp. 334\u2013341. Springer Berlin Heidelberg (2006). https:\/\/doi.org\/http:\/\/dx.doi.org\/10.1007\/3-540-31314-1_40.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2006\/2006-03-gfkl05-bloehdorn-etal-learning-ontologies.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-bc1d40cf4fd64780ecf712b1e40f31de\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-bc1d40cf4fd64780ecf712b1e40f31de\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/3-540-31314-1_40\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/bc1d40cf4fd64780ecf712b1e40f31de\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-bc1d40cf4fd64780ecf712b1e40f31de\">Recent work has shown improvements in text clustering and classification tasks by integrating conceptual features extracted from ontologies. In this paper we present text mining experiments in the medical domain in which the ontological structures used are acquired automatically in an unsupervised learning process from the text corpus in question. We compare results obtained using the automatically learned ontologies with those obtained using manually engineered ones. Our results show that both types of ontologies improve results on text clustering and classification tasks, whereby the automatically acquired ontologies yield a improvement competitive with the manually engineered ones. ER -<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-bc1d40cf4fd64780ecf712b1e40f31de\"><p>@incollection{bloehdorn2006learning,<br\/>  abstract = {Recent work has shown improvements in text clustering and classification tasks by integrating conceptual features extracted from ontologies. In this paper we present text mining experiments in the medical domain in which the ontological structures used are acquired automatically in an unsupervised learning process from the text corpus in question. We compare results obtained using the automatically learned ontologies with those obtained using manually engineered ones. Our results show that both types of ontologies improve results on text clustering and classification tasks, whereby the automatically acquired ontologies yield a improvement competitive with the manually engineered ones. ER -},<br\/>  author = {Bloehdorn, Stephan and Cimiano, Philipp and Hotho, Andreas},<br\/>  booktitle = {From Data and Information Analysis to Knowledge Engineering},<br\/>  keywords = {selected},<br\/>  pages = {334--341},<br\/>  publisher = {Springer Berlin Heidelberg},<br\/>  title = {Learning Ontologies to Improve Text Clustering and Classification},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-bc1d40cf4fd64780ecf712b1e40f31de\"><p>%0 Book Section<br\/>%1 bloehdorn2006learning<br\/>%A Bloehdorn, Stephan<br\/>%A Cimiano, Philipp<br\/>%A Hotho, Andreas<br\/>%B From Data and Information Analysis to Knowledge Engineering<br\/>%D 2006<br\/>%I Springer Berlin Heidelberg<br\/>%P 334--341<br\/>%R http:\/\/dx.doi.org\/10.1007\/3-540-31314-1_40<br\/>%T Learning Ontologies to Improve Text Clustering and Classification<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2006\/2006-03-gfkl05-bloehdorn-etal-learning-ontologies.pdf<br\/>%X Recent work has shown improvements in text clustering and classification tasks by integrating conceptual features extracted from ontologies. In this paper we present text mining experiments in the medical domain in which the ontological structures used are acquired automatically in an unsupervised learning process from the text corpus in question. We compare results obtained using the automatically learned ontologies with those obtained using manually engineered ones. Our results show that both types of ontologies improve results on text clustering and classification tasks, whereby the automatically acquired ontologies yield a improvement competitive with the manually engineered ones. ER -<br\/>%@ 978-3-540-31313-7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Mladenic, D., Semeraro, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Workshop on Web Mining 2006 (WebMine)<\/span>.<\/span> (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/webmine2006\/pdf\/WebMine2006.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ecab780995c630270857b610c7c54e67\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ecab780995c630270857b610c7c54e67\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ecab780995c630270857b610c7c54e67\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ecab780995c630270857b610c7c54e67\"><p>@proceedings{berendt2006webmining,<br\/>  editor = {Berendt, B. and Hotho, A. and Mladenic, D. and Semeraro, G.},<br\/>  keywords = {workshop},<br\/>  title = {Workshop on Web Mining 2006 (WebMine)},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ecab780995c630270857b610c7c54e67\"><p>%0 Conference Proceedings<br\/>%1 berendt2006webmining<br\/>%D 2006<br\/>%E Berendt, B.<br\/>%E Hotho, A.<br\/>%E Mladenic, D.<br\/>%E Semeraro, G.<br\/>%T Workshop on Web Mining 2006 (WebMine)<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/webmine2006\/pdf\/WebMine2006.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C., Hotho, A., J\u00e4schke, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Kollaboratives Wissensmanagement<\/span>.<\/span> In: Pellegrini, T. and Blumauer, A. (eds.) Semantic Web - Wege zur vernetzten Wissensgesellschaft. pp. 273\u2013290. Springer (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hotho2006kollaboratives.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-53e13744981f2c04d9239e0cf9b4e689\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-53e13744981f2c04d9239e0cf9b4e689\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/53e13744981f2c04d9239e0cf9b4e689\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-53e13744981f2c04d9239e0cf9b4e689\">Wissensmanagement in zentralisierten Wissensbasen erfordert einen hohen Aufwand f\u00fcr Erstellung und Wartung, und es entspricht nicht immer den Anforderungen der Benutzer. Wir geben in diesem Kapitel einen \u00dcberblick \u00fcber zwei aktuelle Ans\u00e4tze, die durch kollaboratives Wissensmanagement diese Probleme l\u00f6sen k\u00f6nnen. Im Peer-to-Peer-Wissensmanagement unterhalten Benutzer dezentrale Wissensbasen, die dann vernetzt werden k\u00f6nnen, um andere Benutzer eigene Inhalte nutzen zu lassen. Folksonomies versprechen, die Wissensakquisition so einfach wie m\u00f6glich zu gestalten und so viele Benutzer in den Aufbau und die Pflege einer gemeinsamen Wissensbasis einzubeziehen.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-53e13744981f2c04d9239e0cf9b4e689\"><p>@inbook{schmitz2006kollaboratives,<br\/>  abstract = {Wissensmanagement in zentralisierten Wissensbasen erfordert einen hohen Aufwand f\u00fcr Erstellung und Wartung, und es entspricht nicht immer den Anforderungen der Benutzer. Wir geben in diesem Kapitel einen \u00dcberblick \u00fcber zwei aktuelle Ans\u00e4tze, die durch kollaboratives Wissensmanagement diese Probleme l\u00f6sen k\u00f6nnen. Im Peer-to-Peer-Wissensmanagement unterhalten Benutzer dezentrale Wissensbasen, die dann vernetzt werden k\u00f6nnen, um andere Benutzer eigene Inhalte nutzen zu lassen. Folksonomies versprechen, die Wissensakquisition so einfach wie m\u00f6glich zu gestalten und so viele Benutzer in den Aufbau und die Pflege einer gemeinsamen Wissensbasis einzubeziehen.},<br\/>  author = {Schmitz, Christoph and Hotho, Andreas and J\u00e4schke, Robert and Stumme, Gerd},<br\/>  booktitle = {Semantic Web - Wege zur vernetzten Wissensgesellschaft},<br\/>  editor = {Pellegrini, Tassilo and Blumauer, Andreas},<br\/>  keywords = {knowledge},<br\/>  pages = {273-290},<br\/>  publisher = {Springer},<br\/>  title = {Kollaboratives Wissensmanagement},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-53e13744981f2c04d9239e0cf9b4e689\"><p>%0 Book Section<br\/>%1 schmitz2006kollaboratives<br\/>%A Schmitz, Christoph<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Stumme, Gerd<br\/>%B Semantic Web - Wege zur vernetzten Wissensgesellschaft<br\/>%D 2006<br\/>%E Pellegrini, Tassilo<br\/>%E Blumauer, Andreas<br\/>%I Springer<br\/>%P 273-290<br\/>%T Kollaboratives Wissensmanagement<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hotho2006kollaboratives.pdf<br\/>%X Wissensmanagement in zentralisierten Wissensbasen erfordert einen hohen Aufwand f\u00fcr Erstellung und Wartung, und es entspricht nicht immer den Anforderungen der Benutzer. Wir geben in diesem Kapitel einen \u00dcberblick \u00fcber zwei aktuelle Ans\u00e4tze, die durch kollaboratives Wissensmanagement diese Probleme l\u00f6sen k\u00f6nnen. Im Peer-to-Peer-Wissensmanagement unterhalten Benutzer dezentrale Wissensbasen, die dann vernetzt werden k\u00f6nnen, um andere Benutzer eigene Inhalte nutzen zu lassen. Folksonomies versprechen, die Wissensakquisition so einfach wie m\u00f6glich zu gestalten und so viele Benutzer in den Aufbau und die Pflege einer gemeinsamen Wissensbasis einzubeziehen.<br\/>%@ 3-540-29324-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Hotho, A., Berendt, B.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Web Mining - State of the Art and Future Directions<\/span>.<\/span> Journal of Web Semantics. 4, 124\u2013143 (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/stumme2006semantic.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9937253e6b2591267a0596fa597a4b96\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9937253e6b2591267a0596fa597a4b96\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9937253e6b2591267a0596fa597a4b96\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9937253e6b2591267a0596fa597a4b96\">SemanticWeb Mining aims at combining the two fast-developing research areas SemanticWeb andWeb Mining. This survey analyzes the convergence of trends from both areas: an increasing number of researchers is working on improving the results ofWeb Mining by exploiting semantic structures in theWeb, and they make use ofWeb Mining techniques for building the Semantic Web. Last but not least, these techniques can be used for mining the Semantic Web itself. The Semantic Web is the second-generation WWW, enriched by machine-processable information which supports the user in his tasks. Given the enormous size even of today\u2019s Web, it is impossible to manually enrich all of these resources. Therefore, automated schemes for learning the relevant information are increasingly being used. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of the data being mined, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web sites and navigation behavior are becoming more and more common. Furthermore, mining the Semantic Web itself is another upcoming application. We argue that the two areas Web Mining and Semantic Web need each other to fulfill their goals, but that the full potential of this convergence is not yet realized. This paper gives an overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9937253e6b2591267a0596fa597a4b96\"><p>@article{jws2006Semantic,<br\/>  abstract = {SemanticWeb Mining aims at combining the two fast-developing research areas SemanticWeb andWeb Mining. This survey analyzes the convergence of trends from both areas: an increasing number of researchers is working on improving the results ofWeb Mining by exploiting semantic structures in theWeb, and they make use ofWeb Mining techniques for building the Semantic Web. Last but not least, these techniques can be used for mining the Semantic Web itself. The Semantic Web is the second-generation WWW, enriched by machine-processable information which supports the user in his tasks. Given the enormous size even of today\u2019s Web, it is impossible to manually enrich all of these resources. Therefore, automated schemes for learning the relevant information are increasingly being used. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of the data being mined, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web sites and navigation behavior are becoming more and more common. Furthermore, mining the Semantic Web itself is another upcoming application. We argue that the two areas Web Mining and Semantic Web need each other to fulfill their goals, but that the full potential of this convergence is not yet realized. This paper gives an overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable.},<br\/>  author = {Stumme, Gerd and Hotho, Andreas and Berendt, Bettina},<br\/>  journal = {Journal of Web Semantics},<br\/>  keywords = {sota},<br\/>  number = 2,<br\/>  pages = {124-143},<br\/>  publisher = {Elsevier},<br\/>  title = {Semantic Web Mining - State of the Art and Future Directions},<br\/>  volume = 4,<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9937253e6b2591267a0596fa597a4b96\"><p>%0 Journal Article<br\/>%1 jws2006Semantic<br\/>%A Stumme, Gerd<br\/>%A Hotho, Andreas<br\/>%A Berendt, Bettina<br\/>%D 2006<br\/>%I Elsevier<br\/>%J Journal of Web Semantics<br\/>%N 2<br\/>%P 124-143<br\/>%T Semantic Web Mining - State of the Art and Future Directions<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/stumme2006semantic.pdf<br\/>%V 4<br\/>%X SemanticWeb Mining aims at combining the two fast-developing research areas SemanticWeb andWeb Mining. This survey analyzes the convergence of trends from both areas: an increasing number of researchers is working on improving the results ofWeb Mining by exploiting semantic structures in theWeb, and they make use ofWeb Mining techniques for building the Semantic Web. Last but not least, these techniques can be used for mining the Semantic Web itself. The Semantic Web is the second-generation WWW, enriched by machine-processable information which supports the user in his tasks. Given the enormous size even of today\u2019s Web, it is impossible to manually enrich all of these resources. Therefore, automated schemes for learning the relevant information are increasingly being used. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of the data being mined, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web sites and navigation behavior are becoming more and more common. Furthermore, mining the Semantic Web itself is another upcoming application. We argue that the two areas Web Mining and Semantic Web need each other to fulfill their goals, but that the full potential of this convergence is not yet realized. This paper gives an overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ackermann, M., Berendt, B., Grobelnik, M., Hotho, A., Mladenic, D., Semeraro, G., Spiliopoulou, M., Stumme, G., Svatek, V., van Someren, M. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantics, Web and Mining<\/span>.<\/span> Springer, Heidelberg (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/11908678\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f8335dd42e7eec61d60bbeced71ff3be\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f8335dd42e7eec61d60bbeced71ff3be\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f8335dd42e7eec61d60bbeced71ff3be\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f8335dd42e7eec61d60bbeced71ff3be\"><p>@book{Semantic2006Ackermann,<br\/>  address = {Heidelberg},<br\/>  editor = {Ackermann, Markus and Berendt, Bettina and Grobelnik, Marko and Hotho, Andreas and Mladenic, Dunja and Semeraro, Giovanni and Spiliopoulou, Myra and Stumme, Gerd and Svatek, Vojtech and van Someren, Maarten},<br\/>  keywords = {itegpub},<br\/>  publisher = {Springer},<br\/>  title = {Semantics, Web and Mining},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f8335dd42e7eec61d60bbeced71ff3be\"><p>%0 Book<br\/>%1 Semantic2006Ackermann<br\/>%C Heidelberg<br\/>%D 2006<br\/>%E Ackermann, Markus<br\/>%E Berendt, Bettina<br\/>%E Grobelnik, Marko<br\/>%E Hotho, Andreas<br\/>%E Mladenic, Dunja<br\/>%E Semeraro, Giovanni<br\/>%E Spiliopoulou, Myra<br\/>%E Stumme, Gerd<br\/>%E Svatek, Vojtech<br\/>%E van Someren, Maarten<br\/>%I Springer<br\/>%T Semantics, Web and Mining<br\/>%U http:\/\/dx.doi.org\/10.1007\/11908678<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bloehdorn, S., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Boosting for Text Classification with Semantic Features<\/span>.<\/span> (2006). https:\/\/doi.org\/10.1007\/11899402_10.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/11899402_10\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2a0635c829f9d332b507469cf3a000b7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2a0635c829f9d332b507469cf3a000b7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1007\/11899402_10\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2a0635c829f9d332b507469cf3a000b7\/kde\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2a0635c829f9d332b507469cf3a000b7\"><p>@book{citeulike:910161,<br\/>  author = {Bloehdorn, Stephan and Hotho, Andreas},<br\/>  journal = {Lecture Notes in Computer Science : Advances in Web Mining and Web Usage Analysis},<br\/>  keywords = {classification},<br\/>  pages = {149--166},<br\/>  title = {Boosting for Text Classification with Semantic Features},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2a0635c829f9d332b507469cf3a000b7\"><p>%0 Book<br\/>%1 citeulike:910161<br\/>%A Bloehdorn, Stephan<br\/>%A Hotho, Andreas<br\/>%D 2006<br\/>%J Lecture Notes in Computer Science : Advances in Web Mining and Web Usage Analysis<br\/>%P 149--166<br\/>%R 10.1007\/11899402_10<br\/>%T Boosting for Text Classification with Semantic Features<br\/>%U http:\/\/dx.doi.org\/10.1007\/11899402_10<br\/>%@ 978-3-540-47127-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., J\u00e4schke, R., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">FolkRank: A Ranking Algorithm for Folksonomies<\/span>.<\/span> In: Proc. FGIR 2006 (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hotho2006folkrank.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4d8b4f79814691fbe6db8357d63206a1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4d8b4f79814691fbe6db8357d63206a1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4d8b4f79814691fbe6db8357d63206a1\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-4d8b4f79814691fbe6db8357d63206a1\">In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. A long version of this paper has been published at the European Semantic Web Conference 2006.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4d8b4f79814691fbe6db8357d63206a1\"><p>@inproceedings{hotho2006folkrank,<br\/>  abstract = {In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. A long version of this paper has been published at the European Semantic Web Conference 2006.},<br\/>  author = {Hotho, Andreas and J\u00e4schke, Robert and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proc. FGIR 2006},<br\/>  keywords = {itegpub},<br\/>  title = {FolkRank: A Ranking Algorithm for Folksonomies},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4d8b4f79814691fbe6db8357d63206a1\"><p>%0 Conference Paper<br\/>%1 hotho2006folkrank<br\/>%A Hotho, Andreas<br\/>%A J\u00e4schke, Robert<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proc. FGIR 2006<br\/>%D 2006<br\/>%T FolkRank: A Ranking Algorithm for Folksonomies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2006\/hotho2006folkrank.pdf<br\/>%X In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. A long version of this paper has been published at the European Semantic Web Conference 2006.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Macek, K.H.N.B.-E.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">\u00c4quivalenzbetrachtungen zu den Klassen N und NC<\/span><\/span>, (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-68f72b536640097d2187db01c8a5c23a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-68f72b536640097d2187db01c8a5c23a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/68f72b536640097d2187db01c8a5c23a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-68f72b536640097d2187db01c8a5c23a\">Die vorliegende Studienarbeit besch\u00e4ftigt sich mit dem Artikel \"Separating NC along the \\delta axis\" von Bellantoni und Oitavem (ENTCS 2003). Darin wird ein Termsystem N* \u00fcber Bin\u00e4rb\u00e4umen mit Blattspeicherung, angereichert um Konstanten f\u00fcr Baumrekursion, vorgestellt und im Stile Bellantoni\/Niggl ein Ma\u00df \\rho auf N* erkl\u00e4rt. Das System N besteht dann aus genau den geschlossenen N*-Termen mit \\rho-Ma\u00df kleiner order gleich 1. Nach sorgf\u00e4ltiger Ausarbeitung der in der Arbeit dargestellten Ideen und Konstruktionen f\u00fcr den Beweis der Vollst\u00e4ndigkeit des Systems N, da\u00df n\u00e4mlich jede NC-Funktion in System N definiert (berechnet) werden kann, kommt diese Studienarbeit zu dem Schlu\u00df, da\u00df Vollst\u00e4ndigkeit als zentrale Inklusion in der Charakterisierung von NC durch N so wie vorgestellt nicht gehalten werden kann.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-68f72b536640097d2187db01c8a5c23a\"><p>@misc{macek2006quivalenzbetrachtungen,<br\/>  abstract = {Die vorliegende Studienarbeit besch\u00e4ftigt sich mit dem Artikel \"Separating NC along the \\delta axis\" von Bellantoni und Oitavem (ENTCS 2003). Darin wird ein Termsystem N* \u00fcber Bin\u00e4rb\u00e4umen mit Blattspeicherung, angereichert um Konstanten f\u00fcr Baumrekursion, vorgestellt und im Stile Bellantoni\/Niggl ein Ma\u00df \\rho auf N* erkl\u00e4rt. Das System N besteht dann aus genau den geschlossenen N*-Termen mit \\rho-Ma\u00df kleiner order gleich 1. Nach sorgf\u00e4ltiger Ausarbeitung der in der Arbeit dargestellten Ideen und Konstruktionen f\u00fcr den Beweis der Vollst\u00e4ndigkeit des Systems N, da\u00df n\u00e4mlich jede NC-Funktion in System N definiert (berechnet) werden kann, kommt diese Studienarbeit zu dem Schlu\u00df, da\u00df Vollst\u00e4ndigkeit als zentrale Inklusion in der Charakterisierung von NC durch N so wie vorgestellt nicht gehalten werden kann.},<br\/>  author = {Macek, Karl Heinz Niggl Bj\u00f6rn-Elmar},<br\/>  keywords = {Recursion},<br\/>  title = {\u00c4quivalenzbetrachtungen zu den Klassen N und NC},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-68f72b536640097d2187db01c8a5c23a\"><p>%0 Generic<br\/>%1 macek2006quivalenzbetrachtungen<br\/>%A Macek, Karl Heinz Niggl Bj\u00f6rn-Elmar<br\/>%D 2006<br\/>%T \u00c4quivalenzbetrachtungen zu den Klassen N und NC<br\/>%X Die vorliegende Studienarbeit besch\u00e4ftigt sich mit dem Artikel \"Separating NC along the \\delta axis\" von Bellantoni und Oitavem (ENTCS 2003). Darin wird ein Termsystem N* \u00fcber Bin\u00e4rb\u00e4umen mit Blattspeicherung, angereichert um Konstanten f\u00fcr Baumrekursion, vorgestellt und im Stile Bellantoni\/Niggl ein Ma\u00df \\rho auf N* erkl\u00e4rt. Das System N besteht dann aus genau den geschlossenen N*-Termen mit \\rho-Ma\u00df kleiner order gleich 1. Nach sorgf\u00e4ltiger Ausarbeitung der in der Arbeit dargestellten Ideen und Konstruktionen f\u00fcr den Beweis der Vollst\u00e4ndigkeit des Systems N, da\u00df n\u00e4mlich jede NC-Funktion in System N definiert (berechnet) werden kann, kommt diese Studienarbeit zu dem Schlu\u00df, da\u00df Vollst\u00e4ndigkeit als zentrale Inklusion in der Charakterisierung von NC durch N so wie vorgestellt nicht gehalten werden kann.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Haase, P., Ehrig, M., Hotho, A., Schnizler, B.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Personalized Information Access in a Bibliographic Peer-to-Peer System<\/span>.<\/span> In: Staab, S. and Stuckenschmidt, H. (eds.) Peer-to-Peer and SemanticWeb, Decentralized Management and Exchange of Knowledge and Information. pp. 143\u2013158. Springer (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7e995de813d2ff340285a51ddeaf8892\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7e995de813d2ff340285a51ddeaf8892\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7e995de813d2ff340285a51ddeaf8892\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7e995de813d2ff340285a51ddeaf8892\"><p>@incollection{Haase04Personalized,<br\/>  author = {Haase, Peter and Ehrig, Marc and Hotho, Andreas and Schnizler, Bj\u00f6rn},<br\/>  booktitle = {Peer-to-Peer and SemanticWeb, Decentralized Management and Exchange of Knowledge and Information},<br\/>  editor = {Staab, Steffen and Stuckenschmidt, Heiner},<br\/>  keywords = {ontology},<br\/>  pages = {143--158},<br\/>  publisher = {Springer},<br\/>  title = {Personalized Information Access in a Bibliographic Peer-to-Peer System},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7e995de813d2ff340285a51ddeaf8892\"><p>%0 Book Section<br\/>%1 Haase04Personalized<br\/>%A Haase, Peter<br\/>%A Ehrig, Marc<br\/>%A Hotho, Andreas<br\/>%A Schnizler, Bj\u00f6rn<br\/>%B Peer-to-Peer and SemanticWeb, Decentralized Management and Exchange of Knowledge and Information<br\/>%D 2006<br\/>%E Staab, Steffen<br\/>%E Stuckenschmidt, Heiner<br\/>%I Springer<br\/>%P 143--158<br\/>%T Personalized Information Access in a Bibliographic Peer-to-Peer System<br\/>%@ 3-540-28346-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Alani, H., Hoser, B., Schmitz, C., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the 2nd Workshop on Semantic Network Analysis<\/span>.<\/span> (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/sna2006\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-786a452a14c5189d82dc56f16cc2a266\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-786a452a14c5189d82dc56f16cc2a266\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/786a452a14c5189d82dc56f16cc2a266\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-786a452a14c5189d82dc56f16cc2a266\"><p>@proceedings{alani2006proceedings,<br\/>  editor = {Alani, Harith and Hoser, Bettina and Schmitz, Christoph and Stumme, Gerd},<br\/>  keywords = {workshop},<br\/>  title = {Proceedings of the 2nd Workshop on Semantic Network Analysis},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-786a452a14c5189d82dc56f16cc2a266\"><p>%0 Conference Proceedings<br\/>%1 alani2006proceedings<br\/>%D 2006<br\/>%E Alani, Harith<br\/>%E Hoser, Bettina<br\/>%E Schmitz, Christoph<br\/>%E Stumme, Gerd<br\/>%T Proceedings of the 2nd Workshop on Semantic Network Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/sna2006\/<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R., Hotho, A., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Wege zur Entdeckung von Communities in Folksonomies<\/span>.<\/span> In: Bra\u00df, S. and Hinneburg, A. (eds.) Proc. 18. Workshop Grundlagen von Datenbanken. pp. 80\u201384. Martin-Luther-Universit\u00e4t, Halle-Wittenberg (2006).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2b6be3bd5daee7119973fcf69909956f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2b6be3bd5daee7119973fcf69909956f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2b6be3bd5daee7119973fcf69909956f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2b6be3bd5daee7119973fcf69909956f\"><p>@inproceedings{jaeschke06wege,<br\/>  address = {Halle-Wittenberg},<br\/>  author = {J\u00e4schke, Robert and Hotho, Andreas and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proc. 18. Workshop Grundlagen von Datenbanken},<br\/>  editor = {Bra\u00df, Stefan and Hinneburg, Alexander},<br\/>  keywords = {bibsonomy},<br\/>  month = {06},<br\/>  pages = {80-84},<br\/>  publisher = {Martin-Luther-Universit\u00e4t},<br\/>  title = {Wege zur Entdeckung von Communities in Folksonomies},<br\/>  year = 2006<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2b6be3bd5daee7119973fcf69909956f\"><p>%0 Conference Paper<br\/>%1 jaeschke06wege<br\/>%A J\u00e4schke, Robert<br\/>%A Hotho, Andreas<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proc. 18. Workshop Grundlagen von Datenbanken<br\/>%C Halle-Wittenberg<br\/>%D 2006<br\/>%E Bra\u00df, Stefan<br\/>%E Hinneburg, Alexander<br\/>%I Martin-Luther-Universit\u00e4t<br\/>%P 80-84<br\/>%T Wege zur Entdeckung von Communities in Folksonomies<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2005\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2005<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Dau, F., Mugnier, M.-L., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Contributions to ICCS 2005<\/span>.<\/span> kassel university press, Kassel (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/conf\/iccs05\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-922eeab1c4a936636813e44c6b42092e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-922eeab1c4a936636813e44c6b42092e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/922eeab1c4a936636813e44c6b42092e\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-922eeab1c4a936636813e44c6b42092e\"><p>@proceedings{dau05contributions,<br\/>  address = {Kassel},<br\/>  booktitle = {Contributions to ICCS 2005},<br\/>  editor = {Dau, Frithjof and Mugnier, Marie-Laure and Stumme, Gerd},<br\/>  keywords = {Germany},<br\/>  publisher = {kassel university press},<br\/>  title = {Contributions to ICCS 2005},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-922eeab1c4a936636813e44c6b42092e\"><p>%0 Conference Proceedings<br\/>%1 dau05contributions<br\/>%B Contributions to ICCS 2005<br\/>%C Kassel<br\/>%D 2005<br\/>%E Dau, Frithjof<br\/>%E Mugnier, Marie-Laure<br\/>%E Stumme, Gerd<br\/>%I kassel university press<br\/>%T Contributions to ICCS 2005<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/conf\/iccs05<br\/>%@ 3-89958-138-5<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Haase, P., Schmitz, C., Sure, Y. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ontologies in Peer-to-Peer Communities<\/span>.<\/span> , Heraklion, Greece (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/ontop2p2005\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7d5fd542c189588607dd56fed83a82fe\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7d5fd542c189588607dd56fed83a82fe\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7d5fd542c189588607dd56fed83a82fe\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7d5fd542c189588607dd56fed83a82fe\"><p>@proceedings{haase2005ontologies,<br\/>  address = {Heraklion, Greece},<br\/>  editor = {Haase, Peter and Schmitz, Christoph and Sure, York},<br\/>  keywords = {ontology},<br\/>  month = {05},<br\/>  title = {Ontologies in Peer-to-Peer Communities},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7d5fd542c189588607dd56fed83a82fe\"><p>%0 Conference Proceedings<br\/>%1 haase2005ontologies<br\/>%C Heraklion, Greece<br\/>%D 2005<br\/>%E Haase, Peter<br\/>%E Schmitz, Christoph<br\/>%E Sure, York<br\/>%T Ontologies in Peer-to-Peer Communities<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/ontop2p2005<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ganter, B., Stumme, G., Wille, R. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Formal Concept Analysis: Foundations and Applications<\/span>.<\/span> Springer (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6473a4b020235049c58ab9875f76e97e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6473a4b020235049c58ab9875f76e97e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6473a4b020235049c58ab9875f76e97e\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6473a4b020235049c58ab9875f76e97e\"><p>@book{noauthororeditor,<br\/>  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},<br\/>  keywords = {FCA},<br\/>  publisher = {Springer},<br\/>  title = {Formal Concept Analysis: Foundations and Applications},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6473a4b020235049c58ab9875f76e97e\"><p>%0 Book<br\/>%1 noauthororeditor<br\/>%D 2005<br\/>%E Ganter, Bernhard<br\/>%E Stumme, Gerd<br\/>%E Wille, Rudolf<br\/>%I Springer<br\/>%T Formal Concept Analysis: Foundations and Applications<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., N\u00fcrnberger, A., Paa\u00df, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Brief Survey of Text Mining<\/span>.<\/span> LDV Forum - GLDV Journal for Computational Linguistics and Language Technology. 20, 19\u201362 (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2005\/hotho05TextMining.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9c4995c938c1885ef7321257285bc202\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9c4995c938c1885ef7321257285bc202\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9c4995c938c1885ef7321257285bc202\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9c4995c938c1885ef7321257285bc202\"><p>@article{hotho-etal-ldv-2005,<br\/>  author = {Hotho, Andreas and N\u00fcrnberger, Andreas and Paa\u00df, Gerhard},<br\/>  journal = {LDV Forum - GLDV Journal for Computational Linguistics and Language Technology},<br\/>  keywords = {ontology},<br\/>  month = {05},<br\/>  number = 1,<br\/>  pages = {19-62},<br\/>  title = {A Brief Survey of Text Mining},<br\/>  volume = 20,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9c4995c938c1885ef7321257285bc202\"><p>%0 Journal Article<br\/>%1 hotho-etal-ldv-2005<br\/>%A Hotho, Andreas<br\/>%A N\u00fcrnberger, Andreas<br\/>%A Paa\u00df, Gerhard<br\/>%D 2005<br\/>%J LDV Forum - GLDV Journal for Computational Linguistics and Language Technology<br\/>%N 1<br\/>%P 19-62<br\/>%T A Brief Survey of Text Mining<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2005\/hotho05TextMining.pdf<br\/>%V 20<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Self-Organizing Communities in Peer-to-Peer Knowledge Management<\/span>.<\/span> In: Proc. ESWC 2005 Workshop on Ontologies in Peer-to-Peer Communities. , Heraklion, Greece (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/ontop2p.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-12c3d31dac7c7b14d9fc9482425b3957\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-12c3d31dac7c7b14d9fc9482425b3957\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/12c3d31dac7c7b14d9fc9482425b3957\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-12c3d31dac7c7b14d9fc9482425b3957\"><p>@inproceedings{schmitz2005towards,<br\/>  address = {Heraklion, Greece},<br\/>  author = {Schmitz, Christoph},<br\/>  booktitle = {Proc. ESWC 2005 Workshop on Ontologies in Peer-to-Peer Communities},<br\/>  keywords = {community},<br\/>  month = {05},<br\/>  title = {Towards Self-Organizing Communities in Peer-to-Peer Knowledge Management},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-12c3d31dac7c7b14d9fc9482425b3957\"><p>%0 Conference Paper<br\/>%1 schmitz2005towards<br\/>%A Schmitz, Christoph<br\/>%B Proc. ESWC 2005 Workshop on Ontologies in Peer-to-Peer Communities<br\/>%C Heraklion, Greece<br\/>%D 2005<br\/>%T Towards Self-Organizing Communities in Peer-to-Peer Knowledge Management<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/ontop2p.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Content Aggregation on Knowledge Bases through Graph Clustering<\/span>.<\/span> In: Bra\u00df, S. and Goldberg, C. (eds.) Proc. 17. GI-Workshop ``Grundlagen von Datenbanken\u2019\u2019. , W\u00f6rlitz (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/gvd2005_schmitz.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d4de2a97be96bef44e907de9ddf7719e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d4de2a97be96bef44e907de9ddf7719e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d4de2a97be96bef44e907de9ddf7719e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d4de2a97be96bef44e907de9ddf7719e\"><p>@inproceedings{schmitz2005towards,<br\/>  address = {W\u00f6rlitz},<br\/>  author = {Schmitz, Christoph},<br\/>  booktitle = {Proc. 17. GI-Workshop ``Grundlagen von Datenbanken''},<br\/>  editor = {Bra\u00df, Stefan and Goldberg, Christian},<br\/>  keywords = {base},<br\/>  month = {05},<br\/>  title = {Towards Content Aggregation on Knowledge Bases through Graph Clustering},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d4de2a97be96bef44e907de9ddf7719e\"><p>%0 Conference Paper<br\/>%1 schmitz2005towards<br\/>%A Schmitz, Christoph<br\/>%B Proc. 17. GI-Workshop ``Grundlagen von Datenbanken''<br\/>%C W\u00f6rlitz<br\/>%D 2005<br\/>%E Bra\u00df, Stefan<br\/>%E Goldberg, Christian<br\/>%T Towards Content Aggregation on Knowledge Bases through Graph Clustering<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/gvd2005_schmitz.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Hoser, B., Schmitz, C., Alani, H. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">ISWC 2005 Workshop on Semantic Network Analysis<\/span>.<\/span> , Galway, Ireland (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/sna2005\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d438aab8b1f0bd3ae55e601b16a5a472\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d438aab8b1f0bd3ae55e601b16a5a472\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d438aab8b1f0bd3ae55e601b16a5a472\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d438aab8b1f0bd3ae55e601b16a5a472\"><p>@proceedings{stumme2005iswc,<br\/>  address = {Galway, Ireland},<br\/>  editor = {Stumme, Gerd and Hoser, Bettina and Schmitz, Christoph and Alani, Harith},<br\/>  keywords = {network},<br\/>  month = 11,<br\/>  series = {CEUR Workshop Proceedings},<br\/>  title = {ISWC 2005 Workshop on Semantic Network Analysis},<br\/>  volume = 171,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d438aab8b1f0bd3ae55e601b16a5a472\"><p>%0 Conference Proceedings<br\/>%1 stumme2005iswc<br\/>%B CEUR Workshop Proceedings<br\/>%C Galway, Ireland<br\/>%D 2005<br\/>%E Stumme, Gerd<br\/>%E Hoser, Bettina<br\/>%E Schmitz, Christoph<br\/>%E Alani, Harith<br\/>%T ISWC 2005 Workshop on Semantic Network Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/sna2005\/<br\/>%V 171<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bloehdorn, S., Cimiano, P., Hotho, A., Staab, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">An Ontology-based Framework for Text Mining<\/span>.<\/span> LDV Forum - GLDV Journal for Computational Linguistics and Language Technology. 20, 87\u2013112 (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0abe60273dec207b626c41f431b16b49\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0abe60273dec207b626c41f431b16b49\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0abe60273dec207b626c41f431b16b49\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0abe60273dec207b626c41f431b16b49\"><p>@article{bloehdorn-etal-ldv-2005,<br\/>  author = {Bloehdorn, Stephan and Cimiano, Philipp and Hotho, Andreas and Staab, Steffen},<br\/>  journal = {LDV Forum - GLDV Journal for Computational Linguistics and Language Technology},<br\/>  keywords = {ontology},<br\/>  month = {05},<br\/>  number = 1,<br\/>  pages = {87-112},<br\/>  title = {An Ontology-based Framework for Text Mining},<br\/>  volume = 20,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0abe60273dec207b626c41f431b16b49\"><p>%0 Journal Article<br\/>%1 bloehdorn-etal-ldv-2005<br\/>%A Bloehdorn, Stephan<br\/>%A Cimiano, Philipp<br\/>%A Hotho, Andreas<br\/>%A Staab, Steffen<br\/>%D 2005<br\/>%J LDV Forum - GLDV Journal for Computational Linguistics and Language Technology<br\/>%N 1<br\/>%P 87-112<br\/>%T An Ontology-based Framework for Text Mining<br\/>%V 20<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bloehdorn, S., Buntine, W., Hotho, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the Workshop on Learning in Web Search (LWS 2005)<\/span>.<\/span> (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/cosco.hiit.fi\/search\/learninginsearch05\/ICML_W4.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1041f58d46c742715617292f9998eae3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1041f58d46c742715617292f9998eae3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1041f58d46c742715617292f9998eae3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1041f58d46c742715617292f9998eae3\"><p>@proceedings{2005-lws-proceedings,<br\/>  editor = {Bloehdorn, Stephan and Buntine, Wray and Hotho, Andreas},<br\/>  keywords = {ml},<br\/>  month = {08},<br\/>  note = {Workshop at the 22nd International Conference on Machine Learning (ICML 2005)},<br\/>  title = {Proceedings of the Workshop on Learning in Web Search (LWS 2005)},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1041f58d46c742715617292f9998eae3\"><p>%0 Conference Proceedings<br\/>%1 2005-lws-proceedings<br\/>%D 2005<br\/>%E Bloehdorn, Stephan<br\/>%E Buntine, Wray<br\/>%E Hotho, Andreas<br\/>%T Proceedings of the Workshop on Learning in Web Search (LWS 2005)<br\/>%U http:\/\/cosco.hiit.fi\/search\/learninginsearch05\/ICML_W4.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stefani, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Rechtliche Aspekte und Implementierung eines Benachrichtigungssystems f\u00fcr Nutzer von Bibliotheken<\/span><\/span>, http:\/\/www.svenstefani.de\/publ\/diplom1\/sven_stefani_buecherwecker_unik_diplomarbeit_2005.pdf, (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.svenstefani.de\/publ\/diplom1\/sven_stefani_buecherwecker_unik_diplomarbeit_2005.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1b6dcdc28691f73b443371af0feeca9e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1b6dcdc28691f73b443371af0feeca9e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1b6dcdc28691f73b443371af0feeca9e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1b6dcdc28691f73b443371af0feeca9e\"><p>@mastersthesis{uniksdiplom1,<br\/>  author = {Stefani, Sven},<br\/>  keywords = {diplom},<br\/>  month = 10,<br\/>  school = {Universit\u00e4t Kassel},<br\/>  title = {Rechtliche Aspekte und Implementierung eines Benachrichtigungssystems f\u00fcr Nutzer von Bibliotheken},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1b6dcdc28691f73b443371af0feeca9e\"><p>%0 Thesis<br\/>%1 uniksdiplom1<br\/>%A Stefani, Sven<br\/>%D 2005<br\/>%T Rechtliche Aspekte und Implementierung eines Benachrichtigungssystems f\u00fcr Nutzer von Bibliotheken<br\/>%U http:\/\/www.svenstefani.de\/publ\/diplom1\/sven_stefani_buecherwecker_unik_diplomarbeit_2005.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Finite State Model for On-Line Analytical Processing in Triadic Contexts.<\/span><\/span> In: Ganter, B. and Godin, R. (eds.) Proc. 3rd Intl. Conf. on Formal Concept Analysis. pp. 315\u2013328. Springer (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-468f01390bf3c74843de096a5d79b293\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-468f01390bf3c74843de096a5d79b293\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/468f01390bf3c74843de096a5d79b293\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-468f01390bf3c74843de096a5d79b293\"><p>@inproceedings{stumme05finite,<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Proc. 3rd Intl. Conf. on Formal Concept Analysis},<br\/>  editor = {Ganter, Bernhard and Godin, Robert},<br\/>  keywords = {olap},<br\/>  pages = {315-328},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {A Finite State Model for On-Line Analytical Processing in Triadic Contexts.},<br\/>  volume = 3403,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-468f01390bf3c74843de096a5d79b293\"><p>%0 Conference Paper<br\/>%1 stumme05finite<br\/>%A Stumme, Gerd<br\/>%B Proc. 3rd Intl. Conf. on Formal Concept Analysis<br\/>%D 2005<br\/>%E Ganter, Bernhard<br\/>%E Godin, Robert<br\/>%I Springer<br\/>%P 315-328<br\/>%T A Finite State Model for On-Line Analytical Processing in Triadic Contexts.<br\/>%V 3403<br\/>%@ 3-540-24525-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Dau, F., Mugnier, M.-L., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings<\/span>.<\/span> Springer (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/conf\/iccs05\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-049a73d0f39efc7d4d988f262911c6f4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-049a73d0f39efc7d4d988f262911c6f4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/049a73d0f39efc7d4d988f262911c6f4\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-049a73d0f39efc7d4d988f262911c6f4\"><p>@proceedings{conf\/iccs\/2005,<br\/>  booktitle = {ICCS},<br\/>  editor = {Dau, Frithjof and Mugnier, Marie-Laure and Stumme, Gerd},<br\/>  keywords = {Germany},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings},<br\/>  volume = 3596,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-049a73d0f39efc7d4d988f262911c6f4\"><p>%0 Conference Proceedings<br\/>%1 conf\/iccs\/2005<br\/>%B ICCS<br\/>%D 2005<br\/>%E Dau, Frithjof<br\/>%E Mugnier, Marie-Laure<br\/>%E Stumme, Gerd<br\/>%I Springer<br\/>%T Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/conf\/iccs05<br\/>%V 3596<br\/>%@ 3-540-27783-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Generating a Condensed Representation for Association Rules<\/span>.<\/span> Journal Intelligent Information Systems (JIIS). 24, 29\u201360 (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/pasquier2005generating.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-40f59a7fa7ce5015f9ee81709db89de0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-40f59a7fa7ce5015f9ee81709db89de0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/40f59a7fa7ce5015f9ee81709db89de0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-40f59a7fa7ce5015f9ee81709db89de0\"><p>@article{pasquier2005generating,<br\/>  author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi},<br\/>  journal = {Journal Intelligent Information Systems (JIIS)},<br\/>  keywords = {closed},<br\/>  number = 1,<br\/>  pages = {29-60},<br\/>  publisher = {Kluwer Academic Publishers},<br\/>  title = {Generating a Condensed Representation for Association Rules},<br\/>  volume = 24,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-40f59a7fa7ce5015f9ee81709db89de0\"><p>%0 Journal Article<br\/>%1 pasquier2005generating<br\/>%A Pasquier, Nicolas<br\/>%A Taouil, Rafik<br\/>%A Bastide, Yves<br\/>%A Stumme, Gerd<br\/>%A Lakhal, Lotfi<br\/>%D 2005<br\/>%I Kluwer Academic Publishers<br\/>%J Journal Intelligent Information Systems (JIIS)<br\/>%N 1<br\/>%P 29-60<br\/>%T Generating a Condensed Representation for Association Rules<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/pasquier2005generating.pdf<br\/>%V 24<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Haase, P., Hotho, A., Schmidt-Thieme, L., Sure, Y.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Collaborative and Usage-Driven Evolution of Personal Ontologies.<\/span><\/span> In: G{\u00f3}mez-P{\u00e9}rez, A. and Euzenat, J. (eds.) ESWC. pp. 486\u2013499. Springer (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d1a30c846ceb44230f1c10668434c198\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d1a30c846ceb44230f1c10668434c198\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d1a30c846ceb44230f1c10668434c198\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d1a30c846ceb44230f1c10668434c198\"><p>@inproceedings{DBLP:conf\/esws\/HaaseHSS05,<br\/>  author = {Haase, Peter and Hotho, Andreas and Schmidt-Thieme, Lars and Sure, York},<br\/>  booktitle = {ESWC},<br\/>  editor = {G{\u00f3}mez-P{\u00e9}rez, Asunci{\u00f3}n and Euzenat, J{\u00e9}r{\u00f4}me},<br\/>  keywords = {ontology},<br\/>  pages = {486-499},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Collaborative and Usage-Driven Evolution of Personal Ontologies.},<br\/>  volume = 3532,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d1a30c846ceb44230f1c10668434c198\"><p>%0 Conference Paper<br\/>%1 DBLP:conf\/esws\/HaaseHSS05<br\/>%A Haase, Peter<br\/>%A Hotho, Andreas<br\/>%A Schmidt-Thieme, Lars<br\/>%A Sure, York<br\/>%B ESWC<br\/>%D 2005<br\/>%E G{\u00f3}mez-P{\u00e9}rez, Asunci{\u00f3}n<br\/>%E Euzenat, J{\u00e9}r{\u00f4}me<br\/>%I Springer<br\/>%P 486-499<br\/>%T Collaborative and Usage-Driven Evolution of Personal Ontologies.<br\/>%V 3532<br\/>%@ 3-540-26124-9<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">J\u00e4schke, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Die Struktur der Monoide bin\u00e4rer Relationen auf endlichen Mengen<\/span><\/span>, http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/jaeschke2005struktur.pdf, (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/jaeschke2005struktur.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3cbe3059391ae0f543c448701949ddbc\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3cbe3059391ae0f543c448701949ddbc\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3cbe3059391ae0f543c448701949ddbc\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3cbe3059391ae0f543c448701949ddbc\"><p>@mastersthesis{jaeschke2005struktur,<br\/>  author = {J\u00e4schke, Robert},<br\/>  keywords = {structure},<br\/>  school = {Technische Universit\u00e4t Dresden},<br\/>  title = {Die Struktur der Monoide bin\u00e4rer Relationen auf endlichen Mengen},<br\/>  type = {Diplomarbeit},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3cbe3059391ae0f543c448701949ddbc\"><p>%0 Thesis<br\/>%1 jaeschke2005struktur<br\/>%A J\u00e4schke, Robert<br\/>%D 2005<br\/>%T Die Struktur der Monoide bin\u00e4rer Relationen auf endlichen Mengen<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/pub\/pdf\/jaeschke2005struktur.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ontology Merging with Formal Concept Analysis<\/span>.<\/span> In: Kalfoglou, Y., Schorlemmer, W.M., Sheth, A.P., Staab, S., and Uschold, M. (eds.) Semantic Interoperability and Integration. IBFI, Schloss Dagstuhl, Germany (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/stumme2005ontology.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-225d908cff3ee338f7595032f236fd07\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-225d908cff3ee338f7595032f236fd07\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/225d908cff3ee338f7595032f236fd07\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-225d908cff3ee338f7595032f236fd07\"><p>@inproceedings{conf\/dagstuhl\/Stumme05,<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Semantic Interoperability and Integration},<br\/>  editor = {Kalfoglou, Yannis and Schorlemmer, W. Marco and Sheth, Amit P. and Staab, Steffen and Uschold, Michael},<br\/>  keywords = {ontology},<br\/>  publisher = {IBFI, Schloss Dagstuhl, Germany},<br\/>  series = {Dagstuhl Seminar Proceedings},<br\/>  title = {Ontology Merging with Formal Concept Analysis},<br\/>  volume = {04391},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-225d908cff3ee338f7595032f236fd07\"><p>%0 Conference Paper<br\/>%1 conf\/dagstuhl\/Stumme05<br\/>%A Stumme, Gerd<br\/>%B Semantic Interoperability and Integration<br\/>%D 2005<br\/>%E Kalfoglou, Yannis<br\/>%E Schorlemmer, W. Marco<br\/>%E Sheth, Amit P.<br\/>%E Staab, Steffen<br\/>%E Uschold, Michael<br\/>%I IBFI, Schloss Dagstuhl, Germany<br\/>%T Ontology Merging with Formal Concept Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/stumme2005ontology.pdf<br\/>%V 04391<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Web Mining and the Representation, Analysis, and Evolution of Web Space<\/span>.<\/span> In: Svatek, V. and Snasel, V. (eds.) Proc. of the 1st Intl. Workshop on Representation and Analysis of Web Space. pp. 1\u201316. Technical University of Ostrava (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/berendt2005semantic.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f8826ba2790eeb857dd4becb31a08225\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f8826ba2790eeb857dd4becb31a08225\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f8826ba2790eeb857dd4becb31a08225\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f8826ba2790eeb857dd4becb31a08225\"><p>@inproceedings{berendt05semantic,<br\/>  author = {Berendt, Bettina and Hotho, Andreas and Stumme, Gerd},<br\/>  booktitle = {Proc. of the 1st Intl. Workshop on Representation and Analysis of Web Space},<br\/>  editor = {Svatek, Vojtech and Snasel, Vaclav},<br\/>  keywords = {itegpub},<br\/>  pages = {1-16},<br\/>  publisher = {Technical University of Ostrava},<br\/>  title = {Semantic Web Mining and the Representation, Analysis, and Evolution of Web Space},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f8826ba2790eeb857dd4becb31a08225\"><p>%0 Conference Paper<br\/>%1 berendt05semantic<br\/>%A Berendt, Bettina<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%B Proc. of the 1st Intl. Workshop on Representation and Analysis of Web Space<br\/>%D 2005<br\/>%E Svatek, Vojtech<br\/>%E Snasel, Vaclav<br\/>%I Technical University of Ostrava<br\/>%P 1-16<br\/>%T Semantic Web Mining and the Representation, Analysis, and Evolution of Web Space<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/berendt2005semantic.pdf<br\/>%@ 80-248-0864-1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Knowledge Processing (Invited Talk)<\/span>.<\/span> In: Collard, M. and Cavarero, J.-L. (eds.) Ontologies-based techniques for DataBases and Information Systems. p. 5. , Trondheim (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/stumme2005some_slides.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c0fef31a406a9e305ea459d24af29e0d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c0fef31a406a9e305ea459d24af29e0d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c0fef31a406a9e305ea459d24af29e0d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c0fef31a406a9e305ea459d24af29e0d\"><p>@inproceedings{stumme05conceptual,<br\/>  address = {Trondheim},<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Ontologies-based techniques for DataBases and Information Systems},<br\/>  editor = {Collard, Martine and Cavarero, Jean-Louis},<br\/>  keywords = {ontologies},<br\/>  pages = 5,<br\/>  title = {Conceptual Knowledge Processing (Invited Talk)},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c0fef31a406a9e305ea459d24af29e0d\"><p>%0 Conference Paper<br\/>%1 stumme05conceptual<br\/>%A Stumme, Gerd<br\/>%B Ontologies-based techniques for DataBases and Information Systems<br\/>%C Trondheim<br\/>%D 2005<br\/>%E Collard, Martine<br\/>%E Cavarero, Jean-Louis<br\/>%P 5<br\/>%T Conceptual Knowledge Processing (Invited Talk)<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/stumme2005some_slides.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Lakhal, L., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Efficient Mining of Association Rules Based on Formal Concept Analysis<\/span>.<\/span> In: Ganter, B., Stumme, G., and Wille, R. (eds.) Formal Concept Analysis: Foundations and Applications. pp. 180\u2013195. Springer, Heidelberg (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/lakhal2005efficient.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2b350f817428e4c6c7259cd279815091\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2b350f817428e4c6c7259cd279815091\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2b350f817428e4c6c7259cd279815091\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-2b350f817428e4c6c7259cd279815091\">Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, \\titanic, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2b350f817428e4c6c7259cd279815091\"><p>@inbook{lakhal2005efficient,<br\/>  abstract = {Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, \\titanic, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining.},<br\/>  address = {Heidelberg},<br\/>  author = {Lakhal, Lotfi and Stumme, Gerd},<br\/>  booktitle = {Formal Concept Analysis: Foundations and Applications},<br\/>  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},<br\/>  keywords = {itemsets},<br\/>  pages = {180-195},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},<br\/>  volume = 3626,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2b350f817428e4c6c7259cd279815091\"><p>%0 Book Section<br\/>%1 lakhal2005efficient<br\/>%A Lakhal, Lotfi<br\/>%A Stumme, Gerd<br\/>%B Formal Concept Analysis: Foundations and Applications<br\/>%C Heidelberg<br\/>%D 2005<br\/>%E Ganter, Bernhard<br\/>%E Stumme, Gerd<br\/>%E Wille, Rudolf<br\/>%I Springer<br\/>%P 180-195<br\/>%T Efficient Mining of Association Rules Based on Formal Concept Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2005\/lakhal2005efficient.pdf<br\/>%V 3626<br\/>%X Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, \\titanic, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Text Clustern mit Hintergrundwissen (Dissertationsbeschreibung)<\/span>.<\/span> K\u00fcnstliche Intelligenz (KI). 1, 62\u201364 (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2005\/hotho05KI_final.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-eadda80b9594ae653b19aace7bde9c8b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-eadda80b9594ae653b19aace7bde9c8b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/eadda80b9594ae653b19aace7bde9c8b\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-eadda80b9594ae653b19aace7bde9c8b\"><p>@article{hotho2005text,<br\/>  author = {Hotho, Andreas},<br\/>  journal = {K\u00fcnstliche Intelligenz (KI)},<br\/>  keywords = {hintergrundwissen},<br\/>  pages = {62-64},<br\/>  publisher = {B\u00f6ttcher IT Verlag},<br\/>  title = {Text Clustern mit Hintergrundwissen (Dissertationsbeschreibung)},<br\/>  volume = 1,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-eadda80b9594ae653b19aace7bde9c8b\"><p>%0 Journal Article<br\/>%1 hotho2005text<br\/>%A Hotho, Andreas<br\/>%D 2005<br\/>%I B\u00f6ttcher IT Verlag<br\/>%J K\u00fcnstliche Intelligenz (KI)<br\/>%P 62-64<br\/>%T Text Clustern mit Hintergrundwissen (Dissertationsbeschreibung)<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2005\/hotho05KI_final.pdf<br\/>%V 1<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hitzler, P., Lutz, C., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Foundational Aspects of Ontologies<\/span>.<\/span> Universit\u00e4t Koblenz-Landau (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/phi\/FOnt2005\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0393491bcf7e04cecdcbea3b9c8725f9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0393491bcf7e04cecdcbea3b9c8725f9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0393491bcf7e04cecdcbea3b9c8725f9\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0393491bcf7e04cecdcbea3b9c8725f9\"><p>@proceedings{hitzler05foundational,<br\/>  editor = {Hitzler, Pascal and Lutz, Carsten and Stumme, Gerd},<br\/>  keywords = {ontologies},<br\/>  publisher = {Universit\u00e4t Koblenz-Landau},<br\/>  series = {Fachberichte Informatik der Universit{\u00e4}t Koblenz-Landau},<br\/>  title = {Foundational Aspects of Ontologies},<br\/>  volume = {9-2005},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0393491bcf7e04cecdcbea3b9c8725f9\"><p>%0 Conference Proceedings<br\/>%1 hitzler05foundational<br\/>%B Fachberichte Informatik der Universit{\u00e4}t Koblenz-Landau<br\/>%D 2005<br\/>%E Hitzler, Pascal<br\/>%E Lutz, Carsten<br\/>%E Stumme, Gerd<br\/>%I Universit\u00e4t Koblenz-Landau<br\/>%T Foundational Aspects of Ontologies<br\/>%U http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/phi\/FOnt2005\/<br\/>%V 9-2005<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Hoser, B., Schmitz, C., Alani, H. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the First Workshop on Semantic Network Analysis<\/span>.<\/span> CEUR Proceedings, Aachen (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/Vol-171\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c44763991d44182c53606a2c93054f26\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c44763991d44182c53606a2c93054f26\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c44763991d44182c53606a2c93054f26\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c44763991d44182c53606a2c93054f26\"><p>@proceedings{stumme05semanticnetworkanalysis,<br\/>  address = {Aachen},<br\/>  editor = {Stumme, Gerd and Hoser, Bettina and Schmitz, Christoph and Alani, Harith},<br\/>  keywords = {proceedings},<br\/>  publisher = {CEUR Proceedings},<br\/>  title = {Proceedings of the First Workshop on Semantic Network Analysis},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c44763991d44182c53606a2c93054f26\"><p>%0 Conference Proceedings<br\/>%1 stumme05semanticnetworkanalysis<br\/>%C Aachen<br\/>%D 2005<br\/>%E Stumme, Gerd<br\/>%E Hoser, Bettina<br\/>%E Schmitz, Christoph<br\/>%E Alani, Harith<br\/>%I CEUR Proceedings<br\/>%T Proceedings of the First Workshop on Semantic Network Analysis<br\/>%U http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/Vol-171\/<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Mladenic, D., Semerano, G., Spiliopoulou, M., Stumme, G., van Someren, M. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proc. of the European Web Mining Forum 2005<\/span>.<\/span> (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/ws\/ewmf05\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f306e43da22adede0286917d5d83eb3b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f306e43da22adede0286917d5d83eb3b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f306e43da22adede0286917d5d83eb3b\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f306e43da22adede0286917d5d83eb3b\"><p>@proceedings{berendt05european,<br\/>  editor = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and Semerano, Giovanni and Spiliopoulou, Myra and Stumme, Gerd and van Someren, Maarten},<br\/>  keywords = {proceedings},<br\/>  title = {Proc. of the European Web Mining Forum 2005},<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f306e43da22adede0286917d5d83eb3b\"><p>%0 Conference Proceedings<br\/>%1 berendt05european<br\/>%D 2005<br\/>%E Berendt, Bettina<br\/>%E Hotho, Andreas<br\/>%E Mladenic, Dunja<br\/>%E Semerano, Giovanni<br\/>%E Spiliopoulou, Myra<br\/>%E Stumme, Gerd<br\/>%E van Someren, Maarten<br\/>%T Proc. of the European Web Mining Forum 2005<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/ws\/ewmf05<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cimiano, P., Hotho, A., Staab, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis<\/span>.<\/span> Journal on Artificial Intelligence Research. 24, 305\u2013339 (2005).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/journals\/jair\/jair24.html#CimianoHS05\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-eaaf0e4b3a8b29fab23b6c15ce2d308d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-eaaf0e4b3a8b29fab23b6c15ce2d308d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/eaaf0e4b3a8b29fab23b6c15ce2d308d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-eaaf0e4b3a8b29fab23b6c15ce2d308d\"><p>@article{cimiano05learning,<br\/>  author = {Cimiano, Philipp and Hotho, Andreas and Staab, Steffen},<br\/>  journal = {Journal on Artificial Intelligence Research},<br\/>  keywords = {ontologies},<br\/>  pages = {305-339},<br\/>  title = {Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis},<br\/>  volume = 24,<br\/>  year = 2005<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-eaaf0e4b3a8b29fab23b6c15ce2d308d\"><p>%0 Journal Article<br\/>%1 cimiano05learning<br\/>%A Cimiano, Philipp<br\/>%A Hotho, Andreas<br\/>%A Staab, Steffen<br\/>%D 2005<br\/>%J Journal on Artificial Intelligence Research<br\/>%P 305-339<br\/>%T Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis<br\/>%U http:\/\/dblp.uni-trier.de\/db\/journals\/jair\/jair24.html#CimianoHS05<br\/>%V 24<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2004\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2004<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Mladenic, D., van Someren, M., Spiliopoulou, M., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Web Mining: From Web to Semantic Web, First European Web Mining Forum, EMWF 2003, Cavtat-Dubrovnik, Croatia, September 22, 2003, Revised Selected and Invited Papers<\/span>.<\/span> Springer, Heidelberg (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/springerlink.metapress.com\/content\/unvvag26dttf\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-be8b91e0c05dde74a4af7123b949c6ac\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-be8b91e0c05dde74a4af7123b949c6ac\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/be8b91e0c05dde74a4af7123b949c6ac\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-be8b91e0c05dde74a4af7123b949c6ac\"><p>@proceedings{berendt2004web,<br\/>  address = {Heidelberg},<br\/>  editor = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and van Someren, Maarten and Spiliopoulou, Myra and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  note = {http:\/\/km.aifb.uni-karlsruhe.de\/ws\/ewmf03\/},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Web Mining: From Web to Semantic Web, First European Web Mining Forum, EMWF 2003, Cavtat-Dubrovnik, Croatia, September 22, 2003, Revised Selected and Invited Papers},<br\/>  volume = 3209,<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-be8b91e0c05dde74a4af7123b949c6ac\"><p>%0 Conference Proceedings<br\/>%1 berendt2004web<br\/>%B LNAI<br\/>%C Heidelberg<br\/>%D 2004<br\/>%E Berendt, Bettina<br\/>%E Hotho, Andreas<br\/>%E Mladenic, Dunja<br\/>%E van Someren, Maarten<br\/>%E Spiliopoulou, Myra<br\/>%E Stumme, Gerd<br\/>%I Springer<br\/>%T Web Mining: From Web to Semantic Web, First European Web Mining Forum, EMWF 2003, Cavtat-Dubrovnik, Croatia, September 22, 2003, Revised Selected and Invited Papers<br\/>%U http:\/\/springerlink.metapress.com\/content\/unvvag26dttf\/<br\/>%V 3209<br\/>%@ 3-540-23258-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mobasher, B., Anand, S.S., Berendt, B., Hotho, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Web Personalization<\/span>.<\/span> (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3d91da8819141c3bd4448a174b181db1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3d91da8819141c3bd4448a174b181db1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3d91da8819141c3bd4448a174b181db1\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3d91da8819141c3bd4448a174b181db1\"><p>@proceedings{semwebpers2004,<br\/>  editor = {Mobasher, Bamshad and Anand, Sarabjot Singh and Berendt, Bettina and Hotho, Andreas},<br\/>  keywords = 2004,<br\/>  month = {09},<br\/>  note = {\\url{http:\/\/maya.cs.depaul.edu\/~mobasher\/swp04\/}},<br\/>  title = {Semantic Web Personalization},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3d91da8819141c3bd4448a174b181db1\"><p>%0 Conference Proceedings<br\/>%1 semwebpers2004<br\/>%D 2004<br\/>%E Mobasher, Bamshad<br\/>%E Anand, Sarabjot Singh<br\/>%E Berendt, Bettina<br\/>%E Hotho, Andreas<br\/>%T Semantic Web Personalization<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Haase, P., Ehrig, M., Hotho, A., Schnizler, B.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Personalized Information Access in a Bibliographic Peer-to-Peer System<\/span>.<\/span> In: Proceedings of the AAAI Workshop on Semantic Web Personalization, 2004. pp. 1\u201312. AAAI Press (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/haase04person.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-40bade33489eca1d298330115d4c46ff\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-40bade33489eca1d298330115d4c46ff\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/40bade33489eca1d298330115d4c46ff\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-40bade33489eca1d298330115d4c46ff\"><p>@inproceedings{haase04personalized,<br\/>  author = {Haase, Peter and Ehrig, Marc and Hotho, Andreas and Schnizler, Bj{\u00f6}rn},<br\/>  booktitle = {Proceedings of the AAAI Workshop on Semantic Web Personalization, 2004},<br\/>  keywords = {p2p},<br\/>  month = {07},<br\/>  pages = {1-12},<br\/>  publisher = {AAAI Press},<br\/>  title = {Personalized Information Access in a Bibliographic Peer-to-Peer System},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-40bade33489eca1d298330115d4c46ff\"><p>%0 Conference Paper<br\/>%1 haase04personalized<br\/>%A Haase, Peter<br\/>%A Ehrig, Marc<br\/>%A Hotho, Andreas<br\/>%A Schnizler, Bj{\u00f6}rn<br\/>%B Proceedings of the AAAI Workshop on Semantic Web Personalization, 2004<br\/>%D 2004<br\/>%I AAAI Press<br\/>%P 1-12<br\/>%T Personalized Information Access in a Bibliographic Peer-to-Peer System<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/haase04person.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Self-Organization of a Small World by Topic<\/span>.<\/span> In: Proc. 1st International Workshop on Peer-to-Peer Knowledge Management. , Boston, MA (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/p2pkm.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-35d70e83db23edd0f1e79d8ba67a2705\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-35d70e83db23edd0f1e79d8ba67a2705\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/35d70e83db23edd0f1e79d8ba67a2705\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-35d70e83db23edd0f1e79d8ba67a2705\"><p>@inproceedings{schmitz2004self,<br\/>  address = {Boston, MA},<br\/>  author = {Schmitz, Christoph},<br\/>  booktitle = {Proc. 1st International Workshop on Peer-to-Peer Knowledge Management},<br\/>  keywords = {p2p},<br\/>  month = {08},<br\/>  title = {Self-Organization of a Small World by Topic},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-35d70e83db23edd0f1e79d8ba67a2705\"><p>%0 Conference Paper<br\/>%1 schmitz2004self<br\/>%A Schmitz, Christoph<br\/>%B Proc. 1st International Workshop on Peer-to-Peer Knowledge Management<br\/>%C Boston, MA<br\/>%D 2004<br\/>%T Self-Organization of a Small World by Topic<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/p2pkm.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Sure, Y., Getoor, L. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">International Workshop on Mining for and from the Semantic Web (MSW2004)<\/span>.<\/span> (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/msw2004_proceedings.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0fbd582960b0f6917d82bd1825c3d167\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0fbd582960b0f6917d82bd1825c3d167\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0fbd582960b0f6917d82bd1825c3d167\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0fbd582960b0f6917d82bd1825c3d167\"><p>@proceedings{msw2004,<br\/>  editor = {Hotho, Andreas and Sure, York and Getoor, Lise},<br\/>  keywords = {workshop},<br\/>  month = {08},<br\/>  note = {located at the 10th International ACM SIGKDD Conference on Knowledge Discovery and Data Mining KDD 2004, 22nd August 2004, Seattle, WA, USA},<br\/>  title = {International Workshop on Mining for and from the Semantic Web (MSW2004)},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0fbd582960b0f6917d82bd1825c3d167\"><p>%0 Conference Proceedings<br\/>%1 msw2004<br\/>%D 2004<br\/>%E Hotho, Andreas<br\/>%E Sure, York<br\/>%E Getoor, Lise<br\/>%T International Workshop on Mining for and from the Semantic Web (MSW2004)<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/msw2004_proceedings.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bloehdorn, S., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Boosting for Text Classification with Semantic Features<\/span>.<\/span> In: Proceedings of the MSW 2004 workshop at the 10th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 70\u201387 (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/msw04bloehdorn.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-584e82bad6eb767636ce3ddd8f1ae233\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-584e82bad6eb767636ce3ddd8f1ae233\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/584e82bad6eb767636ce3ddd8f1ae233\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-584e82bad6eb767636ce3ddd8f1ae233\"><p>@inproceedings{bloehdorn04msw,<br\/>  author = {Bloehdorn, Stephan and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the MSW 2004 workshop at the 10th ACM SIGKDD Conference on Knowledge Discovery and Data Mining},<br\/>  keywords = {ontology},<br\/>  month = {08},<br\/>  pages = {70-87},<br\/>  title = {Boosting for Text Classification with Semantic Features},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-584e82bad6eb767636ce3ddd8f1ae233\"><p>%0 Conference Paper<br\/>%1 bloehdorn04msw<br\/>%A Bloehdorn, Stephan<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the MSW 2004 workshop at the 10th ACM SIGKDD Conference on Knowledge Discovery and Data Mining<br\/>%D 2004<br\/>%P 70-87<br\/>%T Boosting for Text Classification with Semantic Features<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/msw04bloehdorn.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bloehdorn, S., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Text Classification by Boosting Weak Learners based on Terms and Concepts<\/span>.<\/span> In: Proceedings of the Fourth IEEE International Conference on Data Mining. pp. 331\u2013334. IEEE Computer Society Press (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/icdm04boosting.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-7df6357c79445d811f4a9223e688da14\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-7df6357c79445d811f4a9223e688da14\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/7df6357c79445d811f4a9223e688da14\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-7df6357c79445d811f4a9223e688da14\"><p>@inproceedings{bloehdorn2004icdm,<br\/>  author = {Bloehdorn, Stephan and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the Fourth IEEE International Conference on Data Mining},<br\/>  keywords = {ontology},<br\/>  month = 11,<br\/>  pages = {331-334},<br\/>  publisher = {IEEE Computer Society Press},<br\/>  title = {Text Classification by Boosting Weak Learners based on Terms and Concepts},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-7df6357c79445d811f4a9223e688da14\"><p>%0 Conference Paper<br\/>%1 bloehdorn2004icdm<br\/>%A Bloehdorn, Stephan<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the Fourth IEEE International Conference on Data Mining<br\/>%D 2004<br\/>%I IEEE Computer Society Press<br\/>%P 331-334<br\/>%T Text Classification by Boosting Weak Learners based on Terms and Concepts<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/icdm04boosting.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ehrig, M., Hartmann, J., Schmitz, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{O}ntologie-basiertes {W}eb {M}ining<\/span>.<\/span> In: Workshop ``Semantische Technologien f\u00fcr Informationsportale\u2019\u2019 (GI-Jahrestagung 2004). Gesellschaft f\u00fcr Informatik (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/2004-gi-crawler_v3.0.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-51805a0515aa7793075c606402eadf93\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-51805a0515aa7793075c606402eadf93\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/51805a0515aa7793075c606402eadf93\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-51805a0515aa7793075c606402eadf93\"><p>@inproceedings{ehrig2004ontologie,<br\/>  author = {Ehrig, Marc and Hartmann, Jens and Schmitz, Christoph},<br\/>  booktitle = {Workshop ``Semantische Technologien f\u00fcr Informationsportale'' (GI-Jahrestagung 2004)},<br\/>  keywords = {crawling},<br\/>  month = {09},<br\/>  organization = {Gesellschaft f\u00fcr Informatik},<br\/>  title = {{O}ntologie-basiertes {W}eb {M}ining},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-51805a0515aa7793075c606402eadf93\"><p>%0 Conference Paper<br\/>%1 ehrig2004ontologie<br\/>%A Ehrig, Marc<br\/>%A Hartmann, Jens<br\/>%A Schmitz, Christoph<br\/>%B Workshop ``Semantische Technologien f\u00fcr Informationsportale'' (GI-Jahrestagung 2004)<br\/>%D 2004<br\/>%T {O}ntologie-basiertes {W}eb {M}ining<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/2004-gi-crawler_v3.0.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bloehdorn, S., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Boosting for Text Classification with Semantic Features (reprint)<\/span>.<\/span> In: Proceedings of the Workshop on Text-based Information Retrieval (TIR-04) at the 27th German Conference on Artificial Intelligence (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/tir04final.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-755cc62833b9c36dea584cde265398ea\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-755cc62833b9c36dea584cde265398ea\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/755cc62833b9c36dea584cde265398ea\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-755cc62833b9c36dea584cde265398ea\"><p>@inproceedings{bloehdorn04Boosting,<br\/>  author = {Bloehdorn, Stephan and Hotho, Andreas},<br\/>  booktitle = {Proceedings of the Workshop on Text-based Information Retrieval (TIR-04) at the 27th German Conference on Artificial Intelligence},<br\/>  keywords = {ontology},<br\/>  month = {09},<br\/>  title = {Boosting for Text Classification with Semantic Features (reprint)},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-755cc62833b9c36dea584cde265398ea\"><p>%0 Conference Paper<br\/>%1 bloehdorn04Boosting<br\/>%A Bloehdorn, Stephan<br\/>%A Hotho, Andreas<br\/>%B Proceedings of the Workshop on Text-based Information Retrieval (TIR-04) at the 27th German Conference on Artificial Intelligence<br\/>%D 2004<br\/>%T Boosting for Text Classification with Semantic Features (reprint)<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/tir04final.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cimiano, P., Hotho, A., Staab, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis<\/span>.<\/span> Institute AIFB, Universit\u00e4t Karlsruhe (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/techOntologylearningFCA.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c46361a68b3dd167a288ba05a74a88bb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c46361a68b3dd167a288ba05a74a88bb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c46361a68b3dd167a288ba05a74a88bb\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c46361a68b3dd167a288ba05a74a88bb\"><p>@techreport{cimianpo_hotho_staab_OL_FCA_04,<br\/>  author = {Cimiano, Philipp and Hotho, Andreas and Staab, Steffen},<br\/>  institution = {Institute AIFB, Universit\u00e4t Karlsruhe},<br\/>  keywords = {learning},<br\/>  month = 11,<br\/>  title = {Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c46361a68b3dd167a288ba05a74a88bb\"><p>%0 Report<br\/>%1 cimianpo_hotho_staab_OL_FCA_04<br\/>%A Cimiano, Philipp<br\/>%A Hotho, Andreas<br\/>%A Staab, Steffen<br\/>%D 2004<br\/>%T Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/techOntologylearningFCA.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cimiano, P., Hotho, A., Staab, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Clustering Ontologies from Text<\/span>.<\/span> In: Proceedings of the Conference on Languages Resources and Evaluation (LREC). ELRA - European Language Ressources Association, Lisbon, Portugal (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/lrec04.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3bc6e5a51dba862da1b7b3b6ac563370\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3bc6e5a51dba862da1b7b3b6ac563370\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3bc6e5a51dba862da1b7b3b6ac563370\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3bc6e5a51dba862da1b7b3b6ac563370\"><p>@inproceedings{cim04a,<br\/>  address = {Lisbon, Portugal},<br\/>  author = {Cimiano, Philipp and Hotho, Andreas and Staab, Steffen},<br\/>  booktitle = {Proceedings of the Conference on Languages Resources and Evaluation (LREC)},<br\/>  keywords = {ontology},<br\/>  month = {05},<br\/>  publisher = {ELRA - European Language Ressources Association},<br\/>  title = {Clustering Ontologies from Text},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3bc6e5a51dba862da1b7b3b6ac563370\"><p>%0 Conference Paper<br\/>%1 cim04a<br\/>%A Cimiano, Philipp<br\/>%A Hotho, Andreas<br\/>%A Staab, Steffen<br\/>%B Proceedings of the Conference on Languages Resources and Evaluation (LREC)<br\/>%C Lisbon, Portugal<br\/>%D 2004<br\/>%I ELRA - European Language Ressources Association<br\/>%T Clustering Ontologies from Text<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/lrec04.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Nejdl, W., Wolpers, M., Siberski, W., Schmitz, C., Schlosser, M., Brunkhorst, I., L\u00f6ser, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Super-Peer-Based Routing Strategies for {RDF}-Based Peer-to-Peer Networks<\/span>.<\/span> Journal of Web Semantics. Special issue WWW 2003, (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/2003-11-18.semweb.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5a5f7698713bb9af488805e9b88c4922\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5a5f7698713bb9af488805e9b88c4922\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5a5f7698713bb9af488805e9b88c4922\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5a5f7698713bb9af488805e9b88c4922\"><p>@article{nejdl2004superpeer2,<br\/>  author = {Nejdl, Wolfgang and Wolpers, Martin and Siberski, Wolf and Schmitz, Christoph and Schlosser, Mario and Brunkhorst, Ingo and L\u00f6ser, Alexander},<br\/>  journal = {Journal of Web Semantics},<br\/>  keywords = {p2p},<br\/>  month = {02},<br\/>  title = {Super-Peer-Based Routing Strategies for {RDF}-Based Peer-to-Peer Networks},<br\/>  volume = {Special issue WWW 2003},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5a5f7698713bb9af488805e9b88c4922\"><p>%0 Journal Article<br\/>%1 nejdl2004superpeer2<br\/>%A Nejdl, Wolfgang<br\/>%A Wolpers, Martin<br\/>%A Siberski, Wolf<br\/>%A Schmitz, Christoph<br\/>%A Schlosser, Mario<br\/>%A Brunkhorst, Ingo<br\/>%A L\u00f6ser, Alexander<br\/>%D 2004<br\/>%J Journal of Web Semantics<br\/>%T Super-Peer-Based Routing Strategies for {RDF}-Based Peer-to-Peer Networks<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/2003-11-18.semweb.pdf<br\/>%V Special issue WWW 2003<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Maedche, A., Sattler, K.-U., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Information Integration and Mining in Databases and on the Web. Proceedings of the 2nd International Workshop on Databases, Documents, and Information Fusion (DBFusion 2002)<\/span>.<\/span> , Aachen (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ftp.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/Vol-124\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2537bcf40084c8492e0ab397ba6947fe\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2537bcf40084c8492e0ab397ba6947fe\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2537bcf40084c8492e0ab397ba6947fe\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2537bcf40084c8492e0ab397ba6947fe\"><p>@proceedings{maedche02information,<br\/>  address = {Aachen},<br\/>  editor = {Maedche, Alexander and Sattler, Kai-Uwe and Stumme, Gerd},<br\/>  journal = {CEUR-WS},<br\/>  keywords = {integration},<br\/>  series = {CEUR Workshop Proceedings},<br\/>  title = {Information Integration and Mining in Databases and on the Web. Proceedings of the 2nd International Workshop on Databases, Documents, and Information Fusion (DBFusion 2002)},<br\/>  volume = 124,<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2537bcf40084c8492e0ab397ba6947fe\"><p>%0 Conference Proceedings<br\/>%1 maedche02information<br\/>%B CEUR Workshop Proceedings<br\/>%C Aachen<br\/>%D 2004<br\/>%E Maedche, Alexander<br\/>%E Sattler, Kai-Uwe<br\/>%E Stumme, Gerd<br\/>%J CEUR-WS<br\/>%T Information Integration and Mining in Databases and on the Web. Proceedings of the 2nd International Workshop on Databases, Documents, and Information Fusion (DBFusion 2002)<br\/>%U http:\/\/ftp.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/Vol-124\/<br\/>%V 124<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Tane, J., Schmitz, C., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Resource Management for the Web: An ELearning Application<\/span>.<\/span> In: Proc. 13th International World Wide Web Conference (WWW 2004). , New York (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/cwwww04.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cc76510c2f9724999e3c1050dfc0a4d9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cc76510c2f9724999e3c1050dfc0a4d9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cc76510c2f9724999e3c1050dfc0a4d9\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cc76510c2f9724999e3c1050dfc0a4d9\"><p>@inproceedings{tane2004semantic,<br\/>  address = {New York},<br\/>  author = {Tane, Julien and Schmitz, Christoph and Stumme, Gerd},<br\/>  booktitle = {Proc. 13th International World Wide Web Conference (WWW 2004)},<br\/>  keywords = {p2p},<br\/>  month = {05},<br\/>  title = {Semantic Resource Management for the Web: An ELearning Application},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cc76510c2f9724999e3c1050dfc0a4d9\"><p>%0 Conference Paper<br\/>%1 tane2004semantic<br\/>%A Tane, Julien<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%B Proc. 13th International World Wide Web Conference (WWW 2004)<br\/>%C New York<br\/>%D 2004<br\/>%T Semantic Resource Management for the Web: An ELearning Application<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/cwwww04.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Clustern mit Hintergrundwissen<\/span><\/span>, (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5bb717f4da468b42a959b0f34e340c83\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5bb717f4da468b42a959b0f34e340c83\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5bb717f4da468b42a959b0f34e340c83\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5bb717f4da468b42a959b0f34e340c83\"><p>@phdthesis{phdthesisNo32,<br\/>  address = {Universit{\u00e4}t Karlsruhe (TH), Institut AIFB, D-76128 Karlsruhe},<br\/>  author = {Hotho, Andreas},<br\/>  keywords = {ontology},<br\/>  note = {Studer\/Gaul},<br\/>  school = {University of Karlsruhe},<br\/>  title = {Clustern mit Hintergrundwissen},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5bb717f4da468b42a959b0f34e340c83\"><p>%0 Thesis<br\/>%1 phdthesisNo32<br\/>%A Hotho, Andreas<br\/>%C Universit{\u00e4}t Karlsruhe (TH), Institut AIFB, D-76128 Karlsruhe<br\/>%D 2004<br\/>%T Clustern mit Hintergrundwissen<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmidt-Thieme, L., Stumme, G., Rusnak, U., Eberhart, A. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantische Technologien f\u00fcr Informationsportale<\/span>.<\/span> Gesellschaft f\u00fcr Informatik, Bonn (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.gi-ev.de\/service\/publikationen\/gi-edition-lecture-notes-in-informatics-lni-2005\/mehr-zu-diesem-buch\/gi-edition-lecture-notes-in-informatics-lni-p-51\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3f12ffb00a1103c870035c095306f430\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3f12ffb00a1103c870035c095306f430\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3f12ffb00a1103c870035c095306f430\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3f12ffb00a1103c870035c095306f430\"><p>@proceedings{schmidt2004semantische,<br\/>  address = {Bonn},<br\/>  booktitle = {INFORMATIK 2004 - Informatik verbindet},<br\/>  editor = {Schmidt-Thieme, Lars and Stumme, Gerd and Rusnak, Ute and Eberhart, Andreas},<br\/>  journal = {LNI},<br\/>  keywords = {itegpub},<br\/>  pages = {158-212},<br\/>  publisher = {Gesellschaft f\u00fcr Informatik},<br\/>  series = {LNI},<br\/>  title = {Semantische Technologien f\u00fcr Informationsportale},<br\/>  volume = 51,<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3f12ffb00a1103c870035c095306f430\"><p>%0 Conference Proceedings<br\/>%1 schmidt2004semantische<br\/>%B INFORMATIK 2004 - Informatik verbindet<br\/>%C Bonn<br\/>%D 2004<br\/>%E Schmidt-Thieme, Lars<br\/>%E Stumme, Gerd<br\/>%E Rusnak, Ute<br\/>%E Eberhart, Andreas<br\/>%I Gesellschaft f\u00fcr Informatik<br\/>%J LNI<br\/>%P 158-212<br\/>%T Semantische Technologien f\u00fcr Informationsportale<br\/>%U http:\/\/www.gi-ev.de\/service\/publikationen\/gi-edition-lecture-notes-in-informatics-lni-2005\/mehr-zu-diesem-buch\/gi-edition-lecture-notes-in-informatics-lni-p-51\/<br\/>%V 51<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cimiano, P., Hotho, A., Stumme, G., Tane, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies<\/span>.<\/span> In: Eklund, P. (ed.) Concept Lattices. pp. 189\u2013207. Springer, Berlin\/Heidelberg (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dx.doi.org\/10.1007\/978-3-540-24651-0_18\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9676ee1ded2b73fa90253a2a5dccdbf8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9676ee1ded2b73fa90253a2a5dccdbf8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9676ee1ded2b73fa90253a2a5dccdbf8\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9676ee1ded2b73fa90253a2a5dccdbf8\"><p>@incollection{cimiano2004conceptual,<br\/>  address = {Berlin\/Heidelberg},<br\/>  author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien},<br\/>  booktitle = {Concept Lattices},<br\/>  editor = {Eklund, Peter},<br\/>  keywords = {icfca},<br\/>  pages = {189--207},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Computer Science},<br\/>  title = {Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies},<br\/>  volume = 2961,<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9676ee1ded2b73fa90253a2a5dccdbf8\"><p>%0 Book Section<br\/>%1 cimiano2004conceptual<br\/>%A Cimiano, Philipp<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%A Tane, Julien<br\/>%B Concept Lattices<br\/>%C Berlin\/Heidelberg<br\/>%D 2004<br\/>%E Eklund, Peter<br\/>%I Springer<br\/>%P 189--207<br\/>%T Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies<br\/>%U http:\/\/dx.doi.org\/10.1007\/978-3-540-24651-0_18<br\/>%V 2961<br\/>%@ 978-3-540-21043-6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Iceberg Query Lattices for Datalog<\/span>.<\/span> In: Wolff, K.E., Pfeiffer, H.D., and Delugach, H.S. (eds.) Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004). pp. 109\u2013125. Springer, Heidelberg (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2004\/stumme2004iceberg.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-70b05439d41b24c2476e9eba1f74ec87\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-70b05439d41b24c2476e9eba1f74ec87\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/70b05439d41b24c2476e9eba1f74ec87\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-70b05439d41b24c2476e9eba1f74ec87\"><p>@inproceedings{stumme2004iceberg,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)},<br\/>  editor = {Wolff, Karl Erich and Pfeiffer, Heather D. and Delugach, Harry S.},<br\/>  keywords = {lattices},<br\/>  pages = {109-125},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {Iceberg Query Lattices for Datalog},<br\/>  volume = 3127,<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-70b05439d41b24c2476e9eba1f74ec87\"><p>%0 Conference Paper<br\/>%1 stumme2004iceberg<br\/>%A Stumme, Gerd<br\/>%B Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)<br\/>%C Heidelberg<br\/>%D 2004<br\/>%E Wolff, Karl Erich<br\/>%E Pfeiffer, Heather D.<br\/>%E Delugach, Harry S.<br\/>%I Springer<br\/>%P 109-125<br\/>%T Iceberg Query Lattices for Datalog<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2004\/stumme2004iceberg.pdf<br\/>%V 3127<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Usage Mining for and on the Semantic Web.<\/span><\/span> In: Kargupta, H., Joshi, A., Sivakumar, K., and Yesha, Y. (eds.) Data Mining Next Generation Challenges and Future Directions. pp. 461\u2013481. AAAI Press, Boston (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6211bdf53752bcfb7fcd98a966ad4f6f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6211bdf53752bcfb7fcd98a966ad4f6f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6211bdf53752bcfb7fcd98a966ad4f6f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6211bdf53752bcfb7fcd98a966ad4f6f\"><p>@incollection{berendt03usage,<br\/>  address = {Boston},<br\/>  author = {Berendt, B. and Hotho, A. and Stumme, G.},<br\/>  booktitle = {Data Mining Next Generation Challenges and Future Directions},<br\/>  editor = {Kargupta, Hillol and Joshi, Anupam and Sivakumar, Krishnamoorthy and Yesha, Yelena},<br\/>  keywords = {wum},<br\/>  pages = {461-481},<br\/>  publisher = {AAAI Press},<br\/>  title = {Usage Mining for and on the Semantic Web.},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6211bdf53752bcfb7fcd98a966ad4f6f\"><p>%0 Book Section<br\/>%1 berendt03usage<br\/>%A Berendt, B.<br\/>%A Hotho, A.<br\/>%A Stumme, G.<br\/>%B Data Mining Next Generation Challenges and Future Directions<br\/>%C Boston<br\/>%D 2004<br\/>%E Kargupta, Hillol<br\/>%E Joshi, Anupam<br\/>%E Sivakumar, Krishnamoorthy<br\/>%E Yesha, Yelena<br\/>%I AAAI Press<br\/>%P 461-481<br\/>%T Usage Mining for and on the Semantic Web.<br\/>%@ 0-262-61203-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Mladenic, D., van Someren, M., Spiliopoulou, M., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Web Mining: From Web to Semantic Web<\/span>.<\/span> Springer, Heidelberg (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-495f8565cdda14bbbe197d11425f0fe8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-495f8565cdda14bbbe197d11425f0fe8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/495f8565cdda14bbbe197d11425f0fe8\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-495f8565cdda14bbbe197d11425f0fe8\"><p>@book{Berendt2004Web,<br\/>  address = {Heidelberg},<br\/>  editor = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and van Someren, Maarten and Spiliopoulou, Myra and Stumme, Gerd},<br\/>  keywords = 2004,<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Web Mining: From Web to Semantic Web},<br\/>  volume = 3209,<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-495f8565cdda14bbbe197d11425f0fe8\"><p>%0 Book<br\/>%1 Berendt2004Web<br\/>%B LNAI<br\/>%C Heidelberg<br\/>%D 2004<br\/>%E Berendt, Bettina<br\/>%E Hotho, Andreas<br\/>%E Mladenic, Dunja<br\/>%E van Someren, Maarten<br\/>%E Spiliopoulou, Myra<br\/>%E Stumme, Gerd<br\/>%I Springer<br\/>%T Web Mining: From Web to Semantic Web<br\/>%V 3209<br\/>%@ 3-540-23258-3<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Mladenic, D., van Someren, M., Spiliopoulou, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Roadmap for Web Mining: From Web to Semantic Web.<\/span><\/span> In: Berendt, B., Hotho, A., Mladenic, D., van Someren, M., Spiliopoulou, M., and Stumme, G. (eds.) Web Mining: From Web to Semantic Web. pp. 1\u201322. Springer, Heidelberg (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2004\/berendt2004roadmap.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-158a99f0088fcefa45b1eb7f96aa5673\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-158a99f0088fcefa45b1eb7f96aa5673\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/158a99f0088fcefa45b1eb7f96aa5673\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-158a99f0088fcefa45b1eb7f96aa5673\">The purpose of Web mining is to develop methods and systems for discovering models of objects and processes on the World Wide Web and for web-based systems that show adaptive performance. Web Mining integrates three parent areas: Data Mining (we use this term here also for the closely related areas of Machine Learning and Knowledge Discovery), Internet technology and World Wide Web, and for the more recent Semantic Web. The World Wide Web has made an enormous amount of information electronically accessible. The use of email, news and markup languages like HTML allow users to publish and read documents at a world-wide scale and to communicate via chat connections, including information in the form of images and voice records. The HTTP protocol that enables access to documents over the network via Web browsers created an immense improvement in communication and access to information. For some years these possibilities were used mostly in the scientific world but recent years have seen an immense growth in popularity, supported by the wide availability of computers and broadband communication. The use of the internet for other tasks than finding information and direct communication is increasing, as can be seen from the interest in ldquoe-activitiesrdquo such as e-commerce, e-learning, e-government, e-science.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-158a99f0088fcefa45b1eb7f96aa5673\"><p>@inproceedings{berendt2004roadmap,<br\/>  abstract = {The purpose of Web mining is to develop methods and systems for discovering models of objects and processes on the World Wide Web and for web-based systems that show adaptive performance. Web Mining integrates three parent areas: Data Mining (we use this term here also for the closely related areas of Machine Learning and Knowledge Discovery), Internet technology and World Wide Web, and for the more recent Semantic Web. The World Wide Web has made an enormous amount of information electronically accessible. The use of email, news and markup languages like HTML allow users to publish and read documents at a world-wide scale and to communicate via chat connections, including information in the form of images and voice records. The HTTP protocol that enables access to documents over the network via Web browsers created an immense improvement in communication and access to information. For some years these possibilities were used mostly in the scientific world but recent years have seen an immense growth in popularity, supported by the wide availability of computers and broadband communication. The use of the internet for other tasks than finding information and direct communication is increasing, as can be seen from the interest in ldquoe-activitiesrdquo such as e-commerce, e-learning, e-government, e-science.},<br\/>  address = {Heidelberg},<br\/>  author = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and van Someren, Maarten and Spiliopoulou, Myra and Stumme, Gerd},<br\/>  booktitle = {Web Mining: From Web to Semantic Web},<br\/>  crossref = {DBLP:conf\/ewmf\/2003},<br\/>  editor = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and van Someren, Maarten and Spiliopoulou, Myra and Stumme, Gerd},<br\/>  keywords = {proceedings},<br\/>  pages = {1-22},<br\/>  publisher = {Springer},<br\/>  title = {A Roadmap for Web Mining: From Web to Semantic Web.},<br\/>  volume = 3209,<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-158a99f0088fcefa45b1eb7f96aa5673\"><p>%0 Conference Paper<br\/>%1 berendt2004roadmap<br\/>%A Berendt, Bettina<br\/>%A Hotho, Andreas<br\/>%A Mladenic, Dunja<br\/>%A van Someren, Maarten<br\/>%A Spiliopoulou, Myra<br\/>%A Stumme, Gerd<br\/>%B Web Mining: From Web to Semantic Web<br\/>%C Heidelberg<br\/>%D 2004<br\/>%E Berendt, Bettina<br\/>%E Hotho, Andreas<br\/>%E Mladenic, Dunja<br\/>%E van Someren, Maarten<br\/>%E Spiliopoulou, Myra<br\/>%E Stumme, Gerd<br\/>%I Springer<br\/>%P 1-22<br\/>%T A Roadmap for Web Mining: From Web to Semantic Web.<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2004\/berendt2004roadmap.pdf<br\/>%V 3209<br\/>%X The purpose of Web mining is to develop methods and systems for discovering models of objects and processes on the World Wide Web and for web-based systems that show adaptive performance. Web Mining integrates three parent areas: Data Mining (we use this term here also for the closely related areas of Machine Learning and Knowledge Discovery), Internet technology and World Wide Web, and for the more recent Semantic Web. The World Wide Web has made an enormous amount of information electronically accessible. The use of email, news and markup languages like HTML allow users to publish and read documents at a world-wide scale and to communicate via chat connections, including information in the form of images and voice records. The HTTP protocol that enables access to documents over the network via Web browsers created an immense improvement in communication and access to information. For some years these possibilities were used mostly in the scientific world but recent years have seen an immense growth in popularity, supported by the wide availability of computers and broadband communication. The use of the internet for other tasks than finding information and direct communication is increasing, as can be seen from the interest in ldquoe-activitiesrdquo such as e-commerce, e-learning, e-government, e-science.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cimiano, P., Hotho, A., Staab, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Comparing Conceptual, Divise and Agglomerative Clustering for Learning Taxonomies from Text<\/span>.<\/span> In: de M{\u00e1}ntaras, R.L. and Saitta, L. (eds.) Proceedings of the European Conference on Artificial Intelligence (ECAI\u201904). pp. 435\u2013439. IOS Press, Valencia, Spain (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/ecai04.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-48d35aa9a4d727e221c90f959462b7b2\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-48d35aa9a4d727e221c90f959462b7b2\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/48d35aa9a4d727e221c90f959462b7b2\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-48d35aa9a4d727e221c90f959462b7b2\"><p>@inproceedings{cim04c,<br\/>  address = {Valencia, Spain},<br\/>  author = {Cimiano, Philipp and Hotho, Andreas and Staab, Steffen},<br\/>  booktitle = {Proceedings of the European Conference on Artificial Intelligence (ECAI'04)},<br\/>  editor = {de M{\u00e1}ntaras, Ramon L{\u00f3}pez and Saitta, Lorenza},<br\/>  keywords = {learning},<br\/>  pages = {435-439},<br\/>  publisher = {IOS Press},<br\/>  title = {Comparing Conceptual, Divise and Agglomerative Clustering for Learning Taxonomies from Text},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-48d35aa9a4d727e221c90f959462b7b2\"><p>%0 Conference Paper<br\/>%1 cim04c<br\/>%A Cimiano, Philipp<br\/>%A Hotho, Andreas<br\/>%A Staab, Steffen<br\/>%B Proceedings of the European Conference on Artificial Intelligence (ECAI'04)<br\/>%C Valencia, Spain<br\/>%D 2004<br\/>%E de M{\u00e1}ntaras, Ramon L{\u00f3}pez<br\/>%E Saitta, Lorenza<br\/>%I IOS Press<br\/>%P 435-439<br\/>%T Comparing Conceptual, Divise and Agglomerative Clustering for Learning Taxonomies from Text<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/2004\/ecai04.pdf<br\/>%@ 1-58603-452-9<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Sure, Y., Getoor, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A workshop report: mining for and from the Semantic Web at KDD 2004.<\/span><\/span> SIGKDD Explorations. 6, 142\u2013143 (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1aae46b03f32f0d69caa735abe81825e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1aae46b03f32f0d69caa735abe81825e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1aae46b03f32f0d69caa735abe81825e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1aae46b03f32f0d69caa735abe81825e\"><p>@article{DBLP:journals\/sigkdd\/HothoSG04,<br\/>  author = {Hotho, Andreas and Sure, York and Getoor, Lise},<br\/>  journal = {SIGKDD Explorations},<br\/>  keywords = {report},<br\/>  number = 2,<br\/>  pages = {142-143},<br\/>  title = {A workshop report: mining for and from the Semantic Web at KDD 2004.},<br\/>  volume = 6,<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1aae46b03f32f0d69caa735abe81825e\"><p>%0 Journal Article<br\/>%1 DBLP:journals\/sigkdd\/HothoSG04<br\/>%A Hotho, Andreas<br\/>%A Sure, York<br\/>%A Getoor, Lise<br\/>%D 2004<br\/>%J SIGKDD Explorations<br\/>%N 2<br\/>%P 142-143<br\/>%T A workshop report: mining for and from the Semantic Web at KDD 2004.<br\/>%V 6<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C., Staab, S., Tempich, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Socialisation in Peer-to-Peer Knowledge Management<\/span>.<\/span> In: Proc. International Conference on Knowledge Management (I-Know 2004). , Graz, Austria (2004).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/socialisation.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4b3563beefc8edf1941c40d340c0ecc3\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4b3563beefc8edf1941c40d340c0ecc3\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4b3563beefc8edf1941c40d340c0ecc3\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4b3563beefc8edf1941c40d340c0ecc3\"><p>@inproceedings{schmitz2004socialisation,<br\/>  address = {Graz, Austria},<br\/>  author = {Schmitz, Christoph and Staab, Steffen and Tempich, Christoph},<br\/>  booktitle = {Proc. International Conference on Knowledge Management (I-Know 2004)},<br\/>  keywords = {p2p},<br\/>  month = {06},<br\/>  title = {Socialisation in Peer-to-Peer Knowledge Management},<br\/>  year = 2004<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4b3563beefc8edf1941c40d340c0ecc3\"><p>%0 Conference Paper<br\/>%1 schmitz2004socialisation<br\/>%A Schmitz, Christoph<br\/>%A Staab, Steffen<br\/>%A Tempich, Christoph<br\/>%B Proc. International Conference on Knowledge Management (I-Know 2004)<br\/>%C Graz, Austria<br\/>%D 2004<br\/>%T Socialisation in Peer-to-Peer Knowledge Management<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/socialisation.pdf<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2003\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2003<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Oberle, D., Berendt, B., Hotho, A., Gonzalez, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual User Tracking<\/span>.<\/span> In: Ruiz, E.M., Segovia, J., and Szczepaniak, P.S. (eds.) Advances in Web Intelligence, First International Atlantic Web Intelligence Conference, AWIC 2003, Madrid, Spain, May 5-6, 2003, Proceedings. pp. 142\u2013154. Springer (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/dob\/pubs\/awic2003.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0e850231f9b08acb97a39c18e6591526\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0e850231f9b08acb97a39c18e6591526\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0e850231f9b08acb97a39c18e6591526\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0e850231f9b08acb97a39c18e6591526\"><p>@inproceedings{awic2003,<br\/>  author = {Oberle, Daniel and Berendt, Bettina and Hotho, Andreas and Gonzalez, Jorge},<br\/>  booktitle = {Advances in Web Intelligence, First International Atlantic Web Intelligence Conference, AWIC 2003, Madrid, Spain, May 5-6, 2003, Proceedings},<br\/>  editor = {Ruiz, Ernestina Menasalvas and Segovia, Javier and Szczepaniak, Piotr S.},<br\/>  keywords = {user},<br\/>  pages = {142-154},<br\/>  publisher = {Springer},<br\/>  series = {Lecture Notes in Artificial Intelligence},<br\/>  title = {Conceptual User Tracking},<br\/>  volume = 2663,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0e850231f9b08acb97a39c18e6591526\"><p>%0 Conference Paper<br\/>%1 awic2003<br\/>%A Oberle, Daniel<br\/>%A Berendt, Bettina<br\/>%A Hotho, Andreas<br\/>%A Gonzalez, Jorge<br\/>%B Advances in Web Intelligence, First International Atlantic Web Intelligence Conference, AWIC 2003, Madrid, Spain, May 5-6, 2003, Proceedings<br\/>%D 2003<br\/>%E Ruiz, Ernestina Menasalvas<br\/>%E Segovia, Javier<br\/>%E Szczepaniak, Piotr S.<br\/>%I Springer<br\/>%P 142-154<br\/>%T Conceptual User Tracking<br\/>%U http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/dob\/pubs\/awic2003.pdf<br\/>%V 2663<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Lehren -- Lernen -- Wissen -- Adaptivit{{\u00e4}}t (LLWA 2003)<\/span>.<\/span> , Universit{{\u00e4}}t Karlsruhe (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-37dcedc2988ffdf9e586ab4954d6938f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-37dcedc2988ffdf9e586ab4954d6938f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/37dcedc2988ffdf9e586ab4954d6938f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-37dcedc2988ffdf9e586ab4954d6938f\"><p>@proceedings{hotho03llwa,<br\/>  address = {Universit{{\u00e4}}t Karlsruhe},<br\/>  editor = {Hotho, Andreas and Stumme, Gerd},<br\/>  keywords = {llwa},<br\/>  month = 10,<br\/>  note = {Proceedings der Workshopwoche der GI-Fachgruppen\/Arbeitskreise FGML, FGWM, ABIS, AKKD},<br\/>  title = {Lehren -- Lernen -- Wissen -- Adaptivit{{\u00e4}}t (LLWA 2003)},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-37dcedc2988ffdf9e586ab4954d6938f\"><p>%0 Conference Proceedings<br\/>%1 hotho03llwa<br\/>%C Universit{{\u00e4}}t Karlsruhe<br\/>%D 2003<br\/>%E Hotho, Andreas<br\/>%E Stumme, Gerd<br\/>%T Lehren -- Lernen -- Wissen -- Adaptivit{{\u00e4}}t (LLWA 2003)<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ehrig, M., Schmitz, C., Staab, S., Tane, J., Tempich, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Evaluation of Peer-to-Peer-based Distributed Information Management Systems<\/span>.<\/span> In: Proceedings of the AAAI Spring Symposium on Agent-Mediated Knowledge Management (AMKM-03). , Stanford (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/amkm_evaluation.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-de986e94d032ff52909c7812856bc6d1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-de986e94d032ff52909c7812856bc6d1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/de986e94d032ff52909c7812856bc6d1\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-de986e94d032ff52909c7812856bc6d1\"><p>@inproceedings{ehrig2003towards,<br\/>  address = {Stanford},<br\/>  author = {Ehrig, Marc and Schmitz, Christoph and Staab, Steffen and Tane, Julien and Tempich, Christoph},<br\/>  booktitle = {Proceedings of the AAAI Spring Symposium on Agent-Mediated Knowledge Management (AMKM-03)},<br\/>  keywords = {p2p},<br\/>  month = {03},<br\/>  title = {Towards Evaluation of Peer-to-Peer-based Distributed Information Management Systems},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-de986e94d032ff52909c7812856bc6d1\"><p>%0 Conference Paper<br\/>%1 ehrig2003towards<br\/>%A Ehrig, Marc<br\/>%A Schmitz, Christoph<br\/>%A Staab, Steffen<br\/>%A Tane, Julien<br\/>%A Tempich, Christoph<br\/>%B Proceedings of the AAAI Spring Symposium on Agent-Mediated Knowledge Management (AMKM-03)<br\/>%C Stanford<br\/>%D 2003<br\/>%T Towards Evaluation of Peer-to-Peer-based Distributed Information Management Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/amkm_evaluation.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Studer, R., Stumme, G., Handschuh, S., Hotho, A., Motik, B.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Building and Using the Semantic Web<\/span>.<\/span> In: New Trends in Knowledge Processing -- Data Mining, Semantic Web and Computational. pp. 31\u201334. , Osaka, Japan (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/Sanken03.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a0e7b52680f1876cdd9cd21f7cb2f95c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a0e7b52680f1876cdd9cd21f7cb2f95c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a0e7b52680f1876cdd9cd21f7cb2f95c\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a0e7b52680f1876cdd9cd21f7cb2f95c\"><p>@inproceedings{studer03building,<br\/>  address = {Osaka, Japan},<br\/>  author = {Studer, Rudi and Stumme, Gerd and Handschuh, Siegfried and Hotho, Andreas and Motik, B.},<br\/>  booktitle = {New Trends in Knowledge Processing -- Data Mining, Semantic Web and Computational},<br\/>  keywords = {ontologies},<br\/>  month = {03},<br\/>  pages = {31-34},<br\/>  title = {Building and Using the Semantic Web},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a0e7b52680f1876cdd9cd21f7cb2f95c\"><p>%0 Conference Paper<br\/>%1 studer03building<br\/>%A Studer, Rudi<br\/>%A Stumme, Gerd<br\/>%A Handschuh, Siegfried<br\/>%A Hotho, Andreas<br\/>%A Motik, B.<br\/>%B New Trends in Knowledge Processing -- Data Mining, Semantic Web and Computational<br\/>%C Osaka, Japan<br\/>%D 2003<br\/>%P 31-34<br\/>%T Building and Using the Semantic Web<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/Sanken03.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Nejdl, W., Wolpers, M., Siberski, W., Schmitz, C., Schlosser, M., Brunkhorst, I., L\u00f6ser, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Super-Peer-Based Routing and Clustering Strategies for {RDF}-Based Peer-To-Peer Networks<\/span>.<\/span> In: Proceedings of the 12th International World Wide Web Conference. , Budapest (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/www03.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-710a9b392f9cd7020a886b375e44c678\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-710a9b392f9cd7020a886b375e44c678\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/710a9b392f9cd7020a886b375e44c678\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-710a9b392f9cd7020a886b375e44c678\"><p>@inproceedings{nejdl2003superpeer,<br\/>  address = {Budapest},<br\/>  author = {Nejdl, Wolfgang and Wolpers, Martin and Siberski, Wolf and Schmitz, Christoph and Schlosser, Mario and Brunkhorst, Ingo and L\u00f6ser, Alexander},<br\/>  booktitle = {Proceedings of the 12th International World Wide Web Conference},<br\/>  keywords = {p2p},<br\/>  month = {05},<br\/>  title = {Super-Peer-Based Routing and Clustering Strategies for {RDF}-Based Peer-To-Peer Networks},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-710a9b392f9cd7020a886b375e44c678\"><p>%0 Conference Paper<br\/>%1 nejdl2003superpeer<br\/>%A Nejdl, Wolfgang<br\/>%A Wolpers, Martin<br\/>%A Siberski, Wolf<br\/>%A Schmitz, Christoph<br\/>%A Schlosser, Mario<br\/>%A Brunkhorst, Ingo<br\/>%A L\u00f6ser, Alexander<br\/>%B Proceedings of the 12th International World Wide Web Conference<br\/>%C Budapest<br\/>%D 2003<br\/>%T Super-Peer-Based Routing and Clustering Strategies for {RDF}-Based Peer-To-Peer Networks<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/www03.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Off to New Shores -- Conceptual Knowledge Discovery and Processing<\/span>.<\/span> Intl. J. Human-Comuter Studies (IJHCS). 59, 287\u2013325 (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/stumme2003off.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-3ad5183ad5e15d93898a798bd5063194\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-3ad5183ad5e15d93898a798bd5063194\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/3ad5183ad5e15d93898a798bd5063194\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-3ad5183ad5e15d93898a798bd5063194\">In the last years, the main orientation of Formal Concept Analysis (FCA) has turned from mathematics towards computer science. This article provides a review of this new orientation and analyzes why and how FCA and computer science attracted each other. It discusses FCA as a knowledge representation formalism using five knowledge representation principles provided by Davis, Shrobe, and Szolovits (1993). It then studies how and why mathematics-based researchers got attracted by computer science. We will argue for continuing this trend by integrating the two research areas FCA and Ontology Engineering. The second part of the article discusses three lines of research which witness the new orientation of Formal Concept Analysis: FCA as a conceptual clustering technique and its application for supporting the merging of ontologies; the efficient computation of association rules and the structuring of the results; and the visualization and management of conceptual hierarchies and ontologies including its application in an email management system.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-3ad5183ad5e15d93898a798bd5063194\"><p>@article{stumme03off,<br\/>  abstract = {In the last years, the main orientation of Formal Concept Analysis (FCA) has turned from mathematics towards computer science. This article provides a review of this new orientation and analyzes why and how FCA and computer science attracted each other. It discusses FCA as a knowledge representation formalism using five knowledge representation principles provided by Davis, Shrobe, and Szolovits (1993). It then studies how and why mathematics-based researchers got attracted by computer science. We will argue for continuing this trend by integrating the two research areas FCA and Ontology Engineering. The second part of the article discusses three lines of research which witness the new orientation of Formal Concept Analysis: FCA as a conceptual clustering technique and its application for supporting the merging of ontologies; the efficient computation of association rules and the structuring of the results; and the visualization and management of conceptual hierarchies and ontologies including its application in an email management system.},<br\/>  author = {Stumme, G.},<br\/>  journal = {Intl. J. Human-Comuter Studies (IJHCS)},<br\/>  keywords = {Conceptual},<br\/>  month = {09},<br\/>  number = 3,<br\/>  pages = {287-325},<br\/>  title = {Off to New Shores -- Conceptual Knowledge Discovery and Processing},<br\/>  volume = 59,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-3ad5183ad5e15d93898a798bd5063194\"><p>%0 Journal Article<br\/>%1 stumme03off<br\/>%A Stumme, G.<br\/>%D 2003<br\/>%J Intl. J. Human-Comuter Studies (IJHCS)<br\/>%N 3<br\/>%P 287-325<br\/>%T Off to New Shores -- Conceptual Knowledge Discovery and Processing<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/stumme2003off.pdf<br\/>%V 59<br\/>%X In the last years, the main orientation of Formal Concept Analysis (FCA) has turned from mathematics towards computer science. This article provides a review of this new orientation and analyzes why and how FCA and computer science attracted each other. It discusses FCA as a knowledge representation formalism using five knowledge representation principles provided by Davis, Shrobe, and Szolovits (1993). It then studies how and why mathematics-based researchers got attracted by computer science. We will argue for continuing this trend by integrating the two research areas FCA and Ontology Engineering. The second part of the article discusses three lines of research which witness the new orientation of Formal Concept Analysis: FCA as a conceptual clustering technique and its application for supporting the merging of ontologies; the efficient computation of association rules and the structuring of the results; and the visualization and management of conceptual hierarchies and ontologies including its application in an email management system.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Mladenic, D., van Someren, M., Spiliopoulou, M., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Proceedings of the 1st European Web Mining Forum (EWMF 2003)<\/span>.<\/span> Workshop at the 14th Europ. Conf. on Machine Learning (ECML\u201903) \/ 7th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD\u201903), Cavtat\/Dubrovnik, Croatia (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-5df1f4f9be3b6424076846d5eb1d2542\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-5df1f4f9be3b6424076846d5eb1d2542\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/5df1f4f9be3b6424076846d5eb1d2542\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-5df1f4f9be3b6424076846d5eb1d2542\"><p>@proceedings{Berendt03EWMFWS,<br\/>  address = {Cavtat\/Dubrovnik, Croatia},<br\/>  editor = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and van Someren, Maarten and Spiliopoulou, Myra and Stumme, Gerd},<br\/>  keywords = {pkdd},<br\/>  month = {09},<br\/>  publisher = {Workshop at the 14th Europ. Conf. on Machine Learning (ECML'03) \/ 7th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'03)},<br\/>  title = {Proceedings of the 1st European Web Mining Forum (EWMF 2003)},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-5df1f4f9be3b6424076846d5eb1d2542\"><p>%0 Conference Proceedings<br\/>%1 Berendt03EWMFWS<br\/>%C Cavtat\/Dubrovnik, Croatia<br\/>%D 2003<br\/>%E Berendt, Bettina<br\/>%E Hotho, Andreas<br\/>%E Mladenic, Dunja<br\/>%E van Someren, Maarten<br\/>%E Spiliopoulou, Myra<br\/>%E Stumme, Gerd<br\/>%I Workshop at the 14th Europ. Conf. on Machine Learning (ECML'03) \/ 7th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'03)<br\/>%T Proceedings of the 1st European Web Mining Forum (EWMF 2003)<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Staab, S., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Explaining Text Clustering Results using Semantic Structures<\/span>.<\/span> In: Lavra\\v{c}, N., Gamberger, D., and Todorovski, H.B. (eds.) Knowledge Discovery in Databases: PKDD 2003, 7th European Conference on Principles and Practice of Knowledge Discovery in Databases. pp. 217\u2013228. Springer, Heidelberg (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/hotho2003explaining.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-53a943b6be4b34cf4e5329d0b58e99f6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-53a943b6be4b34cf4e5329d0b58e99f6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/53a943b6be4b34cf4e5329d0b58e99f6\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-53a943b6be4b34cf4e5329d0b58e99f6\">Common text clustering techniques offer rather poor capabilities for explaining to their users why a particular result has been achieved. They have the disadvantage that they do not relate semantically nearby terms and that they cannot explain how resulting clusters are related to each other. In this paper, we discuss a way of integrating a large thesaurus and the computation of lattices of resulting clusters into common text clustering in order to overcome these two problems. As its major result, our approach achieves an explanation using an appropriate level of granularity at the concept level as well as an appropriate size and complexity of the explaining lattice of resulting clusters.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-53a943b6be4b34cf4e5329d0b58e99f6\"><p>@inproceedings{hotho03explaining,<br\/>  abstract = {Common text clustering techniques offer rather poor capabilities for explaining to their users why a particular result has been achieved. They have the disadvantage that they do not relate semantically nearby terms and that they cannot explain how resulting clusters are related to each other. In this paper, we discuss a way of integrating a large thesaurus and the computation of lattices of resulting clusters into common text clustering in order to overcome these two problems. As its major result, our approach achieves an explanation using an appropriate level of granularity at the concept level as well as an appropriate size and complexity of the explaining lattice of resulting clusters.},<br\/>  address = {Heidelberg},<br\/>  author = {Hotho, Andreas and Staab, Steffen and Stumme, Gerd},<br\/>  booktitle = {Knowledge Discovery in Databases: PKDD 2003, 7th European Conference on Principles and Practice of Knowledge Discovery in Databases},<br\/>  editor = {Lavra\\v{c}, Nada and Gamberger, Dragan and Todorovski, Hendrik BlockeelLjupco},<br\/>  keywords = {ontologies},<br\/>  pages = {217-228},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Explaining Text Clustering Results using Semantic Structures},<br\/>  volume = 2838,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-53a943b6be4b34cf4e5329d0b58e99f6\"><p>%0 Conference Paper<br\/>%1 hotho03explaining<br\/>%A Hotho, Andreas<br\/>%A Staab, Steffen<br\/>%A Stumme, Gerd<br\/>%B Knowledge Discovery in Databases: PKDD 2003, 7th European Conference on Principles and Practice of Knowledge Discovery in Databases<br\/>%C Heidelberg<br\/>%D 2003<br\/>%E Lavra\\v{c}, Nada<br\/>%E Gamberger, Dragan<br\/>%E Todorovski, Hendrik BlockeelLjupco<br\/>%I Springer<br\/>%P 217-228<br\/>%T Explaining Text Clustering Results using Semantic Structures<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/hotho2003explaining.pdf<br\/>%V 2838<br\/>%X Common text clustering techniques offer rather poor capabilities for explaining to their users why a particular result has been achieved. They have the disadvantage that they do not relate semantically nearby terms and that they cannot explain how resulting clusters are related to each other. In this paper, we discuss a way of integrating a large thesaurus and the computation of lattices of resulting clusters into common text clustering in order to overcome these two problems. As its major result, our approach achieves an explanation using an appropriate level of granularity at the concept level as well as an appropriate size and complexity of the explaining lattice of resulting clusters.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Lehren -- Lernen -- Wissen -- Adaptivit\u00e4t. Workshopwoche der GI-Fachgruppen\/Arbeitskreise FGML, FGWM, ABIS, AKKD<\/span>.<\/span> , Universit\u00e4t Karlsruhe (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/km.aifb.uni-karlsruhe.de\/ws\/LLWA\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4d0edfc20579b879777174fd5709ac4a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4d0edfc20579b879777174fd5709ac4a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4d0edfc20579b879777174fd5709ac4a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4d0edfc20579b879777174fd5709ac4a\"><p>@proceedings{hotho03lehren,<br\/>  address = {Universit\u00e4t Karlsruhe},<br\/>  editor = {Hotho, A. and Stumme, G.},<br\/>  keywords = {akkd},<br\/>  month = 10,<br\/>  title = {Lehren -- Lernen -- Wissen -- Adaptivit\u00e4t. Workshopwoche der GI-Fachgruppen\/Arbeitskreise FGML, FGWM, ABIS, AKKD},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4d0edfc20579b879777174fd5709ac4a\"><p>%0 Conference Proceedings<br\/>%1 hotho03lehren<br\/>%C Universit\u00e4t Karlsruhe<br\/>%D 2003<br\/>%E Hotho, A.<br\/>%E Stumme, G.<br\/>%T Lehren -- Lernen -- Wissen -- Adaptivit\u00e4t. Workshopwoche der GI-Fachgruppen\/Arbeitskreise FGML, FGWM, ABIS, AKKD<br\/>%U http:\/\/km.aifb.uni-karlsruhe.de\/ws\/LLWA\/<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Lehren -- Lernen -- Wissen -- Adaptivit{\u00e4}t (LLWA 2003)<\/span>.<\/span> , Universit{\u00e4}t Karlsruhe (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-970db45c872cd6afd3f09e84b8395fec\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-970db45c872cd6afd3f09e84b8395fec\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/970db45c872cd6afd3f09e84b8395fec\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-970db45c872cd6afd3f09e84b8395fec\"><p>@proceedings{hotho03llwa,<br\/>  address = {Universit{\u00e4}t Karlsruhe},<br\/>  editor = {Hotho, Andreas and Stumme, Gerd},<br\/>  keywords = {llwa},<br\/>  month = 10,<br\/>  note = {Proceedings der Workshopwoche der GI-Fachgruppen\/Arbeitskreise FGML, FGWM, ABIS, AKKD},<br\/>  title = {Lehren -- Lernen -- Wissen -- Adaptivit{\u00e4}t (LLWA 2003)},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-970db45c872cd6afd3f09e84b8395fec\"><p>%0 Conference Proceedings<br\/>%1 hotho03llwa<br\/>%C Universit{\u00e4}t Karlsruhe<br\/>%D 2003<br\/>%E Hotho, Andreas<br\/>%E Stumme, Gerd<br\/>%T Lehren -- Lernen -- Wissen -- Adaptivit{\u00e4}t (LLWA 2003)<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Staab, S., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ontologies improve text document clustering<\/span>.<\/span> In: Proceedings of the 2003 IEEE International Conference on Data Mining. pp. 541\u2013544 (Poster. IEEE {C}omputer {S}ociety, Melbourne, Florida (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/hotho2003ontologies.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-57a39c81cff1982dbefed529be934bee\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-57a39c81cff1982dbefed529be934bee\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/57a39c81cff1982dbefed529be934bee\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-57a39c81cff1982dbefed529be934bee\"><p>@inproceedings{hotho03ontologies,<br\/>  address = {Melbourne, Florida},<br\/>  author = {Hotho, Andreas and Staab, Steffen and Stumme, Gerd},<br\/>  booktitle = {Proceedings of the 2003 IEEE International Conference on Data Mining},<br\/>  keywords = {ontologies},<br\/>  month = 11,<br\/>  pages = {541-544 (Poster},<br\/>  publisher = {IEEE {C}omputer {S}ociety},<br\/>  title = {Ontologies improve text document clustering},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-57a39c81cff1982dbefed529be934bee\"><p>%0 Conference Paper<br\/>%1 hotho03ontologies<br\/>%A Hotho, Andreas<br\/>%A Staab, Steffen<br\/>%A Stumme, Gerd<br\/>%B Proceedings of the 2003 IEEE International Conference on Data Mining<br\/>%C Melbourne, Florida<br\/>%D 2003<br\/>%I IEEE {C}omputer {S}ociety<br\/>%P 541-544 (Poster<br\/>%T Ontologies improve text document clustering<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/hotho2003ontologies.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Tane, J., Schmitz, C., Stumme, G., Staab, S., Studer, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The Courseware Watchdog: an Ontology-based tool for finding and organizing learning material<\/span>.<\/span> In: David, K. and Wegner, L. (eds.) Mobiles Lernen und Forschen - Beitr\u00e4ge der Fachtagung an der Universit\u00e4t. pp. 93\u2013104. Kassel University Press (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/tane2003courseware.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-850949481723b7dd03768ccd96b25cb9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-850949481723b7dd03768ccd96b25cb9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/850949481723b7dd03768ccd96b25cb9\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-850949481723b7dd03768ccd96b25cb9\">Topics in education are changing with an ever faster pace. E-Learning resources tend to be more and more decentralised. Users need increasingly to be able to use the resources of the web. For this, they should have tools for finding and organizing information in a decentral way. In this, paper, we show how an ontology-based tool suite allows to make the most of the resources available on the web.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-850949481723b7dd03768ccd96b25cb9\"><p>@inproceedings{tane03courseware,<br\/>  abstract = {Topics in education are changing with an ever faster pace. E-Learning resources tend to be more and more decentralised. Users need increasingly to be able to use the resources of the web. For this, they should have tools for finding and organizing information in a decentral way. In this, paper, we show how an ontology-based tool suite allows to make the most of the resources available on the web.},<br\/>  author = {Tane, Julien and Schmitz, Christoph and Stumme, Gerd and Staab, Steffen and Studer, R.},<br\/>  booktitle = {Mobiles Lernen und Forschen - Beitr\u00e4ge der Fachtagung an der Universit\u00e4t},<br\/>  editor = {David, Klaus and Wegner, Lutz},<br\/>  keywords = {ontologies},<br\/>  month = 11,<br\/>  pages = {93-104},<br\/>  publisher = {Kassel University Press},<br\/>  title = {The Courseware Watchdog: an Ontology-based tool for finding and organizing learning material},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-850949481723b7dd03768ccd96b25cb9\"><p>%0 Conference Paper<br\/>%1 tane03courseware<br\/>%A Tane, Julien<br\/>%A Schmitz, Christoph<br\/>%A Stumme, Gerd<br\/>%A Staab, Steffen<br\/>%A Studer, R.<br\/>%B Mobiles Lernen und Forschen - Beitr\u00e4ge der Fachtagung an der Universit\u00e4t<br\/>%D 2003<br\/>%E David, Klaus<br\/>%E Wegner, Lutz<br\/>%I Kassel University Press<br\/>%P 93-104<br\/>%T The Courseware Watchdog: an Ontology-based tool for finding and organizing learning material<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/tane2003courseware.pdf<br\/>%X Topics in education are changing with an ever faster pace. E-Learning resources tend to be more and more decentralised. Users need increasingly to be able to use the resources of the web. For this, they should have tools for finding and organizing information in a decentral way. In this, paper, we show how an ontology-based tool suite allows to make the most of the resources available on the web.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Lauser, B., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Automatic multi-label subject indexing in a multilingual environment<\/span>.<\/span> In: Proc. of the 7th European Conference in Research and Advanced Technology for Digital Libraries, ECDL 2003. pp. 140\u2013151. Springer (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8b298c325c6ecdb9c01e01057464ae2d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8b298c325c6ecdb9c01e01057464ae2d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8b298c325c6ecdb9c01e01057464ae2d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8b298c325c6ecdb9c01e01057464ae2d\"><p>@inproceedings{lauser03,<br\/>  author = {Lauser, Boris and Hotho, Andreas},<br\/>  booktitle = {Proc. of the 7th European Conference in Research and Advanced Technology for Digital Libraries, ECDL 2003},<br\/>  keywords = {ontology},<br\/>  pages = {140-151},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {Automatic multi-label subject indexing in a multilingual environment},<br\/>  volume = 2769,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8b298c325c6ecdb9c01e01057464ae2d\"><p>%0 Conference Paper<br\/>%1 lauser03<br\/>%A Lauser, Boris<br\/>%A Hotho, Andreas<br\/>%B Proc. of the 7th European Conference in Research and Advanced Technology for Digital Libraries, ECDL 2003<br\/>%D 2003<br\/>%I Springer<br\/>%P 140-151<br\/>%T Automatic multi-label subject indexing in a multilingual environment<br\/>%V 2769<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stefani, S., Adamczak, W.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A web based conference tool developed with SeSAMe<\/span><\/span>, http:\/\/www.svenstefani.de\/publ\/eunis2003\/Eunis2003_pp97_final.ppt, (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.svenstefani.de\/publ\/eunis2003\/Eunis2003_pp97_final.ppt\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2d30e3190917cd89d7c2ac274afccc24\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2d30e3190917cd89d7c2ac274afccc24\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2d30e3190917cd89d7c2ac274afccc24\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2d30e3190917cd89d7c2ac274afccc24\"><p>@misc{eunis2003ss,<br\/>  address = {EUNIS 2003, Niederlande},<br\/>  author = {Stefani, Sven and Adamczak, Wolfgang},<br\/>  howpublished = {Presentation at EUNIS 2003},<br\/>  keywords = {developed},<br\/>  note = {EUNIS 2003 - European University Information Systems, Amsterdam, Niederlande, 2003},<br\/>  title = {A web based conference tool developed with SeSAMe},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2d30e3190917cd89d7c2ac274afccc24\"><p>%0 Generic<br\/>%1 eunis2003ss<br\/>%A Stefani, Sven<br\/>%A Adamczak, Wolfgang<br\/>%C EUNIS 2003, Niederlande<br\/>%D 2003<br\/>%T A web based conference tool developed with SeSAMe<br\/>%U http:\/\/www.svenstefani.de\/publ\/eunis2003\/Eunis2003_pp97_final.ppt<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hereth, J., Stumme, G., Wille, R., Wille, U.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Knowledge Discovery - a Human-Centered Approach<\/span>.<\/span> Journal of Applied Artificial Intelligence (AAI). 17, 281\u2013301 (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/hereth2003conceptual.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-edffeb9bd2aaac559f2a6233dd49ae3b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-edffeb9bd2aaac559f2a6233dd49ae3b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/edffeb9bd2aaac559f2a6233dd49ae3b\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-edffeb9bd2aaac559f2a6233dd49ae3b\">In this paper we discuss Conceptual Knowledge Discovery in Databases (CKDD) as it is developing in the field of Conceptual Knowledge Processing. Conceptual Knowledge Processing is based on the mathematical theory of Formal Concept Analysis which has become a successful theory for data analysis during the last two decades. CKDD aims to support a human-centered process of discovering knowledge from data by visualizing and analyzing the conceptual structure of the data. We dicuss how the management system TOSCANA for conceptual information systems supports CKDD, and illustrate it by two applications in database marketing and flight movement analysis. Finally, we present a new tool for conceptual deviation discovery, Chianti.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-edffeb9bd2aaac559f2a6233dd49ae3b\"><p>@article{hereth03conceptual,<br\/>  abstract = {In this paper we discuss Conceptual Knowledge Discovery in Databases (CKDD) as it is developing in the field of Conceptual Knowledge Processing. Conceptual Knowledge Processing is based on the mathematical theory of Formal Concept Analysis which has become a successful theory for data analysis during the last two decades. CKDD aims to support a human-centered process of discovering knowledge from data by visualizing and analyzing the conceptual structure of the data. We dicuss how the management system TOSCANA for conceptual information systems supports CKDD, and illustrate it by two applications in database marketing and flight movement analysis. Finally, we present a new tool for conceptual deviation discovery, Chianti.},<br\/>  author = {Hereth, Joachim and Stumme, Gerd and Wille, Rudolf and Wille, Uta},<br\/>  journal = {Journal of Applied Artificial Intelligence (AAI)},<br\/>  keywords = {knowledge},<br\/>  number = 3,<br\/>  pages = {281-301},<br\/>  title = {Conceptual Knowledge Discovery - a Human-Centered Approach},<br\/>  volume = 17,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-edffeb9bd2aaac559f2a6233dd49ae3b\"><p>%0 Journal Article<br\/>%1 hereth03conceptual<br\/>%A Hereth, Joachim<br\/>%A Stumme, Gerd<br\/>%A Wille, Rudolf<br\/>%A Wille, Uta<br\/>%D 2003<br\/>%J Journal of Applied Artificial Intelligence (AAI)<br\/>%N 3<br\/>%P 281-301<br\/>%T Conceptual Knowledge Discovery - a Human-Centered Approach<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/hereth2003conceptual.pdf<br\/>%V 17<br\/>%X In this paper we discuss Conceptual Knowledge Discovery in Databases (CKDD) as it is developing in the field of Conceptual Knowledge Processing. Conceptual Knowledge Processing is based on the mathematical theory of Formal Concept Analysis which has become a successful theory for data analysis during the last two decades. CKDD aims to support a human-centered process of discovering knowledge from data by visualizing and analyzing the conceptual structure of the data. We dicuss how the management system TOSCANA for conceptual information systems supports CKDD, and illustrate it by two applications in database marketing and flight movement analysis. Finally, we present a new tool for conceptual deviation discovery, Chianti.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Staab, S., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">WordNet improves text document clustering<\/span>.<\/span> In: Proc. of the SIGIR 2003 Semantic Web Workshop. , Toronto, Canada (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/hothoetal_sigir_ws_sem_web.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b03e58ecb17c09f8c09d1fd93fb24f90\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b03e58ecb17c09f8c09d1fd93fb24f90\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b03e58ecb17c09f8c09d1fd93fb24f90\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b03e58ecb17c09f8c09d1fd93fb24f90\"><p>@inproceedings{hotho_sigir03,<br\/>  address = {Toronto, Canada},<br\/>  author = {Hotho, A. and Staab, S. and Stumme, G.},<br\/>  booktitle = {Proc. of the SIGIR 2003 Semantic Web Workshop},<br\/>  keywords = {ontology},<br\/>  title = {WordNet improves text document clustering},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b03e58ecb17c09f8c09d1fd93fb24f90\"><p>%0 Conference Paper<br\/>%1 hotho_sigir03<br\/>%A Hotho, A.<br\/>%A Staab, S.<br\/>%A Stumme, G.<br\/>%B Proc. of the SIGIR 2003 Semantic Web Workshop<br\/>%C Toronto, Canada<br\/>%D 2003<br\/>%T WordNet improves text document clustering<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/hotho\/pub\/hothoetal_sigir_ws_sem_web.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Reimer, U., Abecker, A., Staab, A., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM 2003<\/span>.<\/span> Gesellschaft f\u00fcr Informatik, Bonn (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/wm2003.aifb.uni-karlsruhe.de\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-728288f09f6d0f6dc4212e0b28cd3950\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-728288f09f6d0f6dc4212e0b28cd3950\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/728288f09f6d0f6dc4212e0b28cd3950\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-728288f09f6d0f6dc4212e0b28cd3950\"><p>@proceedings{reimer03professionelles,<br\/>  address = {Bonn},<br\/>  editor = {Reimer, U. and Abecker, A and Staab, A. and Stumme, G.},<br\/>  keywords = {wissensmanagement},<br\/>  publisher = {Gesellschaft f\u00fcr Informatik},<br\/>  series = {LNI},<br\/>  title = {Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM 2003},<br\/>  volume = 28,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-728288f09f6d0f6dc4212e0b28cd3950\"><p>%0 Conference Proceedings<br\/>%1 reimer03professionelles<br\/>%B LNI<br\/>%C Bonn<br\/>%D 2003<br\/>%E Reimer, U.<br\/>%E Abecker, A<br\/>%E Staab, A.<br\/>%E Stumme, G.<br\/>%I Gesellschaft f\u00fcr Informatik<br\/>%T Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM 2003<br\/>%U http:\/\/wm2003.aifb.uni-karlsruhe.de\/<br\/>%V 28<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cole, R.J., Eklund, P.W., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Document Retrieval for Email Search and Discovery using Formal Concept Analysis<\/span>.<\/span> Journal of Applied Artificial Intelligence (AAI). 17, 257\u2013280 (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/AAI03_emails.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-473f5c2cca394fac0de61086082a09de\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-473f5c2cca394fac0de61086082a09de\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/473f5c2cca394fac0de61086082a09de\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-473f5c2cca394fac0de61086082a09de\">This paper discusses an document discovery tool based on conceptual clustering by formal concept analysis. The program allows users to navigate email using a visual lattice metaphor rather than a tree. It implements a virtual file structure over email where files and entire directories can appear in multiple positions. The content and shape of the lattice formed by the conceptual ontology can assist in email discovery. The system described provides more flexibility in retrieving stored emails than what is normally available in email clients. The paper discusses how conceptual ontologies can leverage traditional document retrieval systems and aid knowledge discovery in document collections.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-473f5c2cca394fac0de61086082a09de\"><p>@article{cole03document,<br\/>  abstract = {This paper discusses an document discovery tool based on conceptual clustering by formal concept analysis. The program allows users to navigate email using a visual lattice metaphor rather than a tree. It implements a virtual file structure over email where files and entire directories can appear in multiple positions. The content and shape of the lattice formed by the conceptual ontology can assist in email discovery. The system described provides more flexibility in retrieving stored emails than what is normally available in email clients. The paper discusses how conceptual ontologies can leverage traditional document retrieval systems and aid knowledge discovery in document collections.},<br\/>  author = {Cole, Richard J. and Eklund, Peter W. and Stumme, Gerd},<br\/>  journal = {Journal of Applied Artificial Intelligence (AAI)},<br\/>  keywords = {information},<br\/>  number = 3,<br\/>  pages = {257-280},<br\/>  title = {Document Retrieval for Email Search and Discovery using Formal Concept Analysis},<br\/>  volume = 17,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-473f5c2cca394fac0de61086082a09de\"><p>%0 Journal Article<br\/>%1 cole03document<br\/>%A Cole, Richard J.<br\/>%A Eklund, Peter W.<br\/>%A Stumme, Gerd<br\/>%D 2003<br\/>%J Journal of Applied Artificial Intelligence (AAI)<br\/>%N 3<br\/>%P 257-280<br\/>%T Document Retrieval for Email Search and Discovery using Formal Concept Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/AAI03_emails.pdf<br\/>%V 17<br\/>%X This paper discusses an document discovery tool based on conceptual clustering by formal concept analysis. The program allows users to navigate email using a visual lattice metaphor rather than a tree. It implements a virtual file structure over email where files and entire directories can appear in multiple positions. The content and shape of the lattice formed by the conceptual ontology can assist in email discovery. The system described provides more flexibility in retrieving stored emails than what is normally available in email clients. The paper discusses how conceptual ontologies can leverage traditional document retrieval systems and aid knowledge discovery in document collections.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Agarwal, S., Fankhauser, P., Gonzalez-Ollala, J., Hartmann, J., Hollfelder, S., Jameson, A., Klink, S., Lehti, P., Ley, M., Rabbidge, E., Schwarzkopf, E., Shrestha, N., Stojanovic, N., Studer, R., Stumme, G., Walter, B.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Methods and Tools for Information Portals<\/span>.<\/span> In: Dittrich, K., K\u00f6nig, W., Oberweis, A., Rannenberg, K., and Wahlster, W. (eds.) INFORMATIK 2003 -- Innovative Informatikanwendungen (Band 1). pp. 116\u2013131. Gesellschaft f\u00fcr Informatik, Bonn (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/agarwal2003semantic.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8f2983e0f20c26ff98577059343f2cd4\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8f2983e0f20c26ff98577059343f2cd4\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8f2983e0f20c26ff98577059343f2cd4\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-8f2983e0f20c26ff98577059343f2cd4\">The paper describes a set of approaches for representing and accessing information within a semantically structured information portal, while offering the possibility to integrate own information. It discusses research performed within the project `Semantic Methods and Tools for Information Portals (SemIPort)'. In particular, it focuses on (1) the development of scalable storing, processing and querying methods for semantic data, (2) visualization and browsing of complex data inventories, (3) personalization and agent-based interaction, and (4) the enhancement of web mining approaches for use within a semantics-based portal.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8f2983e0f20c26ff98577059343f2cd4\"><p>@inproceedings{agarwal03semantic,<br\/>  abstract = {The paper describes a set of approaches for representing and accessing information within a semantically structured information portal, while offering the possibility to integrate own information. It discusses research performed within the project `Semantic Methods and Tools for Information Portals (SemIPort)'. In particular, it focuses on (1) the development of scalable storing, processing and querying methods for semantic data, (2) visualization and browsing of complex data inventories, (3) personalization and agent-based interaction, and (4) the enhancement of web mining approaches for use within a semantics-based portal.},<br\/>  address = {Bonn},<br\/>  author = {Agarwal, Sudhir and Fankhauser, Peter and Gonzalez-Ollala, Jorge and Hartmann, Jens and Hollfelder, Silvia and Jameson, Anthony and Klink, Stefan and Lehti, Patrick and Ley, Michael and Rabbidge, Emma and Schwarzkopf, Eric and Shrestha, Nitesh and Stojanovic, Nenad and Studer, Rudi and Stumme, Gerd and Walter, Bernd},<br\/>  booktitle = {INFORMATIK 2003 -- Innovative Informatikanwendungen (Band 1)},<br\/>  editor = {Dittrich, K. and K\u00f6nig, W. and Oberweis, A. and Rannenberg, K. and Wahlster, W.},<br\/>  keywords = {ontologies},<br\/>  pages = {116-131},<br\/>  publisher = {Gesellschaft f\u00fcr Informatik},<br\/>  series = {LNI},<br\/>  title = {Semantic Methods and Tools for Information Portals},<br\/>  volume = 34,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8f2983e0f20c26ff98577059343f2cd4\"><p>%0 Conference Paper<br\/>%1 agarwal03semantic<br\/>%A Agarwal, Sudhir<br\/>%A Fankhauser, Peter<br\/>%A Gonzalez-Ollala, Jorge<br\/>%A Hartmann, Jens<br\/>%A Hollfelder, Silvia<br\/>%A Jameson, Anthony<br\/>%A Klink, Stefan<br\/>%A Lehti, Patrick<br\/>%A Ley, Michael<br\/>%A Rabbidge, Emma<br\/>%A Schwarzkopf, Eric<br\/>%A Shrestha, Nitesh<br\/>%A Stojanovic, Nenad<br\/>%A Studer, Rudi<br\/>%A Stumme, Gerd<br\/>%A Walter, Bernd<br\/>%B INFORMATIK 2003 -- Innovative Informatikanwendungen (Band 1)<br\/>%C Bonn<br\/>%D 2003<br\/>%E Dittrich, K.<br\/>%E K\u00f6nig, W.<br\/>%E Oberweis, A.<br\/>%E Rannenberg, K.<br\/>%E Wahlster, W.<br\/>%I Gesellschaft f\u00fcr Informatik<br\/>%P 116-131<br\/>%T Semantic Methods and Tools for Information Portals<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/agarwal2003semantic.pdf<br\/>%V 34<br\/>%X The paper describes a set of approaches for representing and accessing information within a semantically structured information portal, while offering the possibility to integrate own information. It discusses research performed within the project `Semantic Methods and Tools for Information Portals (SemIPort)'. In particular, it focuses on (1) the development of scalable storing, processing and querying methods for semantic data, (2) visualization and browsing of complex data inventories, (3) personalization and agent-based interaction, and (4) the enhancement of web mining approaches for use within a semantics-based portal.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Staab, S., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Text Clustering Based on Background Knowledge<\/span>.<\/span> University of Karlsruhe, Institute AIFB (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/hotho2003text.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-61d58db419af0dbc3681432588219c3d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-61d58db419af0dbc3681432588219c3d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/61d58db419af0dbc3681432588219c3d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-61d58db419af0dbc3681432588219c3d\">Text document clustering plays an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. Standard partitional or agglomerative clustering methods efficiently compute results to this end. However, the bag of words representation used for these clustering methods is often unsatisfactory as it ignores relationships between important terms that do not co-occur literally. Also, it is mostly left to the user to find out why a particular partitioning has been achieved, because it is only specified extensionally. In order to deal with the two problems, we integrate background knowledge into the process of clustering text documents. First, we preprocess the texts, enriching their representations by background knowledge provided in a core ontology \u2014 in our application Wordnet. Then, we cluster the documents by a partitional algorithm. Our experimental evaluation on Reuters newsfeeds compares clustering results with pre-categorizations of news. In the experiments, improvements of results by background knowledge compared to the baseline can be shown for many interesting tasks. Second, the clustering partitions the large number of documents to a relatively small number of clusters, which may then be analyzed by conceptual clustering. In our approach, we applied Formal Concept Analysis. Conceptual clustering techniques are known to be too slow for directly clustering several hundreds of documents, but they give an intensional account of cluster results. They allow for a concise description of commonalities and distinctions of different clusters. With background knowledge they even find abstractions like \u201cfood\u201d (vs. specializations like \u201cbeef\u201d or \u201ccorn\u201d). Thus, in our approach, partitional clustering reduces first the size of the problem such that it becomes tractable for conceptual clustering, which then facilitates the understanding of the results.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-61d58db419af0dbc3681432588219c3d\"><p>@techreport{hotho03textclustering,<br\/>  abstract = {Text document clustering plays an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. Standard partitional or agglomerative clustering methods efficiently compute results to this end. However, the bag of words representation used for these clustering methods is often unsatisfactory as it ignores relationships between important terms that do not co-occur literally. Also, it is mostly left to the user to find out why a particular partitioning has been achieved, because it is only specified extensionally. In order to deal with the two problems, we integrate background knowledge into the process of clustering text documents. First, we preprocess the texts, enriching their representations by background knowledge provided in a core ontology \u2014 in our application Wordnet. Then, we cluster the documents by a partitional algorithm. Our experimental evaluation on Reuters newsfeeds compares clustering results with pre-categorizations of news. In the experiments, improvements of results by background knowledge compared to the baseline can be shown for many interesting tasks. Second, the clustering partitions the large number of documents to a relatively small number of clusters, which may then be analyzed by conceptual clustering. In our approach, we applied Formal Concept Analysis. Conceptual clustering techniques are known to be too slow for directly clustering several hundreds of documents, but they give an intensional account of cluster results. They allow for a concise description of commonalities and distinctions of different clusters. With background knowledge they even find abstractions like \u201cfood\u201d (vs. specializations like \u201cbeef\u201d or \u201ccorn\u201d). Thus, in our approach, partitional clustering reduces first the size of the problem such that it becomes tractable for conceptual clustering, which then facilitates the understanding of the results.},<br\/>  author = {Hotho, Andreas and Staab, Steffen and Stumme, Gerd},<br\/>  institution = {University of Karlsruhe, Institute AIFB},<br\/>  keywords = {ontologies},<br\/>  title = {Text Clustering Based on Background Knowledge},<br\/>  type = {Technical Report},<br\/>  volume = 425,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-61d58db419af0dbc3681432588219c3d\"><p>%0 Report<br\/>%1 hotho03textclustering<br\/>%A Hotho, Andreas<br\/>%A Staab, Steffen<br\/>%A Stumme, Gerd<br\/>%D 2003<br\/>%T Text Clustering Based on Background Knowledge<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/hotho2003text.pdf<br\/>%V 425<br\/>%X Text document clustering plays an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. Standard partitional or agglomerative clustering methods efficiently compute results to this end. However, the bag of words representation used for these clustering methods is often unsatisfactory as it ignores relationships between important terms that do not co-occur literally. Also, it is mostly left to the user to find out why a particular partitioning has been achieved, because it is only specified extensionally. In order to deal with the two problems, we integrate background knowledge into the process of clustering text documents. First, we preprocess the texts, enriching their representations by background knowledge provided in a core ontology \u2014 in our application Wordnet. Then, we cluster the documents by a partitional algorithm. Our experimental evaluation on Reuters newsfeeds compares clustering results with pre-categorizations of news. In the experiments, improvements of results by background knowledge compared to the baseline can be shown for many interesting tasks. Second, the clustering partitions the large number of documents to a relatively small number of clusters, which may then be analyzed by conceptual clustering. In our approach, we applied Formal Concept Analysis. Conceptual clustering techniques are known to be too slow for directly clustering several hundreds of documents, but they give an intensional account of cluster results. They allow for a concise description of commonalities and distinctions of different clusters. With background knowledge they even find abstractions like \u201cfood\u201d (vs. specializations like \u201cbeef\u201d or \u201ccorn\u201d). Thus, in our approach, partitional clustering reduces first the size of the problem such that it becomes tractable for conceptual clustering, which then facilitates the understanding of the results.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ganter, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Creation and Merging of Ontology Top-Levels<\/span>.<\/span> In: de Moor, A., Lex, W., and Ganter, B. (eds.) Conceptual Structures for Knowledge Creation and Communication. pp. 131\u2013145. Springer, Heidelberg (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/ganter2003creation.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-63bd63cb06802a5308959d611c1a017a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-63bd63cb06802a5308959d611c1a017a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/63bd63cb06802a5308959d611c1a017a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-63bd63cb06802a5308959d611c1a017a\">We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top--down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating\/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-63bd63cb06802a5308959d611c1a017a\"><p>@inproceedings{ganter03creation,<br\/>  abstract = {We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top--down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating\/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.},<br\/>  address = {Heidelberg},<br\/>  author = {Ganter, Bernhard and Stumme, Gerd},<br\/>  booktitle = {Conceptual Structures for Knowledge Creation and Communication.},<br\/>  editor = {de Moor, Aldo and Lex, Wilfried and Ganter, Bernhard},<br\/>  keywords = {ontologies},<br\/>  pages = {131-145},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Creation and Merging of Ontology Top-Levels},<br\/>  volume = 2746,<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-63bd63cb06802a5308959d611c1a017a\"><p>%0 Conference Paper<br\/>%1 ganter03creation<br\/>%A Ganter, Bernhard<br\/>%A Stumme, Gerd<br\/>%B Conceptual Structures for Knowledge Creation and Communication.<br\/>%C Heidelberg<br\/>%D 2003<br\/>%E de Moor, Aldo<br\/>%E Lex, Wilfried<br\/>%E Ganter, Bernhard<br\/>%I Springer<br\/>%P 131-145<br\/>%T Creation and Merging of Ontology Top-Levels<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/ganter2003creation.pdf<br\/>%V 2746<br\/>%X We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top--down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating\/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Stumme, G., Studer, R., Volz, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Web -- State of the Art and Future Directions<\/span>.<\/span> K\u00fcnstliche Intelligenz. 5\u20139 (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/KI03_Themenheft.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b5b149d07fb802ff5fffeec5e7f11fb8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b5b149d07fb802ff5fffeec5e7f11fb8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b5b149d07fb802ff5fffeec5e7f11fb8\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-b5b149d07fb802ff5fffeec5e7f11fb8\">The paper presents the vision of the Se- mantic Web and describes ontologies and associated metadata as the building blocks of the SemanticWeb. Current research topics and promising application ar- eas are discussed as well.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b5b149d07fb802ff5fffeec5e7f11fb8\"><p>@article{hotho03semantic,<br\/>  abstract = {The paper presents the vision of the Se- mantic Web and describes ontologies and associated metadata as the building blocks of the SemanticWeb. Current research topics and promising application ar- eas are discussed as well.},<br\/>  author = {Hotho, Andreas and Stumme, Gerd and Studer, Rudi and Volz, Raphael},<br\/>  journal = {K\u00fcnstliche Intelligenz},<br\/>  keywords = 2003,<br\/>  number = 3,<br\/>  pages = {5-9},<br\/>  title = {Semantic Web -- State of the Art and Future Directions},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b5b149d07fb802ff5fffeec5e7f11fb8\"><p>%0 Journal Article<br\/>%1 hotho03semantic<br\/>%A Hotho, Andreas<br\/>%A Stumme, Gerd<br\/>%A Studer, Rudi<br\/>%A Volz, Raphael<br\/>%D 2003<br\/>%J K\u00fcnstliche Intelligenz<br\/>%N 3<br\/>%P 5-9<br\/>%T Semantic Web -- State of the Art and Future Directions<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2003\/KI03_Themenheft.pdf<br\/>%X The paper presents the vision of the Se- mantic Web and describes ontologies and associated metadata as the building blocks of the SemanticWeb. Current research topics and promising application ar- eas are discussed as well.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Maedche, A., Staab, S., Zacharias, V.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On Knowledgeable Unsupervised Text Mining<\/span>.<\/span> In: Text Mining. pp. 131\u2013152 (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a0734d09c40265a173480ce4dc0af57a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a0734d09c40265a173480ce4dc0af57a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a0734d09c40265a173480ce4dc0af57a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a0734d09c40265a173480ce4dc0af57a\"><p>@incollection{hotho03tm,<br\/>  author = {Hotho, Andreas and Maedche, Alexander and Staab, Steffen and Zacharias, Valentin},<br\/>  booktitle = {Text Mining},<br\/>  keywords = {tm},<br\/>  pages = {131-152},<br\/>  title = {On Knowledgeable Unsupervised Text Mining},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a0734d09c40265a173480ce4dc0af57a\"><p>%0 Book Section<br\/>%1 hotho03tm<br\/>%A Hotho, Andreas<br\/>%A Maedche, Alexander<br\/>%A Staab, Steffen<br\/>%A Zacharias, Valentin<br\/>%B Text Mining<br\/>%D 2003<br\/>%P 131-152<br\/>%T On Knowledgeable Unsupervised Text Mining<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Staab, S., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ontology-based Text Document Clustering.<\/span><\/span> In: Intelligent Information Processing and Web Mining, Proceedings of the International IIS: IIPWM\u201903 Conference held in Zakopane. pp. 451\u2013452 (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/dblp.uni-trier.de\/db\/conf\/iis\/iis2003.html#StaabH03\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d773061117a913428968cc99c6e1ec0f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d773061117a913428968cc99c6e1ec0f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d773061117a913428968cc99c6e1ec0f\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d773061117a913428968cc99c6e1ec0f\"><p>@inproceedings{conf\/iis\/StaabH03,<br\/>  author = {Staab, Steffen and Hotho, Andreas},<br\/>  booktitle = {Intelligent Information Processing and Web Mining, Proceedings of the International IIS: IIPWM'03 Conference held in Zakopane},<br\/>  keywords = {ontology},<br\/>  pages = {451-452},<br\/>  title = {Ontology-based Text Document Clustering.},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d773061117a913428968cc99c6e1ec0f\"><p>%0 Conference Paper<br\/>%1 conf\/iis\/StaabH03<br\/>%A Staab, Steffen<br\/>%A Hotho, Andreas<br\/>%B Intelligent Information Processing and Web Mining, Proceedings of the International IIS: IIPWM'03 Conference held in Zakopane<br\/>%D 2003<br\/>%P 451-452<br\/>%T Ontology-based Text Document Clustering.<br\/>%U http:\/\/dblp.uni-trier.de\/db\/conf\/iis\/iis2003.html#StaabH03<br\/>%@ 3-540-00843-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Ehrig, M., Handschuh, S., Hotho, A., Maedche, A., Motik, B., Oberle, D., Schmitz, C., Staab, S., Stojanovic, L., Stojanovic, N., Studer, R., Sure, Y., Volz, R., Zacharias, V.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">The {K}arlsruhe view on ontologies<\/span>.<\/span> University of Karlsruhe, Institute AIFB (2003).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0fd517b9591a65c71f02b6f34690d829\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0fd517b9591a65c71f02b6f34690d829\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0fd517b9591a65c71f02b6f34690d829\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0fd517b9591a65c71f02b6f34690d829\"><p>@techreport{stumme03,<br\/>  author = {Stumme, Gerd and Ehrig, Marc and Handschuh, Siegfried and Hotho, Andreas and Maedche, Alexander and Motik, Boris and Oberle, Daniel and Schmitz, Christoph and Staab, Steffen and Stojanovic, Ljiljana and Stojanovic, Nenad and Studer, Rudi and Sure, York and Volz, Raphael and Zacharias, Valentin},<br\/>  institution = {University of Karlsruhe, Institute AIFB},<br\/>  keywords = {ontology},<br\/>  title = {The {K}arlsruhe view on ontologies},<br\/>  year = 2003<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0fd517b9591a65c71f02b6f34690d829\"><p>%0 Report<br\/>%1 stumme03<br\/>%A Stumme, Gerd<br\/>%A Ehrig, Marc<br\/>%A Handschuh, Siegfried<br\/>%A Hotho, Andreas<br\/>%A Maedche, Alexander<br\/>%A Motik, Boris<br\/>%A Oberle, Daniel<br\/>%A Schmitz, Christoph<br\/>%A Staab, Steffen<br\/>%A Stojanovic, Ljiljana<br\/>%A Stojanovic, Nenad<br\/>%A Studer, Rudi<br\/>%A Sure, York<br\/>%A Volz, Raphael<br\/>%A Zacharias, Valentin<br\/>%D 2003<br\/>%T The {K}arlsruhe view on ontologies<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2002\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2002<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Fernandez-Lopez, M., Gomez-Perez, A., Euzenat, J., Gangemi, A., Kalfoglou, Y., Pisanelli, D., Schorlemmer, M., Steve, G., Stojanovic, L., Stumme, G., Sure, Y.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A survey on methodologies for developing, maintaining, integration, evaluation and reengineering ontologies<\/span>.<\/span> Universidad Politecnia de Madrid (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/OntoWeb_Del_1-4.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-65a9d7650d99f11baa36420527fcedd9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-65a9d7650d99f11baa36420527fcedd9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/65a9d7650d99f11baa36420527fcedd9\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-65a9d7650d99f11baa36420527fcedd9\"><p>@techreport{fernandez02survey,<br\/>  author = {Fernandez-Lopez, Mariano and Gomez-Perez, Asun and Euzenat, Jerome and Gangemi, Aldo and Kalfoglou, Y. and Pisanelli, D. and Schorlemmer, M. and Steve, G. and Stojanovic, Ljilajana and Stumme, Gerd and Sure, York},<br\/>  institution = {Universidad Politecnia de Madrid},<br\/>  keywords = {ontology},<br\/>  title = {A survey on methodologies for developing, maintaining, integration, evaluation and reengineering ontologies},<br\/>  type = {OntoWeb deliverable},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-65a9d7650d99f11baa36420527fcedd9\"><p>%0 Report<br\/>%1 fernandez02survey<br\/>%A Fernandez-Lopez, Mariano<br\/>%A Gomez-Perez, Asun<br\/>%A Euzenat, Jerome<br\/>%A Gangemi, Aldo<br\/>%A Kalfoglou, Y.<br\/>%A Pisanelli, D.<br\/>%A Schorlemmer, M.<br\/>%A Steve, G.<br\/>%A Stojanovic, Ljilajana<br\/>%A Stumme, Gerd<br\/>%A Sure, York<br\/>%D 2002<br\/>%T A survey on methodologies for developing, maintaining, integration, evaluation and reengineering ontologies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/OntoWeb_Del_1-4.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf. on Machine Learning (ECML\u201902) \/ 6th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD\u201902)<\/span>.<\/span> , Helsinki, Finland (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/km.aifb.uni-karlsruhe.de\/ws\/semwebmine2002\/online_html\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b4d1e0ba321cc53504b66fc58ff18446\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b4d1e0ba321cc53504b66fc58ff18446\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b4d1e0ba321cc53504b66fc58ff18446\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b4d1e0ba321cc53504b66fc58ff18446\"><p>@proceedings{berendt02semantic,<br\/>  address = {Helsinki, Finland},<br\/>  editor = {Berendt, B. and Hotho, A. and Stumme, G.},<br\/>  keywords = {pkdd},<br\/>  month = {08},<br\/>  title = {Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf. on Machine Learning (ECML'02) \/ 6th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'02)},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b4d1e0ba321cc53504b66fc58ff18446\"><p>%0 Conference Proceedings<br\/>%1 berendt02semantic<br\/>%C Helsinki, Finland<br\/>%D 2002<br\/>%E Berendt, B.<br\/>%E Hotho, A.<br\/>%E Stumme, G.<br\/>%T Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf. on Machine Learning (ECML'02) \/ 6th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'02)<br\/>%U http:\/\/km.aifb.uni-karlsruhe.de\/ws\/semwebmine2002\/online_html<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ganter, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Creation and Merging of Ontology Top-Levels<\/span>.<\/span> In: Maedche, A., Sattler, K.-U., and Stumme, G. (eds.) Information Integration and Mining in Databases and on the Web. pp. 37\u201352. , Karlsruhe (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/ganter2002creating.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-46127c313c1b90d04ba961ee7945c92d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-46127c313c1b90d04ba961ee7945c92d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/46127c313c1b90d04ba961ee7945c92d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-46127c313c1b90d04ba961ee7945c92d\">We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top-down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating\/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-46127c313c1b90d04ba961ee7945c92d\"><p>@inproceedings{ganter02creation,<br\/>  abstract = {We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top-down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating\/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.},<br\/>  address = {Karlsruhe},<br\/>  author = {Ganter, B. and Stumme, G.},<br\/>  booktitle = {Information Integration and Mining in Databases and on the Web.},<br\/>  editor = {Maedche, A. and Sattler, K.-U and Stumme, G.},<br\/>  keywords = 2002,<br\/>  month = {07},<br\/>  pages = {37-52},<br\/>  title = {Creation and Merging of Ontology Top-Levels},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-46127c313c1b90d04ba961ee7945c92d\"><p>%0 Conference Paper<br\/>%1 ganter02creation<br\/>%A Ganter, B.<br\/>%A Stumme, G.<br\/>%B Information Integration and Mining in Databases and on the Web.<br\/>%C Karlsruhe<br\/>%D 2002<br\/>%E Maedche, A.<br\/>%E Sattler, K.-U<br\/>%E Stumme, G.<br\/>%P 37-52<br\/>%T Creation and Merging of Ontology Top-Levels<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/ganter2002creating.pdf<br\/>%X We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top-down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating\/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Becker, P., Hereth, J., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Toscana{J}: An Open Source Tool for Qualitative Data Analysis<\/span>.<\/span> In: Duquenne, V., Ganter, B., Liquiere, M., Nguifo, E.M., and Stumme, G. (eds.) Advances in Formal Concept Analysis for Knowledge Discovery in Databases. pp. 1\u20132. , Lyon, France (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/FCAKDD02.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9c8080aa372c4ac558c11465d817499a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9c8080aa372c4ac558c11465d817499a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9c8080aa372c4ac558c11465d817499a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9c8080aa372c4ac558c11465d817499a\"><p>@inproceedings{becker02toscana,<br\/>  address = {Lyon, France},<br\/>  author = {Becker, P. and Hereth, J. and Stumme, G.},<br\/>  booktitle = {Advances in Formal Concept Analysis for Knowledge Discovery in Databases.},<br\/>  editor = {Duquenne, V. and Ganter, B. and Liquiere, M. and Nguifo, E. M. and Stumme, G.},<br\/>  keywords = {open},<br\/>  month = {07},<br\/>  pages = {1-2},<br\/>  title = {Toscana{J}: An Open Source Tool for Qualitative Data Analysis},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9c8080aa372c4ac558c11465d817499a\"><p>%0 Conference Paper<br\/>%1 becker02toscana<br\/>%A Becker, P.<br\/>%A Hereth, J.<br\/>%A Stumme, G.<br\/>%B Advances in Formal Concept Analysis for Knowledge Discovery in Databases.<br\/>%C Lyon, France<br\/>%D 2002<br\/>%E Duquenne, V.<br\/>%E Ganter, B.<br\/>%E Liquiere, M.<br\/>%E Nguifo, E. M.<br\/>%E Stumme, G.<br\/>%P 1-2<br\/>%T Toscana{J}: An Open Source Tool for Qualitative Data Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/FCAKDD02.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Web Mining<\/span>.<\/span> Workshop at 13th Europ. Conf. on Machine Learning (ECML\u201902) \/ 6th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD\u201902), Helsinki (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f5bfd0060d08ec6aefea23c4add8da51\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f5bfd0060d08ec6aefea23c4add8da51\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f5bfd0060d08ec6aefea23c4add8da51\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f5bfd0060d08ec6aefea23c4add8da51\"><p>@proceedings{WS_BHS02,<br\/>  address = {Helsinki},<br\/>  booktitle = {Proc. of the Semantic Web Mining Workshop},<br\/>  editor = {Berendt, B. and Hotho, A. and Stumme, G.},<br\/>  keywords = 2002,<br\/>  month = {08},<br\/>  publisher = {Workshop at 13th Europ. Conf. on Machine Learning (ECML'02) \/ 6th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'02)},<br\/>  title = {Semantic Web Mining},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f5bfd0060d08ec6aefea23c4add8da51\"><p>%0 Conference Proceedings<br\/>%1 WS_BHS02<br\/>%B Proc. of the Semantic Web Mining Workshop<br\/>%C Helsinki<br\/>%D 2002<br\/>%E Berendt, B.<br\/>%E Hotho, A.<br\/>%E Stumme, G.<br\/>%I Workshop at 13th Europ. Conf. on Machine Learning (ECML'02) \/ 6th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'02)<br\/>%T Semantic Web Mining<br\/>%@ 3-540-41066-X<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Gonzalez-Olalla, J., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Methods and Tools for Information Portals - The {S}em{IP}ort Project (Project Description)<\/span>.<\/span> In: Berendt, B., Hotho, A., and Stumme, G. (eds.) Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf. p. 90. , Helsinki (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/gonzalez2002semantic.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c9fdc0e65bbd2a49ee0b1396b068a76d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c9fdc0e65bbd2a49ee0b1396b068a76d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c9fdc0e65bbd2a49ee0b1396b068a76d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c9fdc0e65bbd2a49ee0b1396b068a76d\"><p>@inproceedings{gonzalez02semantic,<br\/>  address = {Helsinki},<br\/>  author = {Gonzalez-Olalla, J. and Stumme, G.},<br\/>  booktitle = {Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf.},<br\/>  editor = {Berendt, B. and Hotho, A. and Stumme, G.},<br\/>  keywords = {ontologies},<br\/>  month = {08},<br\/>  pages = 90,<br\/>  title = {Semantic Methods and Tools for Information Portals - The {S}em{IP}ort Project (Project Description)},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c9fdc0e65bbd2a49ee0b1396b068a76d\"><p>%0 Conference Paper<br\/>%1 gonzalez02semantic<br\/>%A Gonzalez-Olalla, J.<br\/>%A Stumme, G.<br\/>%B Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf.<br\/>%C Helsinki<br\/>%D 2002<br\/>%E Berendt, B.<br\/>%E Hotho, A.<br\/>%E Stumme, G.<br\/>%P 90<br\/>%T Semantic Methods and Tools for Information Portals - The {S}em{IP}ort Project (Project Description)<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/gonzalez2002semantic.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hartmann, J., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Web Mining for Building Information Portals (Position Paper)<\/span>.<\/span> In: Proc. Arbeitskreistreffen Knowledge Discovery. , Oldenburg (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/hartmann2002semanticweb.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a5f1a8b42409b96271bc5c671deceea9\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a5f1a8b42409b96271bc5c671deceea9\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a5f1a8b42409b96271bc5c671deceea9\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a5f1a8b42409b96271bc5c671deceea9\"><p>@inproceedings{hartmann02semanticweb,<br\/>  address = {Oldenburg},<br\/>  author = {Hartmann, J. and Hotho, A. and Stumme, G.},<br\/>  booktitle = {Proc. Arbeitskreistreffen Knowledge Discovery},<br\/>  keywords = {ontologies},<br\/>  month = {09},<br\/>  title = {Semantic Web Mining for Building Information Portals (Position Paper)},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a5f1a8b42409b96271bc5c671deceea9\"><p>%0 Conference Paper<br\/>%1 hartmann02semanticweb<br\/>%A Hartmann, J.<br\/>%A Hotho, A.<br\/>%A Stumme, G.<br\/>%B Proc. Arbeitskreistreffen Knowledge Discovery<br\/>%C Oldenburg<br\/>%D 2002<br\/>%T Semantic Web Mining for Building Information Portals (Position Paper)<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/hartmann2002semanticweb.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Ehrig, M., Handschuh, S., Hotho, A., Maedche, A., Motik, B., Oberle, D., Schmitz, C., Staab, S., Stojanovic, L., Stojanovic, N., Studer, R., Stumme, G., Sure, Y., Tane, J., Volz, R., Zacharias, V.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{KAON} - Towards a large scale {S}emantic {W}eb<\/span>.<\/span> In: Bauknecht, K., Tjoa, A.M., and Quirchmayr, G. (eds.) Proc. E-Commerce and Web Technologies, Third International Conference, EC-Web 2002. Springer, Aix-en-Provence %, France (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f2a4d095a4d921d311a5f24d91789cdb\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f2a4d095a4d921d311a5f24d91789cdb\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f2a4d095a4d921d311a5f24d91789cdb\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f2a4d095a4d921d311a5f24d91789cdb\"><p>@inproceedings{ehrig2002kaon,<br\/>  address = {Aix-en-Provence %, France},<br\/>  author = {Ehrig, Marc and Handschuh, Siegfried and Hotho, Andreas and Maedche, Alexander and Motik, Boris and Oberle, Daniel and Schmitz, Christoph and Staab, Steffen and Stojanovic, Ljiljana and Stojanovic, Nenad and Studer, Rudi and Stumme, Gerd and Sure, York and Tane, Julien and Volz, Raphael and Zacharias, Valentin},<br\/>  booktitle = {Proc. E-Commerce and Web Technologies, Third International Conference, EC-Web 2002},<br\/>  editor = {Bauknecht, Kurt and Tjoa, A. Min and Quirchmayr, Gerald},<br\/>  keywords = {knowledge},<br\/>  month = {09},<br\/>  number = 2455,<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {{KAON} - Towards a large scale {S}emantic {W}eb},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f2a4d095a4d921d311a5f24d91789cdb\"><p>%0 Conference Paper<br\/>%1 ehrig2002kaon<br\/>%A Ehrig, Marc<br\/>%A Handschuh, Siegfried<br\/>%A Hotho, Andreas<br\/>%A Maedche, Alexander<br\/>%A Motik, Boris<br\/>%A Oberle, Daniel<br\/>%A Schmitz, Christoph<br\/>%A Staab, Steffen<br\/>%A Stojanovic, Ljiljana<br\/>%A Stojanovic, Nenad<br\/>%A Studer, Rudi<br\/>%A Stumme, Gerd<br\/>%A Sure, York<br\/>%A Tane, Julien<br\/>%A Volz, Raphael<br\/>%A Zacharias, Valentin<br\/>%B Proc. E-Commerce and Web Technologies, Third International Conference, EC-Web 2002<br\/>%C Aix-en-Provence %, France<br\/>%D 2002<br\/>%E Bauknecht, Kurt<br\/>%E Tjoa, A. Min<br\/>%E Quirchmayr, Gerald<br\/>%I Springer<br\/>%N 2455<br\/>%T {KAON} - Towards a large scale {S}emantic {W}eb<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Efficient Data Mining Based on Formal Concept Analysis<\/span>.<\/span> In: Hameurlain, A., Cicchetti, R., and Traunm\u00fcller, R. (eds.) Database and Expert Systems Applications. Proc. DEXA 2002. pp. 534\u2013546. Springer, Heidelberg (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/DEXA02.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0adce6a0db24566bb55d6e2d6667c8e7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0adce6a0db24566bb55d6e2d6667c8e7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0adce6a0db24566bb55d6e2d6667c8e7\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0adce6a0db24566bb55d6e2d6667c8e7\"><p>@inproceedings{stumme02efficient,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, G.},<br\/>  booktitle = {Database and Expert Systems Applications. Proc. DEXA 2002},<br\/>  editor = {Hameurlain, A. and Cicchetti, R. and Traunm\u00fcller, R.},<br\/>  keywords = {itemsets},<br\/>  pages = {534-546},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {Efficient Data Mining Based on Formal Concept Analysis},<br\/>  volume = 2453,<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0adce6a0db24566bb55d6e2d6667c8e7\"><p>%0 Conference Paper<br\/>%1 stumme02efficient<br\/>%A Stumme, G.<br\/>%B Database and Expert Systems Applications. Proc. DEXA 2002<br\/>%C Heidelberg<br\/>%D 2002<br\/>%E Hameurlain, A.<br\/>%E Cicchetti, R.<br\/>%E Traunm\u00fcller, R.<br\/>%I Springer<br\/>%P 534-546<br\/>%T Efficient Data Mining Based on Formal Concept Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/DEXA02.pdf<br\/>%V 2453<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C., Staab, S., Studer, R., Stumme, G., Tane, J.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Accessing Distributed Learning Repositories through a {C}ourseware {W}atchdog<\/span>.<\/span> In: Proc. E-Learn 2002: World Conference on E-Learning in Corporate, Government, Healthcare, \\&amp; Higher Education. , Montreal (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/elearn02.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b390c948b070288a352dd957021238be\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b390c948b070288a352dd957021238be\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b390c948b070288a352dd957021238be\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b390c948b070288a352dd957021238be\"><p>@inproceedings{schmitz2002accessing,<br\/>  address = {Montreal},<br\/>  author = {Schmitz, Christoph and Staab, Steffen and Studer, Rudi and Stumme, Gerd and Tane, Julien},<br\/>  booktitle = {Proc. E-Learn 2002: World Conference on E-Learning in Corporate, Government, Healthcare, \\& Higher Education},<br\/>  keywords = {p2p},<br\/>  month = 10,<br\/>  title = {Accessing Distributed Learning Repositories through a {C}ourseware {W}atchdog},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b390c948b070288a352dd957021238be\"><p>%0 Conference Paper<br\/>%1 schmitz2002accessing<br\/>%A Schmitz, Christoph<br\/>%A Staab, Steffen<br\/>%A Studer, Rudi<br\/>%A Stumme, Gerd<br\/>%A Tane, Julien<br\/>%B Proc. E-Learn 2002: World Conference on E-Learning in Corporate, Government, Healthcare, \\& Higher Education<br\/>%C Montreal<br\/>%D 2002<br\/>%T Accessing Distributed Learning Repositories through a {C}ourseware {W}atchdog<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/elearn02.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Berendt, B., Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Usage Mining for and on the Semantic Web<\/span>.<\/span> In: Proc. NSF Workshop on Next Generation Data Mining. pp. 77\u201386. , Baltimore (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/NSF-NGDM02.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4a68d1443065dcd7980989e97cb0af69\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4a68d1443065dcd7980989e97cb0af69\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4a68d1443065dcd7980989e97cb0af69\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4a68d1443065dcd7980989e97cb0af69\"><p>@inproceedings{stumme02usage,<br\/>  address = {Baltimore},<br\/>  author = {Stumme, G. and Berendt, B. and Hotho, A.},<br\/>  booktitle = {Proc. NSF Workshop on Next Generation Data Mining},<br\/>  keywords = 2002,<br\/>  month = 11,<br\/>  pages = {77-86},<br\/>  title = {Usage Mining for and on the Semantic Web},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4a68d1443065dcd7980989e97cb0af69\"><p>%0 Conference Paper<br\/>%1 stumme02usage<br\/>%A Stumme, G.<br\/>%A Berendt, B.<br\/>%A Hotho, A.<br\/>%B Proc. NSF Workshop on Next Generation Data Mining<br\/>%C Baltimore<br\/>%D 2002<br\/>%P 77-86<br\/>%T Usage Mining for and on the Semantic Web<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/NSF-NGDM02.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bozsak, E., Ehrig, M., Handschuh, S., Hotho, A., Maedche, A., Motik, B., Oberle, D., Schmitz, C., Staab, S., Stojanovic, L., Stojanovic, N., Studer, R., Stumme, G., Sure, Y., Tane, J., Volz, R., Zacharias, V.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">KAON - Towards a Large Scale Semantic Web<\/span>.<\/span> In: Bauknecht, K., Tjoa, A.M., and Quirchmayr, G. (eds.) E-Commerce and Web Technologies, Third International Conference, EC-Web 2002, Proceedings. pp. 304\u2013313. Springer, Aix-en-Provence, France (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d92e8045430c4cfe096d515455a23921\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d92e8045430c4cfe096d515455a23921\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d92e8045430c4cfe096d515455a23921\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d92e8045430c4cfe096d515455a23921\"><p>@inproceedings{kaon_def2002,<br\/>  address = {Berlin},<br\/>  author = {Bozsak, E. and Ehrig, M. and Handschuh, S. and Hotho, A. and Maedche, A. and Motik, B. and Oberle, D. and Schmitz, C. and Staab, S. and Stojanovic, L. and Stojanovic, N. and Studer, R. and Stumme, G. and Sure, Y. and Tane, J. and Volz, R. and Zacharias, V.},<br\/>  booktitle = {E-Commerce and Web Technologies, Third International Conference, EC-Web 2002, Proceedings},<br\/>  editor = {Bauknecht, K. and Tjoa, A. Min and Quirchmayr, G.},<br\/>  keywords = {SumSchool06},<br\/>  pages = {304--313},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {KAON - Towards a Large Scale Semantic Web},<br\/>  volume = 2455,<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d92e8045430c4cfe096d515455a23921\"><p>%0 Conference Paper<br\/>%1 kaon_def2002<br\/>%A Bozsak, E.<br\/>%A Ehrig, M.<br\/>%A Handschuh, S.<br\/>%A Hotho, A.<br\/>%A Maedche, A.<br\/>%A Motik, B.<br\/>%A Oberle, D.<br\/>%A Schmitz, C.<br\/>%A Staab, S.<br\/>%A Stojanovic, L.<br\/>%A Stojanovic, N.<br\/>%A Studer, R.<br\/>%A Stumme, G.<br\/>%A Sure, Y.<br\/>%A Tane, J.<br\/>%A Volz, R.<br\/>%A Zacharias, V.<br\/>%B E-Commerce and Web Technologies, Third International Conference, EC-Web 2002, Proceedings<br\/>%C Berlin<br\/>%D 2002<br\/>%E Bauknecht, K.<br\/>%E Tjoa, A. Min<br\/>%E Quirchmayr, G.<br\/>%I Springer<br\/>%P 304--313<br\/>%T KAON - Towards a Large Scale Semantic Web<br\/>%V 2455<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Maedche, A., Staab, S., Zacharias, V.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On Knowledgeable Unsupervised Text Mining<\/span>.<\/span> In: Proc. of Text Mining Workshop (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/aho\/pub\/txt_mining_ws_2002.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-56ae0afc93999014629b06cc958f6a04\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-56ae0afc93999014629b06cc958f6a04\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/56ae0afc93999014629b06cc958f6a04\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-56ae0afc93999014629b06cc958f6a04\"><p>@inproceedings{hotho02textws,<br\/>  author = {Hotho, Andreas and Maedche, Alexander and Staab, Steffen and Zacharias, Valentin},<br\/>  booktitle = {Proc. of Text Mining Workshop},<br\/>  keywords = {text},<br\/>  title = {On Knowledgeable Unsupervised Text Mining},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-56ae0afc93999014629b06cc958f6a04\"><p>%0 Conference Paper<br\/>%1 hotho02textws<br\/>%A Hotho, Andreas<br\/>%A Maedche, Alexander<br\/>%A Staab, Steffen<br\/>%A Zacharias, Valentin<br\/>%B Proc. of Text Mining Workshop<br\/>%D 2002<br\/>%T On Knowledgeable Unsupervised Text Mining<br\/>%U http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/aho\/pub\/txt_mining_ws_2002.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Maedche, A., Staab, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Text Clustering Based on Good Aggregations<\/span>.<\/span> K{{\u00fc}}nstliche Intelligenz (KI). 16, 48\u201354 (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/aho\/pub\/Ontology_based_Text_Document_Clustering_2002.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b54e211028a75303d03dfdcce479428e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b54e211028a75303d03dfdcce479428e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b54e211028a75303d03dfdcce479428e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b54e211028a75303d03dfdcce479428e\"><p>@article{hotho02ki,<br\/>  author = {Hotho, Andreas and Maedche, Alexander and Staab, Steffen},<br\/>  journal = {K{{\u00fc}}nstliche Intelligenz (KI)},<br\/>  keywords = {ontology},<br\/>  number = 4,<br\/>  pages = {48-54},<br\/>  title = {Text Clustering Based on Good Aggregations},<br\/>  volume = 16,<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b54e211028a75303d03dfdcce479428e\"><p>%0 Journal Article<br\/>%1 hotho02ki<br\/>%A Hotho, Andreas<br\/>%A Maedche, Alexander<br\/>%A Staab, Steffen<br\/>%D 2002<br\/>%J K{{\u00fc}}nstliche Intelligenz (KI)<br\/>%N 4<br\/>%P 48-54<br\/>%T Text Clustering Based on Good Aggregations<br\/>%U http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/aho\/pub\/Ontology_based_Text_Document_Clustering_2002.pdf<br\/>%V 16<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">E-{L}earning: vom {N}\u00fcrnberger {T}richter zum weltweiten {N}etz<\/span>.<\/span> Karlsruher Transfer. 27, 14\u201317 (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/KarlsruherTransfer02.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a26b923916e6b0d54014daaaed729e91\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a26b923916e6b0d54014daaaed729e91\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a26b923916e6b0d54014daaaed729e91\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a26b923916e6b0d54014daaaed729e91\"><p>@article{stumme02elearning,<br\/>  author = {Stumme, G.},<br\/>  journal = {Karlsruher Transfer},<br\/>  keywords = {eLearning},<br\/>  pages = {14-17},<br\/>  title = {E-{L}earning: vom {N}\u00fcrnberger {T}richter zum weltweiten {N}etz},<br\/>  volume = 27,<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a26b923916e6b0d54014daaaed729e91\"><p>%0 Journal Article<br\/>%1 stumme02elearning<br\/>%A Stumme, G.<br\/>%D 2002<br\/>%J Karlsruher Transfer<br\/>%P 14-17<br\/>%T E-{L}earning: vom {N}\u00fcrnberger {T}richter zum weltweiten {N}etz<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/KarlsruherTransfer02.pdf<br\/>%V 27<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Pascal: un alogorithme d\u2019extraction des motifs fr\u00e9quents<\/span>.<\/span> Technique et Science Informatiques (TSI). 21, 65\u201395 (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/TSI01.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-494ab134ddccac2af4a1d4a7cb52a78d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-494ab134ddccac2af4a1d4a7cb52a78d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/494ab134ddccac2af4a1d4a7cb52a78d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-494ab134ddccac2af4a1d4a7cb52a78d\"><p>@article{bastide02unalogorithme,<br\/>  author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},<br\/>  journal = {Technique et Science Informatiques (TSI)},<br\/>  keywords = {closed},<br\/>  number = 1,<br\/>  pages = {65-95},<br\/>  title = {Pascal: un alogorithme d'extraction des motifs fr\u00e9quents},<br\/>  volume = 21,<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-494ab134ddccac2af4a1d4a7cb52a78d\"><p>%0 Journal Article<br\/>%1 bastide02unalogorithme<br\/>%A Bastide, Y.<br\/>%A Taouil, R.<br\/>%A Pasquier, N.<br\/>%A Stumme, G.<br\/>%A Lakhal, L.<br\/>%D 2002<br\/>%J Technique et Science Informatiques (TSI)<br\/>%N 1<br\/>%P 65-95<br\/>%T Pascal: un alogorithme d'extraction des motifs fr\u00e9quents<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/TSI01.pdf<br\/>%V 21<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Formal Concept Analysis on its Way from Mathematics to Computer Science<\/span>.<\/span> In: Priss, U., Corbett, D., and Angelova, G. (eds.) Conceptual Structures: Integration and Interfaces. pp. 2\u201319. Springer, Heidelberg (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/ICCS02.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a5e66aef2e0adc6cc7eff677b36d0823\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a5e66aef2e0adc6cc7eff677b36d0823\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a5e66aef2e0adc6cc7eff677b36d0823\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a5e66aef2e0adc6cc7eff677b36d0823\"><p>@inproceedings{stumme02formalconcept,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, G.},<br\/>  booktitle = {Conceptual Structures: Integration and Interfaces},<br\/>  editor = {Priss, U. and Corbett, D. and Angelova, G.},<br\/>  keywords = {mathematik},<br\/>  note = {Invited Talk, summary of \\cite{stumme03offtonew}},<br\/>  pages = {2-19},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Formal Concept Analysis on its Way from Mathematics to Computer Science},<br\/>  volume = 2393,<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a5e66aef2e0adc6cc7eff677b36d0823\"><p>%0 Conference Paper<br\/>%1 stumme02formalconcept<br\/>%A Stumme, G.<br\/>%B Conceptual Structures: Integration and Interfaces<br\/>%C Heidelberg<br\/>%D 2002<br\/>%E Priss, U.<br\/>%E Corbett, D.<br\/>%E Angelova, G.<br\/>%I Springer<br\/>%P 2-19<br\/>%T Formal Concept Analysis on its Way from Mathematics to Computer Science<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/ICCS02.pdf<br\/>%V 2393<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge<\/span>.<\/span> In: Becker, J. and Knackstedt, R. (eds.) Wissensmanagement mit Referenzmodellen -- Konzepte f\u00fcr die Anwendungssystem- und Organisationsgestaltung. pp. 163\u2013174. Physica, Heidelberg (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/REFMOD01.ps\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8cd4f719765abd1c46d28f200327d935\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8cd4f719765abd1c46d28f200327d935\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8cd4f719765abd1c46d28f200327d935\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8cd4f719765abd1c46d28f200327d935\"><p>@incollection{stumme02using,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, G.},<br\/>  booktitle = {Wissensmanagement mit Referenzmodellen -- Konzepte f\u00fcr die Anwendungssystem- und Organisationsgestaltung},<br\/>  editor = {Becker, J. and Knackstedt, R.},<br\/>  keywords = {ontologies},<br\/>  pages = {163-174},<br\/>  publisher = {Physica},<br\/>  title = {Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8cd4f719765abd1c46d28f200327d935\"><p>%0 Book Section<br\/>%1 stumme02using<br\/>%A Stumme, G.<br\/>%B Wissensmanagement mit Referenzmodellen -- Konzepte f\u00fcr die Anwendungssystem- und Organisationsgestaltung<br\/>%C Heidelberg<br\/>%D 2002<br\/>%E Becker, J.<br\/>%E Knackstedt, R.<br\/>%I Physica<br\/>%P 163-174<br\/>%T Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/REFMOD01.ps<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Berendt, B., Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards Semantic Web Mining<\/span>.<\/span> In: Horrocks, I. and Hendler, J. (eds.) The Semantic Web -- ISWC 2002. pp. 264\u2013278. Springer, Heidelberg (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/ISWC02.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fc1c88be5f8c2640ca6e9a40b5fa1c7b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fc1c88be5f8c2640ca6e9a40b5fa1c7b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fc1c88be5f8c2640ca6e9a40b5fa1c7b\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fc1c88be5f8c2640ca6e9a40b5fa1c7b\"><p>@inproceedings{berendt02towards,<br\/>  address = {Heidelberg},<br\/>  author = {Berendt, B. and Hotho, A. and Stumme, G.},<br\/>  booktitle = {The Semantic Web -- ISWC 2002},<br\/>  editor = {Horrocks, I. and Hendler, J.},<br\/>  keywords = 2002,<br\/>  pages = {264-278},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {Towards Semantic Web Mining},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fc1c88be5f8c2640ca6e9a40b5fa1c7b\"><p>%0 Conference Paper<br\/>%1 berendt02towards<br\/>%A Berendt, B.<br\/>%A Hotho, A.<br\/>%A Stumme, G.<br\/>%B The Semantic Web -- ISWC 2002<br\/>%C Heidelberg<br\/>%D 2002<br\/>%E Horrocks, I.<br\/>%E Hendler, J.<br\/>%I Springer<br\/>%P 264-278<br\/>%T Towards Semantic Web Mining<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/ISWC02.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Taouil, R., Bastide, Y., Pasqier, N., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Computing Iceberg Concept Lattices with {Titanic}<\/span>.<\/span> {J.} Data and KnowledgeEngineering (DKE). 42, 189\u2013222 (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/stumme2002computing.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a590bd9ffa84e218d2d78c36feea9e1d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a590bd9ffa84e218d2d78c36feea9e1d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a590bd9ffa84e218d2d78c36feea9e1d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a590bd9ffa84e218d2d78c36feea9e1d\"><p>@article{stumme02computing,<br\/>  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasqier, N. and Lakhal, L.},<br\/>  journal = {{J.} Data and KnowledgeEngineering (DKE)},<br\/>  keywords = {itemsets},<br\/>  number = 2,<br\/>  pages = {189-222},<br\/>  title = {Computing Iceberg Concept Lattices with {Titanic}},<br\/>  volume = 42,<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a590bd9ffa84e218d2d78c36feea9e1d\"><p>%0 Journal Article<br\/>%1 stumme02computing<br\/>%A Stumme, G.<br\/>%A Taouil, R.<br\/>%A Bastide, Y.<br\/>%A Pasqier, N.<br\/>%A Lakhal, L.<br\/>%D 2002<br\/>%J {J.} Data and KnowledgeEngineering (DKE)<br\/>%N 2<br\/>%P 189-222<br\/>%T Computing Iceberg Concept Lattices with {Titanic}<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2002\/stumme2002computing.pdf<br\/>%V 42<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Clustering of Text Clusters<\/span>.<\/span> In: Proceedings of FGML Workshop. pp. 37\u201345. Special Interest Group of German Informatics Society (FGML --- Fachgruppe Maschinelles Lernen der GI e.V.) (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"\\url{http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/aho\/pub\/tc_fca_2002_submit.pdf}\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-18fdbebb76d48feccf2dceed23f4cd74\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-18fdbebb76d48feccf2dceed23f4cd74\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/18fdbebb76d48feccf2dceed23f4cd74\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-18fdbebb76d48feccf2dceed23f4cd74\"><p>@inproceedings{hotho_fgml02,<br\/>  author = {Hotho, A. and Stumme, G.},<br\/>  booktitle = {Proceedings of FGML Workshop},<br\/>  keywords = {ontology},<br\/>  pages = {37-45},<br\/>  publisher = {Special Interest Group of German Informatics Society (FGML --- Fachgruppe Maschinelles Lernen der GI e.V.)},<br\/>  title = {Conceptual Clustering of Text Clusters},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-18fdbebb76d48feccf2dceed23f4cd74\"><p>%0 Conference Paper<br\/>%1 hotho_fgml02<br\/>%A Hotho, A.<br\/>%A Stumme, G.<br\/>%B Proceedings of FGML Workshop<br\/>%D 2002<br\/>%I Special Interest Group of German Informatics Society (FGML --- Fachgruppe Maschinelles Lernen der GI e.V.)<br\/>%P 37-45<br\/>%T Conceptual Clustering of Text Clusters<br\/>%U \\url{http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/aho\/pub\/tc_fca_2002_submit.pdf}<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Computing iceberg concept lattices with TITANIC<\/span>.<\/span> Data \\&amp; Knowledge Engineering. 42, 189\u2013222 (2002). https:\/\/doi.org\/10.1016\/S0169-023X(02)00057-5.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/portal.acm.org\/citation.cfm?id=606457\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fc31933f0eec502e305b6aecb9ef6e8a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fc31933f0eec502e305b6aecb9ef6e8a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.1016\/S0169-023X(02)00057-5\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fc31933f0eec502e305b6aecb9ef6e8a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-fc31933f0eec502e305b6aecb9ef6e8a\">We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fc31933f0eec502e305b6aecb9ef6e8a\"><p>@article{stumme2002computing,<br\/>  abstract = {We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.},<br\/>  address = {Amsterdam, The Netherlands, The Netherlands},<br\/>  author = {Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi},<br\/>  journal = {Data \\& Knowledge Engineering},<br\/>  keywords = {icfca},<br\/>  number = 2,<br\/>  pages = {189--222},<br\/>  publisher = {Elsevier Science Publishers B. V.},<br\/>  title = {Computing iceberg concept lattices with TITANIC},<br\/>  volume = 42,<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fc31933f0eec502e305b6aecb9ef6e8a\"><p>%0 Journal Article<br\/>%1 stumme2002computing<br\/>%A Stumme, Gerd<br\/>%A Taouil, Rafik<br\/>%A Bastide, Yves<br\/>%A Pasquier, Nicolas<br\/>%A Lakhal, Lotfi<br\/>%C Amsterdam, The Netherlands, The Netherlands<br\/>%D 2002<br\/>%I Elsevier Science Publishers B. V.<br\/>%J Data \\& Knowledge Engineering<br\/>%N 2<br\/>%P 189--222<br\/>%R 10.1016\/S0169-023X(02)00057-5<br\/>%T Computing iceberg concept lattices with TITANIC<br\/>%U http:\/\/portal.acm.org\/citation.cfm?id=606457<br\/>%V 42<br\/>%X We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Duquenne, V., Ganter, B., Liquiere, M., Nguifo, E.M., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Advances in Formal Concept Analysis for Knowledge Discovery in Databases. Proc. Workshop FCAKDD of the 15th European Conference on Artificial Intelligence (ECAI 2002)<\/span>.<\/span> , Lyon, France (2002).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.lirmm.fr\/~liquiere\/Documents\/FCAKDDProceedings2002.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9fc9512c38ebd6dbd6982fce651da0be\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9fc9512c38ebd6dbd6982fce651da0be\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9fc9512c38ebd6dbd6982fce651da0be\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9fc9512c38ebd6dbd6982fce651da0be\"><p>@proceedings{duquenne02advanced,<br\/>  address = {Lyon, France},<br\/>  editor = {Duquenne, V. and Ganter, B. and Liquiere, M. and Nguifo, E. M. and Stumme, G.},<br\/>  keywords = {analysis},<br\/>  month = {07},<br\/>  title = {Advances in Formal Concept Analysis for Knowledge Discovery in Databases. Proc. Workshop FCAKDD of the 15th European Conference on Artificial Intelligence (ECAI 2002)},<br\/>  year = 2002<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9fc9512c38ebd6dbd6982fce651da0be\"><p>%0 Conference Proceedings<br\/>%1 duquenne02advanced<br\/>%C Lyon, France<br\/>%D 2002<br\/>%E Duquenne, V.<br\/>%E Ganter, B.<br\/>%E Liquiere, M.<br\/>%E Nguifo, E. M.<br\/>%E Stumme, G.<br\/>%T Advances in Formal Concept Analysis for Knowledge Discovery in Databases. Proc. Workshop FCAKDD of the 15th European Conference on Artificial Intelligence (ECAI 2002)<br\/>%U http:\/\/www.lirmm.fr\/~liquiere\/Documents\/FCAKDDProceedings2002.pdf<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2001\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2001<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Maedche, A., Staab, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Text Clustering Based on Good Aggregations<\/span>.<\/span> In: ICDM \u201901: Proceedings of the 2001 IEEE International Conference on Data Mining. pp. 607\u2013608. IEEE Computer Society, Washington, DC, USA (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/portal.acm.org\/citation.cfm?id=658040\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a6803e87c5145d5f55d7bb1bab8dfd67\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a6803e87c5145d5f55d7bb1bab8dfd67\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a6803e87c5145d5f55d7bb1bab8dfd67\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a6803e87c5145d5f55d7bb1bab8dfd67\"><p>@inproceedings{658040,<br\/>  address = {Washington, DC, USA},<br\/>  author = {Hotho, Andreas and Maedche, Alexander and Staab, Steffen},<br\/>  booktitle = {ICDM '01: Proceedings of the 2001 IEEE International Conference on Data Mining},<br\/>  keywords = {ontology},<br\/>  pages = {607--608},<br\/>  publisher = {IEEE Computer Society},<br\/>  title = {Text Clustering Based on Good Aggregations},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a6803e87c5145d5f55d7bb1bab8dfd67\"><p>%0 Conference Paper<br\/>%1 658040<br\/>%A Hotho, Andreas<br\/>%A Maedche, Alexander<br\/>%A Staab, Steffen<br\/>%B ICDM '01: Proceedings of the 2001 IEEE International Conference on Data Mining<br\/>%C Washington, DC, USA<br\/>%D 2001<br\/>%I IEEE Computer Society<br\/>%P 607--608<br\/>%T Text Clustering Based on Good Aggregations<br\/>%U http:\/\/portal.acm.org\/citation.cfm?id=658040<br\/>%@ 0-7695-1119-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis<\/span>.<\/span> In: Baader, F., Brewker, G., and Eiter, T. (eds.) KI 2001: Advances in Artificial Intelligence. KI 2001. pp. 335\u2013350. Springer, Heidelberg (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/KI01.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d93292a7637bd2061b67f4934e7dde46\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d93292a7637bd2061b67f4934e7dde46\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d93292a7637bd2061b67f4934e7dde46\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d93292a7637bd2061b67f4934e7dde46\"><p>@inproceedings{stumme01intelligent,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},<br\/>  booktitle = {KI 2001: Advances in Artificial Intelligence. KI 2001},<br\/>  editor = {Baader, F. and Brewker, G. and Eiter, T.},<br\/>  keywords = {itemsets},<br\/>  pages = {335-350},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis},<br\/>  volume = 2174,<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d93292a7637bd2061b67f4934e7dde46\"><p>%0 Conference Paper<br\/>%1 stumme01intelligent<br\/>%A Stumme, G.<br\/>%A Taouil, R.<br\/>%A Bastide, Y.<br\/>%A Pasquier, N.<br\/>%A Lakhal, L.<br\/>%B KI 2001: Advances in Artificial Intelligence. KI 2001<br\/>%C Heidelberg<br\/>%D 2001<br\/>%E Baader, F.<br\/>%E Brewker, G.<br\/>%E Eiter, T.<br\/>%I Springer<br\/>%P 335-350<br\/>%T Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/KI01.pdf<br\/>%V 2174<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Maedche, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ontology Merging for Federated Ontologies for the Semantic Web<\/span>.<\/span> In: Franconi, E., Barker, K., and Calvanese, D. (eds.) Proc. Intl. Workshop on Foundations of Models for Information Integration (FMII\u201901) (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/FMII01.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d0577ea538ef23bcc9b96d68aa7490bf\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d0577ea538ef23bcc9b96d68aa7490bf\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d0577ea538ef23bcc9b96d68aa7490bf\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d0577ea538ef23bcc9b96d68aa7490bf\"><p>@inproceedings{stumme01ontology,<br\/>  author = {Stumme, G. and Maedche, A.},<br\/>  booktitle = {Proc. Intl. Workshop on Foundations of Models for Information Integration (FMII'01)},<br\/>  editor = {Franconi, E. and Barker, K. and Calvanese, D.},<br\/>  keywords = {myown},<br\/>  note = {{L}ong version of \\cite{stumme01bottom}},<br\/>  title = {Ontology Merging for Federated Ontologies for the Semantic Web},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d0577ea538ef23bcc9b96d68aa7490bf\"><p>%0 Conference Paper<br\/>%1 stumme01ontology<br\/>%A Stumme, G.<br\/>%A Maedche, A.<br\/>%B Proc. Intl. Workshop on Foundations of Models for Information Integration (FMII'01)<br\/>%D 2001<br\/>%E Franconi, E.<br\/>%E Barker, K.<br\/>%E Calvanese, D.<br\/>%T Ontology Merging for Federated Ontologies for the Semantic Web<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/FMII01.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Analyse von {W}ettbewerbsverlusten im {T}elekommunikationsmarkt und m\u00f6gliche {G}egenma\u00dfnahmen<\/span>.<\/span> AIFB (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-641bbe2c42b0841f4c8f58ac3bd48b9a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-641bbe2c42b0841f4c8f58ac3bd48b9a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/641bbe2c42b0841f4c8f58ac3bd48b9a\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-641bbe2c42b0841f4c8f58ac3bd48b9a\"><p>@techreport{hotho_telekom00,<br\/>  author = {Hotho, A.},<br\/>  institution = {AIFB},<br\/>  keywords = 2001,<br\/>  title = {Analyse von {W}ettbewerbsverlusten im {T}elekommunikationsmarkt und m\u00f6gliche {G}egenma\u00dfnahmen},<br\/>  type = {Projektbericht 2000 f\u00fcr die {D}eutsche {T}elekom {AG}},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-641bbe2c42b0841f4c8f58ac3bd48b9a\"><p>%0 Report<br\/>%1 hotho_telekom00<br\/>%A Hotho, A.<br\/>%D 2001<br\/>%T Analyse von {W}ettbewerbsverlusten im {T}elekommunikationsmarkt und m\u00f6gliche {G}egenma\u00dfnahmen<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Maedche, A., Staab, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ontology-based Text Clustering<\/span>.<\/span> In: Proc. of the Workshop ``Text Learning: Beyond Supervision\u2019\u2019 at IJCAI 2001. Seattle, WA, USA, August 6, 2001 (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-15a8cfc9a49b70812a55c76e597db7a5\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-15a8cfc9a49b70812a55c76e597db7a5\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/15a8cfc9a49b70812a55c76e597db7a5\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-15a8cfc9a49b70812a55c76e597db7a5\"><p>@inproceedings{hotho-ijcaiws2001,<br\/>  author = {Hotho, Andreas and Maedche, Alexander and Staab, Steffen},<br\/>  booktitle = {Proc. of the Workshop ``Text Learning: Beyond Supervision'' at IJCAI 2001. Seattle, WA, USA, August 6, 2001},<br\/>  keywords = {ontology},<br\/>  title = {Ontology-based Text Clustering},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-15a8cfc9a49b70812a55c76e597db7a5\"><p>%0 Conference Paper<br\/>%1 hotho-ijcaiws2001<br\/>%A Hotho, Andreas<br\/>%A Maedche, Alexander<br\/>%A Staab, Steffen<br\/>%B Proc. of the Workshop ``Text Learning: Beyond Supervision'' at IJCAI 2001. Seattle, WA, USA, August 6, 2001<br\/>%D 2001<br\/>%T Ontology-based Text Clustering<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hereth, J., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Reverse Pivoting in Conceptual Information Systems.<\/span><\/span> In: Delugach, H. and Stumme, G. (eds.) Conceptual Structures: Broadening the Base. pp. 202\u2013215. Springer, Heidelberg (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/ICCS01.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-86270d99bc6aafb48a23c650c254d23e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-86270d99bc6aafb48a23c650c254d23e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/86270d99bc6aafb48a23c650c254d23e\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-86270d99bc6aafb48a23c650c254d23e\"><p>@inproceedings{hereth01reverse,<br\/>  address = {Heidelberg},<br\/>  author = {Hereth, J. and Stumme, G.},<br\/>  booktitle = {Conceptual Structures: Broadening the Base.},<br\/>  editor = {Delugach, H. and Stumme, G.},<br\/>  keywords = {reverse},<br\/>  pages = {202-215},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Reverse Pivoting in Conceptual Information Systems.},<br\/>  volume = 2120,<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-86270d99bc6aafb48a23c650c254d23e\"><p>%0 Conference Paper<br\/>%1 hereth01reverse<br\/>%A Hereth, J.<br\/>%A Stumme, G.<br\/>%B Conceptual Structures: Broadening the Base.<br\/>%C Heidelberg<br\/>%D 2001<br\/>%E Delugach, H.<br\/>%E Stumme, G.<br\/>%I Springer<br\/>%P 202-215<br\/>%T Reverse Pivoting in Conceptual Information Systems.<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/ICCS01.pdf<br\/>%V 2120<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Maedche, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{FCA}-{M}erge: Bottom-Up Merging of Ontologies.<\/span><\/span> In: Nebel, B. (ed.) Proc. 17th Intl. Conf. on Artificial Intelligence (IJCAI \u201901). pp. 225\u2013230. , Seattle, WA, USA (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/IJCAI01.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cd6d6c64f79d13d7cf394d3a6b3858ba\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cd6d6c64f79d13d7cf394d3a6b3858ba\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cd6d6c64f79d13d7cf394d3a6b3858ba\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cd6d6c64f79d13d7cf394d3a6b3858ba\"><p>@inproceedings{stumme01bottom,<br\/>  address = {Seattle, WA, USA},<br\/>  author = {Stumme, G. and Maedche, A.},<br\/>  booktitle = {Proc. 17th Intl. Conf. on Artificial Intelligence (IJCAI '01)},<br\/>  editor = {Nebel, B.},<br\/>  keywords = {ontologies},<br\/>  pages = {225-230},<br\/>  title = {{FCA}-{M}erge: Bottom-Up Merging of Ontologies.},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cd6d6c64f79d13d7cf394d3a6b3858ba\"><p>%0 Conference Paper<br\/>%1 stumme01bottom<br\/>%A Stumme, G.<br\/>%A Maedche, A.<br\/>%B Proc. 17th Intl. Conf. on Artificial Intelligence (IJCAI '01)<br\/>%C Seattle, WA, USA<br\/>%D 2001<br\/>%E Nebel, B.<br\/>%P 225-230<br\/>%T {FCA}-{M}erge: Bottom-Up Merging of Ontologies.<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/IJCAI01.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Gronau, N., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Methoden und Techniken der Wissensverarbeitung. Workshop der 1. Tagung Professionelles Wissensmanagement -- Erfahrungen und Visionen<\/span>.<\/span> Shaker, Aachen (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/wm2001.aifb.uni-karlsruhe.de\/ws\/ws7.html\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-fd3698c685ae7f07a29e8255199aa542\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-fd3698c685ae7f07a29e8255199aa542\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/fd3698c685ae7f07a29e8255199aa542\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-fd3698c685ae7f07a29e8255199aa542\"><p>@proceedings{gronau01methoden,<br\/>  address = {Aachen},<br\/>  editor = {Gronau, N. and Stumme, G.},<br\/>  keywords = {wissensmanagement},<br\/>  pages = {287-378},<br\/>  publisher = {Shaker},<br\/>  title = {Methoden und Techniken der Wissensverarbeitung. Workshop der 1. Tagung Professionelles Wissensmanagement -- Erfahrungen und Visionen},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-fd3698c685ae7f07a29e8255199aa542\"><p>%0 Conference Proceedings<br\/>%1 gronau01methoden<br\/>%C Aachen<br\/>%D 2001<br\/>%E Gronau, N.<br\/>%E Stumme, G.<br\/>%I Shaker<br\/>%P 287-378<br\/>%T Methoden und Techniken der Wissensverarbeitung. Workshop der 1. Tagung Professionelles Wissensmanagement -- Erfahrungen und Visionen<br\/>%U http:\/\/wm2001.aifb.uni-karlsruhe.de\/ws\/ws7.html<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A., Maedche, A., Staab, S., Studer, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{SEAL-II} --- The Soft Spot between Richly Structured and Unstructured Knowledge<\/span>.<\/span> Journal of Universal Computer Science (J.UCS). 7, 566\u2013590 (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b9a6e840ccef27311575ed33d40bcc53\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b9a6e840ccef27311575ed33d40bcc53\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b9a6e840ccef27311575ed33d40bcc53\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b9a6e840ccef27311575ed33d40bcc53\"><p>@article{hotho_jucs01,<br\/>  author = {Hotho, A. and Maedche, A. and Staab, S. and Studer, R.},<br\/>  journal = {Journal of Universal Computer Science (J.UCS)},<br\/>  keywords = {portal},<br\/>  number = 7,<br\/>  pages = {566-590},<br\/>  title = {{SEAL-II} --- The Soft Spot between Richly Structured and Unstructured Knowledge},<br\/>  volume = 7,<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b9a6e840ccef27311575ed33d40bcc53\"><p>%0 Journal Article<br\/>%1 hotho_jucs01<br\/>%A Hotho, A.<br\/>%A Maedche, A.<br\/>%A Staab, S.<br\/>%A Studer, R.<br\/>%D 2001<br\/>%J Journal of Universal Computer Science (J.UCS)<br\/>%N 7<br\/>%P 566-590<br\/>%T {SEAL-II} --- The Soft Spot between Richly Structured and Unstructured Knowledge<br\/>%V 7<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schnurr, H.P., Staab, S., Studer, R., Stumme, G., Sure, Y. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM \u201901<\/span>.<\/span> Shaker, Aachen (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/wm2001.aifb.uni-karlsruhe.de\/\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-62a33713ffd8549124f1ce62019cd614\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-62a33713ffd8549124f1ce62019cd614\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/62a33713ffd8549124f1ce62019cd614\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-62a33713ffd8549124f1ce62019cd614\"><p>@proceedings{schnurr01professionnelles,<br\/>  address = {Aachen},<br\/>  editor = {Schnurr, H. P. and Staab, S. and Studer, R. and Stumme, G. and Sure, Y.},<br\/>  keywords = {wissensmanagement},<br\/>  publisher = {Shaker},<br\/>  title = {Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM '01},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-62a33713ffd8549124f1ce62019cd614\"><p>%0 Conference Proceedings<br\/>%1 schnurr01professionnelles<br\/>%C Aachen<br\/>%D 2001<br\/>%E Schnurr, H. P.<br\/>%E Staab, S.<br\/>%E Studer, R.<br\/>%E Stumme, G.<br\/>%E Sure, Y.<br\/>%I Shaker<br\/>%T Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM '01<br\/>%U http:\/\/wm2001.aifb.uni-karlsruhe.de\/<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Maedche, A., Staab, S. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Ontologies<\/span>.<\/span> CEUR Proceedings, Aachen (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/ceur-ws.org\/Vol-48\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e18e3ff876c53bcf04fb24227cd4c58d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e18e3ff876c53bcf04fb24227cd4c58d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e18e3ff876c53bcf04fb24227cd4c58d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e18e3ff876c53bcf04fb24227cd4c58d\"><p>@proceedings{stumme01ontologies,<br\/>  address = {Aachen},<br\/>  editor = {Stumme, G. and Maedche, A. and Staab, S.},<br\/>  keywords = {ontologies},<br\/>  publisher = {CEUR Proceedings},<br\/>  series = {CEUR-Proceedings},<br\/>  title = {Ontologies},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e18e3ff876c53bcf04fb24227cd4c58d\"><p>%0 Conference Proceedings<br\/>%1 stumme01ontologies<br\/>%B CEUR-Proceedings<br\/>%C Aachen<br\/>%D 2001<br\/>%E Stumme, G.<br\/>%E Maedche, A.<br\/>%E Staab, S.<br\/>%I CEUR Proceedings<br\/>%T Ontologies<br\/>%U http:\/\/ceur-ws.org\/Vol-48<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Hotho, A., Berendt, B. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Web Mining<\/span>.<\/span> Workshop at 12th Europ. Conf. on Machine Learning (ECML\u201901) \/ 5th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD\u201901), Freiburg (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-604cb78986cc5596b4c336b9c5543add\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-604cb78986cc5596b4c336b9c5543add\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/604cb78986cc5596b4c336b9c5543add\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-604cb78986cc5596b4c336b9c5543add\"><p>@proceedings{stumme_semwebmine_ws01,<br\/>  address = {Freiburg},<br\/>  booktitle = {Proc. of the Semantic Web Mining Workshop},<br\/>  editor = {Stumme, G. and Hotho, A. and Berendt, B.},<br\/>  keywords = 2001,<br\/>  month = {09},<br\/>  publisher = {Workshop at 12th Europ. Conf. on Machine Learning (ECML'01) \/ 5th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'01)},<br\/>  title = {Semantic Web Mining},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-604cb78986cc5596b4c336b9c5543add\"><p>%0 Conference Proceedings<br\/>%1 stumme_semwebmine_ws01<br\/>%B Proc. of the Semantic Web Mining Workshop<br\/>%C Freiburg<br\/>%D 2001<br\/>%E Stumme, G.<br\/>%E Hotho, A.<br\/>%E Berendt, B.<br\/>%I Workshop at 12th Europ. Conf. on Machine Learning (ECML'01) \/ 5th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'01)<br\/>%T Semantic Web Mining<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Hotho, A., Berendt, B. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Web Mining. Workshop Proceedings.<\/span><\/span> , Freiburg (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/semwebmine2001.aifb.uni-karlsruhe.de\/online.html\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ee4f8a6316e6454df268067b4e47f818\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ee4f8a6316e6454df268067b4e47f818\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ee4f8a6316e6454df268067b4e47f818\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ee4f8a6316e6454df268067b4e47f818\"><p>@proceedings{stumme01semantic,<br\/>  address = {Freiburg},<br\/>  editor = {Stumme, G. and Hotho, A. and Berendt, B.},<br\/>  keywords = {pkdd},<br\/>  month = {09},<br\/>  title = {Semantic Web Mining. Workshop Proceedings.},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ee4f8a6316e6454df268067b4e47f818\"><p>%0 Conference Proceedings<br\/>%1 stumme01semantic<br\/>%C Freiburg<br\/>%D 2001<br\/>%E Stumme, G.<br\/>%E Hotho, A.<br\/>%E Berendt, B.<br\/>%T Semantic Web Mining. Workshop Proceedings.<br\/>%U http:\/\/semwebmine2001.aifb.uni-karlsruhe.de\/online.html<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Schmitz, C.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{U}ntersuchung der {G}raphstruktur von {W}eb-{C}ommunities am {B}eispiel der {I}nformatik<\/span><\/span>, http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/da_schmitz.pdf, (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/da_schmitz.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4b947c300dd19a363bf50819ef6b0ed8\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4b947c300dd19a363bf50819ef6b0ed8\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4b947c300dd19a363bf50819ef6b0ed8\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4b947c300dd19a363bf50819ef6b0ed8\"><p>@mastersthesis{schmitz2001untersuchung,<br\/>  author = {Schmitz, Christoph},<br\/>  keywords = {structure},<br\/>  month = 10,<br\/>  school = {Universit\u00e4t Trier},<br\/>  title = {{U}ntersuchung der {G}raphstruktur von {W}eb-{C}ommunities am {B}eispiel der {I}nformatik},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4b947c300dd19a363bf50819ef6b0ed8\"><p>%0 Thesis<br\/>%1 schmitz2001untersuchung<br\/>%A Schmitz, Christoph<br\/>%D 2001<br\/>%T {U}ntersuchung der {G}raphstruktur von {W}eb-{C}ommunities am {B}eispiel der {I}nformatik<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/schmitz\/publ\/da_schmitz.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Taouil, R., Bastide, Y., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Clustering with Iceberg Concept Lattices<\/span>.<\/span> In: Klinkenberg, R., R\u00fcping, S., Fick, A., Henze, N., Herzog, C., Molitor, R., and Schr\u00f6der, O. (eds.) Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML\u201901). , Universit\u00e4t Dortmund 763 (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/FGML01.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-f4ec21d5f63dbc213a3a6eae076c4b62\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-f4ec21d5f63dbc213a3a6eae076c4b62\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/f4ec21d5f63dbc213a3a6eae076c4b62\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-f4ec21d5f63dbc213a3a6eae076c4b62\"><p>@inproceedings{stumme01conceptualclustering,<br\/>  address = {Universit\u00e4t Dortmund 763},<br\/>  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.},<br\/>  booktitle = {Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)},<br\/>  editor = {Klinkenberg, R. and R\u00fcping, S. and Fick, A. and Henze, N. and Herzog, C. and Molitor, R. and Schr\u00f6der, O.},<br\/>  keywords = {itemsets},<br\/>  month = 10,<br\/>  title = {Conceptual Clustering with Iceberg Concept Lattices},<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-f4ec21d5f63dbc213a3a6eae076c4b62\"><p>%0 Conference Paper<br\/>%1 stumme01conceptualclustering<br\/>%A Stumme, G.<br\/>%A Taouil, R.<br\/>%A Bastide, Y.<br\/>%A Lakhal, L.<br\/>%B Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)<br\/>%C Universit\u00e4t Dortmund 763<br\/>%D 2001<br\/>%E Klinkenberg, R.<br\/>%E R\u00fcping, S.<br\/>%E Fick, A.<br\/>%E Henze, N.<br\/>%E Herzog, C.<br\/>%E Molitor, R.<br\/>%E Schr\u00f6der, O.<br\/>%T Conceptual Clustering with Iceberg Concept Lattices<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2001\/FGML01.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Delugach, H., Stumme, G. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Structures -- Broadening the Base. Proc. 9th International Conference on Conceptual Structures<\/span>.<\/span> Springer, Heidelberg (2001).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-45c60d52ca51dfb995a284f3a9dd14a0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-45c60d52ca51dfb995a284f3a9dd14a0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/45c60d52ca51dfb995a284f3a9dd14a0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-45c60d52ca51dfb995a284f3a9dd14a0\"><p>@proceedings{delugach01conceptual,<br\/>  address = {Heidelberg},<br\/>  editor = {Delugach, H. and Stumme, G.},<br\/>  keywords = {cgs},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Conceptual Structures -- Broadening the Base. Proc. 9th International Conference on Conceptual Structures},<br\/>  volume = 2120,<br\/>  year = 2001<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-45c60d52ca51dfb995a284f3a9dd14a0\"><p>%0 Conference Proceedings<br\/>%1 delugach01conceptual<br\/>%B LNAI<br\/>%C Heidelberg<br\/>%D 2001<br\/>%E Delugach, H.<br\/>%E Stumme, G.<br\/>%I Springer<br\/>%T Conceptual Structures -- Broadening the Base. Proc. 9th International Conference on Conceptual Structures<br\/>%V 2120<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_2000\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">2000<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Begriffliche Wissensverarbeitung -- Methoden und Anwendungen<\/span>.<\/span> Springer, Heidelberg (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-aa16abb7f91c21ae9d27638a2e8804d6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-aa16abb7f91c21ae9d27638a2e8804d6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/aa16abb7f91c21ae9d27638a2e8804d6\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-aa16abb7f91c21ae9d27638a2e8804d6\"><p>@book{Stumme00begriffliche,<br\/>  author = {Stumme, G.},<br\/>  editor = {Stumme, G. and Wille, R.},<br\/>  keywords = 2000,<br\/>  publisher = {Springer, Heidelberg},<br\/>  title = {Begriffliche Wissensverarbeitung -- Methoden und Anwendungen},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-aa16abb7f91c21ae9d27638a2e8804d6\"><p>%0 Book<br\/>%1 Stumme00begriffliche<br\/>%A Stumme, G.<br\/>%D 2000<br\/>%E Stumme, G.<br\/>%E Wille, R.<br\/>%I Springer, Heidelberg<br\/>%T Begriffliche Wissensverarbeitung -- Methoden und Anwendungen<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hotho, A.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Analyse von {W}ettbewerbsverlusten im {T}elekommunikationsmarkt und m\u00f6gliche {G}egenma\u00dfnahmen<\/span>.<\/span> AIFB (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-cdd760f5f1348cb608fcde9ad46d8a62\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-cdd760f5f1348cb608fcde9ad46d8a62\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/cdd760f5f1348cb608fcde9ad46d8a62\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-cdd760f5f1348cb608fcde9ad46d8a62\"><p>@techreport{hotho_telekom99,<br\/>  author = {Hotho, A.},<br\/>  institution = {AIFB},<br\/>  keywords = 2000,<br\/>  title = {Analyse von {W}ettbewerbsverlusten im {T}elekommunikationsmarkt und m\u00f6gliche {G}egenma\u00dfnahmen},<br\/>  type = {Projektbericht 1999 f\u00fcr die {D}eutsche {T}elekom {AG}},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-cdd760f5f1348cb608fcde9ad46d8a62\"><p>%0 Report<br\/>%1 hotho_telekom99<br\/>%A Hotho, A.<br\/>%D 2000<br\/>%T Analyse von {W}ettbewerbsverlusten im {T}elekommunikationsmarkt und m\u00f6gliche {G}egenma\u00dfnahmen<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Levelwise Search of Frequent Patterns<\/span>.<\/span> In: Actes des 16i\u00e8mes Journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es. pp. 307\u2013322. Blois, France (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/BDA00.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a11de6a74851c7076452159d1b12489b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a11de6a74851c7076452159d1b12489b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a11de6a74851c7076452159d1b12489b\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a11de6a74851c7076452159d1b12489b\"><p>@inproceedings{bastide00levelwise,<br\/>  address = {France},<br\/>  author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},<br\/>  booktitle = {Actes des 16i\u00e8mes Journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es},<br\/>  keywords = {algorithm},<br\/>  month = 10,<br\/>  pages = {307-322},<br\/>  publisher = {Blois},<br\/>  title = {Levelwise Search of Frequent Patterns},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a11de6a74851c7076452159d1b12489b\"><p>%0 Conference Paper<br\/>%1 bastide00levelwise<br\/>%A Bastide, Y.<br\/>%A Taouil, R.<br\/>%A Pasquier, N.<br\/>%A Stumme, G.<br\/>%A Lakhal, L.<br\/>%B Actes des 16i\u00e8mes Journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es<br\/>%C France<br\/>%D 2000<br\/>%I Blois<br\/>%P 307-322<br\/>%T Levelwise Search of Frequent Patterns<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/BDA00.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Adamczak, W., Begemann, H., Stefani, S.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Research Report Online as Portal to a Wider CRIS<\/span><\/span>, http:\/\/www.svenstefani.de\/publ\/cris2000\/adamczak_fulltext.pdf, (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.svenstefani.de\/publ\/cris2000\/adamczak_fulltext.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-615e77eaf880422be5bd476b90b1b54c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-615e77eaf880422be5bd476b90b1b54c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/615e77eaf880422be5bd476b90b1b54c\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-615e77eaf880422be5bd476b90b1b54c\"><p>@misc{cris2000ss,<br\/>  address = {CRIS 2000, Helsinki, Finnland},<br\/>  author = {Adamczak, Wolfgang and Begemann, Heinz and Stefani, Sven},<br\/>  howpublished = {Presentation at CRIS 2000},<br\/>  keywords = {research},<br\/>  note = {CRIS 2000 - Current Research Information Systems for Europe Conference, Helsinki, Finnland, 2000},<br\/>  title = {Research Report Online as Portal to a Wider CRIS},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-615e77eaf880422be5bd476b90b1b54c\"><p>%0 Generic<br\/>%1 cris2000ss<br\/>%A Adamczak, Wolfgang<br\/>%A Begemann, Heinz<br\/>%A Stefani, Sven<br\/>%C CRIS 2000, Helsinki, Finnland<br\/>%D 2000<br\/>%T Research Report Online as Portal to a Wider CRIS<br\/>%U http:\/\/www.svenstefani.de\/publ\/cris2000\/adamczak_fulltext.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Maedche, A., Hotho, A., Wiese, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Enhancing Preprocessing in Data-Intensive Domains using Online-Analytical Processing<\/span>.<\/span> In: Data Warehousing and Knowledge Discovery, Second International Conference, DaWaK 2000, London, UK. pp. 258\u2013264. Springer (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-0e45a2cba1a2901dbcfe09069cb2695d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-0e45a2cba1a2901dbcfe09069cb2695d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/0e45a2cba1a2901dbcfe09069cb2695d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-0e45a2cba1a2901dbcfe09069cb2695d\"><p>@inproceedings{maedche_dawak00,<br\/>  author = {Maedche, Alexander and Hotho, Andreas and Wiese, Markus},<br\/>  booktitle = {Data Warehousing and Knowledge Discovery, Second International Conference, DaWaK 2000, London, UK},<br\/>  keywords = {intensive},<br\/>  pages = {258-264},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {Enhancing Preprocessing in Data-Intensive Domains using Online-Analytical Processing},<br\/>  volume = 1874,<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-0e45a2cba1a2901dbcfe09069cb2695d\"><p>%0 Conference Paper<br\/>%1 maedche_dawak00<br\/>%A Maedche, Alexander<br\/>%A Hotho, Andreas<br\/>%A Wiese, Markus<br\/>%B Data Warehousing and Knowledge Discovery, Second International Conference, DaWaK 2000, London, UK<br\/>%D 2000<br\/>%I Springer<br\/>%P 258-264<br\/>%T Enhancing Preprocessing in Data-Intensive Domains using Online-Analytical Processing<br\/>%V 1874<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Studer, R., Sure, Y.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Towards an Order-Theoretical Foundation for Maintaining and Merging Ontologies<\/span>.<\/span> In: Bodendorf, F. and Grauer, M. (eds.) Verbundtagung Wirtschaftsinformatik 2000. pp. 136\u2013149. Shaker, Aachen (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/REFMOD00.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-83cc12ae3979a3e4108e5442b7da0b4f\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-83cc12ae3979a3e4108e5442b7da0b4f\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/83cc12ae3979a3e4108e5442b7da0b4f\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-83cc12ae3979a3e4108e5442b7da0b4f\"><p>@inproceedings{stumme00towardsanorder,<br\/>  address = {Aachen},<br\/>  author = {Stumme, G. and Studer, R. and Sure, Y.},<br\/>  booktitle = {Verbundtagung Wirtschaftsinformatik 2000},<br\/>  editor = {Bodendorf, F. and Grauer, M.},<br\/>  keywords = {ontologies},<br\/>  pages = {136-149},<br\/>  publisher = {Shaker},<br\/>  title = {Towards an Order-Theoretical Foundation for Maintaining and Merging Ontologies},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-83cc12ae3979a3e4108e5442b7da0b4f\"><p>%0 Conference Paper<br\/>%1 stumme00towardsanorder<br\/>%A Stumme, G.<br\/>%A Studer, R.<br\/>%A Sure, Y.<br\/>%B Verbundtagung Wirtschaftsinformatik 2000<br\/>%C Aachen<br\/>%D 2000<br\/>%E Bodendorf, F.<br\/>%E Grauer, M.<br\/>%I Shaker<br\/>%P 136-149<br\/>%T Towards an Order-Theoretical Foundation for Maintaining and Merging Ontologies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/REFMOD00.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mining Frequent Patterns with Counting Inference.<\/span><\/span> SIGKDD Explorations, Special Issue on Scalable Algorithms. 2, 71\u201380 (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1e79f8ba76044d2c78cea441eeba84aa\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1e79f8ba76044d2c78cea441eeba84aa\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1e79f8ba76044d2c78cea441eeba84aa\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1e79f8ba76044d2c78cea441eeba84aa\"><p>@article{bastide00miningfrequent,<br\/>  author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},<br\/>  journal = {SIGKDD Explorations, Special Issue on Scalable Algorithms},<br\/>  keywords = {itemsets},<br\/>  number = 2,<br\/>  pages = {71-80},<br\/>  title = {Mining Frequent Patterns with Counting Inference.},<br\/>  volume = 2,<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1e79f8ba76044d2c78cea441eeba84aa\"><p>%0 Journal Article<br\/>%1 bastide00miningfrequent<br\/>%A Bastide, Y.<br\/>%A Taouil, R.<br\/>%A Pasquier, N.<br\/>%A Stumme, G.<br\/>%A Lakhal, L.<br\/>%D 2000<br\/>%J SIGKDD Explorations, Special Issue on Scalable Algorithms<br\/>%N 2<br\/>%P 71-80<br\/>%T Mining Frequent Patterns with Counting Inference.<br\/>%V 2<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cole, R., Eklund, P., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{CEM} -- A Program for Visualization and Discovery in Email<\/span>.<\/span> In: Zighed, D., Komorowski, J., and Zytkow, J. (eds.) Principles of Data Mining and Knowledge Discovery. Proc. PKDD 2000. pp. 367\u2013374. Springer, Heidelberg-Berlin (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/PKDD00.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6cc2aea3462fc632d8677fc4d57051b0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6cc2aea3462fc632d8677fc4d57051b0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6cc2aea3462fc632d8677fc4d57051b0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6cc2aea3462fc632d8677fc4d57051b0\"><p>@inproceedings{cole00program,<br\/>  address = {Heidelberg-Berlin},<br\/>  author = {Cole, R. and Eklund, P. and Stumme, G.},<br\/>  booktitle = {Principles of Data Mining and Knowledge Discovery. Proc. PKDD 2000},<br\/>  editor = {Zighed, D.A. and Komorowski, J. and Zytkow, J.},<br\/>  keywords = {analysis},<br\/>  pages = {367-374},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {{CEM} -- A Program for Visualization and Discovery in Email},<br\/>  volume = 1910,<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6cc2aea3462fc632d8677fc4d57051b0\"><p>%0 Conference Paper<br\/>%1 cole00program<br\/>%A Cole, R.<br\/>%A Eklund, P.<br\/>%A Stumme, G.<br\/>%B Principles of Data Mining and Knowledge Discovery. Proc. PKDD 2000<br\/>%C Heidelberg-Berlin<br\/>%D 2000<br\/>%E Zighed, D.A.<br\/>%E Komorowski, J.<br\/>%E Zytkow, J.<br\/>%I Springer<br\/>%P 367-374<br\/>%T {CEM} -- A Program for Visualization and Discovery in Email<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/PKDD00.pdf<br\/>%V 1910<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Hereth, J., Stumme, G., Wille, R., Wille, U.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Knowledge Discovery and Data Analysis<\/span>.<\/span> In: Ganter, B. and Mineau, G.W. (eds.) Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS \u201900. pp. 421\u2013437. Springer, Heidelberg (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/P2092_ICCS00_kdd.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-577e0f2074bbece17498848014d14705\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-577e0f2074bbece17498848014d14705\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/577e0f2074bbece17498848014d14705\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-577e0f2074bbece17498848014d14705\"><p>@inproceedings{hereth2000conceptual,<br\/>  address = {Heidelberg},<br\/>  author = {Hereth, J. and Stumme, G. and Wille, R. and Wille, U.},<br\/>  booktitle = {Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS '00},<br\/>  editor = {Ganter, B. and Mineau, G. W.},<br\/>  keywords = {knowledge},<br\/>  pages = {421-437},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Conceptual Knowledge Discovery and Data Analysis},<br\/>  volume = 1867,<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-577e0f2074bbece17498848014d14705\"><p>%0 Conference Paper<br\/>%1 hereth2000conceptual<br\/>%A Hereth, J.<br\/>%A Stumme, G.<br\/>%A Wille, R.<br\/>%A Wille, U.<br\/>%B Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS '00<br\/>%C Heidelberg<br\/>%D 2000<br\/>%E Ganter, B.<br\/>%E Mineau, G. W.<br\/>%I Springer<br\/>%P 421-437<br\/>%T Conceptual Knowledge Discovery and Data Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/P2092_ICCS00_kdd.pdf<br\/>%V 1867<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets<\/span>.<\/span> In: Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Laus, K.-K., Palamidessi, C., Pereira, L., Sagiv, Y., and Stuckey, P. (eds.) Computational Logic --- CL 2000 Proc. CL\u201900. Springer, Heidelberg (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/DOOD00.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-25fa3431e7bdd7057f9b80a7385cd718\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-25fa3431e7bdd7057f9b80a7385cd718\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/25fa3431e7bdd7057f9b80a7385cd718\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-25fa3431e7bdd7057f9b80a7385cd718\"><p>@inproceedings{bastide00miningminimal,<br\/>  address = {Heidelberg},<br\/>  author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.},<br\/>  booktitle = {Computational Logic --- CL 2000 Proc. CL'00},<br\/>  editor = {Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.},<br\/>  keywords = {itemsets},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},<br\/>  volume = 1861,<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-25fa3431e7bdd7057f9b80a7385cd718\"><p>%0 Conference Paper<br\/>%1 bastide00miningminimal<br\/>%A Bastide, Y.<br\/>%A Pasquier, N.<br\/>%A Taouil, R.<br\/>%A Stumme, G.<br\/>%A Lakhal, L.<br\/>%B Computational Logic --- CL 2000 Proc. CL'00<br\/>%C Heidelberg<br\/>%D 2000<br\/>%E Lloyd, J.<br\/>%E Dahl, V.<br\/>%E Furbach, U.<br\/>%E Kerber, M.<br\/>%E Laus, K.-K.<br\/>%E Palamidessi, C.<br\/>%E Pereira, L.M.<br\/>%E Sagiv, Y.<br\/>%E Stuckey, P.J.<br\/>%I Springer<br\/>%T Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/DOOD00.pdf<br\/>%V 1861<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Staab, S., Angele, J., Decker, S., Erdmann, M., Hotho, A., Maedche, A., Schnurr, H.-P., Studer, R., Sure, Y.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Semantic Community Web Portals<\/span>.<\/span> In: WWW9 --- Proceedings of the 9th International World Wide Web Conference, Amsterdam, The Netherlands. pp. 473\u2013491. Elsevier (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1b5d0eeeebd6bee17a7fb07d89ce476d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1b5d0eeeebd6bee17a7fb07d89ce476d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1b5d0eeeebd6bee17a7fb07d89ce476d\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1b5d0eeeebd6bee17a7fb07d89ce476d\"><p>@inproceedings{staab.www9,<br\/>  author = {Staab, S. and Angele, J. and Decker, S. and Erdmann, M. and Hotho, A. and Maedche, A. and Schnurr, H.-P. and Studer, R. and Sure, Y.},<br\/>  booktitle = {WWW9 --- Proceedings of the 9th International World Wide Web Conference, Amsterdam, The Netherlands},<br\/>  keywords = {community},<br\/>  pages = {473-491},<br\/>  publisher = {Elsevier},<br\/>  title = {Semantic Community Web Portals},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1b5d0eeeebd6bee17a7fb07d89ce476d\"><p>%0 Conference Paper<br\/>%1 staab.www9<br\/>%A Staab, S.<br\/>%A Angele, J.<br\/>%A Decker, S.<br\/>%A Erdmann, M.<br\/>%A Hotho, A.<br\/>%A Maedche, A.<br\/>%A Schnurr, H.-P.<br\/>%A Studer, R.<br\/>%A Sure, Y.<br\/>%B WWW9 --- Proceedings of the 9th International World Wide Web Conference, Amsterdam, The Netherlands<br\/>%D 2000<br\/>%I Elsevier<br\/>%P 473-491<br\/>%T Semantic Community Web Portals<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Becker, K., Stumme, G., Wille, R., Wille, U., Zickwolff, M.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Information Systems Discussed Through an {IT}-Security Tool<\/span>.<\/span> In: Dieng, R. and Corby, O. (eds.) Knowledge Engineering and Knowledge Management. Methods, Models, and Tools. pp. 352\u2013365. Springer, Heidelberg (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/EKAW00.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8533101d55261b955b9ca6bca2cb73fc\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8533101d55261b955b9ca6bca2cb73fc\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8533101d55261b955b9ca6bca2cb73fc\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8533101d55261b955b9ca6bca2cb73fc\"><p>@inproceedings{becker00conceptual,<br\/>  address = {Heidelberg},<br\/>  author = {Becker, K. and Stumme, G. and Wille, R. and Wille, U. and Zickwolff, M.},<br\/>  booktitle = {Knowledge Engineering and Knowledge Management. Methods, Models, and Tools.},<br\/>  editor = {Dieng, R. and Corby, O.},<br\/>  keywords = {lattices},<br\/>  pages = {352-365},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Conceptual Information Systems Discussed Through an {IT}-Security Tool},<br\/>  volume = 1937,<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8533101d55261b955b9ca6bca2cb73fc\"><p>%0 Conference Paper<br\/>%1 becker00conceptual<br\/>%A Becker, K.<br\/>%A Stumme, G.<br\/>%A Wille, R.<br\/>%A Wille, U.<br\/>%A Zickwolff, M.<br\/>%B Knowledge Engineering and Knowledge Management. Methods, Models, and Tools.<br\/>%C Heidelberg<br\/>%D 2000<br\/>%E Dieng, R.<br\/>%E Corby, O.<br\/>%I Springer<br\/>%P 352-365<br\/>%T Conceptual Information Systems Discussed Through an {IT}-Security Tool<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/EKAW00.pdf<br\/>%V 1937<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual {O}n-{L}ine {A}nalytical {P}rocessing<\/span>.<\/span> In: Tanaka, K., Ghandeharizadeh, S., and Kambayashi, Y. (eds.) Information Organization and Databases. pp. 191\u2013203. Kluwer, Boston-Dordrecht-London (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/Kluwer00.ps\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d83a44b00abdeb6699f25c2652b51b84\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d83a44b00abdeb6699f25c2652b51b84\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d83a44b00abdeb6699f25c2652b51b84\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d83a44b00abdeb6699f25c2652b51b84\"><p>@incollection{stumme00conceptual,<br\/>  address = {Boston-Dordrecht-London},<br\/>  author = {Stumme, G.},<br\/>  booktitle = {Information Organization and Databases},<br\/>  chapter = 14,<br\/>  editor = {Tanaka, K. and Ghandeharizadeh, S. and Kambayashi, Y.},<br\/>  keywords = {olap},<br\/>  pages = {191-203},<br\/>  publisher = {Kluwer},<br\/>  title = {Conceptual {O}n-{L}ine {A}nalytical {P}rocessing},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d83a44b00abdeb6699f25c2652b51b84\"><p>%0 Book Section<br\/>%1 stumme00conceptual<br\/>%A Stumme, G.<br\/>%B Information Organization and Databases<br\/>%C Boston-Dordrecht-London<br\/>%D 2000<br\/>%E Tanaka, K.<br\/>%E Ghandeharizadeh, S.<br\/>%E Kambayashi, Y.<br\/>%I Kluwer<br\/>%P 191-203<br\/>%T Conceptual {O}n-{L}ine {A}nalytical {P}rocessing<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/Kluwer00.ps<br\/>%& 14<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Wille, R. eds.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Begriffliche Wissensverarbeitung -- Methoden und Anwendungen<\/span>.<\/span> Springer, Heidelberg (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.springer.com\/dal\/home\/generic\/search\/results?SGWID=1-40109-22-2058937-0\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-da312496324083ee022682d70fdb22a1\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-da312496324083ee022682d70fdb22a1\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/da312496324083ee022682d70fdb22a1\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-da312496324083ee022682d70fdb22a1\"><p>@proceedings{stumme00begriffliche,<br\/>  address = {Heidelberg},<br\/>  editor = {Stumme, Gerd and Wille, Rudolf},<br\/>  keywords = {knowledge},<br\/>  publisher = {Springer},<br\/>  title = {Begriffliche Wissensverarbeitung -- Methoden und Anwendungen},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-da312496324083ee022682d70fdb22a1\"><p>%0 Conference Proceedings<br\/>%1 stumme00begriffliche<br\/>%C Heidelberg<br\/>%D 2000<br\/>%E Stumme, Gerd<br\/>%E Wille, Rudolf<br\/>%I Springer<br\/>%T Begriffliche Wissensverarbeitung -- Methoden und Anwendungen<br\/>%U http:\/\/www.springer.com\/dal\/home\/generic\/search\/results?SGWID=1-40109-22-2058937-0<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G. ed.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Working with Conceptual Structures -- Contributions to ICCS 2000. Suppl. Proc. 8th International Conference on Conceptual Structures (ICCS 2000)<\/span>.<\/span> Shaker, Aachen (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ade62f61239d92022347243cc1962cc0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ade62f61239d92022347243cc1962cc0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ade62f61239d92022347243cc1962cc0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ade62f61239d92022347243cc1962cc0\"><p>@proceedings{stumme00working,<br\/>  address = {Aachen},<br\/>  editor = {Stumme, G.},<br\/>  keywords = {proceedings},<br\/>  publisher = {Shaker},<br\/>  title = {Working with Conceptual Structures -- Contributions to ICCS 2000. Suppl. Proc. 8th International Conference on Conceptual Structures (ICCS 2000)},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ade62f61239d92022347243cc1962cc0\"><p>%0 Conference Proceedings<br\/>%1 stumme00working<br\/>%C Aachen<br\/>%D 2000<br\/>%E Stumme, G.<br\/>%I Shaker<br\/>%T Working with Conceptual Structures -- Contributions to ICCS 2000. Suppl. Proc. 8th International Conference on Conceptual Structures (ICCS 2000)<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">G\u00f6bel, S., Heidemann, M., Jasnoch, U., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Einsatz von {GIS} und {F}ormaler {B}egriffsanalyse in {A}ltlasten-{I}nformationssystemen<\/span>.<\/span> In: Tochtermann, K. and Riekert, W.-F. (eds.) Hypermedia im Umweltschutz. 3. Workshop in Ulm 2000. pp. 169\u2013179. , Marburg (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/AKHU00.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a133bacbdeef0124a35088b9e66c6de0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a133bacbdeef0124a35088b9e66c6de0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a133bacbdeef0124a35088b9e66c6de0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a133bacbdeef0124a35088b9e66c6de0\"><p>@inproceedings{goebel00einsatz,<br\/>  address = {Marburg},<br\/>  author = {G\u00f6bel, S. and Heidemann, M. and Jasnoch, U. and Stumme, G.},<br\/>  booktitle = {Hypermedia im Umweltschutz. 3. Workshop in Ulm 2000},<br\/>  editor = {Tochtermann, K. and Riekert, W.-F.},<br\/>  keywords = {altlasten},<br\/>  pages = {169-179},<br\/>  title = {Einsatz von {GIS} und {F}ormaler {B}egriffsanalyse in {A}ltlasten-{I}nformationssystemen},<br\/>  volume = {Umwelt-Informatik aktuell, Bd. 24},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a133bacbdeef0124a35088b9e66c6de0\"><p>%0 Conference Paper<br\/>%1 goebel00einsatz<br\/>%A G\u00f6bel, S.<br\/>%A Heidemann, M.<br\/>%A Jasnoch, U.<br\/>%A Stumme, G.<br\/>%B Hypermedia im Umweltschutz. 3. Workshop in Ulm 2000<br\/>%C Marburg<br\/>%D 2000<br\/>%E Tochtermann, K.<br\/>%E Riekert, W.-F.<br\/>%P 169-179<br\/>%T Einsatz von {GIS} und {F}ormaler {B}egriffsanalyse in {A}ltlasten-{I}nformationssystemen<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/AKHU00.pdf<br\/>%V Umwelt-Informatik aktuell, Bd. 24<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">8th {I}nternational {C}onference on {C}onceptual {S}tructures. {C}onference {R}eport<\/span>.<\/span> Knowledge Organization. 27, 162 (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/ConferenceReportICCS00.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-05cb8e9ff42c2d21a876b5af5df46e1b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-05cb8e9ff42c2d21a876b5af5df46e1b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/05cb8e9ff42c2d21a876b5af5df46e1b\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-05cb8e9ff42c2d21a876b5af5df46e1b\"><p>@article{stumme008thinternational,<br\/>  author = {Stumme, G.},<br\/>  journal = {Knowledge Organization},<br\/>  keywords = {report},<br\/>  number = 3,<br\/>  pages = 162,<br\/>  title = {8th {I}nternational {C}onference on {C}onceptual {S}tructures. {C}onference {R}eport},<br\/>  volume = 27,<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-05cb8e9ff42c2d21a876b5af5df46e1b\"><p>%0 Journal Article<br\/>%1 stumme008thinternational<br\/>%A Stumme, G.<br\/>%D 2000<br\/>%J Knowledge Organization<br\/>%N 3<br\/>%P 162<br\/>%T 8th {I}nternational {C}onference on {C}onceptual {S}tructures. {C}onference {R}eport<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/ConferenceReportICCS00.pdf<br\/>%V 27<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Staab, S., Angele, J., Decker, S., Hotho, A., Maedche, A., Schnurr, H.-P., Studer, R., Sure, Y.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">AI for the Web - Ontology-based Community Web Portals<\/span>.<\/span> In: AAAI 2000\/IAAI 2000 - Proceedings of the 17th National Conference on Artificial Intelligence and 12th Innovative Applications of Artificial Intelligence Conference, Austin\/TX, USA, July 30-August 3, 2000. AAAI Press\/MIT Press (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/Publ\/2000\/iaai_sstetal_2000.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-eff8f1e4eaf585eebd37304a592ad65e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-eff8f1e4eaf585eebd37304a592ad65e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/eff8f1e4eaf585eebd37304a592ad65e\/kde-alumni\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-eff8f1e4eaf585eebd37304a592ad65e\"><p>@inproceedings{Staab00AI,<br\/>  author = {Staab, Steffen and Angele, J{\u00fc}rgen and Decker, Stefan and Hotho, Andreas and Maedche, Alexander and Schnurr, Hans-Peter and Studer, Rudi and Sure, York},<br\/>  booktitle = {AAAI 2000\/IAAI 2000 - Proceedings of the 17th National Conference on Artificial Intelligence and 12th Innovative Applications of Artificial Intelligence Conference, Austin\/TX, USA, July 30-August 3, 2000},<br\/>  keywords = {ontology},<br\/>  publisher = {AAAI Press\/MIT Press},<br\/>  title = {AI for the Web - Ontology-based Community Web Portals},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-eff8f1e4eaf585eebd37304a592ad65e\"><p>%0 Conference Paper<br\/>%1 Staab00AI<br\/>%A Staab, Steffen<br\/>%A Angele, J{\u00fc}rgen<br\/>%A Decker, Stefan<br\/>%A Hotho, Andreas<br\/>%A Maedche, Alexander<br\/>%A Schnurr, Hans-Peter<br\/>%A Studer, Rudi<br\/>%A Sure, York<br\/>%B AAAI 2000\/IAAI 2000 - Proceedings of the 17th National Conference on Artificial Intelligence and 12th Innovative Applications of Artificial Intelligence Conference, Austin\/TX, USA, July 30-August 3, 2000<br\/>%D 2000<br\/>%I AAAI Press\/MIT Press<br\/>%T AI for the Web - Ontology-based Community Web Portals<br\/>%U http:\/\/www.aifb.uni-karlsruhe.de\/WBS\/Publ\/2000\/iaai_sstetal_2000.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Cole, R., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">{CEM} - A Conceptual Email Manager<\/span>.<\/span> In: Ganter, B. and Mineau, G.W. (eds.) Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS \u201900. pp. 438\u2013452. Springer, Heidelberg (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/P2088_ICCS00_emails.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-820e9bf0723974b095e425553caf6e54\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-820e9bf0723974b095e425553caf6e54\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/820e9bf0723974b095e425553caf6e54\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-820e9bf0723974b095e425553caf6e54\"><p>@inproceedings{cole2000conceptual,<br\/>  address = {Heidelberg},<br\/>  author = {Cole, R. and Stumme, G.},<br\/>  booktitle = {Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS '00},<br\/>  editor = {Ganter, B. and Mineau, G. W.},<br\/>  keywords = {analysis},<br\/>  note = {{P}art of \\cite{cole03document}},<br\/>  pages = {438-452},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {{CEM} - A Conceptual Email Manager},<br\/>  volume = 1867,<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-820e9bf0723974b095e425553caf6e54\"><p>%0 Conference Paper<br\/>%1 cole2000conceptual<br\/>%A Cole, R.<br\/>%A Stumme, G.<br\/>%B Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS '00<br\/>%C Heidelberg<br\/>%D 2000<br\/>%E Ganter, B.<br\/>%E Mineau, G. W.<br\/>%I Springer<br\/>%P 438-452<br\/>%T {CEM} - A Conceptual Email Manager<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/P2088_ICCS00_emails.pdf<br\/>%V 1867<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Eklund, P., Groh, B., Stumme, G., Wille, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Contextual-Logic Extension of TOSCANA.<\/span><\/span> In: Ganter, B. and Mineau, G.W. (eds.) Conceptual Structures: Logical, Linguistic, and Computational. pp. 453\u2013467. Springer, Heidelberg (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/ICCS_toscanaextension.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-eb6e678cba7f48ae8604d59542cd79c6\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-eb6e678cba7f48ae8604d59542cd79c6\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/eb6e678cba7f48ae8604d59542cd79c6\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-eb6e678cba7f48ae8604d59542cd79c6\"><p>@inproceedings{eklund00contextual,<br\/>  address = {Heidelberg},<br\/>  author = {Eklund, P. and Groh, B. and Stumme, G. and Wille, R.},<br\/>  booktitle = {Conceptual Structures: Logical, Linguistic, and Computational},<br\/>  editor = {Ganter, B. and Mineau, G. W.},<br\/>  keywords = {iccs},<br\/>  pages = {453-467},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Contextual-Logic Extension of TOSCANA.},<br\/>  volume = 1867,<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-eb6e678cba7f48ae8604d59542cd79c6\"><p>%0 Conference Paper<br\/>%1 eklund00contextual<br\/>%A Eklund, P.<br\/>%A Groh, B.<br\/>%A Stumme, G.<br\/>%A Wille, R.<br\/>%B Conceptual Structures: Logical, Linguistic, and Computational<br\/>%C Heidelberg<br\/>%D 2000<br\/>%E Ganter, B.<br\/>%E Mineau, G. W.<br\/>%I Springer<br\/>%P 453-467<br\/>%T Contextual-Logic Extension of TOSCANA.<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/ICCS_toscanaextension.pdf<br\/>%V 1867<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Fast computation of concept lattices using data mining techniques.<\/span><\/span> In: Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases. CEUR-Workshop Proceeding., Berlin (2000).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-a17891b3a55b119d0b8ca5d398a9fe1b\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-a17891b3a55b119d0b8ca5d398a9fe1b\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/a17891b3a55b119d0b8ca5d398a9fe1b\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-a17891b3a55b119d0b8ca5d398a9fe1b\"><p>@inproceedings{Stum00fast,<br\/>  address = {Berlin},<br\/>  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},<br\/>  booktitle = {Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases},<br\/>  keywords = 2000,<br\/>  month = {21--22.August},<br\/>  note = {{http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/}},<br\/>  publisher = {CEUR-Workshop Proceeding.},<br\/>  title = {Fast computation of concept lattices using data mining techniques.},<br\/>  year = 2000<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-a17891b3a55b119d0b8ca5d398a9fe1b\"><p>%0 Conference Paper<br\/>%1 Stum00fast<br\/>%A Stumme, G.<br\/>%A Taouil, R.<br\/>%A Bastide, Y.<br\/>%A Pasquier, N.<br\/>%A Lakhal, L.<br\/>%B Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases<br\/>%C Berlin<br\/>%D 2000<br\/>%I CEUR-Workshop Proceeding.<br\/>%T Fast computation of concept lattices using data mining techniques.<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_1999\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">1999<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Prediger, S., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Theory-Driven Logical Scaling<\/span>.<\/span> In: et al, E.F. (ed.) Proc. 6th Intl. Workshop Knowledge Representation Meets Databases (KRDB\u201999) (1999).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/KRDB99.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-012c6e353faa417521e9c88fc5c89f1e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-012c6e353faa417521e9c88fc5c89f1e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/012c6e353faa417521e9c88fc5c89f1e\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-012c6e353faa417521e9c88fc5c89f1e\"><p>@inproceedings{prediger99theory,<br\/>  author = {Prediger, S. and Stumme, G.},<br\/>  booktitle = {Proc. 6th Intl. Workshop Knowledge Representation Meets Databases (KRDB'99)},<br\/>  editor = {et al, E. Franconi},<br\/>  keywords = {lattices},<br\/>  note = {Also in: P. Lambrix et al (Eds.): Proc. Intl. Workshop on Description Logics (DL'99). CEUR Workshop Proc. 22, 1999 \\url{http:\/\/ceur-ws.org\/Vol-21}},<br\/>  title = {Theory-Driven Logical Scaling},<br\/>  volume = {CEUR Workshop Proc. 21},<br\/>  year = 1999<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-012c6e353faa417521e9c88fc5c89f1e\"><p>%0 Conference Paper<br\/>%1 prediger99theory<br\/>%A Prediger, S.<br\/>%A Stumme, G.<br\/>%B Proc. 6th Intl. Workshop Knowledge Representation Meets Databases (KRDB'99)<br\/>%D 1999<br\/>%E et al, E. Franconi<br\/>%T Theory-Driven Logical Scaling<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/KRDB99.pdf<br\/>%V CEUR Workshop Proc. 21<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Mineau, G., Stumme, G., Wille, R.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis<\/span>.<\/span> In: Tepfenhart, W. and Cyre, W. (eds.) Conceptual Structures: Standards and Practices. Proc. ICCS \u201999. pp. 423\u2013441. Springer, Heidelberg (1999).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/ICCS99.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-162279b2ef7ec69ab0bf0dc3a7b79b18\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-162279b2ef7ec69ab0bf0dc3a7b79b18\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/162279b2ef7ec69ab0bf0dc3a7b79b18\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-162279b2ef7ec69ab0bf0dc3a7b79b18\"><p>@inproceedings{mineau99conceptual,<br\/>  address = {Heidelberg},<br\/>  author = {Mineau, Guy and Stumme, Gerd and Wille, Rudolf},<br\/>  booktitle = {Conceptual Structures: Standards and Practices. Proc. ICCS '99},<br\/>  editor = {Tepfenhart, W. and Cyre, W.},<br\/>  keywords = {knowledge},<br\/>  pages = {423-441},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis},<br\/>  volume = 1640,<br\/>  year = 1999<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-162279b2ef7ec69ab0bf0dc3a7b79b18\"><p>%0 Conference Paper<br\/>%1 mineau99conceptual<br\/>%A Mineau, Guy<br\/>%A Stumme, Gerd<br\/>%A Wille, Rudolf<br\/>%B Conceptual Structures: Standards and Practices. Proc. ICCS '99<br\/>%C Heidelberg<br\/>%D 1999<br\/>%E Tepfenhart, W.<br\/>%E Cyre, W.<br\/>%I Springer<br\/>%P 423-441<br\/>%T Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/ICCS99.pdf<br\/>%V 1640<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Acquiring Expert Knowledge for the Design of Conceptual Information Systems<\/span>.<\/span> In: Fensel, D. and Studer, R. (eds.) Knowledge Acquisition, Modeling, and Management. Proc. 11th European. pp. 275\u2013290. Springer, Heidelberg (1999).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/P1997-EKAW99.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-60dd3cf5ec48b03a4db39e4f24e6c632\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-60dd3cf5ec48b03a4db39e4f24e6c632\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/60dd3cf5ec48b03a4db39e4f24e6c632\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-60dd3cf5ec48b03a4db39e4f24e6c632\"><p>@inproceedings{Stumme1999acquiring,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Knowledge Acquisition, Modeling, and Management. Proc. 11th European},<br\/>  editor = {Fensel, D. and Studer, R.},<br\/>  keywords = {lattices},<br\/>  pages = {275-290},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Acquiring Expert Knowledge for the Design of Conceptual Information Systems},<br\/>  volume = 1621,<br\/>  year = 1999<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-60dd3cf5ec48b03a4db39e4f24e6c632\"><p>%0 Conference Paper<br\/>%1 Stumme1999acquiring<br\/>%A Stumme, Gerd<br\/>%B Knowledge Acquisition, Modeling, and Management. Proc. 11th European<br\/>%C Heidelberg<br\/>%D 1999<br\/>%E Fensel, D.<br\/>%E Studer, R.<br\/>%I Springer<br\/>%P 275-290<br\/>%T Acquiring Expert Knowledge for the Design of Conceptual Information Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/P1997-EKAW99.pdf<br\/>%V 1621<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Dual Retrieval in Conceptual Information Systems<\/span>.<\/span> In: Buchmann, A. (ed.) Datenbanksysteme in B\u00fcro, Technik und Wissenschaft. Proc. BTW\u201999. pp. 328\u2013342. , Heidelberg (1999).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/P2021-BTW99.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-022d58bb6596a05c31d3a2eb42f72e4d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-022d58bb6596a05c31d3a2eb42f72e4d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/022d58bb6596a05c31d3a2eb42f72e4d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-022d58bb6596a05c31d3a2eb42f72e4d\"><p>@inproceedings{stumme99dual,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Datenbanksysteme in B\u00fcro, Technik und Wissenschaft. Proc. BTW'99},<br\/>  editor = {Buchmann, A.},<br\/>  keywords = {information},<br\/>  pages = {328-342},<br\/>  title = {Dual Retrieval in Conceptual Information Systems},<br\/>  year = 1999<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-022d58bb6596a05c31d3a2eb42f72e4d\"><p>%0 Conference Paper<br\/>%1 stumme99dual<br\/>%A Stumme, Gerd<br\/>%B Datenbanksysteme in B\u00fcro, Technik und Wissenschaft. Proc. BTW'99<br\/>%C Heidelberg<br\/>%D 1999<br\/>%E Buchmann, A.<br\/>%P 328-342<br\/>%T Dual Retrieval in Conceptual Information Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/P2021-BTW99.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Knowledge Discovery with Frequent Concept Lattices<\/span>.<\/span> TU Darmstadt (1999).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/P2043.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-6d562dc043ba698acee8a83ce35bde6e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-6d562dc043ba698acee8a83ce35bde6e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/6d562dc043ba698acee8a83ce35bde6e\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-6d562dc043ba698acee8a83ce35bde6e\"><p>@techreport{stumme99conceptualknowledge,<br\/>  author = {Stumme, G.},<br\/>  institution = {TU Darmstadt},<br\/>  keywords = {closed},<br\/>  title = {Conceptual Knowledge Discovery with Frequent Concept Lattices},<br\/>  type = {{FB}4-{P}reprint 2043},<br\/>  year = 1999<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-6d562dc043ba698acee8a83ce35bde6e\"><p>%0 Report<br\/>%1 stumme99conceptualknowledge<br\/>%A Stumme, G.<br\/>%D 1999<br\/>%T Conceptual Knowledge Discovery with Frequent Concept Lattices<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/P2043.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Wolff, K.E.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Numerical Aspects in the Data Model of Conceptual Information Systems<\/span>.<\/span> In: Kambayashi, Y., Lee, D.K., Lim, E.-P., Mohania, M.K., and Masunaga, Y. (eds.) Advances in Database Technologies. Proc. Intl. Workshop on Data Warehousing and. pp. 117\u2013128. Springer, Heidelberg (1999).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/ER98.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-2bffb5196bd99d7953c05d322fcfdd66\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-2bffb5196bd99d7953c05d322fcfdd66\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/2bffb5196bd99d7953c05d322fcfdd66\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-2bffb5196bd99d7953c05d322fcfdd66\"><p>@inproceedings{stumme99numerical,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, G. and Wolff, K. E.},<br\/>  booktitle = {Advances in Database Technologies. Proc. Intl. Workshop on Data Warehousing and},<br\/>  editor = {Kambayashi, Y. and Lee, Dik Kun and Lim, Ee-Peng and Mohania, M. K. and Masunaga, Y.},<br\/>  keywords = {numerical},<br\/>  pages = {117-128},<br\/>  publisher = {Springer},<br\/>  series = {LNCS},<br\/>  title = {Numerical Aspects in the Data Model of Conceptual Information Systems},<br\/>  volume = 1552,<br\/>  year = 1999<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-2bffb5196bd99d7953c05d322fcfdd66\"><p>%0 Conference Paper<br\/>%1 stumme99numerical<br\/>%A Stumme, G.<br\/>%A Wolff, K. E.<br\/>%B Advances in Database Technologies. Proc. Intl. Workshop on Data Warehousing and<br\/>%C Heidelberg<br\/>%D 1999<br\/>%E Kambayashi, Y.<br\/>%E Lee, Dik Kun<br\/>%E Lim, Ee-Peng<br\/>%E Mohania, M. K.<br\/>%E Masunaga, Y.<br\/>%I Springer<br\/>%P 117-128<br\/>%T Numerical Aspects in the Data Model of Conceptual Information Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/ER98.pdf<br\/>%V 1552<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Skorsky, M., Stumme, G., Wille, R., Wille, U.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Reuse in the Development Process of {TOSCANA} Systems<\/span>.<\/span> In: Puppe, F., Fensel, D., K\u00fchler, J., Studer, R., and Wetter, T. (eds.) Proc. Workshop on Knowledge Management, Organizational Memory and Reuse, 5th German Conf. on. , W\u00fcrzburg (1999).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/XPS99.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-ff51aec56eefef18f1a089158a9b074c\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-ff51aec56eefef18f1a089158a9b074c\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/ff51aec56eefef18f1a089158a9b074c\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-ff51aec56eefef18f1a089158a9b074c\"><p>@inproceedings{skorsky1999reuse,<br\/>  address = {W\u00fcrzburg},<br\/>  author = {Skorsky, M. and Stumme, G. and Wille, R. and Wille, U.},<br\/>  booktitle = {Proc. Workshop on Knowledge Management, Organizational Memory and Reuse, 5th German Conf. on},<br\/>  editor = {Puppe, F. and Fensel, D. and K\u00fchler, J. and Studer, R. and Wetter, Th.},<br\/>  keywords = {analysis},<br\/>  month = {03},<br\/>  title = {Reuse in the Development Process of {TOSCANA} Systems},<br\/>  year = 1999<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-ff51aec56eefef18f1a089158a9b074c\"><p>%0 Conference Paper<br\/>%1 skorsky1999reuse<br\/>%A Skorsky, M.<br\/>%A Stumme, G.<br\/>%A Wille, R.<br\/>%A Wille, U.<br\/>%B Proc. Workshop on Knowledge Management, Organizational Memory and Reuse, 5th German Conf. on<br\/>%C W\u00fcrzburg<br\/>%D 1999<br\/>%E Puppe, F.<br\/>%E Fensel, D.<br\/>%E K\u00fchler, J.<br\/>%E Studer, R.<br\/>%E Wetter, Th.<br\/>%T Reuse in the Development Process of {TOSCANA} Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/XPS99.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Hierarchies of Conceptual Scales<\/span>.<\/span> In: Gaines, T.B., Kremer, R., and Musen, M. (eds.) Proc.Workshop on Knowledge Acquisition, Modeling and Management (KAW\u201999). pp. 78\u201395. Banff (1999).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/KAW99.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c184b7c1530317891bb03f61b1a0752a\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c184b7c1530317891bb03f61b1a0752a\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c184b7c1530317891bb03f61b1a0752a\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c184b7c1530317891bb03f61b1a0752a\"><p>@inproceedings{stumme99hierarchies,<br\/>  author = {Stumme, G.},<br\/>  booktitle = {Proc.Workshop on Knowledge Acquisition, Modeling and Management (KAW'99)},<br\/>  editor = {Gaines, T. B. and Kremer, R. and Musen, M.},<br\/>  keywords = {ontologies},<br\/>  month = 10,<br\/>  pages = {78-95},<br\/>  publisher = {Banff},<br\/>  title = {Hierarchies of Conceptual Scales},<br\/>  volume = 2,<br\/>  year = 1999<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c184b7c1530317891bb03f61b1a0752a\"><p>%0 Conference Paper<br\/>%1 stumme99hierarchies<br\/>%A Stumme, G.<br\/>%B Proc.Workshop on Knowledge Acquisition, Modeling and Management (KAW'99)<br\/>%D 1999<br\/>%E Gaines, T. B.<br\/>%E Kremer, R.<br\/>%E Musen, M.<br\/>%I Banff<br\/>%P 78-95<br\/>%T Hierarchies of Conceptual Scales<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1999\/KAW99.pdf<br\/>%V 2<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_1998\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">1998<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">On-Line Analytical Processing with Conceptual Information Systems<\/span>.<\/span> In: Tanaka, K. and Ghandeharizadeh, S. (eds.) Proc. 5th Intl. Conf. on Foundations of Data Organization (FODO\u201998). pp. 117\u2013126 (1998).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/FODO98.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-1121c5fe44a16f5a84ad19dec2dc662d\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-1121c5fe44a16f5a84ad19dec2dc662d\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/1121c5fe44a16f5a84ad19dec2dc662d\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-1121c5fe44a16f5a84ad19dec2dc662d\"><p>@inproceedings{stumme98online,<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Proc. 5th Intl. Conf. on Foundations of Data Organization (FODO'98)},<br\/>  editor = {Tanaka, K. and Ghandeharizadeh, S.},<br\/>  keywords = {olap},<br\/>  month = 11,<br\/>  note = {Short version of \\cite{stumme00conceptual}},<br\/>  pages = {117-126},<br\/>  title = {On-Line Analytical Processing with Conceptual Information Systems},<br\/>  year = 1998<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-1121c5fe44a16f5a84ad19dec2dc662d\"><p>%0 Conference Paper<br\/>%1 stumme98online<br\/>%A Stumme, Gerd<br\/>%B Proc. 5th Intl. Conf. on Foundations of Data Organization (FODO'98)<br\/>%D 1998<br\/>%E Tanaka, K.<br\/>%E Ghandeharizadeh, S.<br\/>%P 117-126<br\/>%T On-Line Analytical Processing with Conceptual Information Systems<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/FODO98.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Exploring Conceptual Similarities of Objects for Analyzing Inconsistencies in Relational Databases.<\/span><\/span> In: Bing, L., Hsu, W., and Ke, W. (eds.) Proc.Workshop on Knowledge Discovery and Data Mining, 5th Pacific Rim Intl. Conf. on Artificial. pp. 41\u201350. , Singapore (1998).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/P2020-PRICAI98.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-e5bde5fb9ef3a57f8d199d26160e33fe\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-e5bde5fb9ef3a57f8d199d26160e33fe\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/e5bde5fb9ef3a57f8d199d26160e33fe\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-e5bde5fb9ef3a57f8d199d26160e33fe\"><p>@inproceedings{stummeexploring98,<br\/>  address = {Singapore},<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Proc.Workshop on Knowledge Discovery and Data Mining, 5th Pacific Rim Intl. Conf. on Artificial},<br\/>  editor = {Bing, L. and Hsu, W. and Ke, W.},<br\/>  keywords = {databases},<br\/>  month = 11,<br\/>  pages = {41-50},<br\/>  title = {Exploring Conceptual Similarities of Objects for Analyzing Inconsistencies in Relational Databases.},<br\/>  year = 1998<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-e5bde5fb9ef3a57f8d199d26160e33fe\"><p>%0 Conference Paper<br\/>%1 stummeexploring98<br\/>%A Stumme, Gerd<br\/>%B Proc.Workshop on Knowledge Discovery and Data Mining, 5th Pacific Rim Intl. Conf. on Artificial<br\/>%C Singapore<br\/>%D 1998<br\/>%E Bing, L.<br\/>%E Hsu, W.<br\/>%E Ke, W.<br\/>%P 41-50<br\/>%T Exploring Conceptual Similarities of Objects for Analyzing Inconsistencies in Relational Databases.<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/P2020-PRICAI98.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Wille, R., Wille, U.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods<\/span>.<\/span> In: Zytkow, J.M. and Quafofou, M. (eds.) Principles of Data Mining and Knowledge Discovery Proc. 2nd European Symposium on PKDD\u201998. pp. 450\u2013458. , Heidelberg (1998).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/P1993-PKDD98.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-b960d1d34dace39052a0530ab4026e18\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-b960d1d34dace39052a0530ab4026e18\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/b960d1d34dace39052a0530ab4026e18\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-b960d1d34dace39052a0530ab4026e18\"><p>@inproceedings{stumme98conceptual,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, Gerd and Wille, Rudolf and Wille, Uta},<br\/>  booktitle = {Principles of Data Mining and Knowledge Discovery Proc. 2nd European Symposium on PKDD'98},<br\/>  editor = {Zytkow, J. M. and Quafofou, M.},<br\/>  keywords = {databases},<br\/>  note = {{P}art of \\cite{hereth03conceptual}},<br\/>  pages = {450-458},<br\/>  series = {LNAI},<br\/>  title = {Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods},<br\/>  volume = 1510,<br\/>  year = 1998<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-b960d1d34dace39052a0530ab4026e18\"><p>%0 Conference Paper<br\/>%1 stumme98conceptual<br\/>%A Stumme, Gerd<br\/>%A Wille, Rudolf<br\/>%A Wille, Uta<br\/>%B Principles of Data Mining and Knowledge Discovery Proc. 2nd European Symposium on PKDD'98<br\/>%C Heidelberg<br\/>%D 1998<br\/>%E Zytkow, J. M.<br\/>%E Quafofou, M.<br\/>%P 450-458<br\/>%T Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/P1993-PKDD98.pdf<br\/>%V 1510<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Distributive Concept Exploration - A Knowledge Acquisition Tool in Formal Concept Analysis<\/span>.<\/span> In: Herzog, O. and G\u00fcnter, A. (eds.) KI-98: Advances in Artificial Intelligence. Proc. 22. Jahrestagung. pp. 117\u2013128. Springer, Heidelberg (1998).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/KI98.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-df6b2348edd768d19918387671315251\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-df6b2348edd768d19918387671315251\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/df6b2348edd768d19918387671315251\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-df6b2348edd768d19918387671315251\"><p>@inproceedings{stumme98knowledgeacquisition,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {KI-98: Advances in Artificial Intelligence. Proc. 22. Jahrestagung},<br\/>  editor = {Herzog, O. and G\u00fcnter, A.},<br\/>  keywords = {knowledge},<br\/>  pages = {117-128},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Distributive Concept Exploration - A Knowledge Acquisition Tool in Formal Concept Analysis},<br\/>  volume = 1504,<br\/>  year = 1998<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-df6b2348edd768d19918387671315251\"><p>%0 Conference Paper<br\/>%1 stumme98knowledgeacquisition<br\/>%A Stumme, Gerd<br\/>%B KI-98: Advances in Artificial Intelligence. Proc. 22. Jahrestagung<br\/>%C Heidelberg<br\/>%D 1998<br\/>%E Herzog, O.<br\/>%E G\u00fcnter, A.<br\/>%I Springer<br\/>%P 117-128<br\/>%T Distributive Concept Exploration - A Knowledge Acquisition Tool in Formal Concept Analysis<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1998\/KI98.pdf<br\/>%V 1504<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Free Distributive Completions of Partial Complete Lattices<\/span>.<\/span> {In:} {O}rder. 14, 179\u2013189 (1998).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/SIGKDD_Explorations00.ps\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-de157d21efb3d9723fb937be024f84cd\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-de157d21efb3d9723fb937be024f84cd\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/de157d21efb3d9723fb937be024f84cd\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-de157d21efb3d9723fb937be024f84cd\"><p>@article{stumme98free,<br\/>  author = {Stumme, Gerd},<br\/>  journal = {{In:} {O}rder},<br\/>  keywords = {theory},<br\/>  pages = {179-189},<br\/>  title = {Free Distributive Completions of Partial Complete Lattices},<br\/>  volume = 14,<br\/>  year = 1998<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-de157d21efb3d9723fb937be024f84cd\"><p>%0 Journal Article<br\/>%1 stumme98free<br\/>%A Stumme, Gerd<br\/>%D 1998<br\/>%J {In:} {O}rder<br\/>%P 179-189<br\/>%T Free Distributive Completions of Partial Complete Lattices<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/2000\/SIGKDD_Explorations00.ps<br\/>%V 14<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Knowledge, {L}ogic, {I}nformation. {C}onference {R}eport.<\/span><\/span> Zeitschrift f\u00fcr Semiotik. 20, 424 (1998).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-d03755fc571c2b7c0d2d6f6e600368f0\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-d03755fc571c2b7c0d2d6f6e600368f0\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/d03755fc571c2b7c0d2d6f6e600368f0\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-d03755fc571c2b7c0d2d6f6e600368f0\"><p>@article{stumme98knowledge,<br\/>  author = {Stumme, Gerd},<br\/>  journal = {Zeitschrift f\u00fcr Semiotik},<br\/>  keywords = {report},<br\/>  number = {3-4},<br\/>  pages = 424,<br\/>  title = {Knowledge, {L}ogic, {I}nformation. {C}onference {R}eport.},<br\/>  volume = 20,<br\/>  year = 1998<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-d03755fc571c2b7c0d2d6f6e600368f0\"><p>%0 Journal Article<br\/>%1 stumme98knowledge<br\/>%A Stumme, Gerd<br\/>%D 1998<br\/>%J Zeitschrift f\u00fcr Semiotik<br\/>%N 3-4<br\/>%P 424<br\/>%T Knowledge, {L}ogic, {I}nformation. {C}onference {R}eport.<br\/>%V 20<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_1997\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">1997<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G., Wolff, K.E.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Computing in Conceptual Data systems with relational structures<\/span>.<\/span> In: Proc. Intl. Symposium on Knowledge Retrieval, Use, and Storage for Efficiency. pp. 206\u2013219. , Vancouver, Canada (1997).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1997\/KRUSE97.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-09244927cabf900accd89964a28c41de\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-09244927cabf900accd89964a28c41de\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/09244927cabf900accd89964a28c41de\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-09244927cabf900accd89964a28c41de\"><p>@inproceedings{stumme97computing,<br\/>  address = {Vancouver, Canada},<br\/>  author = {Stumme, Gerd and Wolff, Karl Erich},<br\/>  booktitle = {Proc. Intl. Symposium on Knowledge Retrieval, Use, and Storage for Efficiency},<br\/>  keywords = {lattices},<br\/>  month = {08},<br\/>  pages = {206-219},<br\/>  title = {Computing in Conceptual Data systems with relational structures},<br\/>  year = 1997<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-09244927cabf900accd89964a28c41de\"><p>%0 Conference Paper<br\/>%1 stumme97computing<br\/>%A Stumme, Gerd<br\/>%A Wolff, Karl Erich<br\/>%B Proc. Intl. Symposium on Knowledge Retrieval, Use, and Storage for Efficiency<br\/>%C Vancouver, Canada<br\/>%D 1997<br\/>%P 206-219<br\/>%T Computing in Conceptual Data systems with relational structures<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1997\/KRUSE97.pdf<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Concept Exploration -- Knowledge Acquisition in Knowledge Systems.<\/span><\/span> Shaker, Aachen (1997).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.shaker.de\/Online-Gesamtkatalog\/details.asp?ISBN=3-8265-2930-8\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-8e9d6d29a5b0764bbf2e18cabe2b8f2e\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-8e9d6d29a5b0764bbf2e18cabe2b8f2e\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/8e9d6d29a5b0764bbf2e18cabe2b8f2e\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-8e9d6d29a5b0764bbf2e18cabe2b8f2e\"><p>@book{stumme97conceptexploration,<br\/>  address = {Aachen},<br\/>  author = {Stumme, Gerd},<br\/>  keywords = {knowledge},<br\/>  publisher = {Shaker},<br\/>  title = {Concept Exploration -- Knowledge Acquisition in Knowledge Systems.},<br\/>  year = 1997<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-8e9d6d29a5b0764bbf2e18cabe2b8f2e\"><p>%0 Book<br\/>%1 stumme97conceptexploration<br\/>%A Stumme, Gerd<br\/>%C Aachen<br\/>%D 1997<br\/>%I Shaker<br\/>%T Concept Exploration -- Knowledge Acquisition in Knowledge Systems.<br\/>%U http:\/\/www.shaker.de\/Online-Gesamtkatalog\/details.asp?ISBN=3-8265-2930-8<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Concept Exploration - A Tool for Creating and Exploring Conceptual Hierarchies<\/span>.<\/span> In: Lukose, D., Delugach, H., Keeler, M., Searle, L., and Sowa, J.F. (eds.) Conceptual Structures: Fulfilling Peirce\u2019s Dream. Proc. ICCS\u201997. Springer, Berlin (1997).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1997\/P1905-ICCS97.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-81bd13dbc2767c77b18bc3bd919fcc29\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-81bd13dbc2767c77b18bc3bd919fcc29\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/81bd13dbc2767c77b18bc3bd919fcc29\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-81bd13dbc2767c77b18bc3bd919fcc29\"><p>@inproceedings{stumme97tool,<br\/>  address = {Berlin},<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Conceptual Structures: Fulfilling Peirce's Dream. Proc. ICCS'97},<br\/>  editor = {Lukose, D. and Delugach, H. and Keeler, M. and Searle, L. and Sowa, J. F.},<br\/>  keywords = {Conceptual},<br\/>  publisher = {Springer},<br\/>  series = {LNAI},<br\/>  title = {Concept Exploration - A Tool for Creating and Exploring Conceptual Hierarchies},<br\/>  volume = 1257,<br\/>  year = 1997<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-81bd13dbc2767c77b18bc3bd919fcc29\"><p>%0 Conference Paper<br\/>%1 stumme97tool<br\/>%A Stumme, Gerd<br\/>%B Conceptual Structures: Fulfilling Peirce's Dream. Proc. ICCS'97<br\/>%C Berlin<br\/>%D 1997<br\/>%E Lukose, D.<br\/>%E Delugach, H.<br\/>%E Keeler, M.<br\/>%E Searle, L.<br\/>%E Sowa, J. F.<br\/>%I Springer<br\/>%T Concept Exploration - A Tool for Creating and Exploring Conceptual Hierarchies<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1997\/P1905-ICCS97.pdf<br\/>%V 1257<br\/><\/p><\/div><\/div><\/li>\n<\/ul>\n<a class=\"bibsonomycsl_publications-headline-anchor \" name=\"jmp_1996\"><\/a><h3 class=\"bibsonomycsl_publications-headline\" style=\"font-size: 1.1em; font-weight: bold;\">1996<\/h3>\n<ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Attribute Exploration with Background Implications and Exceptions<\/span>.<\/span> In: Bock, H.-H. and Polasek, W. (eds.) Data Analysis and Information Systems. Statistical and Conceptual approaches. Proc. GfKl\u201995. Studies in Classification, Data Analysis, and Knowledge Organization 7. pp. 457\u2013469. Springer, Heidelberg (1996).<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1995\/P1781-GfKl95.pdf\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-59bb0dbc1ba508f174108d7bcb6fa240\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-59bb0dbc1ba508f174108d7bcb6fa240\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/59bb0dbc1ba508f174108d7bcb6fa240\/stumme\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-59bb0dbc1ba508f174108d7bcb6fa240\"><p>@inproceedings{stumme96attribute,<br\/>  address = {Heidelberg},<br\/>  author = {Stumme, Gerd},<br\/>  booktitle = {Data Analysis and Information Systems. Statistical and Conceptual approaches. Proc. GfKl'95. Studies in Classification, Data Analysis, and Knowledge Organization 7},<br\/>  editor = {Bock, H.-H. and Polasek, W.},<br\/>  keywords = {lattices},<br\/>  pages = {457-469},<br\/>  publisher = {Springer},<br\/>  title = {Attribute Exploration with Background Implications and Exceptions},<br\/>  year = 1996<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-59bb0dbc1ba508f174108d7bcb6fa240\"><p>%0 Conference Paper<br\/>%1 stumme96attribute<br\/>%A Stumme, Gerd<br\/>%B Data Analysis and Information Systems. Statistical and Conceptual approaches. Proc. GfKl'95. Studies in Classification, Data Analysis, and Knowledge Organization 7<br\/>%C Heidelberg<br\/>%D 1996<br\/>%E Bock, H.-H.<br\/>%E Polasek, W.<br\/>%I Springer<br\/>%P 457-469<br\/>%T Attribute Exploration with Background Implications and Exceptions<br\/>%U http:\/\/www.kde.cs.uni-kassel.de\/stumme\/papers\/1995\/P1781-GfKl95.pdf<br\/><\/p><\/div><\/div><\/li><\/ul>","protected":false},"excerpt":{"rendered":"<p>The list is generated automatically by BibSonomy. For more details and BibTeX entries, please click on the titles. All publications in BibTeX. All publications in one list. All publications in the SWRC ontology. All publications<a class=\"moretag\" href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/pub\"> Read more&hellip;<\/a><\/p>\n","protected":false},"author":9,"featured_media":0,"parent":0,"menu_order":37,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-45","page","type-page","status-publish","hentry"],"translation":{"provider":"WPGlobus","version":"3.0.5","language":"en","enabled_languages":["de","en"],"languages":{"de":{"title":true,"content":true,"excerpt":false},"en":{"title":false,"content":false,"excerpt":false}}},"_links":{"self":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/45","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/users\/9"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/comments?post=45"}],"version-history":[{"count":8,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/45\/revisions"}],"predecessor-version":[{"id":9196,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/45\/revisions\/9196"}],"wp:attachment":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/media?parent=45"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}