{"id":3928,"date":"2018-07-04T17:33:56","date_gmt":"2018-07-04T15:33:56","guid":{"rendered":"https:\/\/www.kde.cs.uni-kassel.de\/?page_id=3928"},"modified":"2025-02-05T12:56:56","modified_gmt":"2025-02-05T11:56:56","slug":"hirth","status":"publish","type":"page","link":"https:\/\/www.kde.cs.uni-kassel.de\/en\/hirth","title":{"rendered":"Johannes Hirth"},"content":{"rendered":"<div style=\"height: 100px;\">\n<p style=\"text-align: center; color: white; background: #9a0c46;\"><strong>Dr. Johannes Hirth ist seit dem 31.10.2024 nicht mehr im Fachgebiet besch\u00e4ftigt.<\/strong><\/p>\n<\/div>\n<div class=\"alignright\"><img decoding=\"async\" class=\"wp-image-6852 size-medium\" style=\"heigth: auto; width: 15vw;\" src=\"https:\/\/www.kde.cs.uni-kassel.de\/wp-content\/uploads\/2024\/06\/johannes2.jpg\" alt=\"\" \/><a style=\"display: none;\" href=\"mailto:hirth@cs.uni-kassel.de\"><u><span style=\"color: #0066cc;\">available for collaboration<\/span><\/u><\/a><\/div>\n<div class=\"name\" style=\"position: relative; display: inline-block;\"><strong>Dr. <u>Johannes<\/u> Hirth<\/strong><\/div>\n<p>Raum 0443<br \/>\n<a href=\"http:\/\/www.uni-kassel.de\/\"><u><span style=\"color: #0066cc;\">Universit\u00e4t Kassel<\/span><\/u><\/a><br \/>\n<a href=\"http:\/\/www.uni-kassel.de\/fb16\/\"><u><span style=\"color: #0066cc;\">Fachbereich Elektrotechnik\/Informatik<\/span><\/u><\/a><br \/>\n<a href=\"\/\"><u><span style=\"color: #0066cc;\">Fachgebiet Wissensverarbeitung<\/span><\/u><\/a><br \/>\nWilhelmsh\u00f6her Allee 73<\/p>\n<p>34121 Kassel<br \/>\nTel.: +49 561 804-6350<br \/>\nORCID: <a href=\"https:\/\/orcid.org\/0000-0001-9034-0321\">0000-0001-9034-0321<\/a><\/p>\n<p>Email: <a href=\"mailto:hirth@cs.uni-kassel.de\"><u><span style=\"color: #0066cc;\">hirth@cs.uni-kassel.de<\/span><\/u><\/a> (PGP-Key: <a href=\"https:\/\/keyserver.ubuntu.com\/pks\/lookup?op=get&amp;search=0x2D9F0D2E01928BC8\"><u><span style=\"color: #0066cc;\">0x2D9F0D2E01928BC8<\/span><\/u><\/a>)<\/p>\n<p><a href=\"https:\/\/www.uni-kassel.de\/forschung\/iteg\">Re\u00adsearch Cen\u00adter for In\u00adform\u00ada\u00adtion Sys\u00adtem Design (ITeG)<\/a><\/p>\n<h2>About Me<\/h2>\n<p>I am a German researcher that is interested in explainable artificial intelligence. With my research I focus on methods from symbolic methods to generate <em>conceptual views<\/em>. These are hierarchical structures that encode what abstract concepts are entailed in data and how they depend on each other. The resulting structures are great for structuring data, concept based navigation and rule inference. I contribute to both deeper theoretical insights and applications in the realm of <em>topic models<\/em>, <em>latent representations of deep learning models<em>, and <em>knowledge representations<\/em> in general. <\/em><\/em><\/p>\n<p>In my spare time, I often find myself optimizing my Emacs workflow.<\/p>\n<h2>Selected Scientific Works (5\/15) <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/hirth\/publications\">[full list]<\/a><\/h2>\n<p><center><svg id=\"bv-topics\" viewbox=\"-5 -5 75 60\" width=\"60%\" height=\"60%\"> \t<line id=\"AI-TM\" x1=\"30\" y1=\"10\" x2=\"15\" y2=\"20\" stroke=\"rgb(74,172,150)\"><\/line> \t<line id=\"AI-SAI\" x1=\"30\" y1=\"10\" x2=\"45\" y2=\"20\" stroke=\"rgb(74,172,150)\"><\/line> \t<line id=\"TM-SNA\" x1=\"15\" y1=\"20\" x2=\"15\" y2=\"35\" stroke=\"rgb(74,172,150)\"><\/line> \t<line id=\"TM-TMSAI\" x1=\"15\" y1=\"20\" x2=\"30\" y2=\"30\" stroke=\"rgb(74,172,150)\"><\/line> \t<line id=\"SAI-TMSAI\" x1=\"45\" y1=\"20\" x2=\"30\" y2=\"30\" stroke=\"rgb(74,172,150)\"><\/line> \t<line id=\"SAI-DL\" x1=\"45\" y1=\"20\" x2=\"45\" y2=\"35\" stroke=\"rgb(74,172,150)\"><\/line> \t<line id=\"SNA-BOT\" x1=\"15\" y1=\"35\" x2=\"30\" y2=\"45\" stroke=\"rgb(74,172,150)\"><\/line> \t<line id=\"TMSAI-BOT\" x1=\"30\" y1=\"30\" x2=\"30\" y2=\"45\" stroke=\"rgb(74,172,150)\"><\/line> \t<line id=\"DL-BOT\" x1=\"45\" y1=\"35\" x2=\"30\" y2=\"45\" stroke=\"rgb(74,172,150)\"><\/line><a href=\"https:\/\/www.bibsonomy.org\/bib\/user\/hirth\/myown\"><circle id=\"AI\" cx=\"30\" cy=\"10\" r=\"3\" stroke=\"rgb(74,172,150)\" stroke-width=\"0\" fill=\"rgb(74,172,150)\" style=\"cursor: pointer;\"><\/circle><\/a><a href=\"https:\/\/www.bibsonomy.org\/bib\/user\/hirth\/tm\"><circle id=\"TM\" cx=\"15\" cy=\"20\" r=\"3\" stroke=\"rgb(74,172,150)\" stroke-width=\"0\" fill=\"rgb(74,172,150)\" style=\"cursor: pointer;\"><\/circle><\/a><a href=\"https:\/\/www.bibsonomy.org\/bib\/user\/hirth\/sai\"><circle id=\"SAI\" cx=\"45\" cy=\"20\" r=\"3\" stroke=\"rgb(74,172,150)\" stroke-width=\"0\" fill=\"rgb(74,172,150)\" style=\"cursor: pointer;\"><\/circle><\/a><a href=\"https:\/\/www.bibsonomy.org\/bib\/user\/hirth\/sna\"><circle id=\"SNA\" cx=\"15\" cy=\"35\" r=\"3\" stroke=\"rgb(74,172,150)\" stroke-width=\"0\" fill=\"rgb(74,172,150)\" style=\"cursor: pointer;\"><\/circle><\/a><a href=\"https:\/\/www.bibsonomy.org\/bib\/user\/hirth\/tmsai\"><circle id=\"TMSAI\" cx=\"30\" cy=\"30\" r=\"3\" stroke=\"rgb(74,172,150)\" stroke-width=\"0\" fill=\"rgb(74,172,150)\" style=\"cursor: pointer;\"><\/circle><\/a><a href=\"https:\/\/www.bibsonomy.org\/bib\/user\/hirth\/dl\"><circle id=\"DL\" cx=\"45\" cy=\"35\" r=\"3\" stroke=\"rgb(74,172,150)\" stroke-width=\"0\" fill=\"rgb(74,172,150)\" style=\"cursor: pointer;\"><\/circle><\/a><circle id=\"BOT\" cx=\"30\" cy=\"45\" r=\"3\" stroke=\"rgb(74,172,150)\" stroke-width=\"0\" fill=\"rgb(74,172,150)\"><\/circle><text id=\"TM-label\" x=\"15\" y=\"20\" fill=\"rgb(74,172,150)\" font-size=\"3pt\"><tspan x=\"-3\" dy=\"-1.4em\">Topic<\/tspan><tspan x=\"-5\" dy=\"1.2em\">Models<\/tspan><\/text><text id=\"SAI-label\" x=\"45\" y=\"20\" fill=\"rgb(74,172,150)\" font-size=\"3pt\"><tspan x=\"48\" dy=\"-1.4em\">Symbolic<\/tspan><tspan x=\"55\" dy=\"1.2em\">AI<\/tspan><\/text><text id=\"SNA-label\" x=\"-2\" y=\"33\" fill=\"rgb(74,172,150)\" font-size=\"3pt\">SNA<\/text><text id=\"DL-label\" x=\"48\" y=\"37\" fill=\"rgb(74,172,150)\" font-size=\"3pt\"><tspan x=\"53\" dy=\"-1.4em\">Deep<\/tspan><tspan x=\"50\" dy=\"1.2em\">learning<\/tspan><\/text><text id=\"AI-label\" x=\"28\" y=\"3\" fill=\"rgb(74,172,150)\" font-size=\"3pt\">AI<\/text><\/svg><\/center><\/p>\n<ul>\n<li>Hirth, J., Hanika, T.: <a href=\"https:\/\/arxiv.org\/abs\/2403.03607\">The Geometric Structure of Topic Models<\/a>. CoRR. abs\/2403.03607, (2024).<\/li>\n<li>Hirth, J., Horn, V., Stumme, G., Hanika, T.: <a href=\"https:\/\/doi.org\/10.1016\/j.ins.2023.120009\">Ordinal Motifs in Lattices<\/a>, (2023). [<a href=\"https:\/\/arxiv.org\/abs\/2304.04827\">arXiv PDF<\/a>]<\/li>\n<li>Sch\u00e4fermeier, B., Hirth, J., Hanika, T.: <a href=\"https:\/\/doi.org\/10.1007\/s11192-022-04573-6\">Research Topic Flows in Co-Authorship Networks<\/a>, https:\/\/doi.org\/10.1007\/s11192-022-04529-w, (2022). [<a href=\"https:\/\/arxiv.org\/abs\/2206.07980\">arXiv PDF<\/a>]<\/li>\n<li>Hanika, T., Hirth, J.: <a href=\"https:\/\/doi.org\/10.1007\/978-3-030-86982-3_8\">Quantifying the Conceptual Error in Dimensionality Reduction<\/a>. In: Braun, T., Gehrke, M., Hanika, T., and Hernandez, N. (eds.) Graph-Based Representation and Reasoning &#8211; 26th International Conference on Conceptual Structures, ICCS 2021, Virtual Event, September 20-22, 2021, Proceedings. pp. 105&#8211;118. Springer (2021). [<a href=\"https:\/\/arxiv.org\/abs\/2106.06815\">arXiv PDF<\/a>]<\/li>\n<li>Hanika, T., Hirth, J.: <a href=\"https:\/\/doi.org\/10.1016\/j.ins.2022.09.005\">On the lattice of conceptual measurements<\/a>. Inf. Sci. 613, 453\u2013468 (2022). [<a href=\"https:\/\/arxiv.org\/abs\/2012.05267\">arXiv PDF<\/a>]<\/li>\n<\/ul>\n<h2>Dissertation<\/h2>\n<p>Hirth, J: <a href=\"https:\/\/dx.doi.org\/10.17170\/kobra-2024100910940\">Conceptual Data Scaling in Machine Learning<\/a>, Kassel, Universit\u00e4t Kassel, Fachbereich Elektrotechnik\/Informatik (2024)<\/p>\n<h2>Talks<\/h2>\n<ul>\n<li>Mai 2024: \u201aConceptual Structures of Topic Models\u2018, <a href=\"https:\/\/christophjansen0.wixsite.com\/machine-learning-und\/blank-1\">1st Workshop on machine learning under weakly structured information<\/a>, LMU Munich, Germany<\/li>\n<li>July 2023: \u201aScaling Dimension\u2018, <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/icfca2023\/program.html\">ICFCA 2023<\/a>, University of Kassel, Kassel, Germany<\/li>\n<li>Januar 2023: \u201aExplaining Ordinal Data Structures via Ordinal Motifs\u2018, <a href=\"https:\/\/www.dagstuhl.de\/23013\">Concept Lattice Based Topological Data Analysis and Reasoning<\/a>, Schloss Dagstuhl Computer Science Center, Wadern, Germany<\/li>\n<li>May 2022: \u201a Formale Begriffsanalyse &amp; Mapping of Controversies\u2018, <a href=\"https:\/\/www.uni-kassel.de\/forschung\/iteg\/veranstaltungen\/e-valuate\">e_valuate!<\/a>, <a href=\"https:\/\/www.uni-kassel.de\/forschung\/iteg\"><u><span style=\"color: #0066cc;\">Re\u00adsearch Cen\u00adter for<br \/>\nIn\u00adform\u00ada\u00adtion Sys\u00adtem Design (ITeG)<\/span><\/u><\/a>, Kassel, Germany<\/li>\n<li>September 2021: \u201aQuantifying the Conceptual Error in Dimensionality Reduction\u2018, <a href=\"https:\/\/iccs-conference.org\/?page_id=900\">ICCS (2021)<\/a>, Bolzano, Italy<\/li>\n<li>September 2021: \u201aQuantifying the Conceptual Error in Dimensionality Reduction\u2018, <a href=\"https:\/\/www.dagstuhl.de\/21353\">Applications of Formal Sciences: Explainable AI<\/a>, Schloss Dagstuhl Computer Science Center, Wadern, Germany<\/li>\n<li>July 2021: \u201aExploring Scale-Measures of Data Sets\u2018, <a href=\"https:\/\/icfca2021.sciencesconf.org\/\">ICFCA (2021)<\/a>, Universit\u00e9 de Strasbourg, Strasbourg, France<\/li>\n<li>March 2021: \u201aDiscovery of Conceptual Measurements\/Entdecken Begrifflicher Messungen\u2018<strong><\/strong><strong><\/strong>, <a href=\"https:\/\/www.dagstuhl.de\/21103\">Explainable Artificial Intelligence<\/a>, Schloss Dagstuhl Computer Science Center, Wadern, Germany<\/li>\n<li>September 2020: \u201aNavigating Conceptual Measurements\u2018, <a href=\"https:\/\/www.dagstuhl.de\/20383\">Dagstuhl Meeting on the Application of Formal Sciences \u2014 Knowledge Engineering<\/a>, Schloss Dagstuhl Computer Science Center, Wadern, Germany<\/li>\n<li>June 2019: \u201aConexp-Clj &#8211; A Research Tool for FCA\u2018, <a href=\"https:\/\/www.informatik.fb2.frankfurt-university.de\/~icfca2019\/index.html\">ICFCA (2019)<\/a>, Frankfurt University of Applied Sciences, Frankfurt, Germany<\/li>\n<\/ul>\n<h2>Organization of Workshops, Tutorials and Other<\/h2>\n<ul>\n<li>Local Organizer: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/icfca2023\/committees.html\">ICFCA 2023<\/a>, University of Kassel, Kassel, Germany<\/li>\n<li>Workshop: <a href=\"https:\/\/hhai-conference.org\/2024\/workshops-tutorials\/\">\u201aCollaborative HAI-Learning through Conceptual Exploration\u2018<\/a>, Organizers: Bernhard Ganter, Tom Hanika, Johannes Hirth and Sergei Obiedkov, HHAI 2024, Malm\u00f6 University, Malm\u00f6, Sweden<\/li>\n<li>Workshop: <a href=\"https:\/\/www.k-cap.org\/2023\/tutorials.html\">\u201aOrdinal Methods for Knowledge Representation and Capture (OrMeKR)\u2018<\/a>, Organizers: Tom Hanika, Dominik D\u00fcrrschnabel, Johannes Hirth, K-CAP 2023, Pensacola, Florida, USA<\/li>\n<li>Workshop: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/icfca2023\/prescod.html\">\u201aPreprocessing and Scaling of Contextual Data \u2013 PreSCoD\u2018<\/a>, Organizers: Tom Hanika, Johannes Hirth, \u00c1ngel Mora Bonilla, ICFCA 2023, University of Kassel, Kassel, Germany<\/li>\n<li>Tutorial: <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/icfca2023\/conexp-clj.html\">\u201aConexp-Clj \u2013 A Functional Approach to Applying Formal Concept Analysis\u2018<\/a>, Organizers: Jana Fischer, Tom Hanika, Johannes Hirth, ICFCA 2023, University of Kassel, Kassel, Germany<\/li>\n<\/ul>\n<h2>Reviewing<\/h2>\n<h3>PC Member<\/h3>\n<ul>\n<li>Web Science Conference, 2025<\/li>\n<\/ul>\n<h3>Reviewer<\/h3>\n<ul>\n<li><a href=\"https:\/\/link.springer.com\/journal\/11192\">Scientometrics<\/a><a>,\u00a0 2024<\/a><\/li>\n<\/ul>\n<h3>Subreviewer<\/h3>\n<ul>\n<li>Concepts,\u00a0 09-13 September 2024,\u00a0 C\u00e1diz, Spain<\/li>\n<li>ISWC,\u00a0 06-10 November 2023,\u00a0 Athen, Greece<\/li>\n<li>ISWC,\u00a0 23-27 October 2022,\u00a0 Hangzhou, China<\/li>\n<li>ICCS,\u00a0 12\u201315 September 2022,\u00a0 M\u00fcnster, Germany<\/li>\n<li>ECML PKDD,\u00a0 19\u201323 September 2022,\u00a0 Grenoble, France<\/li>\n<li>FCA4AI-2021, 21 August 2021,\u00a0 Montr\u00e9al, Canada<\/li>\n<li>ECML PKDD,\u00a0 13\u201317 September 2021<\/li>\n<li>17th Russian Conference on Artificial Intelligence, 21\u201325 October, 2019, Ulyanovsk, Russia\u200b<\/li>\n<li>11th ACM conference \u200bon Web Science, June 30\u2013July 3, 2019, Boston, MA, USA\u200b<\/li>\n<\/ul>\n<h2>Teaching<\/h2>\n<ul>\n<li>Artificial Intelligence <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2024\/ki\">(2024)<\/a><\/li>\n<\/ul>\n<h2>Teaching Assistance<\/h2>\n<ul>\n<li><span style=\"width: 7cm; display: inline-block;\">Functional Programming in Clojure:<\/span> 2019 &#8212; 2024<\/li>\n<li><span style=\"width: 7cm; display: inline-block;\">Conceptual Data Analysis (Labor):<\/span> 2019 &#8212; 2023<\/li>\n<li><span style=\"width: 7cm; display: inline-block;\">Conceptual Data Analysis:<\/span> 2022<\/li>\n<li><span style=\"width: 7cm; display: inline-block;\">Artificial Intelligence:<\/span> 2022<\/li>\n<li><span style=\"width: 7cm; display: inline-block;\">Knowledge Discovery:<\/span> 2021<\/li>\n<li><span style=\"width: 7cm; display: inline-block;\">Social Network Analysis (Labor):<\/span> 2020<\/li>\n<li><span style=\"width: 7cm; display: inline-block;\">Databases:<\/span> 2020<\/li>\n<\/ul>\n<p><!--\n\n\n<div style=\"display: flex;flex-wrap: wrap;\">\n\n\n<div style=\"width: 350px;\">Summer Term 2023:\n\n\n<ul>\n \t\n\n<li>Labor <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2023\/labor-qda\">Qualitative Datenanalyse<\/a><\/li>\n\n\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2022\/clojurekurs\">Clojure-Einf\u00fchrungskurs<\/a><\/li>\n\n\n<\/ul>\n\n\n<\/div>\n\n\n\n\n<div style=\"width: 350px;\">Winter Term 2022:\n\n\n<ul>\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ws2022-23\/ki\">K\u00fcnstliche Intelligenz<\/a><\/li>\n\n\n<\/ul>\n\n\n<\/div>\n\n\n\n\n<div style=\"width: 350px;\">Summer Term 2022:\n\n\n<ul>\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2022\/cda\">Conceptual Data Analysis \/ Begriffliche Datenanalyse <\/a><\/li>\n\n\n \t\n\n<li>Labor <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2022\/labor-qda\">Qualitative Datenanalyse<\/a><\/li>\n\n\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2022\/clojurekurs\">Clojure-Einf\u00fchrungskurs<\/a><\/li>\n\n\n<\/ul>\n\n\n<\/div>\n\n\n\n\n<div style=\"width: 350px;\">Winter Term 2021:\n\n\n<ul>\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ws2021-22\/kdd\">Knowledge Discovery<\/a><\/li>\n\n\n<\/ul>\n\n\n<\/div>\n\n\n\n\n<div style=\"width: 350px;\">Summer Term 2021:\n\n\n<ul>\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2021\/labor-qda\">Labor Conceptual Data Analysis<\/a><\/li>\n\n\n<\/ul>\n\n\n<\/div>\n\n\n\n\n<div style=\"width: 350px;\">Winter Term 2020:\n\n\n<ul>\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ws2020-21\/ln\">Labor Social Networks<\/a><\/li>\n\n\n<\/ul>\n\n\n<\/div>\n\n\n\n\n<div style=\"width: 350px;\">Summer Term 2020:\n\n\n<ul>\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2020\/datenbanken\">Datenbanken<\/a><\/li>\n\n\n<\/ul>\n\n\n<\/div>\n\n\n\n\n<div style=\"width: 350px;\">Winter Term 2019:\n\n\n<ul>\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ws2019-20\/clojurekurs\">Clojure-Kurs<\/a><\/li>\n\n\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ws2019-20\/labor-qda\">Labor Qualitative Datenanalyse<\/a><\/li>\n\n\n<\/ul>\n\n\n<\/div>\n\n\n\n\n<div style=\"width: 350px;\">Summer Term 2019:\n\n\n<ul>\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2019\/clojurekurs\">Clojure-Kurs<\/a><\/li>\n\n\n \t\n\n<li><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2019\/labor-qda\">Labor Qualitative Datenanalyse<\/a><\/li>\n\n\n<\/ul>\n\n\n<\/div>\n\n\n<\/div>\n\n\n--><\/p>\n<h2 id=\"projects\">Projects<\/h2>\n<p>Accompanying my theoretical research, there are two projects I mainly work for:<\/p>\n<h3>Conexp-Clj &#8212; A Research Tool for FCA<\/h3>\n<p>The research unit Knowledge &amp; Data Engineering continues the development of the research tool <a href=\"https:\/\/github.com\/tomhanika\/conexp-clj\" rel=\"attachment noopener wp-att-1732 noreferrer\" target=\"_blank\">conexp-clj<\/a>, originally created by <a href=\"https:\/\/github.com\/exot\">Dr. Daniel Borchmann<\/a>. The continuous enhancement of the software package is supervised by <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/hanika\">Dr. Tom Hanika<\/a>. Having such a tool at hand, the research group is able to test and analyze the theoretical research efforts in the realm of formal concept analysis and related fields. The most recent, pre-compiled, release candidate can be downloaded <a href=\"http:\/\/algebra20.de\/conexp-clj-2.0.0-RC1.jar\">here<\/a>.<br \/>\nA presentation of the tool can be found in <a href=\"http:\/\/ceur-ws.org\/Vol-2378\/shortAT8.pdf\">Conexp-Clj \u2013 A Research Tool for FCA<\/a><\/p>\n<h3><a href=\"http:\/\/www.bibsonomy.org\/\">BibSonomy<\/a><\/h3>\n<p><!--<center style=\"width:100%; height: 170px;\"><img class=\"project-img\" decoding=\"async\" loading=\"lazy\" src=\"https:\/\/www.kde.cs.uni-kassel.de\/wp-content\/uploads\/2023\/01\/bibsonomy.png\" alt=\"BibSonomy\" width=\"450px\" height=\"160px\"><\/center>--><\/p>\n<p>BibSonomy is a scholarly social bookmarking system where researchers manage their collections of publications and web pages. BibSonomy is an open source project, continously developed by researchers in Kassel, W\u00fcrzburg, and Hanover. Functioning as a test bed for recommendation and ranking algorithms, as well as through the publicly available datasets, containing traces of user behavior on the Web, BibSonomy has been the subject of various scientific studies.<\/p>\n<p><a href=\"http:\/\/bibsonomy.bitbucket.org\/\"><u><span style=\"color: #0066cc;\">About<\/span><\/u><\/a> <a href=\"http:\/\/www.bibsonomy.org\/\"><u><span style=\"color: #0066cc;\">BibSonomy<\/span><\/u><\/a>\u00a0<a href=\"http:\/\/blog.bibsonomy.org\/\"><u><span style=\"color: #0066cc;\">Blog<\/span><\/u><\/a>\u00a0<a href=\"https:\/\/bitbucket.org\/bibsonomy\/bibsonomy\/wiki\/Home\"><u><span style=\"color: #0066cc;\">Open Source Repo<\/span><\/u><\/a>\u00a0<a href=\"https:\/\/twitter.com\/BibSonomyCrew\"><u><span style=\"color: #0066cc;\">Twitter<\/span><\/u><\/a><\/p>\n<h3><a href=\"https:\/\/www.forschung-it-sicherheit-kommunikationssysteme.de\/projekte\/fairdienste\">FAIRDIENSTE<\/a><\/h3>\n<p>Im Projekt faire digitale Dienste: \u201eKo-Valuation in der Gestaltung daten\u00f6konomischer Gesch\u00e4ftsmodelle (FAIRDIENSTE)\u201c wird ein interdisziplin\u00e4rer Ansatz verfolgt, der sowohl soziologische als auch (wirtschafts-)informatische Aspekte beinhaltet. Es werden faire Gesch\u00e4ftsmodelle untersucht, die auf Kooperation und Wertevermittlung zielen.<br \/>\nEin Ziel der Arbeit ist die Weiterentwicklung informatischer Methoden zur qualitativen Datenanalyse, welche die an den Kundenschnittstellen digitaler Dienste auftretende Konfliktlandschaft transparent machen und die f\u00fcr Verbraucher*innen eine kritische Beurteilung verschiedener Wertgesichtspunkte erm\u00f6glichen soll.<\/p>\n<h3><a href=\"https:\/\/flow.sci-rec.org\/\">Interactive research topic flow web-application<\/a><\/h3>\n<p><center style=\"width: 100%; height: 310px;\"><img class=\"project-img\" decoding=\"async\" loading=\"lazy\" src=\"https:\/\/www.kde.cs.uni-kassel.de\/wp-content\/uploads\/2023\/01\/topic-flow.png\" alt=\"Research Topic Flow\" width=\"450px\" height=\"300px\" \/><\/center>We provide an interactive WebApp (<a href=\"https:\/\/flow.sci-rec.org\/\">Link<\/a>) accompanying our work on the Topic Flow Network, which enables us to study topic specific flow of expertise between scientific authors.<\/p>\n<p>Associated Papers:<\/p>\n<ul>\n<li>Sch\u00e4fermeier, B., Hirth, J., &amp; Hanika, T. (2022). Research topic flows in co-authorship networks. Scientometrics, 1-28.<\/li>\n<\/ul>\n<p><!--\n\n\n<h3>Conexp-Clj -- Scale-Exploration Standalone<\/h3>\n\n\nAccompanying our research on conceptual measurements, we implemented the exploration of scale-measures algorithm in <a href=\"https:\/\/github.com\/tomhanika\/conexp-clj\">conexp-cjl<\/a> and provided a <a href=\"https:\/\/github.com\/hirthjo\/scale-exploration\">standalone<\/a> (Ready for Use) version of the algorithm. Associated Papers:\n\n\n<ul>\n \t\n\n<li>Hanika, T., Hirth, J.: Quantifying the Conceptual Error in Dimensionality Reduction. 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).<\/li>\n\n\n \t\n\n<li>Hanika, T., Hirth, J.: Exploring Scale-Measures of Data Sets. 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).<\/li>\n\n\n \t\n\n<li>Hanika T., Hirth J.: <a href=\"http:\/\/arxiv.org\/abs\/2012.05267\">On the Lattice of Conceptual Measurements<\/a> <span>submitted.<\/span><\/li>\n\n\n<\/ul>\n\n\n--><\/p>\n<h2 id=\"Extracurricular\">Extracurricular Activities<\/h2>\n<h3><a href=\"href=\" https:=\"\" www=\"\" uni-kassel=\"\" de=\"\" uni=\"\" universitaet=\"\" profil=\"\" mint-hub=\"\" mint-an-der-uni-kassel=\"\" mint-woche-mint-meets-nachhaltigkeit=\"\">MINT Week<\/a> at University of Kassel<\/h3>\n<p>During the <a href=\"https:\/\/www.uni-kassel.de\/uni\/universitaet\/profil\/mint-hub\/mint-an-der-uni-kassel\/mint-woche-mint-meets-nachhaltigkeit\">MINT Week<\/a> 2023 at the University of Kassel we participated with a workshop on <a href=\"https:\/\/veranstaltungen.uni-kassel.de\/event\/scaleing-organizing-understanding-data\"><em>Which is better? Scale, organise and understand data properly.<\/em><\/a><\/p>\n<h3><a><\/a><a href=\"https:\/\/sfn-kassel.de\/aktuelles\/termine\/432\">100 Tage MINT<\/a><\/h3>\n<p>During the <a href=\"https:\/\/en.wikipedia.org\/wiki\/Documenta\">documenta<\/a> 2022, there is a 100 days of STEM event hosted by the <em>Sch\u00fclerforschungszentrum Nordhessen<\/em>, a research centre for students. We participated with a workshop on <em>Which is better? Scale, organise and understand data properly.<\/em><\/p>\n<h3>Supervision of Student Internships<\/h3>\n<p>I supervise an annual two-week student internship at the University of Kassel on simulating traffic using cellular automata (2016) and analyzing the twitter social network (2018 &#8212; 2023).<\/p>\n<h3>Teaching Programming in Clojure<\/h3>\n<p>Teaching an annual Clojure Programming Course (2019 &#8212; 2024).<\/p>\n<style>@media only screen and (max-width: 500px) {.project-img {display: none;} svg {display: none;}}<\/style>\n","protected":false},"excerpt":{"rendered":"<p>Dr. Johannes Hirth ist seit dem 31.10.2024 nicht mehr im Fachgebiet besch\u00e4ftigt. available for collaboration Dr. Johannes Hirth Raum 0443 Universit\u00e4t Kassel Fachbereich Elektrotechnik\/Informatik Fachgebiet Wissensverarbeitung Wilhelmsh\u00f6her Allee 73 34121 Kassel Tel.: +49 561 804-6350<a class=\"moretag\" href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/hirth\"> Read more&hellip;<\/a><\/p>\n","protected":false},"author":17,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-3928","page","type-page","status-publish","hentry"],"translation":{"provider":"WPGlobus","version":"3.0.2","language":"en","enabled_languages":["de","en"],"languages":{"de":{"title":true,"content":true,"excerpt":false},"en":{"title":true,"content":false,"excerpt":false}}},"_links":{"self":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/3928","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\/17"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/comments?post=3928"}],"version-history":[{"count":171,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/3928\/revisions"}],"predecessor-version":[{"id":10035,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/3928\/revisions\/10035"}],"wp:attachment":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/media?parent=3928"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}