DOCSLIB.ORG

Towards Large-Scale Network Analytics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Towards Large-Scale Network Analytics Towards Large-scale Network Analytics Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Xintian Yang, M.S. Graduate Program in Computer Science and Engineering The Ohio State University 2012 Dissertation Committee: Srinivasan Parthasarathy, Advisor P. Sadayappan Gagan Agrawal !c Copyright by Xintian Yang 2012 Abstract In this thesis, we present a framework for efficient analysis of large-scale network datasets. There are four important components in our framework: a) a high per- formance computing platform with Graphics Processing Units (GPUs)andefficient implementations of mining algorithms on top of the GPU platform. b) an efficient summarization method to compress the storage space of large-scale streaming and heterogeneous network data with textual content and network topology. c) a com- plex query engine that depends on the summarized input data and can help to discover new knowledge from network content and topology. d) a visual front-end to present mining results to users. First, the key challenge we address in this work is that of scalability – handling large datasets in terms of the efficiency of the back-end mining algorithms. Several of the mining algorithms that we have investigated share a common Sparse Matrix- Vector Multiplication (SpMV) kernel. We present a novel approach to compute this kernel on the GPUs, particularly targeting sparse matrices representing graphs with power-law attributes. Using real web graph data, we show how our representation scheme, coupled with a novel tiling algorithm, can yield significant benefits over the current state of the art GPU efforts on a number of core data mining algorithms such as PageRank, HITS and Random Walk with Restart. We also extend this efficient single GPU kernel to a cluster environment with multiple GPUs. The multi-GPU ii kernel enables our framework to handle out-of-core datasets such as the Web graph. Additionally, the high performance of GPU kernel relies on programmer expertise and careful tuning of the parameters. We proposed an online parameter auto-tuning method with offline benchmarking component to accurately predict the parameters depending on the input data characteristics. Second, we proposed an efficient summarization method to build an in-memory summary of high speed streaming network input data, which can contain both user generated content and topological information about user connections. The summary can be used as input to our framework to perform analytical tasks. Experimental results show that our method can efficiently and incrementally summarize the stream data. The memory footprint of the summarization algorithm grows logarithmically with time instead of linearly. The raw data can be approximately reconstructed by querying the summary so as to support the analytical applications over the original data. Third, we proposed new complex queries on the summarized network content and topology. The queries about network content not only can detect popular topics discussed by users within the network during a period of time, but alsocancapturethe evolution of such topics over time. The queries about the network topology project the entire network topology onto a subgraph conditioned on a network content keyword and a time interval. Graph mining queries are performed on such subgraphs to find relevant users of a topic keyword, communities of users for the keyword, or dynamic community events among a set of users. Finally, we developed a visual-analytic toolkit for the interrogation of graph data such as those found in social, bibliometric, WWW and biological applications. The iii tool we have developed incorporates common visualization paradigmssuchaszoom- ing, coarsening and filtering while naturally integrating information extracted by data mining algorithms. The visual front-end provides features that are specifically useful in the analysis of graphs, capturing the static and dynamic nature of both individ- ual entities as well as interactions among them. The tool provides the user with the option of selecting multiple views, designed to capture different aspects of the underlying graph data from the perspective of a node, a community or a subset of nodes of interest. Standard visual templates and cues are used to highlight critical changes that have occurred in dynamic graphs. Two case studies based on biblio- metric and Wikipedia data are presented to demonstrate the utility of the toolkit for visual knowledge discovery. In each of the above components, we propose new methods to either speed up mining tasks or reduce the data storage size in those tasks. We compare our methods with existing approaches on real datasets drawn from various domains. iv To my family. v Acknowledgments First of all, I sincerely thank my advisor Dr. Srinivasan Parthasarathy, for his patience and guidance in my PhD study. Without his support, I could not make it to the end of this journey. I would also like to thank Dr. Gagan Agrawal and Dr. P. (Saday) Sadayap- pan for serving on my candidacy and dissertation committee. I am grateful for Dr. Sadayappan’s insightful advices in the GPU work we published together. Former and present members of the Data Mining Research Lab have been very sup- portive and helpful both inside and outside school. They are: Matthew Otey, Sameep Mehta, Keith Marsolo, Amol Ghoting, Chao Wang, Gregory Buehrer, Sitaram Asur, Duygu Ucar, Shirish Tatikonda, Venu Satuluri, Matt Goyder, Ye, Wang, S.M. Faisal, Tyler Clemons, Yu-keng Shih, Yiye Ruan, Dave Fuhry and Yang Zhang. I would like to thank them along with my advisor, for the research discussions, project and paper collaborations. presentation rehearsals, paper proof readings and many other things. I would like to give my special thanks to Sitaram Asur, Amol Ghoting andMatt Otey. Sitaram gave me a lot of help on my first paper submission. Amol Ghoting mentored me during my internship in IBM research. Matt Otey was instrumental in referring me to the summer internship position in Google which eventually led to my full time job. vi I am grateful to the National Science Foundation for supporting myresearch through grants RI-CNS-0403342, CCF-0702587, CAREER-IIS-0347662, IIS-0917070 and SoCS-1111118. Any opinions, findings, and conclusions or recommendations expressed here are those of the author and, if applicable, his adviser and collaborators, and do not necessarily reflect the views of the National Science Foundation. Finally and the most importantly, I would like to thank my wife, my mom anddad, and my parents in-law. In the long journey of pursuing my PhD degree, various good and bad things can happen and make the final goals crumbling. The unconditional supports from my family can always strengthen my determination to conquer all the difficulties. vii Vita November 27, 1983 .........................Born - Harbin, China July, 2006 ..................................B.E. Computer Science and Technol- ogy, Harbin Institute of Technology, China Sept, 2004 - Jan, 2005 . Exchange Student, University of Hong Kong, Hong Kong June, 2010 - Sept, 2010 . Research Intern, IBM T.J. Watson Re- search Center, Yorktown Heights, NY Nov, 2010 ..................................M.S. Computer Science and Engineer- ing, Ohio State University, Columbus, OH June, 2011 - Sept, 2011 . Software Engineering Intern, Google, Kirkland, WA Sept, 2010 - June, 2012 . Graduate Teaching Associate, Ohio State University, Columbus, OH Sept, 2007 - present . Graduate Research Associate, Ohio State University, Columbus, OH Publications Research Publications Xintian Yang, Amol Ghoting, Yiye Ruan, Srinivasan Parthasarathy. AFramework for Summarizing and Analyzing Twitter Feeds. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery andDataMining,KDD ’12. Xintian Yang, Srinivasan Parthasarathy, P. Sadayappan. Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining. In Proceedings of the VLDB Endowment, 4(4):231–242, 2011 viii Xintian Yang, Srinivasan Parthasarathy, P. Sadayappan. Fast Mining Algorithms of Graph Data on GPUs. In 2nd Workshop on Large-scale Data Mining: Theory and Applications LDMTA, 2010. Xintian Yang, Sitaram Asur, Srinivasan Parthasarathy, Sameep Mehta. A Visual- analytic Toolkit for Dynamic Interaction Graphs. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery andDataMining,KDD ’08, pages 1016–1024, New York, NY, USA, 2008. ACM. Fields of Study Major Field: Computer Science and Engineering ix Table of Contents Page Abstract....................................... ii Dedication...................................... v Acknowledgments.................................. vi Vita ......................................... viii ListofTables.................................... xiii ListofFigures ................................... xv 1. Introduction.................................. 1 1.1 Challenges in Analyzing Large Graphs . 3 1.2 ProposedFramework ......................... 5 1.3 OurContributions ........................... 7 1.4 Organization .............................. 10 2. BackgroundandRelatedWork . .. .. 11 2.1 Graph Mining Algorithms . 11 2.1.1 Link Analysis . 11 2.1.2 Graph Clustering . 16 2.1.3 Dynamic Graph Analysis . 20 2.2 GPUBackground............................ 26 2.3 Sparse Matrix and Vector Multiplication . 28 2.4 Summarizationofnetworkcontentandtopology. 33 2.5 Visual Analytics . 34 x 3. HighPerformanceMiningKernels. 36 3.1 Methodology
Load more

