Literatura académica sobre el tema "FACEBOOK GRAPH"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "FACEBOOK GRAPH".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "FACEBOOK GRAPH"
Weaver, Jesse y Paul Tarjan. "Facebook Linked Data via the Graph API". Semantic Web 4, n.º 3 (2013): 245–50. http://dx.doi.org/10.3233/sw-2012-0078.
Texto completoAlsaif, Suleiman Ali, Adel Hidri y Minyar Sassi Hidri. "Towards Inferring Influential Facebook Users". Computers 10, n.º 5 (9 de mayo de 2021): 62. http://dx.doi.org/10.3390/computers10050062.
Texto completoProcaci, Thiago Baesso, Sean Wolfgand M. Siqueira y Leila Cristina Vasconcelos de Andrade. "Finding Experts on Facebook Communities". International Journal of Knowledge Society Research 5, n.º 2 (abril de 2014): 7–19. http://dx.doi.org/10.4018/ijksr.2014040102.
Texto completoXu, Jin, Yu Zhong y Bo Peng. "Parallel k-Way Partitioning Approach for Large Graphs". Advanced Materials Research 912-914 (abril de 2014): 1309–12. http://dx.doi.org/10.4028/www.scientific.net/amr.912-914.1309.
Texto completoBanerjee, Arijeet y Pijush Kanti Kumar. "Review of Shortest Path Algorithm". International Journal of Computer Science and Mobile Computing 11, n.º 4 (30 de abril de 2022): 1–8. http://dx.doi.org/10.47760/ijcsmc.2022.v11i04.001.
Texto completoDas, Sauvik y Adam Kramer. "Self-Censorship on Facebook". Proceedings of the International AAAI Conference on Web and Social Media 7, n.º 1 (3 de agosto de 2021): 120–27. http://dx.doi.org/10.1609/icwsm.v7i1.14412.
Texto completoZhang, Yilin, Marie Poux-Berthe, Chris Wells, Karolina Koc-Michalska y Karl Rohe. "Discovering political topics in Facebook discussion threads with graph contextualization". Annals of Applied Statistics 12, n.º 2 (junio de 2018): 1096–123. http://dx.doi.org/10.1214/18-aoas1191.
Texto completoTerrana, Diego, Agnese Augello y Giovanni Pilato. "Analysis of Facebook Users' Relationships Through Sentiment Classification: A Case Study of Italian Politicians". International Journal of Semantic Computing 08, n.º 03 (septiembre de 2014): 301–17. http://dx.doi.org/10.1142/s1793351x14400108.
Texto completoNugroho, Arif y Anna Agustina. "Examining Corporate Engagement in Social Media: Advancing The Use of Facebook for Corporation Page". CoverAge: Journal of Strategic Communication 10, n.º 2 (29 de marzo de 2020): 1–10. http://dx.doi.org/10.35814/coverage.v10i2.1377.
Texto completoWu, Kuixian, Jian Gao, Rong Chen y Xianji Cui. "Vertex Selection Heuristics in Branch-and-Bound Algorithms for the Maximum k-Plex Problem". International Journal on Artificial Intelligence Tools 28, n.º 05 (agosto de 2019): 1950015. http://dx.doi.org/10.1142/s0218213019500155.
Texto completoTesis sobre el tema "FACEBOOK GRAPH"
Iu, Marco. "Serviceklass för Facebook Graph API". Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-13729.
Texto completoThis report is based on a subset of a project that was made for the company SocialWorks. The project included working with web services. Through web services, web applications are able to communicate and send data to each other. When a web service is used, the user has to study the web service API. This report addresses a number of problems that might arise from the use of such web services and how these problems can be solved by creating a service class that is used as a middle layer. All API calls will be made through the service class and thus changes in the API will only require modification of code in the service class. As a result of this report a service class was created using the PHP framework Zend Framework to facilitate the use of Facebook's Graph API. By using the service class, the user does not have to study the Facebook Graph API in detail. A test application was created to test the service class functionality and manage test users provided by the Facebook Graph API.
Enchill, Happy S. "LDConnect - a SoLiD compliant interface for the Facebook social graph". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/105985.
Texto completoThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 31-32).
LDConnect is a service that allows Crosscloud applications to easily interact with Facebook data. This paper describes the design of LDConnect and the benefits that it provides Crosscloud developers over other methods of interacting with Facebook data. LDConnect's live translation of JSON data to RDF and vice-a-versa makes it easy for developers to run CRUD applications on Facebook elements using the same access methods they would use to access Crosscloud backends.
by Happy S. Enchill.
M. Eng.
Pereira, Jorge André Henriques. "Leveraging facebook’s open graph to develop an environmental persuasive application". Master's thesis, Faculdade de Ciências e Tecnologia, 2013. http://hdl.handle.net/10362/10998.
Texto completoSocial networking sites persuade millions of users each day to adopt specific behaviors. Using the persuasive principles inherent to these sites to increase environmental awareness and reduce our ecological footprint can be challenging but certainly worthy. The DEAP project has already invested time and resources to address persuasion through different devices for a broad audience. However, there are still many obstacles when it comes to such a delicate subject as people’s routines. For many years, social factors have prevented people from adopting a way of living friendlier to our Environment. Whether it is due to lack of proper knowledge about this topic or simply because they are not willing to change, the truth is that we are eventually reaching a point where it will be too late to keep our planet as we know it. Consequently, the time has arrived when there is great need for a platform to bring existing efforts together no matter where they come from but the goal they share: change incorrect behaviors towards environmental sustainability. Towards this ambitious goal a board game was developed and integrated in Facebook capable of merging third-party applications and an important and valuable basis for future research in the field of persuasion.
Coco, Giuseppe Antonio. "Social media evaluation for non-profit organizations : The case of Oxfam Italia". Thesis, Uppsala universitet, Medier och kommunikation, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-232708.
Texto completoJiránek, Aleš. "Analýza a vizualizace vztahů nad daty ze sociálních sítí". Master's thesis, Vysoká škola ekonomická v Praze, 2015. http://www.nusl.cz/ntk/nusl-203987.
Texto completoHrdlička, Pavel. "Model rozhraní sociální sítě elektronického obchodu". Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2011. http://www.nusl.cz/ntk/nusl-222931.
Texto completoNovosad, Andrej. "Využití metod dolování dat pro analýzu sociálních sítí". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236424.
Texto completoSáez-Trumper, Diego. "Finding relevant people in online social networks". Doctoral thesis, Universitat Pompeu Fabra, 2013. http://hdl.handle.net/10803/283658.
Texto completoL'objectiu d'aquesta tesi és desenvolupar noves tècniques per trobar persones rellevants en les Xarxes Socials a Internet. Així doncs, considerem diferents nocions de rellevància, tenint en compte el punt de vista dels prove ïdors del servei (com Facebook) i dels anunciants, però també de persones que intenten proposar noves idees i temes a la xarxa. La nostra investigació va més enllà de la popularitat de les persones, mostra que els usuaris amb molts seguidors no són necessàriament els més rellevants. Específicament, desenvolupem tres algorismes que permeten: (i) calcular el valor (monetari) que cada usuari produeix per al prove ïdor del servei; (ii) trobar usuaris que proposen noves idees i creen tendències; i (iii) un sistema de recomanació que permet als anunciants (centrant-nos en botigues locals, com ara un restaurant o un pub) trobar clients potencials. Addicionalment, lliurem informació útil sobre el comportament dels usuaris segons la seva rellevància i popularitat, mostrant, entre altres coses, que els usuaris més actius solen ser més rellevants que els populars. A més a més, mostrem que normalment els usuaris molt populars arriben tard a les noves tendències, mentre que usuaris de menor popularitat, però molt actius, generen valor i fomenten noves idees a la xarxa .
El objetivo de esta tesis es desarrollar nuevas técnicas para encontrar personas relevantes en las Redes Sociales en Internet. Para ello, consideramos diferentes nociones de relevancia, tomando el punto de vista de los proveedores del servicio (como Facebook) y de los anunciantes, pero también de las personas que intentan proponer nuevas ideas y temas en la red. Nuestra investigación va más allá de la popularidad de las personas, mostrando que los usuarios con muchos seguidores no son necesariamente los más relevantes. Espeficamente, desarollamos tres algoritmos que permiten: (i) calcular el valor (monetario) que cada usuario produce para el proveedor del servicio; (ii) encontrar usuarios que proponen nuevas ideas y crean tendencias; y (iii) un sistema de recomendación que permite a los anunciantes (centrándonos en tiendas locales, tales como un restaurant o un pub) encontrar potenciales clientes. Adicionalmente, proporcionamos información útil sobre el comportamiento de los usuarios según su relevancia y popularidad, mostrando - entre otras cosas - que los usuarios más activos suelen ser más relevantes que los populares. Más aún, mostramos que normalmente los usuarios muy populares llegan tarde a las nuevas tendencias, y que existen usuarios menos populares, pero muy activos que generan valor y fomentan nuevas ideas en la red.
BERHE, ZENAWI HAILESLASSIE. "SENTIMENT ANALYSIS IN SOCIAL MEDIA ON FACEBOOK". Thesis, 2019. http://dspace.dtu.ac.in:8080/jspui/handle/repository/16695.
Texto completoAbdelkamel, Abdelmadjid. "Facebook et les dispositifs de traçabilité vus sous l’angle du droit canadien". Thèse, 2013. http://hdl.handle.net/1866/10010.
Texto completoToday we talk about the social Web. Facebook for example bears the mark of its time, as it becomes the most coveted social networking Web site in the world. However, the company has been criticized due to its policy that violates people's privacy. Through its social plugins, Facebook has the potential to collect considerable amounts of information about users without their knowledge and without their consent, a fact which is unknown to most of them. Certainly, the company must ensure its economic stability through these activities. However, this quest for subsistence should not be to the detriment of people's privacy. Canada has legal tools for the protection of privacy that allow users to deal with this kind of threat. However, Web companies such Facebook succeed to circumvent the law.
Libros sobre el tema "FACEBOOK GRAPH"
I, Prince Far. Facebook Graph API development with Flash: Beginner's guide : build social Flash applications fully integrated with the Facebook Graph API. Birmingham, U.K: Packt Pub., 2010.
Buscar texto completoApeksha, Singh, ed. Facebook application development with Graph API cookbook: Over 90 recipes to create your own exciting Facebook applications at an incredibly fast pace with Facebook Graph API. Birmingham, U.K: Packt Publishing, 2011.
Buscar texto completoDunbar, Robin I. M., Marco Conti, Valerio Arnaboldi y Andrea Passarella. Online Social Networks: Human Cognitive Constraints in Facebook and Twitter Personal Graphs. Elsevier Science & Technology Books, 2015.
Buscar texto completoDunbar, Robin I. M., Marco Conti, Valerio Arnaboldi y Andrea Passarella. Online Social Networks: Human Cognitive Constraints in Facebook and Twitter Personal Graphs. Elsevier, 2015.
Buscar texto completoCapítulos de libros sobre el tema "FACEBOOK GRAPH"
Raj P. M., Krishna, Ankith Mohan y K. G. Srinivasa. "Graph Structure of Facebook". En Computer Communications and Networks, 87–100. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96746-2_5.
Texto completoDannen, Chris y Christopher White. "What the Social Graph Can Do for Your App". En Beginning iOS Apps with Facebook and Twitter APIs, 1–8. Berkeley, CA: Apress, 2011. http://dx.doi.org/10.1007/978-1-4302-3543-9_1.
Texto completoGriffel, Sandra. "Social Graphs – Neue Perspektiven durch Facebook Connect & Co. für Communities von Touristik Anbietern". En Social Web im Tourismus, 217–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12508-9_16.
Texto completoLieber, Sven, Ben De Meester, Ruben Verborgh y Anastasia Dimou. "EcoDaLo: Federating Advertisement Targeting with Linked Data". En Semantic Systems. In the Era of Knowledge Graphs, 87–103. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59833-4_6.
Texto completo"Facebook and the Social Graph: Who Benefits?" En Social Media 101, 155–56. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2011. http://dx.doi.org/10.1002/9781118256138.ch39.
Texto completoAkhtar, Nadeem y Mohd Vasim Ahamad. "Graph Tools for Social Network Analysis". En Advances in Wireless Technologies and Telecommunication, 18–33. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2814-2.ch002.
Texto completoAkhtar, Nadeem y Mohd Vasim Ahamad. "Graph Tools for Social Network Analysis". En Research Anthology on Digital Transformation, Organizational Change, and the Impact of Remote Work, 485–500. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7297-9.ch025.
Texto completoDey, Paramita y Krishnendu Dutta. "Social Network Analysis of Different Parameters Derived From Real-Time Facebook Profiles". En Advances in Wireless Technologies and Telecommunication, 95–108. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2814-2.ch006.
Texto completoSchick, Johannes, Martin Kuboschek y Wolfram Manfred Lippe. "Context Specific Modeling of Communicational and Informational Content in Facebook". En Advances in Wireless Technologies and Telecommunication, 109–24. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2814-2.ch007.
Texto completoBansal, Neetika, Vishal Goyal y Simpel Rani. "Experimenting Language Identification for Sentiment Analysis of English Punjabi Code Mixed Social Media Text". En Research Anthology on Implementing Sentiment Analysis Across Multiple Disciplines, 1470–79. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-6684-6303-1.ch076.
Texto completoActas de conferencias sobre el tema "FACEBOOK GRAPH"
Ugander, Johan. "Scaling graph computations at facebook". En the 22nd International Conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2487788.2487982.
Texto completoHong, Yunfeng, Yu-Cheng Lin, Chun-Ming Lai, S. Felix Wu y George A. Barnett. "Profiling Facebook Public Page Graph". En 2018 International Conference on Computing, Networking and Communications (ICNC). IEEE, 2018. http://dx.doi.org/10.1109/iccnc.2018.8390301.
Texto completoNayak, Deveeshree, Summer Prince y Rosario Robinson. "Information privacy risk assessment of Facebook Graph Search". En 2014 Science and Information Conference (SAI). IEEE, 2014. http://dx.doi.org/10.1109/sai.2014.6918309.
Texto completoEbadian, Soroush y Xin Huang. "Fast Algorithm for K-Truss Discovery on Public-Private Graphs". En Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/313.
Texto completoKirman, Ben, Shaun Lawson y Conor Linehan. "Gaming On and Off the Social Graph: The Social Structure of Facebook Games". En 2009 International Conference on Computational Science and Engineering. IEEE, 2009. http://dx.doi.org/10.1109/cse.2009.266.
Texto completoSaelim, Kwanrutai, Taweewat Luangwiriya y Rachada Kongkachandra. "Using Conceptual Graph to Represent Semantic Relation of Thai Facebook Posts in Marketing". En 2019 14th International Joint Symposium on Artificial Intelligence and Natural Language Processing (iSAI-NLP). IEEE, 2019. http://dx.doi.org/10.1109/isai-nlp48611.2019.9045702.
Texto completoElghanuni, Ramzi Hamid, Rabab Alayham Abbas Helmi y Muhammad Irsyad Abdullah. "Improved detection of Facebook anomalies and abnormalities using graph-based and machine learning techniques". En PROCEEDING OF THE 1ST INTERNATIONAL CONFERENCE ON ADVANCED RESEARCH IN PURE AND APPLIED SCIENCE (ICARPAS2021): Third Annual Conference of Al-Muthanna University/College of Science. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0094026.
Texto completoKlaysri, Thidawan. "Facebook Customer Engagement Graph Analysis Using K-core, M-core and Km-core Methods". En ICCDE 2021: 2021 7th International Conference on Computing and Data Engineering. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3456172.3456215.
Texto completoHelmi, Rabab Alayham Abbas, Ramzi Hamid Elghanuni y Muhammad Irsyad Abdullah. "Effect the Graph Metric to Detect Anomalies and Non-Anomalies on Facebook Using Machine Learning Models". En 2021 IEEE 12th Control and System Graduate Research Colloquium (ICSGRC). IEEE, 2021. http://dx.doi.org/10.1109/icsgrc53186.2021.9515227.
Texto completoN. Zehmakan, Ahad, Charlotte Out y Sajjad Hesamipour Khelejan. "Why Rumors Spread Fast in Social Networks, and How to Stop It". En Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/27.
Texto completo