SearcharxivSearch

arXiv subjects

Marcelo S. Reis

Publications and source records attributed to Marcelo S. Reis.

3 recordsLinked to original sources

ERASMO: Leveraging Large Language Models for Enhanced Clustering Segmentation

Cluster analysis plays a crucial role in various domains and applications, such as customer segmentation in marketing. These contexts often involve multimodal data, including both tabular and textual datasets, making it challenging to represent hidden patterns for obtaining meaningful clusters. This study introduces ERASMO, a framework designed to fine-tune a pretrained language model on textually encoded tabular data and generate embeddings from the fine-tuned model. ERASMO employs a textual converter to transform tabular data into a textual format, enabling the language model to process and understand the data more effectively. Additionally, ERASMO produces contextually rich and structurally representative embeddings through techniques such as random feature sequence shuffling and number verbalization. Extensive experimental evaluations were conducted using multiple datasets and baseline approaches. Our results demonstrate that ERASMO fully leverages the specific context of each tabular dataset, leading to more precise and nuanced embeddings for accurate clustering. This approach enhances clustering performance by capturing complex relationship patterns within diverse tabular data.

cs.CL

Finding steady-state solutions for ODE systems of zero, first and homogeneous second-order chemical reactions is NP-hard

In the context of modeling of cell signaling pathways, a relevant step is finding steady-state solutions for ODE systems that describe the kinetics of a set of chemical reactions, especially sets composed of zero, first, and second-order reactions. To compute a steady-state solution, one must set the left-hand side of each ODE as zero, hence obtaining a system of non-negative, quadratic polynomial equations. If all second-order reactions are homogeneous in respect to their reactants, then the obtained quadratic polynomial equation system will also have univariate monomials. Although it is a well-known fact that finding a root of a quadratic polynomial equation system is a NP-hard problem, it is not so easy to find a readily available proof of NP-hardness for special cases like the aforementioned one. Therefore, we provide here a self-contained proof that finding a root of non-negative, with univariate monomials quadratic polynomial equation system (NUMQ-PES) is NP-hard. This result implies that finding steady-state solutions for ODE systems of zero, first and homogeneous second-order chemical reactions is a NP-hard problem; hence, it is not a feasible approach to approximate non-homogeneous second-order reactions into homogeneous ones.

cs.CC

The U-curve optimization problem: improvements on the original algorithm and time complexity analysis

The U-curve optimization problem is characterized by a decomposable in U-shaped curves cost function over the chains of a Boolean lattice. This problem can be applied to model the classical feature selection problem in Machine Learning. Recently, the U-Curve algorithm was proposed to give optimal solutions to the U-curve problem. In this article, we point out that the U-Curve algorithm is in fact suboptimal, and introduce the U-Curve-Search (UCS) algorithm, which is actually optimal. We also present the results of optimal and suboptimal experiments, in which UCS is compared with the UBB optimal branch-and-bound algorithm and the SFFS heuristic, respectively. We show that, in both experiments, $\proc{UCS}$ had a better performance than its competitor. Finally, we analyze the obtained results and point out improvements on UCS that might enhance the performance of this algorithm.

cs.LG