Recommended publications
  • Download Download
    Proceedings of the Fifteenth International AAAI Conference on Web and Social Media (ICWSM 2021) A Large Open Dataset from the Parler Social Network Max Aliapoulios1, Emmi Bevensee2, Jeremy Blackburn3, Barry Bradlyn4, Emiliano De Cristofaro5, Gianluca Stringhini6, Savvas Zannettou7 1New York University, 2SMAT, 3Binghamton University, 4University of Illinois at Urbana-Champaign, 5University College London, 6Boston University, 7Max Planck Institute for Informatics [email protected], [email protected], [email protected], [email protected], [email protected], [email protected], [email protected] Abstract feasible in technical terms to create a new social media plat- Parler is as an “alternative” social network promoting itself form, but marketing the platform towards specific polarized as a service that allows to “speak freely and express yourself communities is an extremely successful strategy to bootstrap openly, without fear of being deplatformed for your views.” a user base. In other words, there is a subset of users on Twit- Because of this promise, the platform become popular among ter, Facebook, Reddit, etc., that will happily migrate to a new users who were suspended on mainstream social networks platform, especially if it advertises moderation policies that for violating their terms of service, as well as those fearing do not restrict the growth and spread of political polariza- censorship. In particular, the service was endorsed by several tion, conspiracy theories, extremist ideology, hateful and vi- conservative public figures, encouraging people to migrate olent speech, and mis- and dis-information. from traditional social networks. After the storming of the US Capitol on January 6, 2021, Parler has been progressively de- Parler.
    [Show full text]
  • Vincenzo Morabito
    Vincenzo Morabito Trends and Challenges in Digital Business Innovation Trends and Challenges in Digital Business Innovation Vincenzo Morabito Trends and Challenges in Digital Business Innovation 123 Vincenzo Morabito Department of Management and Technology Bocconi University Milan Italy ISBN 978-3-319-04306-7 ISBN 978-3-319-04307-4 (eBook) DOI 10.1007/978-3-319-04307-4 Springer Cham Heidelberg New York Dordrecht London Library of Congress Control Number: 2013958136 Ó Springer International Publishing Switzerland 2014 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.
    [Show full text]
  • FOCS 2005 Program SUNDAY October 23, 2005
    FOCS 2005 Program SUNDAY October 23, 2005 Talks in Grand Ballroom, 17th floor Session 1: 8:50am – 10:10am Chair: Eva´ Tardos 8:50 Agnostically Learning Halfspaces Adam Kalai, Adam Klivans, Yishay Mansour and Rocco Servedio 9:10 Noise stability of functions with low influences: invari- ance and optimality The 46th Annual IEEE Symposium on Elchanan Mossel, Ryan O’Donnell and Krzysztof Foundations of Computer Science Oleszkiewicz October 22-25, 2005 Omni William Penn Hotel, 9:30 Every decision tree has an influential variable Pittsburgh, PA Ryan O’Donnell, Michael Saks, Oded Schramm and Rocco Servedio Sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing 9:50 Lower Bounds for the Noisy Broadcast Problem In cooperation with ACM SIGACT Navin Goyal, Guy Kindler and Michael Saks Break 10:10am – 10:30am FOCS ’05 gratefully acknowledges financial support from Microsoft Research, Yahoo! Research, and the CMU Aladdin center Session 2: 10:30am – 12:10pm Chair: Satish Rao SATURDAY October 22, 2005 10:30 The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics Tutorials held at CMU University Center into `1 [Best paper award] Reception at Omni William Penn Hotel, Monongahela Room, Subhash Khot and Nisheeth Vishnoi 17th floor 10:50 The Closest Substring problem with small distances Tutorial 1: 1:30pm – 3:30pm Daniel Marx (McConomy Auditorium) Chair: Irit Dinur 11:10 Fitting tree metrics: Hierarchical clustering and Phy- logeny Subhash Khot Nir Ailon and Moses Charikar On the Unique Games Conjecture 11:30 Metric Embeddings with Relaxed Guarantees Break 3:30pm – 4:00pm Ittai Abraham, Yair Bartal, T-H.
    [Show full text]
  • Hierarchical Clustering with Global Objectives: Approximation Algorithms and Hardness Results
    HIERARCHICAL CLUSTERING WITH GLOBAL OBJECTIVES: APPROXIMATION ALGORITHMS AND HARDNESS RESULTS ADISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Evangelos Chatziafratis June 2020 © 2020 by Evangelos Chatziafratis. All Rights Reserved. Re-distributed by Stanford University under license with the author. This work is licensed under a Creative Commons Attribution- Noncommercial 3.0 United States License. http://creativecommons.org/licenses/by-nc/3.0/us/ This dissertation is online at: http://purl.stanford.edu/bb164pj1759 ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Tim Roughgarden, Primary Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Moses Charikar, Co-Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Li-Yang Tan I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Gregory Valiant Approved for the Stanford University Committee on Graduate Studies. Stacey F. Bent, Vice Provost for Graduate Education This signature page was generated electronically upon submission of this dissertation in electronic format.
    [Show full text]
  • Runtime Repair and Enhancement of Mobile App Accessibility
    Runtime Repair and Enhancement of Mobile App Accessibility Xiaoyi Zhang A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy University of Washington 2018 Reading Committee: James Fogarty, Chair Jacob O. Wobbrock Jennifer Mankoff Program Authorized to Offer Degree: Computer Science & Engineering © Copyright 2018 Xiaoyi Zhang University of Washington Abstract Runtime Repair and Enhancement of Mobile App Accessibility Xiaoyi Zhang Chair of the Supervisory Committee: Professor James Fogarty Computer Science & Engineering Mobile devices and applications (apps) have become ubiquitous in daily life. Ensuring full access to the wealth of information and services they provide is a matter of social justice. Unfortunately, many capabilities and services offered by apps today remain inaccessible for people with disabilities. Built-in accessibility tools rely on correct app implementation, but app developers often fail to implement accessibility guidelines. In addition, the absence of tactile cues makes mobile touchscreens difficult to navigate for people with visual impairments. This dissertation describes the research I have done in runtime repair and enhancement of mobile app accessibility. First, I explored a design space of interaction re-mapping, which provided examples of re-mapping existing inaccessible interactions into new accessible interactions. I also implemented interaction proxies, a strategy to modify an interaction at runtime without rooting the phone or accessing app source code. This strategy enables third-party developers and researchers to repair and enhance mobile app accessibility. Second, I developed a system for robust annotations on mobile app interfaces to make the accessibility repairs reliable and scalable. Third, I built Interactiles, a low-cost, portable, and unpowered system to enhance tactile interaction on touchscreen phones for people with visual impairments.
    [Show full text]
  • International Journal of Software and Web Sciences (IJSWS)
    ISSN (Print): 2279-0063 International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Online): 2279-0071 International Journal of Software and Web Sciences (IJSWS) www.iasir.net An Efficient Crawling Algorithm for Optimization of Web Page for Major Search Engines Sanjeev Dhawan1, Pooja Choudhary2 1Faculty of Computer Science & Engineering, 2Research Scholar Department of Computer Science & Engineering, University Institute of Engineering and Technology, Kurukshetra University, Kurukshetra-136 119, Haryana, INDIA. E-mail(s): [email protected], [email protected] Abstract: Search engine optimization (SEO) is the process of improving the visibility and scope of a website or a web page in search engines' search results. In general, the earlier (or higher ranked on the search results page), and more frequently a site appears in the search results list, the more visitors it will receive from the search engine's users. SEO may target different kinds of search, including image search, local search, video search, academic search news search and industry-specific vertical search engines. As an Internet marketing strategy, SEO considers how search engines work, what people search for, the actual search terms or keywords typed into search engines and which search engines are preferred by their targeted audience. Optimizing a website may involve editing its content and HTML and associated coding to both increase its relevance to specific keywords and to remove barriers to the indexing activities of search engines. Promoting a site to increase the number of backlinks, or inbound links, is another SEO tactic. This paper proposes an efficient crawling algorithm for indexing and searching from the database.
    [Show full text]
  • Cyberspace and Gay Rights in a Digital China: Queer Documentary Filmmaking Under State Censorship
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Nottingham ePrints Cyberspace and gay rights in a digital China: Queer documentary filmmaking under state censorship Gareth Shaw and Xiaoling Zhang Correspondence Address: Gareth Shaw, School of Sociology and Social Policy, University of Nottingham, University Park, Nottingham NG7 2RD [email protected] Abstract Owing to China’s austere censorship regulations on film media, directors of films and documentaries engaging with lesbian, gay, bisexual and transgender themes have struggled to bring their work to domestic attention. Working outside of the state-funded Chinese film industry has become necessary for these directors to commit their narratives to film, but without approval of China’s State Administration of Press, Publication, Radio, Film and Television, these artists have had little chance of achieving widespread domestic distribution of their work. However, advancements in new media technology and Web 2.0, ranging from digital video formats to Internet-based distribution via social media networks and video-hosting platforms, provide opportunities for Chinese audiences to access films and documentaries dealing with LGBT themes. This empirical study assesses how production, promotion and consumption of queer documentary films are influenced by the development of social media within Chinese cyberspace. Through close readings of microblogs from Sina Weibo this study combines analysis of contemporary research with digital social rights activism to illustrate contemporary discourse regarding film-based LGBT representation in China. Finally, the study comments on the role that documentary filmmaking plays in China’s gay rights movement, and discusses the rewards (and challenges) associated with increased levels of visibility within society.
    [Show full text]
  • Constraint Clustering and Parity Games
    Constrained Clustering Problems and Parity Games Clemens Rösner geboren in Ulm Dissertation zur Erlangung des Doktorgrades (Dr. rer. nat.) der Mathematisch-Naturwissenschaftlichen Fakultät der Rheinischen Friedrich-Wilhelms-Universität Bonn Bonn 2019 1. Gutachter: Prof. Dr. Heiko Röglin 2. Gutachterin: Prof. Dr. Anne Driemel Tag der mündlichen Prüfung: 05. September 2019 Erscheinungsjahr: 2019 Angefertigt mit Genehmigung der Mathematisch-Naturwissenschaftlichen Fakultät der Rheinischen Friedrich-Wilhelms-Universität Bonn Abstract Clustering is a fundamental tool in data mining. It partitions points into groups (clusters) and may be used to make decisions for each point based on its group. We study several clustering objectives. We begin with studying the Euclidean k-center problem. The k-center problem is a classical combinatorial optimization problem which asks to select k centers and assign each input point in a set P to one of the centers, such that the maximum distance of any input point to its assigned center is minimized. The Euclidean k-center problem assumes that the input set P is a subset of a Euclidean space and that each location in the Euclidean space can be chosen as a center. We focus on the special case with k = 1, the smallest enclosing ball problem: given a set of points in m-dimensional Euclidean space, find the smallest sphere enclosing all the points. We combine known results about convex optimization with structural properties of the smallest enclosing ball to create a new algorithm. We show that on instances with rational coefficients our new algorithm computes the exact center of the optimal solutions and has a worst-case run time that is polynomial in the size of the input.
    [Show full text]
  • Google Benefit from News Content
    Google Benefit from News Content Economic Study by News Media Alliance June 2019 EXECUTIVE SUMMARY: The following study analyzes how Google uses and benefits from news. The main components of the study are: a qualitative overview of Google’s usage of news content, an analysis of news content on Google Search, and an estimate of revenue Google receives from news. I. GOOGLE QUALITATIVE USAGE OF NEWS ▪ News consumption increasingly shifts towards digital (e.g., 93% in U.S. get some news online) ▪ Google has increasingly relied on news to drive consumer engagement with its products ▪ Some examples of Google investment to drive traffic from news include: o Significant algorithmic updates emphasize news in Search results (e.g., 2011 “Freshness” update emphasized more recent search results including news) ▪ Google News keeps consumers in the Google ecosystem; Google makes continual updates to Google News including Subscribe with Google (introduced March 2018) ▪ YouTube increasingly relies on news: in 2017, YouTube added “Breaking News;” in 2018, approximately 20% of online news consumers in the US used YouTube for news ▪ AMPs (accelerated mobile pages) keep consumers in the Google ecosystem II. GOOGLE SEARCH QUANTITATIVE USAGE OF NEWS CONTENT A. Key statistics: ▪ ~39% of results and ~40% of clicks on trending queries are news results ▪ ~16% of results and ~16% of clicks on the “most-searched” queries are news results B. Approach ▪ Scraped the page one of desktop results from Google Search o Daily scrapes from February 8, 2019 to March 4, 2019
    [Show full text]
  • Journal of International Media & Entertainment
    JOURNAL OF INTERNATIONAL MEDIA & ENTERTAINMENT LAW PUBLISHED BY THE DONALD E. BIEDERMAN ENTERTAINMENT AND MEDIA LAW INSTITUTE OF SOUTHWESTERN LAW SCHOOL IN ASSOCIATION WITH THE AMERICAN BAR ASSOCIATION FORUMS ON COMMUNICATIONS LAW AND THE ENTERTAINMENT AND SPORTS INDUSTRIES Volume 8, Number 2 2019-2020 SYMPOSIUM FAKE NEWS AND “WEAPONIZED DEFAMATION”: GLOBAL PERSPECTIVES EDITOR’S NOTE ARTICLES Credibility-Enhancing Regulatory Models to Counter Fake News: Risks of a Non-Harmonized Intermediary Liability Paradigm Shift Teresa Rodríguez de las Heras Ballell Criminal Defamation: Still “An Instrument of Destruction” In the Age of Fake News Jane E. Kirtley & Casey Carmody Stemming the Tide of Fake News: A Global Case Study of Decisions to Regulate Amy Kristin Sanders, Rachel L. Jones, and Xiran Liu Legal Responsibility for Fake News Tommaso Tani JOURNAL OF INTERNATIONAL MEDIA & ENTERTAINMENT LAW VOL. 8, NO. 2 ■ 2019–2020 JOURNAL OF INTERNATIONAL MEDIA & ENTERTAINMENT LAW Volume 8 Number 2 2019–2020 PUBLISHED BY THE DONALD E. BIEDERMAN ENTERTAINMENT AND MEDIA LAW INSTITUTE OF SOUTHWESTERN LAW SCHOOL IN ASSOCIATION WITH THE AMERICAN BAR ASSOCIATION FORUMS ON COMMUNICATIONS LAW AND THE ENTERTAINMENT AND SPORTS INDUSTRIES Mission Statement: The Journal of International Media & Entertainment Law is a semi- annual publication of the Donald E. Biederman Entertainment and Media Law Institute of Southwestern Law School in association with the American Bar Association Forums on Communications Law and the Entertainment and Sports Industries. The Journal provides a forum for exploring the complex and unsettled legal principles that apply to the production and distribution of media and entertainment in an international, comparative, and local context. The legal issues surrounding the creation and dissemination of news and entertainment products on a worldwide basis necessarily implicate the laws, customs, and practices of multiple jurisdictions.
    [Show full text]
  • V.6, N.1, Jan./Abr. 2018 § Parágrafo 1
    § ParágrafoISSN 2317-4919 Esta edição da revista Parágrafo representa o fechamento do ciclo de uma proposta editorial caracterizada, desde o segundo semestre de 2014, pela construção de dossiês temáticos - dedi- cados não apenas à compreensão de fenômenos jornalísticos, mas a questões mais amplas do campo da comunicação, em interface com pesquisadores internacionais. A partir do próximo número, a revista priorizará produções que contemplam o jornalismo como objeto de estudo, buscando aprofundar sua aderência ao progra- ma de Mestrado Profissional em Jornalismo do FIAM-FAAM Centro Universitário, ao qual está vinculada. Esperamos, com isso, contri- buir com o avanço da reflexão teórica, metodológica e empírica sobre as práticas jornalísticas, bem como a divulgação de relatos de pesquisa aplicada ao campo profissional, reafirmando a impor- tância do diálogo interdisciplinar neste processo. Revista do Mestrado Profissional em Jornalismo FIAM-FAAM – Centro Universitário v.6, n.1, jan./abr. 2018 § Parágrafo 1 § Parágrafo Revista do Mestrado Profissional em Jornalismo do FIAM-FAAM – Centro Universitário São Paulo, Brasil, volume 6, número 1, janeiro/abril de 2018 ISSN: 2317-4919 § Parágrafo Rua Vergueiro, 101, Liberdade, São Paulo, SP, CEP 01504-001 website: revistaseletronicas.fiamfaam.br/index.php/recicofi e-mail: [email protected] Comitê Editorial raná, Curitiba, PR, Brasil), Dennis de Oliveira (Universidade de São Paulo, São Paulo, SP, Brasil), Egle Müller Spinelli Editora: Cláudia Nonato (Escola Superior de Propaganda e Marketing, São
    [Show full text]
  • Google and the Algorithmic Infomediation of News
    Google and the Algorithmic Infomediation of News Nikos Smyrnaios For a decade, online news distribution has faced a growing intervention of firms that originate from the physical and logical layer of the Internet.1 Web service providers, software firms, and ISPs progressively establish themselves as unavoidable passage points between publishers and Internet users. Some of these players are simple aggregators that gather content from a variety of sources on platforms with little added value. Others, such as Google News, distribute content through complex algorithms that aim to evaluate, hierarchize, and promote content, as well as organizing social interactions around it. By making supply meet demand more easily, they position themselves in the heart of the online news sector and thus become indispensable to publishers. I call this function news infomediation,2 based on a concept used in information science3 and economics4 in order to describe the new, complex forms of intermediation that take place in digital networks. Infomediaries are not simple aggregators or distributors. They are situated in the very core of the internet and thus strongly influence the whole ecology of content production, distribution and consumption while, at the same time, they absorb a significant part of the surplus value produced in the internet economy. Infomediation is a mix of aggregating, editing and distributing third party content that operates by matching between supply and demand. Infomediaries capture a significant part of online revenue and set standards about online publishing that influence journalistic practices. This paper examines the complex relations between online publishers and infomediaries from a socioeconomic point of view.
    [Show full text]