TY - CHAP A1 - Liu, Haiming A1 - Frommholz, Ingo A1 - Song, Dawai A1 - Schmitt, Ingo T1 - The 8th Symposium on Future Directions in Information Access T2 - ICTIR '18, Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval, Tianjin, China, September 14 - 17, 2018 N2 - The 8th PhD Symposium on Future Directions in Information Access (FDIA) will be held in conjunction with the 8th International Conference on the Theory of Information Retrieval (ICTIR 2018) in Tianjin, China. The symposium aims to provide a forum for early stage researchers such as PhD students, to share their research and interact with each other and senior researchers in an informal and relaxed atmosphere. The symposium provides an excellent opportunity for the participants to promote their work and obtain experience in presenting and communicating their research. The participants will learn about different topics in the area of information access and retrieval, receive feedback on their work, meet lots of peers and hear inspiring talks. Y1 - 2018 SN - 978-1-4503-5656-5 U6 - https://doi.org/10.1145/3234944.3237193 SP - S. 5 PB - ACM CY - New York, NY ER - TY - BOOK A1 - Schmitt, Ingo A1 - Saake, Gunter A1 - Türker, Can T1 - Objektdatenbanken : Konzepte, Sprachen, Architekturen KW - Objektdatenbank Y1 - 2005 SN - 3-8266-0258-7 PB - Internat. Thomson Publ. CY - Bonn ER - TY - BOOK A1 - Schmitt, Ingo T1 - Schemaintegration für den Entwurf Föderierter Datenbanken KW - Datenbanken Y1 - 1998 SN - 3-89601-443-9 PB - Infix CY - Sankt Augustin ER - TY - CHAP A1 - Schmitt, Ingo A1 - Nürnberger, Andreas A1 - Lehrack, Sebastian ED - Seising, Rudolf T1 - On the Relation between Fuzzy and Quantum Logic T2 - Views on Fuzzy Sets and Systems from Different Perspectives Y1 - 2009 SN - 978-3-540-93801-9 SP - 417 EP - 438 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Schmitt, Ingo A1 - Hentschel, Christian A1 - Nürnberger, Andreas A1 - Stober, S. T1 - SAFIRE: Towards Standardized Semantic Rich Image Annotation T2 - Adaptive multimedia retrieval, user, context, and feedback, 4th international workshop, AMR 2006, Geneva, Switzerland, July, 27 - 28, 2006 Y1 - 2007 SN - 978-3-540-71544-3 SP - 12 EP - 27 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Schmitt, Ingo T1 - Multimedia Information Retrieval - Ein kurzer Überblick. Y1 - 2007 ER - TY - CHAP A1 - Giurca, Adrian A1 - Schmitt, Ingo A1 - Baier, Daniel T1 - Performing Conjoint Analysis within a Logic-based Framework T2 - 2011 Federated Conference on Computer Science and Information Systems (FedCSIS 2011), Szczecin, Poland, 18 - 21 September 2011 Y1 - 2011 SN - 978-1-457-70041-5 SP - 261 EP - 268 PB - IEEE CY - Piscataway, NJ ER - TY - GEN A1 - Schmitt, Ingo A1 - Zellhöfer, David T1 - Interaktives Information-Retrieval auf der Basis der Polyrepräsentation T2 - Informatik Spektrum Y1 - 2011 SN - 0170-6012 VL - 33 IS - 3 SP - 183 EP - 194 ER - TY - CHAP A1 - Schmitt, Ingo A1 - Baier, Daniel ED - Lausen, Berthold ED - Poel, Dirk van den ED - Ultsch, Alfred T1 - Logic Based Conjoint Analysis Using the Commuting Quantum Query Language T2 - Algorithms from and for Nature and Life: Classification and Data Analysis Y1 - 2013 UR - http://www.springer.com/statistics/computational+statistics/book/978-3-319-00034-3 SN - 978-3-319-00035-0 SP - 481 EP - 490 PB - Springer CY - Heidelberg-Berlin ER - TY - CHAP A1 - Zierenberg, Marcel A1 - Schmitt, Ingo ED - Amato, Giuseppe ED - Connor, Richard ED - Falchi, Fabrizio ED - Gennaro, Claudio T1 - Optimizing the Distance Computation Order of Multi-Feature Similarity Search Indexing T2 - Similarity Search and Applications - 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015, Proceedings N2 - Multi-feature search is an effective approach to similarity search. Unfortunately, the search efficiency decreases with the number of features. Several indexing approaches aim to achieve efficiency by incrementally reducing the approximation error of aggregated distance bounds. They apply heuristics to determine the distance computations order and update the object's aggregated bounds after each computation. However, the existing indexing approaches suffer from several drawbacks. They use the same computation order for all objects, do not support important types of aggregation functions and do not take the varying CPU and I/O costs of different distance computations into account. To resolve these problems, we introduce a new heuristic to determine an efficient distance computation order for each individual object. Our heuristic supports various important aggregation functions and calculates cost-benefit-ratios to incorporate the varying computation costs of different distance functions. The experimental evaluation reveals that our heuristic outperforms state-of-the-art approaches in terms of the number of distance computations as well as search time. KW - combination of features KW - multi-feature search KW - metric indexing KW - nearest neighbor Y1 - 2015 UR - http://link.springer.com/chapter/10.1007/978-3-319-25087-8_8 SN - 978-3-319-25087-8 U6 - https://doi.org/10.1007/978-3-319-25087-8_8 SP - 90 EP - 96 ER - TY - CHAP A1 - Zellhöfer, David A1 - Böttcher, Thomas A1 - Bertram, Maria A1 - Schmidt, Christoph A1 - Tillmann, Claudius A1 - Uhlig, Markus A1 - Zierenberg, Marcel A1 - Schmitt, Ingo ED - Markl, Volker ED - Saake, Gunter ED - Sattler, Kai-Uwe ED - Hackenbroich, Gregor ED - Mitschang, Bernhard ED - Härder, Theo ED - Köppen, Veit T1 - PythiaSearch - Interaktives, Multimodales Multimedia-Retrieval T2 - Datenbanksysteme für Business, Technologie und Web (BTW), Proceedings der 15. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS), 2013, Magdeburg, Deutschland. N2 - PythiaSearch ist ein interaktives Multimedia-Retrieval-System. Es vereint verschiedene Suchstrategien, diverse Visualisierungen und erlaubt eine Personalisierung der Retrieval-Ergebnisse mittels eines Präferenz-basierten Relevance Feedbacks. Das System nutzt die probabilistische Anfragesprache CQQL und erlaubt eine multi-modale Anfragedefinition basierend auf Bildern, Texten oder Metadaten. Y1 - 2013 UR - http://subs.emis.de/LNI/Proceedings/Proceedings214/article6881.html UR - http://subs.emis.de/LNI/Proceedings/Proceedings214/495.pdf SN - 978-3-88579-608-4 SP - 495 EP - 498 PB - Gesellschaft für Informatik CY - Bonn ER - TY - CHAP A1 - Schmitt, Ingo A1 - Römer, Ronald A1 - Wirsching, Günther A1 - Wolff, Matthias ED - Trouvain, Jürgen ED - Steiner, Ingmar ED - Möbius, Bernd T1 - Semantische Repräsentation strukturierter Objekte im Hilbertraum und deren Verarbeitung nach quantenmechanischen Formalismen T2 - Tagungsband der 28. Konferenz Elektronische Sprachsignalverarbeitung (ESSV), 15.-17.03.2017, Saarbrücken Y1 - 2017 SN - 978-3-95908-094-1 SP - 270 EP - 277 PB - TUDpress CY - Dresden ER - TY - CHAP A1 - Schmitt, Ingo ED - Jokisch, Oliver T1 - Informationsdarstellung nach den Gesetzen der Quantenmechanik- und logik T2 - Elektronische Sprachsignalverarbeitung 2016, Tagungsband der 27. Konferenz, Leipzig, 2.-4. März 2016 N2 - Die 27. Konferenz "Elektronische Sprachsignalverarbeitung" ist der Sprach- und Audiosignalverarbeitung sowie angrenzenden Disziplinen in einer großen Breite gewidmet. Die ESSV 2016 bleibt der Tradition der Konferenzreihe verpflichtet und schlägt eine Brücke zwischen Forschung und Anwendung. Der vorliegende Tagungsband enthält 38 Beiträge von 95 Autorinnen und Autoren zu folgenden Themengruppen: Kognitive Systeme; Fremdspracherwerb, Dialekt- und Korpusanalyse; Spracherkennung und Dialogsysteme; Phonetik und Prosodie; Sprachproduktion, Therapie und Diagnostik; Sprechercharakteristik und Stimmanalyse; Audio- und Sprachkodierung, Sprachqualität; Musikanalyse, Sensorik und Signalverarbeitung. Die drei Hauptvorträge von Dietrich Dörner, Ingo Schmitt und Dirk Labudde beschäftigen sich mit künstlicher Intelligenz, Quantencomputing sowie forensischer Text- und Datenanalyse. Y1 - 2016 SN - 978-3-95908-040-8 SP - S. 13 PB - TUDpress CY - Dresden ER - TY - GEN A1 - Klimczak, Peter A1 - Hofstedt, Petra A1 - Schmitt, Ingo A1 - Petersen, Christer T1 - Computergestützte Methoden der Interpretation. Perspektiven einer digitalen Medienwissenschaft T2 - Workshop INF-DH-2018 N2 - Zwar hat sich die elektronische Datenverarbeitung etwa im Rahmen der Archivierung, der Kategorisierung und der Suche von bzw. in Texten allgemein durchgesetzt, allerdings können deren Verfahren bisher nur bedingt auf eine Ebene des Textverständnisses vordringen. Es existieren keine Algorithmen, die menschliche Interpretation auf Subtextebene zufriedenstellend imitieren könnten. Unter Subtext wird hier eine Bedeutungsebene verstanden, die der expliziten Aussage eines Textes als zusätzliche Ausdrucksdimension unterlegt ist. Von Seiten der Computerphilologie sind bisher einzig Textanalyse und -interpretation unterstützende Verfahren entwickelt worden, die lediglich auf der Sprachoberfläche Anwendung finden (Jannidis, 2010). Von Seiten der Computerlinguistik und der Informatik existieren hingegen Text-Retrieval-Systeme, die den groben Inhalt von Texten erfassen (Manning et al., 2008). Dabei erfolgt jedoch keine ‚echte‘ Interpretation, die die impliziten Aussagen des Textes erfassen und damit die Ableitung neuen Wissens ermöglichen könnte. Aufbauend auf der 2016 vorgestellten formalen Subtextanalyse (Klimczak, 2016) erscheint aber ein algorithmisiertes Verfahren zur Rekonstruktion von komplexen Semantiken narrativer Gebrauchstexte möglich, welches die bestehenden Verfahren sowohl der Computerphilologie als auch der Computerlinguistik qualitativ übertreffen könnte, indem es hermeneutische Zugänge für informationstechnische Forschung erschließt. KW - Interpretation KW - Interdisziplinarität KW - Medienwissenschaft KW - Subtextanalyse KW - Narrativik KW - Hermeneutik KW - Semantik KW - Semiotik Y1 - 2018 U6 - https://doi.org/10.18420/infdh2018-06 PB - Gesellschaft für Informatik e.V. CY - Bonn ER - TY - CHAP A1 - Schmitt, Ingo A1 - Wirsching, Günther A1 - Wolff, Matthias ED - Khrennikov, Andrei ED - Melucci, Massimo ED - Bourama, Toni T1 - Quantum-Based Modelling of Database States T2 - Quantum-Like Models for Information Retrieval and Decision-Making Y1 - 2019 UR - https://www.springer.com/de/book/9783030259129 SN - 978-3-030-25912-9 SN - 978-3-030-25913-6 U6 - https://doi.org/10.1007/978-3-030-25913-6 SP - 115 EP - 127 PB - Springer Nature Switzerland AG, Springer International Publishing CY - Cham ET - 1. Auflage ER - TY - GEN A1 - Römer, Ronald A1 - beim Graben, Peter A1 - Huber, Markus A1 - Wolff, Matthias A1 - Wirsching, Günther A1 - Schmitt, Ingo T1 - Behavioral Control of Cognitive Agents Using Database Semantics and Minimalist Grammars T2 - Proceedings 10th IEEE International Conference on Cognitive Infocommunications, CogInfoCom 2019, Oct. 23-25 Y1 - 2019 SN - 978-1-7281-4793-2 SN - 978-1-7281-4792-5 U6 - https://doi.org/10.1109/CogInfoCom47531.2019.9089947 SN - 2380-7350 SP - 73 EP - 78 CY - Naples, Italy ER - TY - GEN A1 - Saha, Sanjit Kumar A1 - Schmitt, Ingo T1 - Non-TI Clustering in the Context of Social Networks T2 - Procedia Computer Science : The 11th International Conference on Ambient Systems, Networks and Technologies (ANT) / The 3rd International Conference on Emerging Data and Industry 4.0 (EDI40) / Affiliated Workshops N2 - Traditional clustering algorithms like K-medoids and DBSCAN take distances between objects as input and find clusters of objects. Distance functions need to satisfy the triangle inequality (TI) property, but sometimes TI is violated and, thus, may compromise the quality of resulting clusters. However, there are scenarios, for example in the context of social networks, where TI does not hold but a meaningful clustering is still possible. This paper investigates the consequences of TI violation with respect to different traditional clustering techniques and presents instead a clique guided approach to find meaningful clusters. In this paper, we use the quantum logic-based query language (CQQL) to measure the similarity value between objects instead of a distance function. The contribution of this paper is to propose an approach of non-TI clustering in the context of social network scenario. KW - Clustering KW - Social Network KW - Clique KW - Triangle Inequality Y1 - 2020 U6 - https://doi.org/10.1016/j.procs.2020.03.031 SN - 1877-0509 VL - 170 SP - 1186 EP - 1191 ER - TY - GEN A1 - Schmitt, Ingo A1 - Wang, Dongsheng A1 - Tiwari, Prayaq A1 - Shorfuzzaman, Mohammad T1 - Deep neural learning on weighted datasets utilizing label disagreement from crowdsourcing T2 - Computer Networks N2 - Experts and crowds can work together to generate high-quality datasets, but such collaboration is limited to a large-scale pool of data. In other words, training on a large-scale dataset depends more on crowdsourced datasets with aggregated labels than expert intensively checked labels. However, the limited amount of high-quality dataset can be used as an objective test dataset to build a connection between disagreement and aggregated labels. In this paper, we claim that the disagreement behind an aggregated label indicates more semantics (e.g. ambiguity or difficulty) of an instance than just spam or error assessment. We attempt to take advantage of the informativeness of disagreement to assist learning neural networks by computing a series of disagreement measurements and incorporating disagreement with distinct mechanisms. Experiments on two datasets demonstrate that the consideration of disagreement, treating training instances differently, can promisingly result in improved performance. KW - Neural networks KW - Assessed dataset KW - Instance weight Y1 - 2021 U6 - https://doi.org/10.1016/j.comnet.2021.108227 SN - 1389-1286 VL - 196 ER - TY - GEN A1 - Schmitt, Ingo T1 - QLDT+: Efficient Construction of a Quantum Logic Decision Tree T2 - ICMLT '23: Proceedings of the 2023 8th International Conference on Machine Learning Technologies, SESSION: Session 2 - Data Model Design and Algorithm Analysis N2 - The quantum-logic inspired decision tree (QLDT) is based on quantum logic concepts and input values from the unit interval whereas the traditional decision tree is based on Boolean values. The logic behind the QLDT obeys the rules of a Boolean algebra. The QLDT is appropriate for classification problems where for a class decision several input values interact gradually with each other. The QLDT construction for a classification problem with n input attributes requires the computation of 2n minterms. The QLDT+ method, however, uses a heuristic for obtaining a QLDT with much smaller computational complexity. As result, the QLDT+ method can be applied to classification problems with a higher number of input attributes. Y1 - 2023 UR - https://dl.acm.org/doi/proceedings/10.1145/3589883 SN - 978-1-4503-9832-9 U6 - https://doi.org/10.1145/3589883.3589895 SP - 82 EP - 88 PB - Association for Computing Machinery CY - New York, NY, United States ER - TY - CHAP A1 - Wolff, Matthias A1 - Huber, Markus A1 - Wirsching, Günther A1 - Römer, Ronald A1 - Beim Graben, Peter A1 - Schmitt, Ingo T1 - Towards a Quantum Mechanical Model of the Inner Stage of Cognitive Agents T2 - 9th IEEE International Conference on Cognitive Infocommunications (CogInfoCom 2018), proceedings, Aug. 22-24, 2018, Budapest, Hungary N2 - We present a model, inspired by quantum field theory, of the so-called inner stage of technical cognitive agents. The inner stage represents all knowledge of the agent. It allows for planning of actions and for higher cognitive functions like coping and fantasy. By the example of a cognitive mouse agent living in a maze wold, we discuss learning, action planning, and attention in a fully deterministic setting and assuming a totally observable world. We explain the relevance of our approach to cognitive infocommunications. KW - cognitive systems KW - cognitive agents KW - quantum field theory KW - machine learning KW - inner stage KW - veridicality KW - attention modeling KW - ontology inference Y1 - 2018 UR - https://ieeexplore.ieee.org/document/8639892 SN - 978-1-5386-7094-1 U6 - https://doi.org/10.1109/CogInfoCom.2018.8639892 N1 - Best Paper Award SP - 147 EP - 152 PB - IEEE CY - Piscataway, NJ ER -