Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kunlin Nie

dblp:414/8982 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0009-8502-8566ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph inference
0.912025
TFGIN: Tight-Fitting Graph Inference Network for Table-based Fact Verification · ACM Trans. Inf. Syst. 2025
Information retrieval
fact-checking
0.912025
TFGIN: Tight-Fitting Graph Inference Network for Table-based Fact Verification · ACM Trans. Inf. Syst. 2025
Information retrieval › fact-checking
table-based fact verification
0.912025
TFGIN: Tight-Fitting Graph Inference Network for Table-based Fact Verification · ACM Trans. Inf. Syst. 2025

Methods — techniques the papers use, named apart from their topics

subgraph segmentation · 1.7interaction guidance · 1.7graph inference network · 1.7
YearPublicationVenuePosition
2025 TFGIN: Tight-Fitting Graph Inference Network for Table-based Fact Verification
abstract
Fact verification task has emerged as an essential research topic recently due to abundant fake news spreading on the Internet. The task based on unstructured data (i.e., news) has achieved great development, but the task based on structured data (i.e., table) is still in the primary development period. The existing methods usually construct complete heterogeneous graph networks around statement, table, and program subgraphs, and then infer to learn similar semantics on them for fact verification. However, they generally connect the nodes with the same content between subgraphs directly to frame a larger graph network, which has serious sparsity in connections, especially when subgraphs possess limited semantics. To this end, we propose tight-fitting graph inference network (TFGIN), which innovatively builds tight-fitting graphs (TF-graphs) to strengthen the connections of subgraphs and designs inference modeling layer (IML) to learn coherence evidence for fact verification. Specifically, different from traditional connection ways, the constructed TF-graph enhances inter-graph and intra-graph connections of subgraphs through subgraph segmentation and interaction guidance mechanisms. IML could reason the semantics with strong correlation and high consistency as explainable evidence. Experiments on three competitive datasets confirm the superiority and scalability of our TFGIN.
Lianwei Wu, Kunlin Nie, Sensen Guo, Chao Gao 0001, Zhen Wang 0004, Shudong Li
ACM Trans. Inf. Syst.3