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

Xian-Ming Gu

dblp:144/9417 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0001-7895-2050ORCID · verified

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

Systems, architecture and hardware · 1 · 1 since 2021Databases, 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
Data mining · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
text mining
0.712023
Learning Discriminative Text Representation for Streaming Social Event Detection · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Representation and self-supervised learning
contrastive learning
0.212023
Learning Discriminative Text Representation for Streaming Social Event Detection · IEEE Trans. Knowl. Data Eng. 2023

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

online update · 1.3heterogeneous graph · 1.3contrastive learning · 1.3
YearPublicationVenuePosition
2024 Application of an extrapolation method in the Hessenberg algorithm for computing PageRank
Qian-Ying Hu, Xian-Ming Gu, Chun Wen
J. Supercomput.2
2023 Learning Discriminative Text Representation for Streaming Social Event Detection
abstract
Event detection on social platforms can help people perceive essential events and make actionable decisions. Existing document-pivot streaming social event detection methods generally embed documents and perform text clustering. They face the challenges of constantly changing context and unknown event categories and struggle by designing compound text representation methods and various similarity measures. However, phased, well-designed methods are excessively fragile and unable to utilize the potential of text representations fully. Meanwhile, their complex threshold settings result in clustering-based event detection suffering the pain of ever-changing environments. We propose a text representation learning method namely Text Similarity Contrastive Learning Neural Network (Text-SimCLNN) to tackle these challenges. Text-SimCLNN uses smaller parts to learn the similarity probability of text pairs from semantic and structural perspectives, effectively bridging the gap between text representation learning and similarity measure in streaming event detection. Event discovery and merging in streams can be easily performed based on the learned representations, and we use various techniques to speed up such processes. Furthermore, we introduce an online update mechanism that uses heterogeneous graphs to generate high-quality samples to enable stable and reliable inductive learning. Extensive experiments on two real-world datasets demonstrate that our method far exceeds state-of-the-art (SOTA).
Chaodong Tong, Huailiang Peng, Qiong Dai, Ruitong Zhang 0001, Hanjie Xu, Xian-Ming Gu
IEEE Trans. Knowl. Data Eng.8