相关论文: Clustering words

Text clustering holds significant value across various domains due to its ability to identify patterns and group related information. Current approaches which rely heavily on a computed similarity measure between documents are often limited…

The notion of Wheeler languages is rooted in the Burrows-Wheeler transform (BWT), one of the most central concepts in data compression and indexing. The BWT has been generalized to finite automata, the so-called Wheeler automata, by Gagie…

This paper aims to use term clustering to build a modular ontology according to core ontology from domain-specific text. The acquisition of semantic knowledge focuses on noun phrase appearing with the same syntactic roles in relation to a…

Word sense induction (WSI) is the task of unsupervised clustering of word usages within a sentence to distinguish senses. Recent work obtain strong results by clustering lexical substitutes derived from pre-trained RNN language models…

We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…

Learning word embeddings using distributional information is a task that has been studied by many researchers, and a lot of studies are reported in the literature. On the contrary, less studies were done for the case of multiple languages.…

Even though large language models (LLMs) have demonstrated remarkable capability in solving various natural language tasks, the capability of an LLM to follow human instructions is still a concern. Recent works have shown great improvements…

The Burrows-Wheeler Transform (BWT) moves characters with similar contexts in a text together, where a character's context consists of the characters immediately following it. We say that a property has contextual locality if characters…

Perfectly clustering words are one of many possible generalizations of Christoffel words. In this article, we propose a factorization of a perfectly clustering word on a $n$ letters alphabet into a product of $n-1$ palindromes with a letter…

In this work we seek clusters of genomic words in human DNA by studying their inter-word lag distributions. Due to the particularly spiked nature of these histograms, a clustering procedure is proposed that first decomposes each…

We introduce a simple model of active transport for an ensemble of particles driven by an external shear flow. Active refers to the fact that the flow of the particles is modified by the distribution of particles itself. The model consists…

Clustering is a fundamental data mining tool that aims to divide data into groups of similar items. Generally, intuition about clustering reflects the ideal case -- exact data sets endowed with flawless dissimilarity between individual…

Distributional text clustering delivers semantically informative representations and captures the relevance between each word and semantic clustering centroids. We extend the neural text clustering approach to text classification tasks by…

This study focuses on exploring the use of local interpretability methods for explaining time series clustering models. Many of the state-of-the-art clustering models are not directly explainable. To provide explanations for these…

A new model that describes adsorption and clustering of particles on a surface is introduced. A {\it clustering} transition is found which separates between a phase of weakly correlated particle distributions and a phase of strongly…

We introduce a topological approach to words. Words are approximated by Gauss words and then studied up to natural modifications inspired by homotopy transformations of curves on the plane.

We conjecture a characterization of a cluster automorphism as an algebra homomorphism from the cluster algebra to itself that restricts to a bijection between two clusters. This formulation does not require that the map commutes with…

Cluster algebras are a class of commutative algebras whose generators are defined by a recursive process called mutation. We give a brief introduction to cluster algebras, and explain how discrete integrable systems can appear in the…

We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular words, then mention possible applications to various…

In a stationary ergodic process, clustering is defined as the tendency of events to appear in series of increased frequency separated by longer breaks. Such behavior, contradicting the theoretical "unbiased behavior" with exponential…