@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} } @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{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} } @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} } @misc{Schmitt, author = {Schmitt, Ingo}, title = {Logic interpretations of ANN partition cells}, series = {Logic in Computer Science (cs.LO); Artificial Intelligence (cs.AI)}, journal = {Logic in Computer Science (cs.LO); Artificial Intelligence (cs.AI)}, number = {abs/2408.14314}, doi = {10.48550/ARXIV.2408.14314}, abstract = {Consider a binary classification problem solved using a feed-forward artificial neural network (ANN). Let the ANN be composed of a ReLU layer and several linear layers (convolution, sum-pooling, or fully connected). We assume the network was trained with high accuracy. Despite numerous suggested approaches, interpreting an artificial neural network remains challenging for humans. For a new method of interpretation, we construct a bridge between a simple ANN and logic. As a result, we can analyze and manipulate the semantics of an ANN using the powerful tool set of logic. To achieve this, we decompose the input space of the ANN into several network partition cells. Each network partition cell represents a linear combination that maps input values to a classifying output value. For interpreting the linear map of a partition cell using logic expressions, we suggest minterm values as the input of a simple ANN. We derive logic expressions representing interaction patterns for separating objects classified as 1 from those classified as 0. To facilitate an interpretation of logic expressions, we present them as binary logic trees.}, language = {en} } @misc{SchmittSowoidnichGosswamietal., author = {Schmitt, Ingo and Sowoidnich, Kay and Gosswami, Tapashi and Sumpf, Bernd and Maiwald, Martin and Wolff, Matthias}, title = {PCA-based peak feature selection for classification of spectroscopic datasets}, series = {Journal of chemometrics}, volume = {39}, journal = {Journal of chemometrics}, number = {11}, publisher = {John Wiley \& Sons Ltd.}, address = {New York, NY}, issn = {0886-9383}, doi = {10.1002/cem.70074}, pages = {1 -- 14}, abstract = {Reducing feature dimensionality in spectroscopic data is crucial for efficient analysis and classification. Using all available features for classification typically results in an unacceptably high runtime and poor accuracy. Popular feature extraction methods, such as principal component analysis (PCA), linear discriminant analysis (LDA), and autoencoders, reduce feature dimensionality by extracting latent features that can be challenging to interpret. To enable better human interpretation of the classification model, we avoid extraction methods and instead propose applying feature selection methods. In this work, we develop an innovative PCA-based feature selection method for spectroscopic data, providing an essential subset of the original features. As an important advantage, no prior knowledge about the characteristic signals of the respective target substance is required. In this proof-of-concept study, the proposed method is initially characterized using simulated Raman and infrared absorption datasets. From the top five PCA eigenvectors of spectroscopic data, we identify a set of three top peaks each at specific wavenumbers (features). The compact set of selected features is then used for classification tasks applying a decision tree. Based on two well-defined spectroscopic datasets, our study demonstrates that our new method of PCA-based peak finding outperforms selected other approaches with regard to interpretability and accuracy. For both investigated datasets, accuracies greater than 97\% are achieved. Our approach shows large potential for accurate classification combined with interpretability in further scenarios involving spectroscopic datasets.}, language = {en} }