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

Krissanee Kamthawee

dblp:383/7011 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 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.

Artificial intelligence
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › text mining › text clustering
short text clustering
0.812024
MIST: Mutual Information Maximization for Short Text Clustering · ACL (1) 2024
Natural language and speech › Information extraction and text analysis › text mining
text clustering
0.812024
MIST: Mutual Information Maximization for Short Text Clustering · ACL (1) 2024

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

mutual information maximization · 0.8contrastive learning · 0.8
YearPublicationVenuePosition
2024 MIST: Mutual Information Maximization for Short Text Clustering
abstract
Short text clustering poses substantial challenges due to the limited amount of information provided by each text sample.Previous efforts based on dense representations are still inadequate as texts are not sufficiently segregated in the embedding space before clustering.Even though the state-of-the-art method utilizes contrastive learning to boost performance, the process of summarizing all local tokens to form a sequence representation for the whole text includes noise that may obscure limited key information.We propose Mutual Information Maximization Framework for Short Text Clustering (MIST), which overcomes the information drown-out by including a mechanism to maximize the mutual information between representations on both sequence and token levels.Experimental results across eight standard short text datasets show that MIST outperforms the state-of-the-art method in terms of Accuracy or Normalized Mutual Information in most cases. 1
Krissanee Kamthawee, Can Udomcharoenchaikit, Sarana Nutanong
ACL (1)1