Binling Nie

Dr. Binling Nie


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 August 2024 in Pattern Recognition
Verified
Journal Article
Closed access
JMJiawei Mao
Jiawei Mao
RXRui Xu
Rui Xu
XYXuesong Yin
Xuesong Yin
YCYuanqi Chang
Yuanqi Chang
BNBinling Nie
Binling Nie
YWYigang Wang
Yigang Wang

3 December 2024 in Applied Soft Computing
Verified
Journal Article
Closed access
JMJiawei Mao
Jiawei Mao
SGShujian Guo
Shujian Guo
XYXuesong Yin
Xuesong Yin
YCYuanqi Chang
Yuanqi Chang
BNBinling Nie
Binling Nie
YWYigang Wang
Yigang Wang

18 May 2021 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
BNBinling Nie
Binling Nie
RDRuixue Ding
Ruixue Ding
PXPengjun Xie
Pengjun Xie
FHFei Huang
Fei Huang
CQChen Qian
Chen Qian
LSLuo Si
Luo Si
Named Entity Recognition (NER) is a fundamental and important research topic for many downstream NLP tasks, aiming at detecting and classifying named entities (NEs) mentioned in unstructured text into pre-defined categories. Learning from labeled data only is far from enough when it comes to domain-specific or temporally-evolving entities (medical terminologies or restaurant names). Luckily, open-source Knowledge Bases (KBs) (Wikidata and Freebase) contain NEs that are manually labeled with predefined types in different domains, which is potentially beneficial to identify entity boundaries and recognize entity types more accurately. However, the type system of a domain-specific NER task is typically independent of that of current KBs and thus exhibits heterogeneity issue inevitably, which makes matching between the original NER and KB types (Person in NER potentially matches President in KBs) less likely, or introduces unintended noises without considering domain-specific knowledge (Band in NER should be mapped to Out_of_Entity_Types in the restaurant-related task). To better incorporate and denoise the abundant knowledge in KBs, we propose a new KB-aware NER framework (KaNa), which utilizes type-heterogeneous knowledge to improve NER. Specifically, for an entity mention along with a set of candidate entities that are linked from KBs, KaNa first uses a type projection mechanism that maps the mention type and entity types into a shared space to homogenize the heterogeneous entity types. Then, based on projected types, a noise detector filters out certain less-confident candidate entities in an unsupervised manner. Finally, the filtered mention-entity pairs are injected into a NER model as a graph to predict answers. The experimental results demonstrate KaNa's state-of-the-art performance on five public benchmark datasets from different domains.

12 February 2023 in arXiv
Verified
Preprint
Open access
PDF file
JMJiawei Mao
Jiawei Mao
RXRui Xu
Rui Xu
XYXuesong Yin
Xuesong Yin
YCYuanqi Chang
Yuanqi Chang
BNBinling Nie
Binling Nie
AHAibin Huang
Aibin Huang
Facial expression recognition (FER) plays an important role in a variety of real-world applications such as human-computer interaction. POSTER achieves the state-of-the-art (SOTA) performance in FER by effectively combining facial landmark and image features through two-stream pyramid cross-fusion design. However, the architecture of POSTER is undoubtedly complex. It causes expensive computational costs. In order to relieve the computational pressure of POSTER, in this paper, we propose POSTER++. It improves POSTER in three directions: cross-fusion, two-stream, and multi-scale feature extraction. In cross-fusion, we use window-based cross-attention mechanism replacing vanilla cross-attention mechanism. We remove the image-to-landmark branch in the two-stream design. For multi-scale feature extraction, POSTER++ combines images with landmark's multi-scale features to replace POSTER's pyramid design. Extensive experiments on several standard datasets show that our POSTER++ achieves the SOTA FER performance with the minimum computational cost. For example, POSTER++ reached 92.21% on RAF-DB, 67.49% on AffectNet (7 cls) and 63.77% on AffectNet (8 cls), respectively, using only 8.4G floating point operations (FLOPs) and 43.7M parameters (Param). This demonstrates the effectiveness of our improvements.

28 October 2021
Verified
Book Chapter
Closed access
PDF file
BNBinling Nie
Binling Nie
CLChenyang Li
Chenyang Li
HWHonglie Wang
Honglie Wang

6 May 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
JMJiawei Mao
Jiawei Mao
YCYuanqi Chang
Yuanqi Chang
XYXuesong Yin
Xuesong Yin
BNBinling Nie
Binling Nie
YWYigang Wang
Yigang Wang