Given the large amount of data provided by the Web 2.0, there is a pressing need to obtain new metrics to better understand the network structure; how their communities are organized and the way they evolve over time. Complex network and graph mining metrics are essentially based on low complexity computational procedures like the diameter of the graph, clustering coefficient and the degree distribution of the ...
Congresso organizado pela Efiusco, realizado em Córdoba de 19-20 de Maio de 2011 ; Weights restriction is a well-known technique in the DEA field. When those techniques are applied,weights cluster around its new limits, making its evaluation dependent of its levels. This paper introduces a new approach to weights adjustment by Goal Programming techniques, avoiding the imposition of hard restrictions that can e...
In social network analysis, a k-clique is a relaxed clique, i.e., a k-clique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between any two vertices is no greater than k. The visualization of a small number of vertices can be easily performed in a graph. However, when the number of vertices and edges increases the visualization becomes incomprehensible. In this paper, we ...
DEA é uma técnica de programação matemática apresentada em 1978 por Charnes, Cooper e Rhodes, focado principalmente na avaliação da eficiência de organizações com finalidades não-lucrativas. Ao construir um modelo de DEA, uma decisão principal é a escolha dos “inputs” e dos “outputs” para o estudo. O modelo de DEA não é adequado para estudos com julgamentos díspares sobre a preferência dos atributos. Isto é sup...
Financiadores do RCAAP | |||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |