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

Hongye Song

dblp:52/10774 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
3since 2021 · last 2024
0009-0000-5595-1303ORCID · corroborated

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

Databases, data management, data science and information retrieval · 3 · 3 since 2021Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1

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
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models › neural retrieval
dense retrieval
0.812024
I3: Intent-Introspective Retrieval Conditioned on Instructions · SIGIR 2024
Information retrieval
retrieval models
0.812024
I3: Intent-Introspective Retrieval Conditioned on Instructions · SIGIR 2024
Information retrieval › document retrieval
zero-shot retrieval
0.812024
I3: Intent-Introspective Retrieval Conditioned on Instructions · SIGIR 2024
Natural language and speech › Information extraction and text analysis
sequence labeling
0.512021
Cross-Domain Contract Element Extraction with a Bi-directional Feedback Clause-Element Relation Network · SIGIR 2021
Natural language and speech › Information extraction and text analysis › named entity recognition
cross-domain named entity recognition
0.112021
Cross-Domain Contract Element Extraction with a Bi-directional Feedback Clause-Element Relation Network · SIGIR 2021
Natural language and speech › Information extraction and text analysis
named entity recognition
0.112021
Cross-Domain Contract Element Extraction with a Bi-directional Feedback Clause-Element Relation Network · SIGIR 2021

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

progressive pruning · 0.8large language model · 0.8data refinement · 0.8multi-task learning · 0.5graph neural network · 0.5bidirectional feedback · 0.5
YearPublicationVenuePosition
2024 I3: Intent-Introspective Retrieval Conditioned on Instructions
abstract
Recent studies indicate that dense retrieval models struggle to perform well on a wide variety of retrieval tasks that lack dedicated training data, as different retrieval tasks often entail distinct search intents. To address this challenge, in this work we leverage instructions to flexibly describe retrieval intents and introduce I3, a unified retrieval system that performs Intent-Introspective retrieval across various tasks, conditioned on Instructions without any task-specific training. I3 innovatively incorporates a pluggable introspector in a parameter-isolated manner to comprehend specific retrieval intents by jointly reasoning over the input query and instruction, and seamlessly integrates the introspected intent into the original retrieval model for intent-aware retrieval. Furthermore, we propose progressively-pruned intent learning. It utilizes extensive LLM-generated data to train I3 phase-by-phase, embodying two key designs: progressive structure pruning and drawback extrapolation-based data refinement. Extensive experiments show that in the BEIR benchmark, I3 significantly outperforms baseline methods designed with task-specific retrievers, achieving state-of-the-art zero-shot performance without any task-specific tuning.
Kaihang Pan, Juncheng Li 0006, Wenjie Wang 0007, Hao Fei 0001, Hongye Song, Wei Ji 0008, Xiaozhong Liu 0001, Tat-Seng Chua, Siliang Tang
SIGIR5
2022 Improving legal judgment prediction through reinforced criminal element extraction
Yougang Lyu, Zihan Wang 0002, Zhaochun Ren, Pengjie Ren, Zhumin Chen, Xiaozhong Liu 0001, Hongsong Li, Hongye Song
Inf. Process. Manag.9
2021 Cross-Domain Contract Element Extraction with a Bi-directional Feedback Clause-Element Relation Network
abstract
Contract element extraction (CEE) is the novel task of automatically identifying and extracting legally relevant elements such as contract dates, payments, and legislation references from contracts. Automatic methods for this task view it as a sequence labeling problem and dramatically reduce human labor. However, as contract genres and element types may vary widely, a significant challenge for this sequence labeling task is how to transfer knowledge from one domain to another, i.e., cross-domain CEE. Cross-domain CEE differs from cross-domain named entity recognition (NER) in two important ways. First, contract elements are far more fine-grained than named entities, which hinders the transfer of extractors. Second, the extraction zones for cross-domain CEE are much larger than for cross-domain NER. As a result, the contexts of elements from different domains can be more diverse. We propose a framework, the Bi-directional Feedback cLause-Element relaTion network (Bi-FLEET), for the cross-domain CEE task that addresses the above challenges. Bi-FLEET has three main components: (1) a context encoder, (2) a clause-element relation encoder, and (3) an inference layer. To incorporate invariant knowledge about element and clause types, a clause-element graph is constructed across domains and a hierarchical graph neural network is adopted in the clause-element relation encoder. To reduce the influence of context variations, a multi-task framework with a bi-directional feedback scheme is designed in the inference layer, conducting both clause classification and element extraction. The experimental results over both cross-domain NER and CEE tasks show that Bi-FLEET significantly outperforms state-of-the-art baselines.
Zihan Wang 0002, Hongye Song, Zhaochun Ren, Pengjie Ren, Zhumin Chen, Xiaozhong Liu 0001, Hongsong Li, Maarten de Rijke
SIGIR2
2019 Ultracontractivity and Functional Inequalities on Infinite Graphs
Hongye Song
Discret. Comput. Geom.3
2012 WCP-Nets: A Weighted Extension to CP-Nets for Web Service Selection
Jie Zhang 0002, Wenlong Sun, Hongye Song, Guibing Guo
ICSOC4