POTA improves short text clustering by generating reliable pseudo-labels.
problem Limited discriminative representations in short texts.
method POTA uses instance-level attention and optimal transport for semantic consistency and cluster structure.
result POTA outperforms state-of-the-art methods in short text clustering.
Study examines how cluster number affects short-text clustering, introducing a stability metric.
problem Challenges in finding meaningful clusters in short-text data.
method Introduces a stability metric to determine cluster robustness and visualizes cluster subdivisions.
result Choosing a cluster number involves balancing informativeness and complexity, not seeking a single 'optimal' solution.
Paper improves short text clustering by integrating semantic relationships into Optimal Transport.
problem Erroneous pseudo-labels caused by neglecting semantic consistency in existing OT methods.
method Designs an instance-level attention mechanism to capture semantic relationships and integrates them into the OT formulation.
result Generates reliable pseudo-labels that improve clustering accuracy.
Model clusters authors and topics in short texts like social media posts.
problem Analysis of short texts is difficult due to brevity and lack of context.
method Expands Latent Dirichlet Allocation to model word dependencies and cluster users.
result Improves topic and user clustering, outperforming traditional methods.
In this paper we consider the problem of clustering collections of very short texts using subspace clustering. This problem arises in many applications such as product categorisation, fraud detection, and sentiment analysis. The main challenge lies in the fact that the vectorial representation of short texts is both hi…
Paper introduces a new text clustering model using Beta-Liouville priors.
problem Clustering short text data.
method Develops a hierarchical mixture model with Beta-Liouville priors for short text clustering.
result The Beta-Liouville distribution offers a more flexible correlation structure for short text clustering.
A graph model improves short text classification by integrating sentence relationships.
problem Sparse features in short text classification due to limited text length.
method PathWalk model combining graph networks and short sentences.
result PathWalk achieves state-of-the-art results on four datasets.
Recent approaches based on artificial neural networks (ANNs) have shown promising results for short-text classification. However, many short texts occur in sequences (e.g., sentences in a document or utterances in a dialog), and most existing ANN-based systems do not leverage the preceding short texts when classifying …
Text clustering method replaces centroids with summaries for interpretability and scalability.
problem Efficiently clustering text data while maintaining interpretability and scalability.
method k-NLPmeans and k-LLMmeans, which periodically replace numeric centroids with textual summaries.
result Consistently outperforms classical baselines and recent LLM-based clustering methods.
SoulMate links short texts through multi-aspect embeddings.
problem Linking authors of noisy, ambiguous short texts.
method Neural network-based temporal-textual framework generating author subgraphs.
result Higher performance in linking short-text authors compared to competitors.
BBM models short texts using biterms to improve coherence.
problem Challenges in analyzing short texts from social media.
method Bag of Biterms (BoB) for document representation and simple statistical models.
result BBM enhances coherence and performance over traditional models.
Survey on reproducibility and distortion issues in text clustering and topic modeling.
problem Reproducibility and misleading cluster geometry in unsupervised learning for text categorization.
method Systematic literature review of text clustering and topic modeling from 2011-2022.
result Outliers and initialization issues are significant factors in text clustering and topic modeling.
Paper introduces new indicators for forecasting crude oil prices using short news headlines.
problem Forecasting crude oil prices from short, noisy news headlines using LDA.
method Developed two novel indicators for topic and sentiment from short text data, and applied AdaBoost.RT.
result AdaBoost.RT with the proposed indicators outperforms benchmarks in crude oil forecasting.
Simplified image clustering achieves competitive results without text-based embeddings.
problem Complexity and resource requirements of state-of-the-art clustering methods.
method SCP: trains a small cluster head using pre-trained vision model features and positive data pairs.
result SCP achieves highly competitive performance on various benchmark datasets.
Proposes spherical text embedding for better directional similarity.
problem Directional similarity is more effective but unsupervised text embeddings are typically learned in Euclidean space.
method Develops a spherical generative model and an efficient optimization algorithm for unsupervised word and paragraph embeddings.
result Achieves state-of-the-art performances on various text embedding tasks.
In this technical report, we present jLDADMM---an easy-to-use Java toolkit for conventional topic models. jLDADMM is released to provide alternatives for topic modeling on normal or short texts. It provides implementations of the Latent Dirichlet Allocation topic model and the one-topic-per-document Dirichlet Multinomi…
We propose JECL, a method for clustering image-caption pairs by training parallel encoders with regularized clustering and alignment objectives, simultaneously learning both representations and cluster assignments. These image-caption pairs arise frequently in high-value applications where structured training data is e…
AOBTM adapts online topic modeling for short app reviews, revealing coherent topics over time.
problem Challenges in inferring latent topics from short, dynamic app reviews over multiple versions.
method Adaptive Online Biterm Topic Model (AOBTM) that addresses sparsity and considers statistical data from previous versions.
result AOBTM finds more coherent topics and outperforms state-of-the-art baselines.
Current state-of-the-art nonparametric Bayesian text clustering methods model documents through multinomial distribution on bags of words. Although these methods can effectively utilize the word burstiness representation of documents and achieve decent performance, they do not explore the sequential information of text…
We give a short proof of a theorem of Handel and Mosher stating that any finitely generated subgroup of Out(FN) either contains a fully irreducible automorphism, or virtually fixes the conjugacy class of a proper free factor of FN, and we extend their result to non finitely generated subgroups of $\text{Ou…
APLC-XLNet improves XMTC by clustering labels and reducing computational time.
problem Efficiently tagging texts with many labels from a large set.
method Fine-tunes XLNet with APLC to approximate cross entropy loss.
result Achieved state-of-the-art results on XMTC benchmarks.
In this short communication we introduce the quick clustering algorithm (QUIST), an efficient hierarchical clustering algorithm based on sorting. QUIST is a poly-logarithmic divisive clustering algorithm that does not assume the number of clusters, and/or the cluster size to be known ahead of time. It is also insensiti…
New Gamma-Poisson model improves topic selection for short text.
problem Topic modelling for short text using Poisson distribution.
method Gamma-Poisson mixture model with collapsed Gibbs sampler.
result Gamma-Poisson model selects more accurate number of topics.
MultiwayPAM clusters LLM-as-a-Judge scores to reveal evaluator bias.
problem Revealing bias in LLM evaluations of text quality.
method Tensor clustering with MultiwayPAM method.
result Medoids reveal cluster membership of questions, answerers, and evaluators.
The large volume of text in electronic healthcare records often remains underused due to a lack of methodologies to extract interpretable content. Here we present an unsupervised framework for the analysis of free text that combines text-embedding with paragraph vectors and graph-theoretical multiscale community detect…
Fuzzy clustering reduces text data dimensions effectively.
problem Sparsity and high dimensionality in document-term frequency matrices.
method Fuzzy clustering applied as a new unsupervised feature transformation method.
result Fuzzy clustering outperforms PCA and SVD in reducing text data dimensions.
Cluster analysis is a field of data analysis that extracts underlying patterns in data. One application of cluster analysis is in text-mining, the analysis of large collections of text to find similarities between documents. We used a collection of about 30,000 tweets extracted from Twitter just before the World Cup st…
A new text clustering method using NMF and LSA improves stability and performance.
problem Text data's large, sparse term-document matrix makes clustering difficult.
method Proposes a new feature agglomeration method based on NMF and deterministic K-Means initialization.
result Significantly improves clustering performance and stability.
New SMC algorithm reduces memory usage for online clustering.
problem Uncertainty in online clustering with complex distributions.
method Decomposes clustering into independent subproblems using SMC.
result Accurately and efficiently solves clustering problems.
Automates summarizing federal grant audits with machine learning.
problem Manual analysis of large federal grant audits is time-consuming and error-prone.
method Sentence clustering, k-means, proximity to centroids, human input for refinement.
result Automated summaries are comparable to human-generated ones using ROUGE metric.
As the emergence and the thriving development of social networks, a huge number of short texts are accumulated and need to be processed. Inferring latent topics of collected short texts is useful for understanding its hidden structure and predicting new contents. Unlike conventional topic models such as latent Dirichle…
System identifies language of transliterated text.
problem Users struggle to understand non-native language transliterated text.
method Feature extraction of phonetic syllables using LSTM network.
result System accurately identifies language of transliterated text.
Developed text classification system for Azerbaijani language.
problem Text clustering problem in Azerbaijani language.
method Machine learning and embedding techniques.
result System successfully categorizes news, product reviews, and more.
New algorithm clusters GRBs into two groups: short and long duration.
problem Determining the number of clusters in gamma-ray bursts.
method Completely parameter-free clustering algorithm.
result Clusters indicate two main groups: short and long duration GRBs.
This work uses image generation models to find vision model bugs.
problem Automatically discovering failures in vision models.
method Conditional text-to-image generation and captioning models.
result Demonstrated utility of large-scale generative models to find vision model bugs.
Concept Relation Discovery and Innovation Enabling Technology (CORDIET), is a toolbox for gaining new knowledge from unstructured text data. At the core of CORDIET is the C-K theory which captures the essential elements of innovation. The tool uses Formal Concept Analysis (FCA), Emergent Self Organizing Maps (ESOM) and…
This study improves sentence embeddings from BERT models.
problem Capturing the underlying meaning of sentences using BERT models.
method Comprehensive review and testing of various sentence embedding extraction and refinement methods.
result Representation-shaping techniques significantly improve sentence embeddings from BERT-based and simple baseline models.
A novel multilayer network approach for text analysis.
problem Clustering documents and finding topics in large collections with metadata and hyperlinks.
method Multilayer Networks and Stochastic Block Models applied to multiple data types.
result Taking into account multiple types of information improves topic and document clustering.
New method clusters tensors with heteroskedastic noise.
problem Clustering tensors with varying noise levels.
method Two-stage method: subspace estimation followed by approximate k-means. result Proves exact clustering for SNR above computational limit.
Improves video search by balancing text and visual modalities.
problem Modality imbalance in video search models, focusing mainly on text matching.
method Proposes MBVR with MS samples and DM to balance modalities.
result Empirically shows significant improvement in modality balance and search effectiveness.
SCROLLS benchmarks long text NLP tasks, improving existing models.
problem Short NLP benchmarks ignore long texts; SCROLLS addresses this.
method Handpicked long-text datasets for summarization, QA, and inference tasks.
result Improvement potential on SCROLLS tasks, as indicated by initial baselines.
Enhances LLMs for predicting stock movements by considering news dissemination and context.
problem Lack of consideration for news dissemination and insufficient contextual data in LLMs for stock price prediction.
method Clusters news for reach assessment, enriches prompts with specific data and instructions, fine-tunes an LLM using the dataset.
result Improves prediction accuracy by 8% compared to existing methods.
New method evaluates text-to-image synthesis for realism, variety, and semantic accuracy.
problem Lack of metrics revealing semantic accuracy in text-to-image synthesis.
method Uses Inception network representations and t-SNE visualization for semantic evaluation.
result Classification accuracy of generated images to real images' visual concepts correlates with semantic accuracy.
The increasing volume of short texts generated on social media sites, such as Twitter or Facebook, creates a great demand for effective and efficient topic modeling approaches. While latent Dirichlet allocation (LDA) can be applied, it is not optimal due to its weakness in handling short texts with fast-changing topics…
Understanding a user's motivations provides valuable information beyond the ability to recommend items. Quite often this can be accomplished by perusing both ratings and review texts, since it is the latter where the reasoning for specific preferences is explicitly expressed. Unfortunately matrix factorization approach…
We apply text analysis approaches for a specialized search engine for 3D CAD models and associated products. The main goals are to distinguish between actual product descriptions and other text on a website, as well as to decide whether a given text is or contains a product name. For this we use paragraph vectors for t…
Hybrid approach combines topic and graph embeddings for legal document clustering.
problem Challenges in classifying legal texts due to domain-specific language and limited labeled data.
method Combines unsupervised topic and graph embeddings with a supervised model.
result Improves clustering quality over text-only or graph-only embeddings.
A latent-variable model is introduced for text matching, inferring sentence representations by jointly optimizing generative and discriminative objectives. To alleviate typical optimization challenges in latent-variable models for text, we employ deconvolutional networks as the sequence decoder (generator), providing l…