activity
20152022
most citedVariations of the Similarity Function of TextRank for Automated Summarization

112 citations · 118 across the 6 of their papers we have counts for

collaborators

7 papers

cs.LG2022★ 1 cited

Improving Data Quality with Training Dynamics of Gradient Boosting Decision Trees

Moacir Antonelli Ponti, Lucas de Angelis Oliveira, Mathias Esteban +3

Real world datasets contain incorrectly labeled instances that hamper the performance of the model and, in particular, the ability to generalize out of distribution. Also, each exa…

cs.LG2018

Iterative evaluation of LSTM cells

Leandro Palma, Luis Argerich

In this work we present a modification in the conventional flow of information through a LSTM network, which we consider well suited for RNNs in general. The modification leads to…

cs.CL2017

From Imitation to Prediction, Data Compression vs Recurrent Neural Networks for Natural Language Processing

Juan Andrés Laura, Gabriel Masi, Luis Argerich

In recent studies [1][13][12] Recurrent Neural Networks were used for generative processes and their surprising performance can be explained by their ability to create good predict…

cs.DS2017★ 1 cited

Generic LSH Families for the Angular Distance Based on Johnson-Lindenstrauss Projections and Feature Hashing LSH

Luis Argerich, Natalia Golmar

In this paper we propose the creation of generic LSH families for the angular distance based on Johnson-Lindenstrauss projections. We show that feature hashing is a valid J-L proje…

cs.CL2016★ 2 cited

Hash2Vec, Feature Hashing for Word Embeddings

Luis Argerich, Joaquín Torré Zaffaroni, Matías J Cano

In this paper we propose the application of feature hashing to create word embeddings for natural language processing. Feature hashing has been used successfully to create document…

cs.CL2016★ 112 cited

Variations of the Similarity Function of TextRank for Automated Summarization

Federico Barrios, Federico López, Luis Argerich +1

This article presents new alternatives to the similarity function for the TextRank algorithm for automatic summarization of texts. We describe the generalities of the algorithm and…

cs.SI2015★ 2 cited

EntropyWalker, a Fast Algorithm for Small Community Detection in Large Graphs

Luis Argerich

This report presents a very simple algorithm for overlaping community-detection in large graphs under constraints such as the minimum and maximum number of members allowed. The alg…