RevistasRevistas relacionadas con Bioinformáticahttp://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/13862026-05-22T19:05:10Z2026-05-22T19:05:10ZCompetitive author profiling using compression-based strategiesClaude, FranciscoGalaktionov, DanivKonow, RobertoLadra, SusanaPedreira, Óscarhttp://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/14062025-10-20T11:00:27Z2019-01-01T00:00:00ZCompetitive author profiling using compression-based strategies
Claude, Francisco; Galaktionov, Daniv; Konow, Roberto; Ladra, Susana; Pedreira, Óscar
In this paper we address the problem by using several compression-inspired strategiesthat generate different models without analyzing or extracting specific features from thetextual content, making them style-oblivious approaches. We analyze the behavior ofthese techniques, combine them and compare them with other state-of-the-art methods.We show that they can be competitive in terms of accuracy, giving the best predictionsfor some domains, and they are efficient in time performance.
2019-01-01T00:00:00ZCompact and Efficient Representation of General Graph Databases1.0Álvarez-García, SandraFreire, BorjaLadra, SusanaPedreira, Óscarhttp://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/14032025-10-20T10:59:18Z2019-01-01T00:00:00ZCompact and Efficient Representation of General Graph Databases1.0
Álvarez-García, Sandra; Freire, Borja; Ladra, Susana; Pedreira, Óscar
In this paper, we propose a compact data structure to store labeled at-tributed graphs based on thek2-tree, which is a very compact data structure designedto represent a simple directed graph. The idea we propose can be seen as an extension ofthek2-tree to support property graphs. In addition to the static approach, we also pro-pose a dynamic version of the storage representation, which allows flexible schemas andinsertion or deletion of data. We provide an implementation of a basic set of operations,which can be combined to form complex queries over these graphs with attributes. Weevaluate the performance of our proposal with existing graph database systems andprove that our compact attributed graph representation obtains also competitive timeresults.
2019-01-01T00:00:00Z