Point-Supervised Object Detection (PSOD) in a discriminative style has recently gained significant attention for its impressive detection performance and cost-effectiveness. However, accurately predicting high-quality pseudo-box labels for drone-view images, which often feature densely packed small objects, remains a challenge. This difficulty arises primarily from the limitation of rigid sampling strategies, which hinder the pseudo-box optimization process. To address this, we propose PointSR, an effective and robust point-supervised object detection framework with self-regularized sampling that integrates temporal and informative constraints throughout the pseudo-box generation process. Specifically, the framework comprises three key components: Temporal-Ensembling Encoder (TE Encoder), Coarse Pseudo-box Prediction, and Pseudo-box Refinement. The TE Encoder builds an anchor prototype library by aggregating temporal information for dynamic anchor adjustment. In Coarse Pseudo-box Prediction, anchors are refined using the prototype library, and a set of informative samples is collected for subsequent refinement. During Pseudo-box Refinement, these informative negative samples are used to suppress low-confidence candidate positive samples, thereby improving the quality of the pseudo-boxes. Experimental results on benchmark datasets demonstrate that PointSR significantly outperforms state-of-the-art methods, achieving up to 2.6% ∼ 7.2% higher AP50using only point supervision. Additionally, it exhibits strong robustness to perturbation in human-labeled points.

MOTIVATION: Protein-protein interactions (PPIs) are essential for the regulation and facilitation of virtually all biological processes. Computational tools, particularly those based on deep learning, are preferred for the efficient prediction of PPIs. Despite recent progress, two challenges remain unresolved: (i) the imbalanced nature of PPI characteristics is often ignored and (ii) there exists a high computational cost associated with capturing long-range dependencies within protein data, typically exhibiting quadratic complexity relative to the length of the protein sequence. RESULT: Here, we propose an anti-symmetric graph learning model, BaPPI, for the balanced prediction of PPIs and extrapolation of the involved patterns in PPI network. In BaPPI, the contextualized information of protein data is efficiently handled by an attention-free mechanism formed by recurrent convolution operator. The anti-symmetric graph convolutional network is employed to model the uneven distribution within PPI networks, aiming to learn a more robust and balanced representation of the relationships between proteins. Ultimately, the model is updated using asymmetric loss. The experimental results on classical baseline datasets demonstrate that BaPPI outperforms four state-of-the-art PPI prediction methods. In terms of Micro-F1, BaPPI exceeds the second-best method by 6.5% on SHS27K and 5.3% on SHS148K. Further analysis of the generalization ability and patterns of predicted PPIs also demonstrates our model's generalizability and robustness to the imbalanced nature of PPI datasets. AVAILABILITY AND IMPLEMENTATION: The source code of this work is publicly available at https://github.com/ttan6729/BaPPI.

Ontology mappings are regarded as the semantic bridges that link entities from different yet overlapping ontologies in order to support knowledge sharing and reuse on the Semantic Web. However, mappings can be wrong and result in logical conflicts among ontologies. Such kind of mappings are called incoherent mappings. As an important part of ontology matching, mapping validation aims at detecting the conflicts and restoring the coherence of mappings. In this paper, we propose a graph-based approach which is complete for detecting incoherent mappings among DL-Lite ontologies. The lightweight DL-Lite family of description logics stand out for tractable reasoning and efficient query answering capabilities. Our approach consists of a set of graph construction rules, a graph-based incoherence detection algorithm, and a graph-based incoherence repair algorithm. We propose and formalize three repair principles in an attempt to measure the wrong mappings, where the notion of common closures w.r.t. a mapping arc in the constructed graph is introduced. These principles feature a global removal strategy that is independent of individual ontology matchers. In order to relieve the loss of information among ontologies in the repair process, we further define a mapping revision operator so that common closures related to the removed mappings can be preserved in the graph. We implement the graph-based algorithms and evaluate their performance in a comparison with state-of-the-art systems on real-world ontologies. Experimental results show that our approach can remove more wrong mappings and achieve better repairing results in most of the cases.