DOCSLIB.ORG

Social- Networks Connect Services

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

COVER FEATURE SOCIAL- NETWORKS CONNECT SERVICES Moo Nam Ko, Gorrell P. Cheek, and Mohamed Shehab, University of North Carolina at Charlotte Ravi Sandhu, University of Texas at San Antonio New services such as Facebook Platform, in touch with users while they’re on these sites. Moreover, Google Friend Connect, and MySpaceID users can enjoy various applications with content from let third-party sites develop social appli- numerous third-party sites: users access social-networking cations without having to build their own sites, where they maintain their profiles; third-party sites social network. These social-networks con- retrieve these profiles, enrich the content, and return them nect services increase access to and enrich to the social-networking sites for consumption by the user user data in the Social Web, although they and, possibly, friends. For example, Facebook users can share music with friends, create playlists, and get concert also present several security and privacy alerts on their profile page by installing the third-party challenges. music application iLike (www.ilike.com). Major social-networking sites have begun launching ocial-networking websites let users build social social-networks connect services such as Facebook Plat- connections with family, friends, and cowork- form, Google Friend Connect, and MySpaceID that further ers. Users can also build profiles for storing break down the garden walls of social-networking sites. and sharing various types of content with These SNCSs let third-party sites develop social applica- others, including photos, videos, and mes- tions and extend their services without having to either Ssages. Updating user profiles with interesting content is a host or build their own social network. This extension form of self-expression that increases interaction in such allows third-party sites to leverage the social-networking sites. To encourage this interaction and provide richer con- site’s features. tent, social-networking sites expose their networks to Web For example, third-party sites can exploit the authenti- services in the form of online application programming cation services provided by a social-networking site so that interfaces. These APIs allow third-party developers to users need not create another username and password interface with the social-networking site, access informa- to access the third-party site; instead, users can draw on tion and media posted with user profiles, and build social their social-network credentials and established profile. applications that aggregate, process, and create content Users can also access third-party sites that leverage social- based on users’ interests. network user-profile content. The third-party sites retrieve Social-networking sites provide numerous applica- users’ profiles from the social-networking site to create tion services that can mash up user-profile data with an enhanced experience. In this way, they can increase third-party data. In addition, third-party sites can rapidly membership by providing more interesting content from distribute their services via social-networking sites to keep a variety of sources in a seamless manner. 0018-9162/10/$26.00 © 2010 IEEE Published by the IEEE Computer Society AUGUST 2010 37 COVER FEATURE Social-networks User data in the • Authorization governs access to user connect services Social Web data in the Social Web based on pre- Identity Identity defined authorization access rights; the authentication authorization API lets third-party sites Prole create new content and extract existing Authorization content from users’ Social Web data. Third-party Privacy policy site • Streams let third-party sites publish Streams Client Social graph to users’ activity streams and vice versa. Applications Content • Applications let third-party sites de- velop rich social features in the form of applications and thereby extend the Figure 1. Social-networks connect services framework. Social Web. The implementation of these APIs can vary widely with different protocols and technologies. Facebook Platform User data in services Facebook Facebook Platform Authentication Identity OAuth 2.0 Facebook Platform became gener- ally available in December 2008 under Authorization Prole OAuth 2.0 the Facebook Connect brand. (Facebook Third-party Privacy policy announced in April 2010 that it’s eliminat- site Open Stream ing the Facebook Connect brand as part Client Social graph of the launch of the Open Graph API; it’s Applications Content not clear at this point whether the com- • Open Graph • FQL • Social • FBML pany will replace it or call it something plug -ins else.) Since then, more than 80,000 third- • JavaScript • REST party sites have implemented it. Facebook Platform lets third-party sites integrate with Facebook and send information both ways to create more engaging and Figure 2. Facebook Platform services. richer social experiences on the Web. As Figure 2 shows, Facebook Platform allows SOCIAL-NETWORKS CONNECT SERVICES users to import their identity, profile, privacy policy, social User data is composed of three types of information. graph, and content from Facebook to third-party sites. Identity data describes who I am in the Social Web, includ- Authentication is by far the most used Facebook Plat- ing my identity, profile information, and privacy policy. form component. This API enables third-party sites to Social-graph data represents who I know in the Social Web, leverage Facebook as an identity provider. For example, including my friendship connections with descriptions Digg.com, a social news website where users can share such as family, coworker, colleague, and so on. Content content, doesn’t require new members to register and data represents what I have in the Social Web, including create a profile. Instead, as Figure 3 shows, they can use my messages, photos, videos, and all other data objects their existing Facebook profile to authenticate (steps 1 and created through various Social Web activities. 2); once authenticated, new users can extend their social For social-networking sites to be able to share user Social graph to the third-party site and invite friends—or link to Web data with third-party sites, a secure and reliable SNCS them, if they’re already members—to join them on Digg. framework is required. As Figure 1 shows, this framework com (step 3). consists of a collection of four categories of APIs that allow Facebook Platform leverages OAuth 2.0 for authentica- third-party sites to interface with the social-networking site: tion and authorization. OAuth 2.0 is a simplified, improved version of the Open Authorization standard (http://oauth. • Identity authentication proves users’ identity; users net) that lets third-party sites obtain authorization tokens can authenticate using their existing accounts from from Facebook. First, a user of the third-party site au- various identity providers to include the social- thenticates using Facebook as an identity provider. Next, networking site. Facebook issues a token that lets the third-party site 38 COMPUTER access the user’s basic profile information in- cluding name, picture, gender, and Friend List. The third-party site can request extended per- missions depending on User authenticates using the specific application Facebook credentials requirements—for exam- ple, to access the user’s Wall, the space on the Step 1 Step 2 user’s Facebook profile where friends can post Step 3 messages. The third-party site can also apply Face- Figure 3. Digg.com authentication via Facebook Platform. New users can leverage their exist- book users’ privacy policy ing Facebook profile to authenticate (steps 1 and 2); once authenticated, they can extend their settings. For example, if social graph to the third-party site and invite their friends—or link to them, if they’re already members—to join them on Digg.com. Alice doesn’t allow Bob to access her content on Facebook, then Bob wouldn’t be allowed to access Alice’s used to integrate third-party sites using Facebook Platform content on the third-party site. along with numerous tools for developers to build social The Open Stream API lets third-party sites read and applications. Facebook Markup Language (FBML) is a pro- write to users’ activity streams—for example, short mes- prietary variant of HTML, and Facebook Query Language sages on new events. This API supports multiple-stream (FQL) provides a quick and easy mechanism to query Face- publishing methods as well as the Atom feed standard. book user data without using API methods. Third-party sites can read content from users’ activity streams in addition to publishing to their activity streams. Google Friend Connect For example, Facebook users can share their activities on Released at approximately the same time as Facebook third-party sites with their friends on Facebook through Platform, Google Friend Connect also makes it easy to the News Feed feature. share profile, social-graph, and content data with third- Facebook provides a series of APIs to assist developers party sites (www.google.com/friendconnect). As Figure in creating social applications that interface with third- 4 shows, its decentralized approach to integrating social party sites (http://developers.facebook.com/docs). The and nonsocial websites relies on open standards such as primary API is Open Graph, which lets third-party applica- OpenID (http://openid.net), OAuth, and OpenSocial (www. tions read and write content objects—photos, friends, and opensocial.org). so on—and the connections among them in Facebook’s OpenID lets users authenticate to third-party sites using social graph. The API is simple in that it allows access to credentials issued by a supported OpenID identity pro- content objects via URLs. For example, with proper au- vider such as Google or Yahoo. This API prevents users thorization, http://graph.facebook.com/FBUserID/friends from having to go through the new-member registration will provide access to FBUserID’s friends. Facebook also process. After initial authentication, users can select their provides support for the Representational State Transfer existing profile from a profile provider site like Plaxo.
Recommended publications
  • Digital Platform As a Double-Edged Sword: How to Interpret Cultural Flows in the Platform Era

    Digital Platform As a Double-Edged Sword: How to Interpret Cultural Flows in the Platform Era

    International Journal of Communication 11(2017), 3880–3898 1932–8036/20170005 Digital Platform as a Double-Edged Sword: How to Interpret Cultural Flows in the Platform Era DAL YONG JIN Simon Fraser University, Canada This article critically examines the main characteristics of cultural flows in the era of digital platforms. By focusing on the increasing role of digital platforms during the Korean Wave (referring to the rapid growth of local popular culture and its global penetration starting in the late 1990s), it first analyzes whether digital platforms as new outlets for popular culture have changed traditional notions of cultural flows—the forms of the export and import of popular culture mainly from Western countries to non-Western countries. Second, it maps out whether platform-driven cultural flows have resolved existing global imbalances in cultural flows. Third, it analyzes whether digital platforms themselves have intensified disparities between Western and non- Western countries. In other words, it interprets whether digital platforms have deepened asymmetrical power relations between a few Western countries (in particular, the United States) and non-Western countries. Keywords: digital platforms, cultural flows, globalization, social media, asymmetrical power relations Cultural flows have been some of the most significant issues in globalization and media studies since the early 20th century. From television programs to films, and from popular music to video games, cultural flows as a form of the export and import of cultural materials have been increasing. Global fans of popular culture used to enjoy films, television programs, and music by either purchasing DVDs and CDs or watching them on traditional media, including television and on the big screen.
  • Paying Attention to Public Readers of Canadian Literature

    Paying Attention to Public Readers of Canadian Literature

    PAYING ATTENTION TO PUBLIC READERS OF CANADIAN LITERATURE: POPULAR GENRE SYSTEMS, PUBLICS, AND CANONS by KATHRYN GRAFTON BA, The University of British Columbia, 1992 MPhil, University of Stirling, 1994 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY in THE FACULTY OF GRADUATE STUDIES (English) THE UNIVERSITY OF BRITISH COLUMBIA (Vancouver) August 2010 © Kathryn Grafton, 2010 ABSTRACT Paying Attention to Public Readers of Canadian Literature examines contemporary moments when Canadian literature has been canonized in the context of popular reading programs. I investigate the canonical agency of public readers who participate in these programs: readers acting in a non-professional capacity who speak and write publicly about their reading experiences. I argue that contemporary popular canons are discursive spaces whose constitution depends upon public readers. My work resists the common critique that these reading programs and their canons produce a mass of readers who read the same work at the same time in the same way. To demonstrate that public readers are canon-makers, I offer a genre approach to contemporary canons that draws upon literary and new rhetorical genre theory. I contend in Chapter One that canons are discursive spaces comprised of public literary texts and public texts about literature, including those produced by readers. I study the intertextual dynamics of canons through Michael Warner’s theory of publics and Anne Freadman’s concept of “uptake.” Canons arise from genre systems that are constituted to respond to exigencies readily recognized by many readers, motivating some to participate. I argue that public readers’ agency lies in the contingent ways they select and interpret a literary work while taking up and instantiating a canonizing genre.
  • A Survey of Adversarial Learning on Graph

    A Survey of Adversarial Learning on Graph

    A Survey of Adversarial Learning on Graph LIANG CHEN, Sun Yat-sen University of China JINTANG LI, Sun Yat-sen University of China JIAYING PENG, Sun Yat-sen University of China TAO XIE, Sun Yat-sen University of China ZENGXU CAO, Hangzhou Dianzi University of China KUN XU, Sun Yat-sen University of China XIANGNAN HE, University of Science and Technology of China ZIBIN ZHENG∗, Sun Yat-sen University of China Deep learning models on graphs have achieved remarkable performance in various graph analysis tasks, e.g., node classication, link prediction and graph clustering. However, they expose uncertainty and unreliability against the well-designed inputs, i.e., adversarial examples. Accordingly, a line of studies have emerged for both aack and defense addressed in dierent graph analysis tasks, leading to the arms race in graph adversarial learning. Despite the booming works, there still lacks a unied problem denition and a comprehensive review. To bridge this gap, we investigate and summarize the existing works on graph adversarial learning tasks systemically. Specically, we survey and unify the existing works w.r.t. aack and defense in graph analysis tasks, and give appropriate denitions and taxonomies at the same time. Besides, we emphasize the importance of related evaluation metrics, investigate and summarize them comprehensively. Hopefully, our works can provide a comprehensive overview and oer insights for the relevant researchers. More details of our works are available at hps://github.com/gitgiter/Graph-Adversarial-Learning. CCS Concepts: •Computing methodologies ! Semi-supervised learning settings; Neural networks; •Security and privacy ! So ware and application security; •Networks ! Network reliability; Additional Key Words and Phrases: adversarial learning, graph neural networks, adversarial aack and defense, adversarial examples, network robustness ACM Reference format: Liang Chen, Jintang Li, Jiaying Peng, Tao Xie, Zengxu Cao, Kun Xu, Xiangnan He, and Zibin Zheng.
  • Writing a Book Using Google Docs

    Writing a Book Using Google Docs

    Share Report Abuse Next Blog» Create Blog Sign In Docs Blog News and notes from the Google Docs and Sites teams Guest post: Writing a book using Google Docs Looking for posts on your Monday, November 01, 2010 favorite product? Labels: documents, Google Apps Blog, Guest Post Google Sites Documents Guest post: November is National Writing Month and to celebrate, we’ve invited Dr. Steven Daviss Spreadsheets to talk about how he used Google Docs to write a book with two colleagues. Dr. Daviss is currently Presentations the Chairman of Psychiatry at Baltimore Washington Medical Center in Maryland and has been Forms increasingly leveraging his clinical and administrative experience towards a career merging health Drawings care policy, informatics, and health care reform. Docs list Archives Archives Site Feed Follow us on Twitter twitter.com/googledocs Followers Follow with Google Friend Connect Followers (5351) More » Two other psychiatrists (Anne Hanson and Dinah Miller) and I have been writing a popular blog (Shrink Rap) about the practice of psychiatry since 2006. A year later, we started a podcast (My Three Shrinks) that has received great reviews in iTunes. Late in 2007, we decided to take some of those posts and weave them together to write a book. We started out using a desktop word processor to write the book, each chapter being a separate document. We learned about the limitations of making edits and sending out each of our revisions to the other two: we very quickly had multiple out-of-sync versions and the whole thing was a mess. This is from one of Dinah’s emails back then: “With 3 people doing this, I need to be able to keep track of what everyone wants to write.
  • Tipologie Di Dati Raccolti Modalità E

    Tipologie Di Dati Raccolti Modalità E

    Privacy Policy di www.mcj.it Questa Applicazione raccoglie alcuni Dati Personali dei propri Utenti. Titolare del Trattamento dei Dati Mcj Sede legale: Corso Rosselli, 73 – 10129 Torino P.IVA 01370130336 Tipologie di Dati raccolti Fra i Dati Personali raccolti da questa Applicazione, in modo autonomo o tramite terze parti, ci sono: Cookie, Dati di utilizzo, Numero di Telefono, Email, Nome, Cognome, Posizione geografica, Indirizzo, Password, Codice Fiscale, Professione, Nazione, Provincia, CAP e Città. Altri Dati Personali raccolti potrebbero essere indicati in altre sezioni di questa privacy policy o mediante testi informativi visualizzati contestualmente alla raccolta dei Dati stessi. I Dati Personali possono essere inseriti volontariamente dall’Utente, oppure raccolti in modo automatico durante l'uso di questa Applicazione. L’eventuale utilizzo di Cookie - o di altri strumenti di tracciamento - da parte di questa Applicazione o dei titolari dei servizi terzi utilizzati da questa Applicazione, ove non diversamente precisato, ha la finalità di identificare l’Utente e registrare le relative preferenze per finalità strettamente legate all'erogazione del servizio richiesto dall’Utente. Il mancato conferimento da parte dell’Utente di alcuni Dati Personali potrebbe impedire a questa Applicazione di erogare i propri servizi. L'Utente si assume la responsabilità dei Dati Personali di terzi pubblicati o condivisi mediante questa Applicazione e garantisce di avere il diritto di comunicarli o diffonderli, liberando il Titolare da qualsiasi responsabilità verso terzi. Modalità e luogo del trattamento dei Dati raccolti Modalità di trattamento Il Titolare tratta i Dati Personali degli Utenti adottando le opportune misure di sicurezza volte ad impedire l’accesso, la divulgazione, la modifica o la distruzione non autorizzate dei Dati Personali.
  • Citron Research Backing up the Sleigh on Facebook – 2019 S&P

    Citron Research Backing up the Sleigh on Facebook – 2019 S&P

    December 26, 2018 Citron Research Backing Up the Sleigh on Facebook – 2019 S&P Stock of the Year Separating the Noise from Reality will take Facebook back to $160 Two and a half years ago, Citron Research said that FB was a long-term short and that engagement levels would eventually top out. At the time, the stock was trading in the $120 range. In the past 30 months FB has more than doubled its quarterly revenue and concerns of engagement have shifted to concerns of addiction, yet the stock is back down in $120 range. Time to back up the sleigh! Yet, 2018 is a year that Facebook shareholders would like to forget, as the stock is down 30% YTD and over 40% from its recent high. Yet, while the media has reported on one scandal after the next and the NYT even tried to promote a #deletefacebook movement. The truth is revenues and more important user base has seen little impact. As you read this article Facebook has 2.2 billion active users and has grown revenues 33% q over q during this controversial 12 months. Considering the user base excludes China, this is a lead that has no second place. Going Forward There are only three talking points on Facebook that matter: 1. Putting Facebook Valuation in Perspective 2. Is Facebook Evil or Investible? 3. Instagram – the Anti CRaP experience © Copyright 2018 | Citron Research | www.citronresearch.com | All Inquiries – [email protected] December 26, 2018 Valuation in Perspective Facebook is growing faster than 95% of the S&P with margins higher than about 90% of the S&P.
  • Graph Search Process in Social Networks and It's Challenges

    Graph Search Process in Social Networks and It's Challenges

    Preeti Narooka et al | IJCSET(www.ijcset.net) | June 2016 | Vol 6, Issue 6, 228-232 Graph Search Process in Social Networks and it’s Challenges Ms. Preeti Narooka1, Dr. Sunita Chaodhary2 Ph. D Student, Banasthali University, Jaipur, India1 Former Associate Professor, Banasthali University, Jaipur, India 2 Abstract: - Social networking sites are grabbing attention of complex network where huge amount of data can be millions of users and it resulted into creation of humongous distribute and store easily. data on these networking sites. Number of users on any networking sites denotes the complexity and size of the data. Graph algorithm is the efficient tool which defines the These developments have thrown a challenge in front of relationships between all objects on social cloud. In today’s computer scientists to optimize the search operations on these scenario, users are increasing in Social Networks in leaps social networking sites. This paper outlines the Graph theory and bounds. With the increase of users, there is a rapid as a tool for search operation on social networking sites & for increment in number of objects on social graph, results in optimization of search graph operation map reducing exponential growth of the graph size [12]. Accessing useful technology is discussed. In this paper on one side, different information from exponentially growing graph in fast traditional system of social networking and graph algorithm are elaborated. On the other side, various application and manner is a very difficult challenging task. To provide different issues related to the graph algorithm and social solution for the aforesaid problem it is the need to optimize networking are discussed in detail.
  • Building a W Eb Site

    Building a W Eb Site

    spine=.72” Internet/Web Page Design ™ 4th Edition Web building demystified! Making Everything Easier! Here’s what you need to know Building a Web Site a Web Building to create a great site Open the book and find: Back by popular demand and fully updated — here’s the • Site planning tips fun, easy, straightforward way to build a cool Web site, even • How to create a basic page in Building a if you’ve never done it before! Learn Web lingo, master HTML Dreamweaver tags and WYSIWYG editors, make your pages look cool with graphics, add a blog, and attract an audience. You’ll even be • Inexpensive ways to get your site online able to get an e-commerce site open for business! • What you need to know about Web Site • Brush up on basics — see how basic HTML works and compare graphics different types of editors • How to put forms on your site • Get that look — arrange your text for easy reading with tables, and process responses frames, and framesets, and keep everything up to date with cascading style sheets • Helpful tips for a successful business site • What’s in a name — choose and register a domain name and select the best host for your site • Ten great places to get advice • Worth a thousand words — learn where to get free graphics and • Some super e-commerce tools how to edit and include them in your pages • Dress it up — explore tricks for adding image-based buttons, audio, and video to your site • Mean business — discover how to set up a site for your online business, connect with search sites, and link your site to others Learn to: • Get paid — obtain a merchant account, register with PayPal, • Plan and design a great-looking Web site and learn to protect yourself from credit card fraud Go to Dummies.com® for videos, step-by-step examples, • Work with HTML, CSS, and navigation how-to articles, or to shop! plans • Collect and create content that gets attention • Take your site online and attract visitors who come back $24.99 US / $29.99 CN / £17.99 UK David A.
  • Unicorn: a System for Searching the Social Graph

    Unicorn: a System for Searching the Social Graph

    Unicorn: A System for Searching the Social Graph Michael Curtiss, Iain Becker, Tudor Bosman, Sergey Doroshenko, Lucian Grijincu, Tom Jackson, Sandhya Kunnatur, Soren Lassen, Philip Pronin, Sriram Sankar, Guanghao Shen, Gintaras Woss, Chao Yang, Ning Zhang Facebook, Inc. ABSTRACT rative of the evolution of Unicorn's architecture, as well as Unicorn is an online, in-memory social graph-aware index- documentation for the major features and components of ing system designed to search trillions of edges between tens the system. of billions of users and entities on thousands of commodity To the best of our knowledge, no other online graph re- servers. Unicorn is based on standard concepts in informa- trieval system has ever been built with the scale of Unicorn tion retrieval, but it includes features to promote results in terms of both data volume and query volume. The sys- with good social proximity. It also supports queries that re- tem serves tens of billions of nodes and trillions of edges quire multiple round-trips to leaves in order to retrieve ob- at scale while accounting for per-edge privacy, and it must jects that are more than one edge away from source nodes. also support realtime updates for all edges and nodes while Unicorn is designed to answer billions of queries per day at serving billions of daily queries at low latencies. latencies in the hundreds of milliseconds, and it serves as an This paper includes three main contributions: infrastructural building block for Facebook's Graph Search • We describe how we applied common information re- product. In this paper, we describe the data model and trieval architectural concepts to the domain of the so- query language supported by Unicorn.
  • Graph Generators: State of the Art and Open Challenges 0:3 Across All the Categories of Graph Generators That We Consider

    Graph Generators: State of the Art and Open Challenges 0:3 Across All the Categories of Graph Generators That We Consider

    0 Graph Generators: State of the Art and Open Challenges ANGELA BONIFATI, Lyon 1 University, France IRENA HOLUBOVA´ , Charles University, Prague, Czech Republic ARNAU PRAT-PEREZ´ , Sparsity-Technologies, Barcelona, Spain SHERIF SAKR, University of Tartu, Estonia The abundance of interconnected data has fueled the design and implementation of graph generators repro- ducing real-world linking properties, or gauging the effectiveness of graph algorithms, techniques and appli- cations manipulating these data. We consider graph generation across multiple subfields, such as Semantic Web, graph databases, social networks, and community detection, along with general graphs. Despite the disparate requirements of modern graph generators throughout these communities, we analyze them under a common umbrella, reaching out the functionalities, the practical usage, and their supported operations. We argue that this classification is serving the need of providing scientists, researchers and practitioners with the right data generator at hand for their work. This survey provides a comprehensive overview of the state-of-the-art graph generators by focusing on those that are pertinent and suitable for several data-intensive tasks. Finally, we discuss open challenges and missing requirements of current graph generators along with their future extensions to new emerging fields. 1. INTRODUCTION Graphs are ubiquitous data structures that span a wide array of scientific disciplines and are a subject of study in several subfields of computer science. Nowadays, due to the dawn of numerous tools and applications manipulating graphs, they are adopted as a rich data model in many data-intensive use cases involving disparate domain knowl- edge, mathematical foundations and computer science. Interconnected data is often- times used to encode domain-specific use cases, such as recommendation networks, social networks, protein-to-protein interactions, geolocation networks, and fraud de- tection analysis networks, to name a few.
  • Graph Pattern Matching Revised for Social Network Analysis

    Graph Pattern Matching Revised for Social Network Analysis

    Graph Pattern Matching Revised for Social Network Analysis Wenfei Fan University of Edinburgh & Harbin Institute of Technology [email protected] Abstract subgraphs G of G to which Q is isomorphic, i.e., there exists a bijective function h from the nodes of Q to the Graph pattern matching is fundamental to social network nodes of G such that (u, u )isanedgeinQ if and analysis. Traditional techniques are subgraph isomorphism only if (h(u),h(u )) is an edge in G ;or and graph simulation. However, these notions often impose • M Q, G too strong a topological constraint on graphs to find mean- graph simulation [42]: ( ) is a binary relation S ⊆ V × V V V ingful matches. Worse still, graphs in the real world are Q ,where Q and are the set of nodes in Q G typically large, with millions of nodes and billions of edges. and , respectively, such that It is often prohibitively expensive to compute matches – for each node u in VQ,thereexistsanodev in V in such graphs. With these comes the need for revising such that (u, v) ∈ S,and the notions of graph pattern matching and for developing – for each (u, v) ∈ S and each edge (u, u )inQ, techniques of querying large graphs, to effectively and there is an edge (v, v )inG such that (u ,v ) ∈ S. efficiently identify social communities or groups. This paper aims to provide an overview of recent advances Graph pattern matching has been extensively studied for in the study of graph pattern matching in social networks. pattern recognition, knowledge discovery, biology, chemin- (1) We present several revisions of the traditional notions formatics, dynamic network traffic and intelligence analysis, of graph pattern matching to find sensible matches in so- based on subgraph isomorphism (see [2, 16, 28, 57] for sur- cial networks.
  • Arxiv:1403.5206V2 [Cs.SI] 30 Jul 2014

    Arxiv:1403.5206V2 [Cs.SI] 30 Jul 2014

    What is Tumblr: A Statistical Overview and Comparison Yi Chang‡, Lei Tang§, Yoshiyuki Inagaki† and Yan Liu‡ † Yahoo Labs, Sunnyvale, CA 94089, USA § @WalmartLabs, San Bruno, CA 94066, USA ‡ University of Southern California, Los Angeles, CA 90089 [email protected],[email protected], [email protected],[email protected] Abstract Traditional blogging sites, such as Blogspot6 and Living- Social7, have high quality content but little social interac- Tumblr, as one of the most popular microblogging platforms, tions. Nardi et al. (Nardi et al. 2004) investigated blogging has gained momentum recently. It is reported to have 166.4 as a form of personal communication and expression, and millions of users and 73.4 billions of posts by January 2014. showed that the vast majority of blog posts are written by While many articles about Tumblr have been published in ordinarypeople with a small audience. On the contrary, pop- major press, there is not much scholar work so far. In this pa- 8 per, we provide some pioneer analysis on Tumblr from a va- ular social networking sites like Facebook , have richer so- riety of aspects. We study the social network structure among cial interactions, but lower quality content comparing with Tumblr users, analyze its user generated content, and describe blogosphere. Since most social interactions are either un- reblogging patterns to analyze its user behavior. We aim to published or less meaningful for the majority of public audi- provide a comprehensive statistical overview of Tumblr and ence, it is natural for Facebook users to form different com- compare it with other popular social services, including blo- munities or social circles.