DAMA-UPC - Data Management Group de la Universitat Politècnica de Catalunya : Enviaments recents
Ara es mostren els items 13-24 de 41
-
Put three and three together: Triangle-driven community detection
(Association for Computing Machinery (ACM), 2016-02-01)
Article
Accés obertCommunity detection has arisen as one of the most relevant topics in the field of graph data mining due to its applications in many fields such as biology, social networks, or network traffic analysis. Although the existing ... -
Tècniques de feature weighting per casos no supervisats: Implementació a GESCONDA
(2006-07)
Report de recerca
Accés obertFeature selection and feature weighting methods in supervised domains have been thoroughly discussed in the literature. On the other hand, very little work has been done for unsupervised domains, probably due to the assumed ... -
Introduction to graph databases
(2014-09-08)
Capítol de llibre
Accés restringit per política de l'editorialThe use of graphs in analytic environments is getting more and more widespread, with applications in many different environments like social network analysis, fraud detection, industrial management, knowledge analysis, ... -
High quality, scalable and parallel community detection for large real graphs
(Association for Computing Machinery (ACM), 2014)
Text en actes de congrés
Accés restringit per política de l'editorialCommunity detection has arisen as one of the most relevant topics in the field of graph mining, principally for its applications in domains such as social or biological networks analysis. Different community detection ... -
Automatic multi-partite graph generation from arbitrary data
(2014-08-22)
Article
Accés restringit per política de l'editorialIn this paper we present a generic model for automatic generation of basic multi-partite graphs obtained from collections of arbitrary input data following user indications. The paper also presents GraphGen, a tool that ... -
Two-way replacement selection
(Association for Computing Machinery (ACM), 2010-09-01)
Article
Accés restringit per política de l'editorialThe performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacement Selection (RS) because, on average, it ... -
Using genetic algorithms for attribute grouping in multivariate microaggregation
(2014-01-01)
Article
Accés obertAnonymization techniques that provide k-anonymity suffer from loss of quality when data dimensionality is high. Microaggregation techniques are not an exception. Given a set of records, attributes are grouped into ... -
A discussion on the design of graph database benchmarks
(2011)
Article
Accés obertGraph Database Management systems (GDBs) are gaining popularity. They are used to analyze huge graph datasets that are naturally appearing in many application areas to model interrelated data. The objective of this paper ... -
Massive query expansion by exploiting graph knowledge bases for image retrieval
(Association for Computing Machinery (ACM), 2014)
Text en actes de congrés
Accés restringit per política de l'editorialAnnotation-based techniques for image retrieval suffer from sparse and short image textual descriptions. Moreover, users are often not able to describe their needs with the most appropriate keywords. This situation is a ... -
Producer-consumer: the programming model for future many-core processors
(Springer, 2013)
Text en actes de congrés
Accés restringit per política de l'editorialThe massive addition of cores on a chip is adding more pressure to the accesses to main memory. In order to avoid this bottleneck, we propose the use of a simple producer-consumer model, which allows for the temporary ... -
Hybrid tables for speeding-up data accesses in hybrid database management systems
(2011)
Comunicació de congrés
Accés obert -
Generalized median string computation by means of string embedding in vector spaces
(2012-11-01)
Article
Accés restringit per política de l'editorialIn structural pattern recognition the median string has been established as a useful tool to represent a set of strings. However, its exact computation is complex and of high computational burden. In this paper we propose ...