检索结果-内蒙古大学图书馆

Semi-automatic staging area for high-quality structured data extraction from scientific literature

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Foppiano, Luca Mato, Tomoya Terashima, Kensei Suarez, Pedro Ortiz Tou, Taku Sakai, Chikako Wang, Wei-Sheng Amagasa, Toshiyuki Takano, Yoshihiko Ishii, Masashi Materials Modelling Group Data-driven Materials Research Field Centre for Basic Research on Materials NIMS Japan Knowledge and Data Engineering Centre for Computational Sciences University of Tsukuba Japan Frontier Superconducting Materials Group MANA NIMS Tsukuba Japan DFKI GmbH Germany

We propose a semi-automatic staging area for efficiently building an accurate database of experimental physical properties of superconductors from literature, called SuperCon2, to enrich the existing manually-built superconductor database SuperCon. Here we report our curation interface (SuperCon2 Interface) and a workflow managing the state transitions of each examined record, to validate the dataset of superconductors from PDF documents collected using Grobid-superconductors in a previous work [1]. This curation workflow allows both automatic and manual operations, the former contains "anomaly detection" that scans new data identifying outliers, and a "training data collector" mechanism that collects training data examples based on manual corrections. Such training data collection policy is effective in improving the machine-learning models with a reduced number of examples. For manual operations, the interface (SuperCon2 interface) is developed to increase efficiency during manual correction by providing a smart interface and an enhanced PDF document viewer. We show that our interface significantly improves the curation quality by boosting precision and recall as compared with the traditional "manual correction". Our semi-automatic approach would provide a solution for achieving a reliable database with text-data mining of scientific documents. © 2023, CC BY.

关键词： database systems

Enhancing Playout Policy Adaptation for General Game Playing 1

学校读者我要写书评

暂无评论

1st Workshop on Monte Carlo Search, MCS 2020, Held in conjunction with IJCAI 2020

作者： Sironi, Chiara F. Cazenave, Tristan Winands, Mark H. M. Game AI & Search Group Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands LAMSADE Université Paris-Dauphine PSL CNRS Paris France

ISBN: (数字)9783030894535

ISBN: (纸本)9783030894528

Playout Policy Adaptation (PPA) is a state-of-the-art strategy that has been proposed to control the playouts in Monte-Carlo Tree Search (MCTS). PPA has been successfully applied to many two-player, sequential-move games. This paper further evaluates this strategy in General Game Playing (GGP) by first reformulating it for simultaneous-move games. Next, it presents five enhancements for the strategy, four of which have been previously successfully applied to a related MCTS playout strategy, the Move-Average Sampling Technique (MAST). Experiments on a heterogeneous set of games show three enhancements to have a positive effect on PPA: (i) updating the policy for all players proportionally to their payoffs instead of updating only the policy of the winner, (ii) collecting statistics for N-grams of moves instead of single moves only, and (iii) discounting the backpropagated payoffs depending on the depth of the playout. Results also show enhanced PPA variants to be competitive with MAST for small search budgets, and better for larger search budgets. The use of an ϵ -greedy selection of moves and of after-move decay of statistics, instead, seem to have a detrimental effect on PPA. © 2021, Springer Nature Switzerland AG.

关键词： Monte Carlo methods

Interval-Dismantling for Lattices

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Felde, Maximilian Koyda, Maren Knowledge & Data Engineering Group University of Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Germany

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 *** Codes 06B05, 68R01 Copyright © 2022, The Authors. All rights reserved.

关键词： Formal concept analysis

Attribute Exploration with Multiple Contradicting Partial Experts

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Felde, Maximilian Stumme, Gerd Knowledge & Data Engineering Group University of Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Germany

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. Copyright © 2022, The Authors. All rights reserved.

关键词： Formal concept analysis

Discovering Locally Maximal Bipartite Subgraphs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group University of Kassel Kassel Germany Interdisciplinary Research Center for Information System Design Kassel Germany

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 *** Codes 90C27 Copyright © 2022, The Authors. All rights reserved.

