Search Results for author:
Found 9 papers, 5 papers with code
Exploring Sentence Community for Document-Level Event Extraction
Document-level event extraction is critical to various natural language processing tasks for providing structured information.
Linear-time online visibility graph transformation algorithm: for both natural and horizontal visibility criteria
Visibility graph (VG) transformation is a technique used to convert a time series into a graph based on specific visibility criteria.
I2SRM: Intra- and Inter-Sample Relationship Modeling for Multimodal Information Extraction
Multimodal information extraction is attracting research attention nowadays, which requires aggregating representations from different modalities.
Document-Level Relation Extraction with Relation Correlation Enhancement
Document-level relation extraction (DocRE) is a task that focuses on identifying relations between entities within a document.
Asymmetric Polynomial Loss For Multi-Label Classification
We further employ the asymmetric focusing mechanism to decouple the gradient contribution from the negative and positive samples.
Text Classification in the Wild: a Large-scale Long-tailed Name Normalization Dataset
In this work, we first collect a large-scale institution name normalization dataset LoT-insts1, which contains over 25k classes that exhibit a naturally long-tailed distribution.
Ranked #1 on
Long-tail Learning
on Lot-insts
Belief Evolution Network-based Probability Transformation and Fusion
Smets proposes the Pignistic Probability Transformation (PPT) as the decision layer in the Transferable Belief Model (TBM), which argues when there is no more information, we have to make a decision using a Probability Mass Function (PMF).
When does the Physarum Solver Distinguish the Shortest Path from other Paths: the Transition Point and its Applications
Based on the D-Path and T-Point, a newly accelerated PPA named OPPA-D using the proposed termination criterion is developed which is superior to all other baseline algorithms according to the experiments conducted in this paper.
The Capacity Constraint Physarum Solver
Motivated by the lack of related PPA-based research, a novel framework, the capacitated physarum polycephalum inspired algorithm (CPPA), is proposed to allow capacity constraints toward link flow in the PPA.
