@inproceedings{LiuFrommholzSongetal., author = {Liu, Haiming and Frommholz, Ingo and Song, Dawai and Schmitt, Ingo}, title = {The 8th Symposium on Future Directions in Information Access}, series = {ICTIR '18, Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval, Tianjin, China, September 14 - 17, 2018}, booktitle = {ICTIR '18, Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval, Tianjin, China, September 14 - 17, 2018}, publisher = {ACM}, address = {New York, NY}, isbn = {978-1-4503-5656-5}, doi = {10.1145/3234944.3237193}, pages = {S. 5}, abstract = {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.}, language = {en} } @book{SchmittSaakeTuerker, author = {Schmitt, Ingo and Saake, Gunter and T{\"u}rker, Can}, title = {Objektdatenbanken : Konzepte, Sprachen, Architekturen}, publisher = {Internat. Thomson Publ.}, address = {Bonn}, isbn = {3-8266-0258-7}, pages = {XVIII, 646}, language = {de} } @book{Schmitt, author = {Schmitt, Ingo}, title = {Schemaintegration f{\"u}r den Entwurf F{\"o}derierter Datenbanken}, publisher = {Infix}, address = {Sankt Augustin}, isbn = {3-89601-443-9}, pages = {XIV, 297}, language = {de} } @incollection{SchmittNuernbergerLehrack, author = {Schmitt, Ingo and N{\"u}rnberger, Andreas and Lehrack, Sebastian}, title = {On the Relation between Fuzzy and Quantum Logic}, series = {Views on Fuzzy Sets and Systems from Different Perspectives}, booktitle = {Views on Fuzzy Sets and Systems from Different Perspectives}, editor = {Seising, Rudolf}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {978-3-540-93801-9}, pages = {417 -- 438}, language = {en} } @inproceedings{SchmittHentschelNuernbergeretal., author = {Schmitt, Ingo and Hentschel, Christian and N{\"u}rnberger, Andreas and Stober, S.}, title = {SAFIRE: Towards Standardized Semantic Rich Image Annotation}, series = {Adaptive multimedia retrieval, user, context, and feedback, 4th international workshop, AMR 2006, Geneva, Switzerland, July, 27 - 28, 2006}, booktitle = {Adaptive multimedia retrieval, user, context, and feedback, 4th international workshop, AMR 2006, Geneva, Switzerland, July, 27 - 28, 2006}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {978-3-540-71544-3}, pages = {12 -- 27}, language = {en} } @inproceedings{Schmitt, author = {Schmitt, Ingo}, title = {Multimedia Information Retrieval - Ein kurzer {\"U}berblick.}, language = {de} } @inproceedings{GiurcaSchmittBaier, author = {Giurca, Adrian and Schmitt, Ingo and Baier, Daniel}, title = {Performing Conjoint Analysis within a Logic-based Framework}, series = {2011 Federated Conference on Computer Science and Information Systems (FedCSIS 2011), Szczecin, Poland, 18 - 21 September 2011}, booktitle = {2011 Federated Conference on Computer Science and Information Systems (FedCSIS 2011), Szczecin, Poland, 18 - 21 September 2011}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-457-70041-5}, pages = {261 -- 268}, language = {en} } @misc{SchmittZellhoefer, author = {Schmitt, Ingo and Zellh{\"o}fer, David}, title = {Interaktives Information-Retrieval auf der Basis der Polyrepr{\"a}sentation}, series = {Informatik Spektrum}, volume = {33}, journal = {Informatik Spektrum}, number = {3}, issn = {0170-6012}, pages = {183 -- 194}, language = {de} } @incollection{SchmittBaier, author = {Schmitt, Ingo and Baier, Daniel}, title = {Logic Based Conjoint Analysis Using the Commuting Quantum Query Language}, series = {Algorithms from and for Nature and Life: Classification and Data Analysis}, booktitle = {Algorithms from and for Nature and Life: Classification and Data Analysis}, editor = {Lausen, Berthold and Poel, Dirk van den and Ultsch, Alfred}, publisher = {Springer}, address = {Heidelberg-Berlin}, isbn = {978-3-319-00035-0}, pages = {481 -- 490}, language = {en} } @inproceedings{ZierenbergSchmitt, author = {Zierenberg, Marcel and Schmitt, Ingo}, title = {Optimizing the Distance Computation Order of Multi-Feature Similarity Search Indexing}, series = {Similarity Search and Applications - 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015, Proceedings}, booktitle = {Similarity Search and Applications - 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015, Proceedings}, editor = {Amato, Giuseppe and Connor, Richard and Falchi, Fabrizio and Gennaro, Claudio}, isbn = {978-3-319-25087-8}, doi = {10.1007/978-3-319-25087-8_8}, pages = {90 -- 96}, abstract = {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.}, language = {en} } @inproceedings{ZellhoeferBoettcherBertrametal., author = {Zellh{\"o}fer, David and B{\"o}ttcher, Thomas and Bertram, Maria and Schmidt, Christoph and Tillmann, Claudius and Uhlig, Markus and Zierenberg, Marcel and Schmitt, Ingo}, title = {PythiaSearch - Interaktives, Multimodales Multimedia-Retrieval}, series = {Datenbanksysteme f{\"u}r Business, Technologie und Web (BTW), Proceedings der 15. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS), 2013, Magdeburg, Deutschland.}, booktitle = {Datenbanksysteme f{\"u}r Business, Technologie und Web (BTW), Proceedings der 15. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS), 2013, Magdeburg, Deutschland.}, editor = {Markl, Volker and Saake, Gunter and Sattler, Kai-Uwe and Hackenbroich, Gregor and Mitschang, Bernhard and H{\"a}rder, Theo and K{\"o}ppen, Veit}, publisher = {Gesellschaft f{\"u}r Informatik}, address = {Bonn}, isbn = {978-3-88579-608-4}, pages = {495 -- 498}, abstract = {PythiaSearch ist ein interaktives Multimedia-Retrieval-System. Es vereint verschiedene Suchstrategien, diverse Visualisierungen und erlaubt eine Personalisierung der Retrieval-Ergebnisse mittels eines Pr{\"a}ferenz-basierten Relevance Feedbacks. Das System nutzt die probabilistische Anfragesprache CQQL und erlaubt eine multi-modale Anfragedefinition basierend auf Bildern, Texten oder Metadaten.}, language = {de} } @inproceedings{SchmittRoemerWirschingetal., author = {Schmitt, Ingo and R{\"o}mer, Ronald and Wirsching, G{\"u}nther and Wolff, Matthias}, title = {Semantische Repr{\"a}sentation strukturierter Objekte im Hilbertraum und deren Verarbeitung nach quantenmechanischen Formalismen}, series = {Tagungsband der 28. Konferenz Elektronische Sprachsignalverarbeitung (ESSV), 15.-17.03.2017, Saarbr{\"u}cken}, booktitle = {Tagungsband der 28. Konferenz Elektronische Sprachsignalverarbeitung (ESSV), 15.-17.03.2017, Saarbr{\"u}cken}, editor = {Trouvain, J{\"u}rgen and Steiner, Ingmar and M{\"o}bius, Bernd}, publisher = {TUDpress}, address = {Dresden}, isbn = {978-3-95908-094-1}, pages = {270 -- 277}, language = {de} } @inproceedings{Schmitt, author = {Schmitt, Ingo}, title = {Informationsdarstellung nach den Gesetzen der Quantenmechanik- und logik}, series = {Elektronische Sprachsignalverarbeitung 2016, Tagungsband der 27. Konferenz, Leipzig, 2.-4. M{\"a}rz 2016}, booktitle = {Elektronische Sprachsignalverarbeitung 2016, Tagungsband der 27. Konferenz, Leipzig, 2.-4. M{\"a}rz 2016}, editor = {Jokisch, Oliver}, publisher = {TUDpress}, address = {Dresden}, isbn = {978-3-95908-040-8}, pages = {S. 13}, abstract = {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{\"a}gt eine Br{\"u}cke zwischen Forschung und Anwendung. Der vorliegende Tagungsband enth{\"a}lt 38 Beitr{\"a}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{\"a}t; Musikanalyse, Sensorik und Signalverarbeitung. Die drei Hauptvortr{\"a}ge von Dietrich D{\"o}rner, Ingo Schmitt und Dirk Labudde besch{\"a}ftigen sich mit k{\"u}nstlicher Intelligenz, Quantencomputing sowie forensischer Text- und Datenanalyse.}, language = {de} } @misc{KlimczakHofstedtSchmittetal., author = {Klimczak, Peter and Hofstedt, Petra and Schmitt, Ingo and Petersen, Christer}, title = {Computergest{\"u}tzte Methoden der Interpretation. Perspektiven einer digitalen Medienwissenschaft}, series = {Workshop INF-DH-2018}, journal = {Workshop INF-DH-2018}, publisher = {Gesellschaft f{\"u}r Informatik e.V.}, address = {Bonn}, doi = {10.18420/infdh2018-06}, pages = {10}, abstract = {Zwar hat sich die elektronische Datenverarbeitung etwa im Rahmen der Archivierung, der Kategorisierung und der Suche von bzw. in Texten allgemein durchgesetzt, allerdings k{\"o}nnen deren Verfahren bisher nur bedingt auf eine Ebene des Textverst{\"a}ndnisses vordringen. Es existieren keine Algorithmen, die menschliche Interpretation auf Subtextebene zufriedenstellend imitieren k{\"o}nnten. Unter Subtext wird hier eine Bedeutungsebene verstanden, die der expliziten Aussage eines Textes als zus{\"a}tzliche Ausdrucksdimension unterlegt ist. Von Seiten der Computerphilologie sind bisher einzig Textanalyse und -interpretation unterst{\"u}tzende Verfahren entwickelt worden, die lediglich auf der Sprachoberfl{\"a}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{\"o}glichen k{\"o}nnte. Aufbauend auf der 2016 vorgestellten formalen Subtextanalyse (Klimczak, 2016) erscheint aber ein algorithmisiertes Verfahren zur Rekonstruktion von komplexen Semantiken narrativer Gebrauchstexte m{\"o}glich, welches die bestehenden Verfahren sowohl der Computerphilologie als auch der Computerlinguistik qualitativ {\"u}bertreffen k{\"o}nnte, indem es hermeneutische Zug{\"a}nge f{\"u}r informationstechnische Forschung erschließt.}, language = {de} } @incollection{SchmittWirschingWolff, author = {Schmitt, Ingo and Wirsching, G{\"u}nther and Wolff, Matthias}, title = {Quantum-Based Modelling of Database States}, series = {Quantum-Like Models for Information Retrieval and Decision-Making}, booktitle = {Quantum-Like Models for Information Retrieval and Decision-Making}, editor = {Khrennikov, Andrei and Melucci, Massimo and Bourama, Toni}, edition = {1. Auflage}, publisher = {Springer Nature Switzerland AG, Springer International Publishing}, address = {Cham}, isbn = {978-3-030-25912-9}, doi = {10.1007/978-3-030-25913-6}, pages = {115 -- 127}, language = {en} } @misc{RoemerbeimGrabenHuberetal., author = {R{\"o}mer, Ronald and beim Graben, Peter and Huber, Markus and Wolff, Matthias and Wirsching, G{\"u}nther and Schmitt, Ingo}, title = {Behavioral Control of Cognitive Agents Using Database Semantics and Minimalist Grammars}, series = {Proceedings 10th IEEE International Conference on Cognitive Infocommunications, CogInfoCom 2019, Oct. 23-25}, journal = {Proceedings 10th IEEE International Conference on Cognitive Infocommunications, CogInfoCom 2019, Oct. 23-25}, address = {Naples, Italy}, isbn = {978-1-7281-4793-2}, issn = {2380-7350}, doi = {10.1109/CogInfoCom47531.2019.9089947}, pages = {73 -- 78}, language = {en} } @misc{SahaSchmitt, author = {Saha, Sanjit Kumar and Schmitt, Ingo}, title = {Non-TI Clustering in the Context of Social Networks}, series = {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}, volume = {170}, journal = {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}, issn = {1877-0509}, doi = {10.1016/j.procs.2020.03.031}, pages = {1186 -- 1191}, abstract = {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.}, language = {en} } @misc{SchmittWangTiwarietal., author = {Schmitt, Ingo and Wang, Dongsheng and Tiwari, Prayaq and Shorfuzzaman, Mohammad}, title = {Deep neural learning on weighted datasets utilizing label disagreement from crowdsourcing}, series = {Computer Networks}, volume = {196}, journal = {Computer Networks}, issn = {1389-1286}, doi = {10.1016/j.comnet.2021.108227}, pages = {7}, abstract = {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.}, language = {en} } @misc{Schmitt, author = {Schmitt, Ingo}, title = {QLDT+: Efficient Construction of a Quantum Logic Decision Tree}, series = {ICMLT '23: Proceedings of the 2023 8th International Conference on Machine Learning Technologies, SESSION: Session 2 - Data Model Design and Algorithm Analysis}, journal = {ICMLT '23: Proceedings of the 2023 8th International Conference on Machine Learning Technologies, SESSION: Session 2 - Data Model Design and Algorithm Analysis}, publisher = {Association for Computing Machinery}, address = {New York, NY, United States}, isbn = {978-1-4503-9832-9}, doi = {10.1145/3589883.3589895}, pages = {82 -- 88}, abstract = {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.}, language = {en} } @inproceedings{WolffHuberWirschingetal., author = {Wolff, Matthias and Huber, Markus and Wirsching, G{\"u}nther and R{\"o}mer, Ronald and Beim Graben, Peter and Schmitt, Ingo}, title = {Towards a Quantum Mechanical Model of the Inner Stage of Cognitive Agents}, series = {9th IEEE International Conference on Cognitive Infocommunications (CogInfoCom 2018), proceedings, Aug. 22-24, 2018, Budapest, Hungary}, booktitle = {9th IEEE International Conference on Cognitive Infocommunications (CogInfoCom 2018), proceedings, Aug. 22-24, 2018, Budapest, Hungary}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-5386-7094-1}, doi = {10.1109/CogInfoCom.2018.8639892}, pages = {147 -- 152}, abstract = {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.}, language = {en} } @inproceedings{WolffWirschingHuberetal., author = {Wolff, Matthias and Wirsching, G{\"u}nther and Huber, Markus and Beim Graben, Peter and R{\"o}mer, Ronald and Schmitt, Ingo}, title = {A Fock Space Toolbox and Some Applications in Computational Cognition}, series = {Speech and computer : 20th International Conference, SPECOM 2018, Leipzig, Germany, September 18-22, 2018, proceedings}, booktitle = {Speech and computer : 20th International Conference, SPECOM 2018, Leipzig, Germany, September 18-22, 2018, proceedings}, editor = {Karpov, Alexey and Jokisch, Oliver and Potapova, Rodmonga}, publisher = {Springer International Publishing}, address = {Cham}, isbn = {978-3-319-99578-6}, doi = {10.1007/978-3-319-99579-3}, abstract = {We present a Matlab toolbox, called "FockBox", handling Fock spaces and objects associated with Fock spaces: scalars, ket and bra vectors, and linear operators. We give brief application examples from computational linguistics, semantics processing, and quantum logic,demonstrating the use of the toolbox.}, language = {en} } @inproceedings{BeimGrabenHuberRoemeretal., author = {Beim Graben, Peter and Huber, Markus and R{\"o}mer, Ronald and Schmitt, Ingo and Wolff, Matthias}, title = {Der Fockraum als Labyrinth: Wissensrepr{\"a}sentation und Probleml{\"o}sungen am Beispiel des Mouse-Maze-Problems}, series = {Elektronische Sprachsignalverarbeitung, Tagungsband der 29. Konferenz, Ulm, 7.-9. M{\"a}rz 2018}, booktitle = {Elektronische Sprachsignalverarbeitung, Tagungsband der 29. Konferenz, Ulm, 7.-9. M{\"a}rz 2018}, editor = {Berton, Andr{\´e} and Haiber, Udo and Minker, Wolfgang}, publisher = {TUDpress}, address = {Dresden}, isbn = {978-3-95908-128-3}, pages = {167 -- 174}, language = {de} } @inproceedings{SchmittRoemerWirschingetal., author = {Schmitt, Ingo and R{\"o}mer, Ronald and Wirsching, G{\"u}nther and Wolff, Matthias}, title = {Denormalized Quantum Density Operators for Encoding Semantic Uncertainty in Cognitive Agents}, series = {8th IEEE International Conference on Cognitive Infocommunications CogInfoCom 2017 Proceedings, September 11-14, 2017 Debrecen, Hungary}, booktitle = {8th IEEE International Conference on Cognitive Infocommunications CogInfoCom 2017 Proceedings, September 11-14, 2017 Debrecen, Hungary}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-5386-1264-4}, pages = {165 -- 170}, language = {en} } @inproceedings{GiurcaBaierSchmitt, author = {Giurca, Adrian and Baier, Daniel and Schmitt, Ingo}, title = {What is in a Like? : Preference Aggregation on the Social Web}, series = {Data Science, Learning by Latent Structures, and Knowledge Discovery}, booktitle = {Data Science, Learning by Latent Structures, and Knowledge Discovery}, editor = {Lausen, Berthold and Krolak-Schwerdt, Sabine and B{\"o}hmer, Matthias}, publisher = {Springer}, address = {Heidelberg}, isbn = {978-3-662-44982-0}, doi = {10.1007/978-3-662-44983-7_38}, pages = {435 -- 444}, language = {en} } @book{Schmitt, author = {Schmitt, Ingo}, title = {{\"A}hnlichkeitssuche in Multimedia-Datenbanken : Retrival, Suchalgorithmen und Anfragebehandlung}, publisher = {Oldenbourg}, address = {M{\"u}nchen}, isbn = {978-3-486-57907-9}, pages = {445}, language = {de} } @misc{SahaSchmitt, author = {Saha, Sanjit Kumar and Schmitt, Ingo}, title = {Quantitative Weighting Approach for Non-TI Clustering}, series = {Procedia Computer Science}, volume = {184}, journal = {Procedia Computer Science}, issn = {1877-0509}, doi = {10.1016/j.procs.2021.03.119}, pages = {966 -- 971}, abstract = {To enable users to influence clusters of a social network by their external feedback, we present an adaptive clustering-based quantitative weighting approach. Intrinsically, Persons in a social network are connected and their homogeneity is reflected based on the similarity of their attributes. But all attributes do not have the same influence on the network and thus may affect to form the network and compromise the quality of resulting clusters. The introduced weighting approach is completely embedded in logic and has the capability of assigning query weights to atomic conditions in user interaction. Hence, the presented system supports users by offering an intuitive feedback formulation without deeper knowledge of the underlying attributes of objects. Experiments demonstrate the benefits of our approach.}, language = {en} } @inproceedings{SchmittNuernberger, author = {Schmitt, Ingo and N{\"u}rnberger, Andreas}, title = {Image Database Search using Fuzzy and Quantum Logic}, series = {IEEE International Fuzzy Systems Conference, 2007, FUZZ-IEEE 2007, 23 - 26 July 2007, London, United Kingdom}, booktitle = {IEEE International Fuzzy Systems Conference, 2007, FUZZ-IEEE 2007, 23 - 26 July 2007, London, United Kingdom}, publisher = {IEEE Service Center}, address = {Piscataway, NJ}, isbn = {1-4244-1209-9}, pages = {1 -- 6}, language = {en} } @misc{Schmitt, author = {Schmitt, Ingo}, title = {QLDT: A Decision Tree Based on Quantum Logic}, series = {New Trends in Database and Information Systems. ADBIS 2022}, journal = {New Trends in Database and Information Systems. ADBIS 2022}, publisher = {Springer}, address = {Switzerland}, isbn = {978-3-031-15743-1}, doi = {10.1007/978-3-031-15743-1_28}, pages = {299 -- 308}, abstract = {Besides a good prediction a classifier is to give an explanation how input data is related to the classification result. Decision trees are very popular classifiers and provide a good trade-off between accuracy and explainability for many scenarios. Its split decisions correspond to Boolean conditions on single attributes. In cases when for a class decision several attribute values interact gradually with each other, Boolean-logic-based decision trees are not appropriate. For such cases we propose a quantum-logic inspired decision tree (QLDT) which is based on sums and products on normalized attribute values. In contrast to decision trees based on fuzzy logic a QLDT obeys the rules of the Boolean algebra.}, language = {en} } @misc{Schmitt, author = {Schmitt, Ingo}, title = {QLC: A Quantum-Logic-inspired Classifier}, series = {IDEAS '22: Proceedings of the 26th International Database Engineered Applications Symposium}, journal = {IDEAS '22: Proceedings of the 26th International Database Engineered Applications Symposium}, publisher = {Association of Computing Machinery}, address = {New York}, isbn = {9781450397094}, doi = {10.1145/3548785.3548790}, pages = {120 -- 127}, abstract = {Besides a good prediction a classifier is to give an explanation how the input data is related to the classification result. There is a general agreement that logic expressions provide a better explanation than other methods like SVM, logistic regression, and neural networks. However, a classifier based on Boolean logic needs to map continuous data to Boolean values which can cause a loss of information. In contrast, we design a quantum-logic-inspired classifier where continuous data are directly processed and the laws of the Boolean algebra are maintained. As a result from our approach we obtain a CQQL condition which provides good insights into the relation of input features to the class decision. Furthermore, our experiment shows a good prediction accuracy.}, language = {en} } @incollection{Schmitt, author = {Schmitt, Ingo}, title = {Incorporating Weights into a Quantum-Logic-Based Query Language}, series = {Quantum-Like Models for Information Retrieval and Decision-Making}, booktitle = {Quantum-Like Models for Information Retrieval and Decision-Making}, editor = {Aerts, Diederik and Khrennikov, Andrei and Melucci, Massimo and Bourama, Toni}, edition = {1. Auflage}, publisher = {Springer Nature Switzerland AG, Springer International Publishing}, address = {Cham}, isbn = {978-3-030-25912-9}, issn = {2520-1948}, doi = {10.1007/978-3-030-25913-6_7}, pages = {129 -- 143}, abstract = {Traditional database query languages are based on set theory and crisp first order logic. However, many applications require imprecise conditions which return result objects associated with a degree of fulfillment. For example, a research paper should be reviewed by giving a degree of fulfillment for originality and relevance. Very often, imprecise conditions of a query are of different importance. Thus, a query language should allow the user to give conditions different weights. This paper proposes a weighting approach which is realized by means of conjunction, disjunction, and negation. Thus, our weighting is completely embedded within a logic. As a result, logical rules are preserved and can be used for query reformulation and optimization. As underlying logic-based query language, we use the CQQL query language. Furthermore we demonstrate that our weighting approach is applicable to further logic-based query languages.}, language = {en} } @incollection{SahaSchmitt, author = {Saha, Sanjit Kumar and Schmitt, Ingo}, title = {A Relevance Feedback-Based Approach for Non-TI Clustering}, series = {Advanced Data Mining and Applications, 17th International Conference, ADMA 2021, Sydney, NSW, Australia, February 2-4, 2022, Proceedings, Part II}, booktitle = {Advanced Data Mining and Applications, 17th International Conference, ADMA 2021, Sydney, NSW, Australia, February 2-4, 2022, Proceedings, Part II}, editor = {Yu, Han and Fang, Fei and Guodong, Long and Xue, Li and Weitong, Chen and Jiang, Jing and Yue, Lin and Bohan, Li}, publisher = {Springer International Publishing}, address = {Cham}, isbn = {978-3-030-95408-6}, pages = {381 -- 393}, abstract = {Homogeneity of persons in a social network is based on the similarity of their attributes. Traditional clustering algorithms like hierarchical (agglomerative) clustering or 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, in addition, not all attributes do have the same influence on the network and thus may affect the network and compromise the quality of resulting clusters. We present an adaptive clustering-based quantitative weighting approach that is completely embedded in logic. To facilitate the user interaction with the system, we exploit the concept of relevance feedback. The approach takes user feedback as input to improve the quality of clusters and finds meaningful clusters where TI does not hold. In addition, it has the capability of providing the user alternative possible feedbacks that can be fulfilled. To test the approach, we evaluate a clustering distance regarding an ideal solution. Experiments demonstrate the benefits of our approach.}, language = {en} } @techreport{Schmitt, author = {Schmitt, Ingo}, title = {Generating CQQL Conditions from Classifying CNNs}, address = {Cottbus}, issn = {1437-7969}, doi = {10.26127/BTUOpen-5550}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-55503}, pages = {15}, abstract = {Convolutional neural networks are often successfully used for clas- si cation problems. Usually, a huge number of weights need to be learnt by use of training data. However, the learnt weights give no insight how the cnn really works. Thus, a cnn can be seen as a black box solution. In our approach we develop a method to generate a commuting quantum query language (cqql) condition from a sample derived from a given cnn or from training input. The query language cqql is inspired by quantum logic and its conditions obey the rules of a Boolean algebra. The evaluation of a cqql condition provides values from the unit interval [0; 1] and establishes therefore an elegant bridge between logic and a cnn. The underlying assumption is that a condition (a logic expression) gives much more understanding than pure cnn weights. Furthermore, the rich theory of Boolean algebra can be used for manipulating logic expressions. After extracting a cqql condition from a cnn or its training data we can use logic as a way to predict classes alternatively to a cnn.}, language = {en} } @misc{HuberLieblRoemerWirschingetal., author = {Huber-Liebl, Markus and R{\"o}mer, Ronald and Wirsching, G{\"u}nther and Schmitt, Ingo and beim Graben, Peter and Wolff, Matthias}, title = {Quantum-inspired Cognitive Agents}, series = {Frontiers in Applied Mathematics and Statistics}, journal = {Frontiers in Applied Mathematics and Statistics}, number = {8}, issn = {2297-4687}, doi = {10.3389/fams.2022.909873}, pages = {1 -- 31}, abstract = {The concept of intelligent agents is—roughly speaking—based on an architecture and a set of behavioral programs that primarily serve to solve problems autonomously. Increasing the degree of autonomy and improving cognitive performance, which can be assessed using cognitive and behavioral tests, are two important research trends. The degree of autonomy can be increased using higher-level psychological modules with which needs and motives are taken into account. In our approach we integrate these modules in architecture for an embodied, enactive multi-agent system, such that distributed problem solutions can be achieved. Furthermore, after uncovering some weaknesses in the cognitive performance of traditionally designed agents, we focus on two major aspects. On the one hand, the knowledge processing of cognitive agents is based on logical formalisms, which have deficiencies in the representation and processing of incomplete or uncertain knowledge. On the other hand, in order to fully understand the performance of cognitive agents, explanations at the symbolic and subsymbolic levels are required. Both aspects can be addressed by quantum-inspired cognitive agents. To investigate this approach, we consider two tasks in the sphere of Shannon's famous mouse-maze problem: namely classifying target objects and ontology inference. First, the classification of an unknown target object in the mouse-maze, such as cheese, water, and bacon, is based on sensory data that measure characteristics such as odor, color, shape, or nature. For an intelligent agent, we need a classifier with good prediction accuracy and explanatory power on a symbolic level. Boolean logic classifiers do work on a symbolic level but are not adequate for dealing with continuous data. Therefore, we demonstrate and evaluate a quantum-logic-inspired classifier in comparison to Boolean-logic-based classifiers. Second, ontology inference is iteratively achieved by a quantum-inspired agent through maze exploration. This requires the agent to be able to manipulate its own state by performing actions and by collecting sensory data during perception. We suggest an algebraic approach where both kinds of behaviors are uniquely described by quantum operators. The agent's state space is then iteratively constructed by carrying out unitary action operators, while Hermitian perception operators act as observables on quantum eigenstates. As a result, an ontology emerges as the simultaneous solution of the respective eigenvalue equations. Tags: btuktqiai; btuktcogsys; btukttheseus; btuktqtheseus}, language = {en} } @techreport{NoackSchmitt, author = {Noack, Tino and Schmitt, Ingo}, title = {A Cyclic Process Model for Monitoring Mobile Cyber-Physical Systems}, publisher = {BTU}, address = {Cottbus}, pages = {12 Bl.}, language = {en} } @techreport{SchmittBalko, author = {Schmitt, Ingo and Balko, S.}, title = {Signature Indexing and Self-Refinement in Metric Spaces}, publisher = {BTU}, address = {Cottbus}, language = {en} }