关键词： Simulated annealing

The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Stubbemann, Maximilian Stumme, Gerd Knowledge and Data Engineering Group University of Kassel Kassel Germany

The investigation of social networks is often hindered by their size as such networks often consist of at least thousands of vertices and edges. Hence, it is of major interest to derive compact structures that represent important connections of the original network. In this work, we derive such structures with orometric methods that are originally designed to identify outstanding mountain peaks and relationships between them. By adapting these methods to social networks, it is possible to derive family trees of important vertices. Our approach consists of two steps. We first apply a novel method for discarding edges that stand for weak connections. This is done such that the connectivity of the network is preserved. Then, we identify the important "peaks" in the network and the "key cols", i.e., the lower points that connect them. This gives us a compact network that displays which peaks are connected through which cols. Thus, a natural hierarchy on the peaks arises by the question which higher peak comes behind the col, yielding to chains of peaks with increasing heights. The resulting "line parent hierarchy" displays dominance relations between important vertices. We show that networks with hundreds or thousands of edges can be condensed to a small set of vertices and key connections between them. Copyright © 2021, The Authors. All rights reserved.

关键词：

Intrinsic Dimension for Large-Scale Geometric Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Stubbemann, Maximilian Hanika, Tom Schneider, Friedrich Martin Knowledge & Data Engineering Group University of Kassel Kassel Germany Institute of Discrete Mathematics and Algebra TU Bergakademie Freiberg Freiberg Germany

The concept of dimension is essential to grasp the complexity of data. A naive approach to determine the dimension of a dataset is based on the number of attributes. More sophisticated methods derive a notion of intrinsic dimension (ID) that employs more complex feature functions, e.g., distances between data points. Yet, many of these approaches are based on empirical observations, cannot cope with the geometric character of contemporary datasets, and do lack an axiomatic foundation. A different approach was proposed by V. Pestov, who links the intrinsic dimension axiomatically to the mathematical concentration of measure phenomenon. First methods to compute this and related notions for ID were computationally intractable for large-scale real-world datasets. In the present work, we derive a computationally feasible method for determining said axiomatic ID functions. Moreover, we demonstrate how the geometric properties of complex data are accounted for in our modeling. In particular, we propose a principle way to incorporate neighborhood information, as in graph data, into the ID. This allows for new insights into common graph learning procedures, which we illustrate by experiments on the Open Graph Benchmark. Copyright © 2022, The Authors. All rights reserved.

关键词： Large dataset

Topological indoor mapping through wifi signals

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Schaefermeier, Bastian Stumme, Gerd Hanika, Tom Knowledge & Data Engineering Group University of Kassel Germany U Kassel

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. Copyright © 2021, The Authors. All rights reserved.

关键词： Indoor positioning systems

Drawing Order Diagrams Through Two-Dimension Extension

学校读者我要写书评

暂无评论

Journal of Graph Algorithms and Applications 2023年第9期27卷 783-802页

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group Research Center for Information System Design & Department of Electrical Engineering and Computer Science University of Kassel Germany Institute of Computer Science University of Hildesheim Germany Berlin School of Library and Information Science Humboldt-Universität zu Berlin Germany

Ordinal real-world data such as concept hierarchies, ontologies, genealogies, or task dependencies in scheduling often has the property to not only contain pairwise comparable, but also incomparable elements. Order diagrams provide an important tool for understanding and thus discovering knowledge in such data. Easily readable drawings of such order diagrams 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 decompose an ordered set (e.g., a concept hierarchy) in linear orders and to produce a corresponding order diagram. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of its transitive incompatibility graph. To evaluate the quality of the algorithm, a user study was conducted where generated drawings were compared with ones from state-of-the-art drawing algorithms. © 2023 Brown University. All rights reserved.

关键词： Set theory