004 Datenverarbeitung; Informatik
Refine
Year of publication
Document Type
- Article (144) (remove)
Language
- English (144) (remove)
Is part of the Bibliography
- yes (144) (remove)
Keywords
- Data profiling (3)
- machine learning (3)
- Blockchains (2)
- Deep learning (2)
- General Earth and Planetary Sciences (2)
- Geography, Planning and Development (2)
- JSP (2)
- Machine learning (2)
- Runtime analysis (2)
- Twitter (2)
- Water Science and Technology (2)
- answer set programming (2)
- bibliometric analysis (2)
- citation analysis (2)
- data integration (2)
- duplicate detection (2)
- identity theory (2)
- perception of robots (2)
- social media (2)
- software engineering (2)
- (FPGA) (1)
- 3D point clouds (1)
- APX-hardness (1)
- Activity-oriented Optimization (1)
- Actor (1)
- Actor model (1)
- Advanced Video Codec (AVC) (1)
- Algebraic methods (1)
- Animal building (1)
- Application (1)
- Argument Mining (1)
- Artificial neural networks (1)
- Assessment (1)
- Attribute aggregation (1)
- Augmented and virtual reality (1)
- Augmented reality (1)
- Authentication (1)
- Automatically controlled windows (1)
- BPMN (1)
- Bean (1)
- Bibliometrics (1)
- Bidirectional order dependencies (1)
- Big Five model (1)
- Bitcoin (1)
- Brownian motion with discontinuous drift (1)
- Business Process Management (1)
- Business process modeling (1)
- Bystander (1)
- CCS Concepts (1)
- Calibration (1)
- Case management (1)
- Clinical predictive modeling (1)
- Cographs (1)
- Coherent partition (1)
- Commonsense reasoning (1)
- Complexity (1)
- Compliance checking (1)
- Computational photography (1)
- Computer crime (1)
- Conceptual modeling (1)
- Condition number (1)
- Consistency (1)
- Convolution (1)
- Covid (1)
- Critical pairs (1)
- Crowd-sourcing (1)
- Cryptography (1)
- Currencies (1)
- Customer ownership (1)
- Data dependencies (1)
- Data mining (1)
- Data modeling (1)
- Data warehouse (1)
- Data-centric (1)
- Decision support (1)
- Defining characteristics of physical computing (1)
- Delphi study (1)
- Delta preservation (1)
- Dependency discovery (1)
- Digital image analysis (1)
- Digitalization (1)
- Distributed computing (1)
- Distributed programming (1)
- Economics (1)
- Ecosystems (1)
- Electronic and spintronic devices (1)
- Entity resolution (1)
- Enumeration algorithm (1)
- Estimation-of-distribution algorithm (1)
- Evolutionary algorithms (1)
- FPGA (1)
- Feature extraction (1)
- Feature selection (1)
- Federated learning (1)
- Field programmable gate arrays (1)
- Finite automata (1)
- Fitness-distance correlation (1)
- Formal modelling (1)
- Functional dependencies (1)
- Gene expression (1)
- Graph databases (1)
- Graph homomorphisms (1)
- Graph logic (1)
- Graph partitions (1)
- Graph repair (1)
- Graph transformation (1)
- H.264 (1)
- Hardware accelerator (1)
- Helmholtz problem (1)
- HiGHmed (1)
- Histograms (1)
- Human (1)
- Human-robot interaction (1)
- IHL (1)
- IHRL (1)
- IOPS (1)
- Identity management systems (1)
- Ill-conditioning (1)
- Image (1)
- Image resolution (1)
- Image-based rendering (1)
- Imperative calculi (1)
- Improving classroom (1)
- Inclusion dependencies (1)
- Indefinite (1)
- Industries (1)
- Inference (1)
- Initial conflicts (1)
- Instagram (1)
- Insurance industry (1)
- Interface design (1)
- Interpretability (1)
- Kernel (1)
- LIDAR (1)
- LSTM (1)
- Licenses (1)
- Lindenmayer systems (1)
- Loss (1)
- Low Latency (1)
- Machine Learning (1)
- Matroids (1)
- Media in education (1)
- Metaverse (1)
- Minimal hitting set (1)
- Model repair (1)
- Model verification (1)
- Model-driven (1)
- Multi-objective optimization (1)
- Multi-sided platforms (1)
- Multimodal behavior (1)
- Mutation operators (1)
- N-of-1 trial (1)
- NUI (1)
- Natural ventilation (1)
- Nephrology (1)
- Nested graph conditions (1)
- Network clustering (1)
- O (1)
- Opinion mining (1)
- Optimization (1)
- OptoGait (1)
- Order dependencies (1)
- Ordinances (1)
- Parallelization (1)
- Pedagogical issues (1)
- Plant identification (1)
- Point-based rendering (1)
- Popular matching (1)
- Prime graphs (1)
- Prior knowledge (1)
- Privacy (1)
- Process Execution (1)
- Protocols (1)
- Query execution (1)
- Query optimization (1)
- Rainfall-runoff (1)
- Random access memory (1)
- Region of Interest (1)
- Relational data (1)
- Reproducible benchmarking (1)
- Resource Allocation (1)
- Resource Management (1)
- Reversibility (1)
- Robot personality (1)
- Run time analysis (1)
- SCED (1)
- SQL (1)
- Satisfiability (1)
- Scale-invariant feature transform (SIFT) (1)
- Second Life (1)
- Security (1)
- Semantic Web (1)
- Semiconductors (1)
- Sequential anomaly (1)
- Sharing (1)
- Signal processing (1)
- Simulations (1)
- Single event upsets (1)
- Smart cities (1)
- Social (1)
- Specification (1)
- Stable marriage (1)
- Stable matching (1)
- Stance Detection (1)
- Submodular function (1)
- Submodular functions (1)
- Subset selection (1)
- Systematics (1)
- Systems of parallel communicating (1)
- Taxonomy (1)
- Text mining (1)
- Theory (1)
- Time series (1)
- Transversal hypergraph (1)
- Type and effect systems (1)
- UX (1)
- Uncanny valley (1)
- Unique column combination (1)
- Unique column combinations (1)
- VGG16 (1)
- VR (1)
- Validation (1)
- Value network (1)
- Visualization (1)
- Vocabulary (1)
- W[3]-Completeness (1)
- WhatsApp (1)
- X-ray imaging (1)
- YouTube (1)
- Zebris (1)
- action and change (1)
- acyclic preferences (1)
- adaptive (1)
- algorithms (1)
- annotation (1)
- anxiety (1)
- app (1)
- approximation (1)
- architecture (1)
- architecture recovery (1)
- argumentation research (1)
- attacks (1)
- attribute assurance (1)
- authorship attribution (1)
- automata (1)
- automated planning (1)
- big data (1)
- biomarker detection (1)
- blockchain (1)
- brand personality (1)
- business process management (1)
- business processes (1)
- cancer therapy (1)
- center dot Computing (1)
- cloud security (1)
- co-citation analysis (1)
- co-occurrence analysis (1)
- cognition (1)
- cognitive load (1)
- collaboration (1)
- combined task and motion planning (1)
- complexity dichotomy (1)
- comprehension (1)
- computational thinking (1)
- computed tomography (1)
- computer vision (1)
- concurrent graph rewriting (1)
- conditions (1)
- conflicts and dependencies in (1)
- contract (1)
- conversational agents (1)
- corporate nomadism (1)
- corporate takeovers (1)
- cryptocurrency exchanges (1)
- cyber (1)
- cyber humanistic (1)
- cyber threat intelligence (1)
- cyber-attack (1)
- cyberbullying (1)
- cyberwar (1)
- data assimilation (1)
- data driven approaches (1)
- data migration (1)
- data pipeline (1)
- data preparation (1)
- data quality (1)
- data transformation (1)
- data wrangling (1)
- database systems (1)
- deferred choice (1)
- dental caries classification (1)
- depression (1)
- determinism (1)
- deterministic properties (1)
- developmental systems (1)
- digital health (1)
- digital identity (1)
- digital interventions (1)
- digital nomadism (1)
- digital transformation (1)
- digital workplace transformation (1)
- digitally-enabled pedagogies (1)
- distributed systems (1)
- drift theory (1)
- educational systems (1)
- efficient deep learning (1)
- elections (1)
- emotional design (1)
- empathy (1)
- engagement (1)
- engine (1)
- engineering (1)
- ethics (1)
- evaluation (1)
- evolutionary computation (1)
- exact simulation methods (1)
- experiment (1)
- explainability (1)
- explainability-accuracy trade-off (1)
- explainable AI (1)
- exploratory programming (1)
- expression (1)
- external knowledge bases (1)
- failure model (1)
- field-programmable gate array (1)
- forensics (1)
- formal languages (1)
- formal semantics (1)
- functions (1)
- gait analysis algorithm (1)
- gender (1)
- gene (1)
- gene selection (1)
- graph languages (1)
- graph pattern matching (1)
- graph transformation (1)
- hardware accelerator (1)
- hardware architecture (1)
- health care (1)
- healthcare (1)
- home office (1)
- human–computer interaction (1)
- identity broker (1)
- image captioning (1)
- image processing (1)
- individual effects (1)
- inertial measurement unit (1)
- informal and formal learning (1)
- information diffusion (1)
- interactive technologies (1)
- international human rights (1)
- international humanitarian law (1)
- interpretable machine learning (1)
- intransitivity (1)
- iteration method (1)
- job shop scheduling (1)
- job-shop scheduling (1)
- key competences in physical computing (1)
- knowledge building (1)
- knowledge management (1)
- knowledge representation and nonmonotonic reasoning (1)
- knowledge work (1)
- law (1)
- law and technology (1)
- learning (1)
- learning factory (1)
- literature review (1)
- localization (1)
- long-term interaction (1)
- longitudinal (1)
- machine (1)
- machine learning algorithms (1)
- manipulation planning (1)
- matrices (1)
- media (1)
- medical malpractice (1)
- memory (1)
- method comparision (1)
- methodologie (1)
- methods (1)
- metric learning (1)
- migration (1)
- mobile application (1)
- mobile learning (1)
- mobile technologies and apps (1)
- modelling (1)
- modular counting (1)
- modularity (1)
- molecular tumor board (1)
- monitoring (1)
- mood (1)
- multimedia learning (1)
- multimodal representations (1)
- mutli-task learning (1)
- mutual gaze (1)
- networks (1)
- neural (1)
- neural networks (1)
- new technologies (1)
- news media (1)
- notation (1)
- online learning (1)
- optimal transport (1)
- oracles (1)
- organisational evolution (1)
- paper prototyping (1)
- parallel processing (1)
- parallel rewriting (1)
- performance (1)
- personality prediction (1)
- personalization principle (1)
- personalized medicine (1)
- phone (1)
- physical computing tools (1)
- planning (1)
- poset (1)
- power-law (1)
- predictive models (1)
- prior knowledge (1)
- process scheduling (1)
- processes (1)
- processing (1)
- production planning and control (1)
- program (1)
- programming (1)
- programming skills (1)
- public dataset (1)
- quantified logics (1)
- random I (1)
- random graphs (1)
- randomized control trial (1)
- real-time (1)
- record linkage (1)
- recursive tuning (1)
- reliability (1)
- remodularization (1)
- remote-first (1)
- representation learning (1)
- resilient architectures (1)
- restoration (1)
- restricted parallelism (1)
- review (1)
- robustness (1)
- search plan generation (1)
- security (1)
- security chaos engineering (1)
- security risk assessment (1)
- self-adaptive multiprocessing system (1)
- self-driving (1)
- self-healing (1)
- self-sovereign identity (1)
- self-supervised learning (1)
- sentiment (1)
- signal processing (1)
- similarity learning (1)
- similarity measures (1)
- simulation (1)
- single event upset (1)
- single-case experimental design (1)
- skew Brownian motion (1)
- skew diffusions (1)
- small files (1)
- smart contracts (1)
- smoother (1)
- social media analysis (1)
- social network analysis (1)
- social networking sites (1)
- societal effects (1)
- solar particle event (1)
- space missions (1)
- spread correction (1)
- stable matching (1)
- standardization (1)
- stochastic process (1)
- strongly stable matching (1)
- super stable matching (1)
- survey mode (1)
- systematic literature review (1)
- taxonomy (1)
- teaching (1)
- teamwork (1)
- technical notes and rapid communications (1)
- terminology (1)
- text based classification methods (1)
- tort law (1)
- training (1)
- transfer learning (1)
- trust (1)
- trust model (1)
- uncanny valley (1)
- unsupervised methods (1)
- usability (1)
- user experience (1)
- virtual collaboration (1)
- virtual groups (1)
- virtual reality (1)
- virtual teams (1)
- vulnerabilities (1)
- weakly (1)
- web application (1)
- weight (1)
- well-being (1)
- workflow patterns (1)
- workload prediction (1)
Institute
- Institut für Informatik und Computational Science (42)
- Hasso-Plattner-Institut für Digital Engineering gGmbH (41)
- Hasso-Plattner-Institut für Digital Engineering GmbH (19)
- Fachgruppe Betriebswirtschaftslehre (8)
- Wirtschaftswissenschaften (8)
- Institut für Mathematik (6)
- Institut für Biochemie und Biologie (4)
- Institut für Physik und Astronomie (4)
- Department Erziehungswissenschaft (3)
- Department Linguistik (3)
The past three decades of policy process studies have seen the emergence of a clear intellectual lineage with regard to complexity. Implicitly or explicitly, scholars have employed complexity theory to examine the intricate dynamics of collective action in political contexts. However, the methodological counterparts to complexity theory, such as computational methods, are rarely used and, even if they are, they are often detached from established policy process theory. Building on a critical review of the application of complexity theory to policy process studies, we present and implement a baseline model of policy processes using the logic of coevolving networks. Our model suggests that an actor's influence depends on their environment and on exogenous events facilitating dialogue and consensus-building. Our results validate previous opinion dynamics models and generate novel patterns. Our discussion provides ground for further research and outlines the path for the field to achieve a computational turn.
PC2P
(2021)
Motivation:
Prediction of protein complexes from protein-protein interaction (PPI) networks is an important problem in systems biology, as they control different cellular functions. The existing solutions employ algorithms for network community detection that identify dense subgraphs in PPI networks. However, gold standards in yeast and human indicate that protein complexes can also induce sparse subgraphs, introducing further challenges in protein complex prediction.
Results:
To address this issue, we formalize protein complexes as biclique spanned subgraphs, which include both sparse and dense subgraphs. We then cast the problem of protein complex prediction as a network partitioning into biclique spanned subgraphs with removal of minimum number of edges, called coherent partition. Since finding a coherent partition is a computationally intractable problem, we devise a parameter-free greedy approximation algorithm, termed Protein Complexes from Coherent Partition (PC2P), based on key properties of biclique spanned subgraphs. Through comparison with nine contenders, we demonstrate that PC2P: (i) successfully identifies modular structure in networks, as a prerequisite for protein complex prediction, (ii) outperforms the existing solutions with respect to a composite score of five performance measures on 75% and 100% of the analyzed PPI networks and gold standards in yeast and human, respectively, and (iii,iv) does not compromise GO semantic similarity and enrichment score of the predicted protein complexes. Therefore, our study demonstrates that clustering of networks in terms of biclique spanned subgraphs is a promising framework for detection of complexes in PPI networks.
In recent years, many efforts have been made to apply image processing techniques for plant leaf identification. However, categorizing leaf images at the cultivar/variety level, because of the very low inter-class variability, is still a challenging task. In this research, we propose an automatic discriminative method based on convolutional neural networks (CNNs) for classifying 12 different cultivars of common beans that belong to three various species. We show that employing advanced loss functions, such as Additive Angular Margin Loss and Large Margin Cosine Loss, instead of the standard softmax loss function for the classification can yield better discrimination between classes and thereby mitigate the problem of low inter-class variability. The method was evaluated by classifying species (level I), cultivars from the same species (level II), and cultivars from different species (level III), based on images from the leaf foreside and backside. The results indicate that the performance of the classification algorithm on the leaf backside image dataset is superior. The maximum mean classification accuracies of 95.86, 91.37 and 86.87% were obtained at the levels I, II and III, respectively. The proposed method outperforms the previous relevant works and provides a reliable approach for plant cultivars identification.
High annotation costs are a substantial bottleneck in applying deep learning architectures to clinically relevant use cases, substantiating the need for algorithms to learn from unlabeled data.
In this work, we propose employing self-supervised methods. To that end, we trained with three self-supervised algorithms on a large corpus of unlabeled dental images, which contained 38K bitewing radiographs (BWRs). We then applied the learned neural network representations on tooth-level dental caries classification, for which we utilized labels extracted from electronic health records (EHRs). Finally, a holdout test-set was established, which consisted of 343 BWRs and was annotated by three dental professionals and approved by a senior dentist.
This test-set was used to evaluate the fine-tuned caries classification models. Our experimental results demonstrate the obtained gains by pretraining models using self-supervised algorithms. These include improved caries classification performance (6 p.p. increase in sensitivity) and, most importantly, improved label-efficiency.
In other words, the resulting models can be fine-tuned using few labels (annotations).
Our results show that using as few as 18 annotations can produce >= 45% sensitivity, which is comparable to human-level diagnostic performance.
This study shows that self-supervision can provide gains in medical image analysis, particularly when obtaining labels is costly and expensive.
We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges, and they also have the right to declare a draw or even withdraw from such a comparison. This freedom is then gradually restricted as we specify six stages of orderedness in the preferences, ending with the classical case of strictly ordered lists. We study all cases occurring when combining the three known notions of stability-weak, strong, and super-stability-under the assumption that each side of the bipartite market obtains one of the six degrees of orderedness. By designing three polynomial algorithms and two NP-completeness proofs, we determine the complexity of all cases not yet known and thus give an exact boundary in terms of preference structure between tractable and intractable cases.
Our input is a complete graph G on n vertices where each vertex has a strict ranking of all other vertices in G. The goal is to construct a matching in G that is popular. A matching M is popular if M does not lose a head-to-head election against any matching M ': here each vertex casts a vote for the matching in {M,M '} in which it gets a better assignment. Popular matchings need not exist in the given instance G and the popular matching problem is to decide whether one exists or not. The popular matching problem in G is easy to solve for odd n. Surprisingly, the problem becomes NP-complete for even n, as we show here. This is one of the few graph theoretic problems efficiently solvable when n has one parity and NP-complete when n has the other parity.
Local laws on urban policy, i.e., ordinances directly affect our daily life in various ways (health, business etc.), yet in practice, for many citizens they remain impervious and complex. This article focuses on an approach to make urban policy more accessible and comprehensible to the general public and to government officials, while also addressing pertinent social media postings. Due to the intricacies of the natural language, ranging from complex legalese in ordinances to informal lingo in tweets, it is practical to harness human judgment here. To this end, we mine ordinances and tweets via reasoning based on commonsense knowledge so as to better account for pragmatics and semantics in the text. Ours is pioneering work in ordinance mining, and thus there is no prior labeled training data available for learning. This gap is filled by commonsense knowledge, a prudent choice in situations involving a lack of adequate training data. The ordinance mining can be beneficial to the public in fathoming policies and to officials in assessing policy effectiveness based on public reactions. This work contributes to smart governance, leveraging transparency in governing processes via public involvement. We focus significantly on ordinances contributing to smart cities, hence an important goal is to assess how well an urban region heads towards a smart city as per its policies mapping with smart city characteristics, and the corresponding public satisfaction.
VLDB 2021
(2021)
The 47th International Conference on Very Large Databases (VLDB'21) was held on August 16-20, 2021 as a hybrid conference. It attracted 180 in-person attendees in Copenhagen and 840 remote attendees. In this paper, we describe our key decisions as general chairs and program committee chairs and share the lessons we learned.
Modern data analysis tasks often involve control flow statements, such as the iterations in PageRank and K-means. To achieve scalability, developers usually implement these tasks in distributed dataflow systems, such as Spark and Flink. Designers of such systems have to choose between providing imperative or functional control flow constructs to users. Imperative constructs are easier to use, but functional constructs are easier to compile to an efficient dataflow job. We propose Mitos, a system where control flow is both easy to use and efficient. Mitos relies on an intermediate representation based on the static single assignment form. This allows us to abstract away from specific control flow constructs and treat any imperative control flow uniformly both when building the dataflow job and when coordinating the distributed execution.
Nowadays, production planning and control must cope with mass customization, increased fluctuations in demand, and high competition pressures. Despite prevailing market risks, planning accuracy and increased adaptability in the event of disruptions or failures must be ensured, while simultaneously optimizing key process indicators. To manage that complex task, neural networks that can process large quantities of high-dimensional data in real time have been widely adopted in recent years. Although these are already extensively deployed in production systems, a systematic review of applications and implemented agent embeddings and architectures has not yet been conducted. The main contribution of this paper is to provide researchers and practitioners with an overview of applications and applied embeddings and to motivate further research in neural agent-based production. Findings indicate that neural agents are not only deployed in diverse applications, but are also increasingly implemented in multi-agent environments or in combination with conventional methods — leveraging performances compared to benchmarks and reducing dependence on human experience. This not only implies a more sophisticated focus on distributed production resources, but also broadening the perspective from a local to a global scale. Nevertheless, future research must further increase scalability and reproducibility to guarantee a simplified transfer of results to reality.