Submitted by Celso Magalhaes (celsomagalhaes@ufrrj.br) on 2018-08-28T12:21:13Z
No. of bitstreams: 1
2017 - Victor dos Santos Ponciano.pdf: 551672 bytes, checksum: c01424f760ef08254a63d236b62f72c5 (MD5) / Made available in DSpace on 2018-08-28T12:21:15Z (GMT). No. of bitstreams: 1
2017 - Victor dos Santos Ponciano.pdf: 551672 bytes, checksum: c01424f760ef08254a63d236b62f72c5 (MD5)
Previous issue date: 2017-02-21 / Conselho Nacional de Desenvolvimento Cient?fico e Tecnol?gico - CNPq / In 1946, Heider developed Signal Graph Theory with the purpose of describing the emotional
relationships between people pertaining to the same social group. In this work, we study
graph partitioning problems associated with structural balance. These problems are known in
the computer science literature as partition correlation problems: correlation clustering (CC)
and a relaxed version (RCC). The solution of CC and RCC problems has been previously
used in the literature as a tool for the evaluation of structural balance in a social network.
The aim of this work is to apply the solution of these problems in the detection of corruption
in public contracts. We describe integer linear programming formulations from the literature
for these problems. We also discuss a probabilistic model for Structural balance and the
solution of these problems applied to the detection of cases of corruption existing in public
bids. / Em 1946, Heider desenvolveu a Teoria de Grafos de Sinais a fim de descrever as rela??es
emocionais entre as pessoas pertencentes ao mesmo grupo social. Neste trabalho, estudamos
problemas de particionamento de grafo associados com equil?brio estrutural, que na literatura
de Ci?ncia da Computa??o s?o conhecidos como problemas de correla??o de parti??es ou,
em ingl?s, correlation clustering (CC), al?m de uma vers?o relaxada (RCC). As solu??es
dos problemas CC e RCC foram anteriormente utilizadas na literatura como ferramentas
para a avalia??o de equil?brio estrutural numa rede social. O objetivo deste trabalho ? aplicar
as solu??es destes problemas na detec??o de corrup??o em contratos p?blicos. Para esse fim,
s?o utilizadas formula??es de programa??o linear inteira existentes na literatura para estes
problemas. Al?m disso, ? discutido tamb?m um modelo probabil?stico para o Equil?brio
Estrutural e as solu??es destes problemas s?o aplicadas ? detec??o de casos de corrup??es
existentes em licita??es p?blicas.
| Identifer | oai:union.ndltd.org:IBICT/oai:localhost:jspui/2386 |
| Date | 21 February 2017 |
| Creators | Ponciano, Vitor dos Santos |
| Contributors | Greg?rio, Ronaldo Malheiros, Figueiredo, Rosa Maria Videira de, Cruz, Marcelo Dib, Frota, Yuri Abitbol de Menezes |
| Publisher | Universidade Federal Rural do Rio de Janeiro, Programa de P?s-Gradua??o em Modelagem Matem?tica e Computacional, UFRRJ, Brasil, Instituto de Ci?ncias Exatas |
| Source Sets | IBICT Brazilian ETDs |
| Language | Portuguese |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, info:eu-repo/semantics/masterThesis |
| Format | application/pdf |
| Source | reponame:Biblioteca Digital de Teses e Dissertações da UFRRJ, instname:Universidade Federal Rural do Rio de Janeiro, instacron:UFRRJ |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | ABELL, P.; LUDWIG, M. Structural balance: a dynamic perspective. Journal of Mathematical Sociology, v. 33, pp. 129-155, 2009. Citado na p?gina 12. ADEJUMO, G.; DUIMERING, P.; ZHONG, Z. A balance theory approach to group problem solving. Social Networks, vol. 30, pp. 83?99, 2008. Citado na p?gina 12. ALVARO, J. L.; GARRIDO, A. Psicologia social: perspectivas psicol?gicas e sociol?gicas. S?o Paulo: McGraw-Hill, 2006. Citado na p?gina 16. BANSAL, N.; BLUM, A.; CHAWLA, S. Correlation clustering. In:Proceedings of the 43rd annual IEEE symposium of foundations of computer science, pp. 238?250, 2002. Citado 2 vezes nas p?ginas 12 e 19. BRUSCO, M. et al. Two algorithms for relaxed structural balance partitioning: linking theory,models and data to understand social network phenomena. Sociological Methods Research, vol. 40, 57-87, 2011. Citado 2 vezes nas p?ginas 27 e 28. CAMPELO M., C. R. F. Y. Information processing letters. Networks, v. 89, pp. 1097-1111., 2004. Citado na p?gina 22. CARTWRIGHT, D.; HARARY, F. A note on a matrix criterion for unique colorability of a signed graph. Psychometrik, v.32, pp. 291-296, 1967. Citado 2 vezes nas p?ginas 12 e 14. DASGUPTA, B. et al. Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. BioSystems, vol. 90, pp. 161?178, 2007. Citado na p?gina 12. DAVIS, J. A. Clustering and structural balance in graph signed. Human Relations, vol. 20, pp. 181-187, 1967. Citado na p?gina 14. DOREIAN, P. A multiple indicator approach to blockmodeling signed networks. Social Networks, vol. 30, pp. 247-258, 2008. Citado 2 vezes nas p?ginas 19 e 28. DOREIAN, P.; MRVAR, A. A partitioning approach to structural balance. Social Networks, vol. 18, pp. 149-168, 1996. Citado 3 vezes nas p?ginas 12, 15 e 28. DOREIAN, P.; MRVAR, A. Partitioning signed social networks. [S.l.: s.n.], 2009. Citado 2 vezes nas p?ginas 12 e 19. DOREIAN, P.; MRVAR, A. Identifying fragments in networks for structural balance and tracking the levels of balance over time. Connections, v. 35, pp. 6-18, 2016. Citado na p?gina 12. DRUMMOND L., F. R. F. Y.; LEVORATO, M. Efficient solution of the correlation clustering problem: An application to structural balance. Springer Berlin Heidelberg. In Demey, Y. and Panetto,H., editors,on the Move to Meaningful Internet Systems: OTM 2013 Workshops Lecture Notes in Computer Science, v. 8186 pages 674?683, 2013. Citado na p?gina 12. Refer?ncias 56 ESTRADA, E.; BENZI, M. Walk-based measure of balance in signed networks: Detecting lack of balance in social networks. Physical Review E, v. 90, pp. 042802:1-10, 2014. Citado 4 vezes nas p?ginas 9, 12, 15 e 16. FAZEKAS, M.; T?TH, I. J. From corruption to state capture: A new analytical framework with empirical applications from Hungary. [S.l.]: Government Transparency Institute, 2014. Citado na p?gina 12. FAZEKAS, M.; T?TH, I. J. Three indicators of institutionalised grand corruption using administrative data. Corruption Research Centre, 2014. Citado 4 vezes nas p?ginas 36, 37, 38 e 40. FAZEKAS, M.; T?TH, I. J.; KING, L. P. Anatomy of grand corruption: A composite corruption risk index based on objective data. [S.l.]: Corruption Research Centre, 2013. Citado 3 vezes nas p?ginas 12, 35 e 36. FIGUEIREDO, R.; FROTA, Y. The maximum balanced subgraph of a signed graph: Applications and solution approaches. European Journal of Operational Research, vol. 236, pp. 473-487, 2014. Citado na p?gina 12. FIGUEIREDO, R.; MOURA, G. Mixed integer programming formulations for clustering problems related to structural balance. Social Networks, v. 35, pp. 639-651, 2013. Citado 6 vezes nas p?ginas 9, 12, 19, 21, 22 e 25. FROTA Y., M. N. N. T. R. C. A branch-and-cut algorithm for partition coloring. Networks, v. 55, pp. 194-204., 2010. Citado 2 vezes nas p?ginas 12 e 22. GAREY M.R., J. D. Computers and intractability. W.H.Free man and Company, New York., v. 24th ed, 2003. Citado na p?gina 21. GOUNEV, P.; BEZLOV, T. Examining the links between organised crime and corruption. Sofia: Center for the Study of Democracy, 2010. Citado na p?gina 35. HARVEY, J. H. Fritz heider (1896?1988). American Psychologist, vol. 44, 570-571, 1989. Citado na p?gina 12. HEIDER, F. Attitudes and cognitive organization. Journal of Psychology, vol. 21, pp. 107-112., 1946. Citado 2 vezes nas p?ginas 12 e 14. HELLMAN, J. S. et al. Measuring governance and state capture: The role of bureaucrats and firms in shaping the business environment. In: World Bank Working Paper 2312, 2000. Citado na p?gina 12. HUFFNER, F.; BETZLER, N.; NIEDERMEIER, R. Optimal edge deletions for signed graph balancing. In: Proceedings of 6th WEA in LNCS, vol. 4525, 297?310, 2007. Citado na p?gina 12. LEMANN T.B., S. R. Group characteristics as revealed in sociometric patterns and personality ratings. Sociometry, vol. 15, pp. 7?90, 1952. Citado na p?gina 27. LEVORATO, J. Efficient solutions to the correlation clustering problem. Disserta??o de Mestrado (UFF), 91 fls, Niter?i, Rio de Janeiro: [s.n.], 2015. Citado 3 vezes nas p?ginas 9, 20 e 22. Refer?ncias 57 MCKINNEY, J. C. An educational application of a two-dimensional sociometric test. Sociometry, v.11, pp. 356-367, 1948. Citado na p?gina 27. MENDONCA, I. et al. Relevance of negative links in graph partitioning: A case study using votes from the european parliament. In:2nd European Network Intelligence Conference (ENIC), 2015. Citado na p?gina 12. NEWCOMB, T. The acquaintance process. [S.l.]: Holt, Reinhard Winston, 1961. Citado na p?gina 28. RAMOS, C. D. Corrup??o e o papel do estado: uma an?lise sobre o controle e a interven??o estatal. Revista Banco de Id?ias: Encarte - Revista 37, Instituto Liberal, vol. 37, pp. 1-29, 2013. Citado na p?gina 35. SAMPSON, S. A novitiate in a period of change: An experimental case study of relationships. [S.l.: s.n.], 2009. Citado na p?gina 26. TRAAG, V. A.; BRUGGEMAN, J. Community detection in networks with positive and negative links. Physical Review E, vol. 80, pp. 036115:1-6, 2009. Citado na p?gina 12. TRICK, M. A. A column generation approach for graph coloring. INFORMS Journal of Computing, vol.8, pp. 334-354, 1996. Citado na p?gina 19. WOLSEY, L. Integer Programming. [S.l.]: Wiley, 1998. Citado 2 vezes nas p?ginas 23 e 24. |
Page generated in 0.0151 seconds