The document analyzes the social network characteristics of YouTube by measuring the full-scale YouTube subscription graph, comment graph, and video corpus. It finds that YouTube deviates from traditional social networks in properties like homophily and reciprocity, but is similar to Twitter. It also finds a stronger correlation between a user's social popularity and their most popular content, rather than overall content popularity. Finally, it demonstrates classifying YouTube Partners using these measurements.
Twitter is going to become much less important as a person to person (peer to peer) communication medium and instead become more of a content-delivery medium like TV, where content is broadcast to a large number of followers. It's just going to become a new way to follow celebrities, corporations, and the like.
These are the findings of research by two business school professors. Their paper "Intrinsic versus Image-Related Motivations in Social Media: Why do People Contribute to Twitter?", was published in the journal Marketing Science. The professors are Olivier Toubia of Columbia Business School and Andrew T. Stephen of the University of Pittsburgh.
In Professor Toubia’s words, “Get ready for a TV-like Twitter".
The research examined the motivations behind why everyday people, with no financial incentive, contribute to Twitter.The study examined roughly 2500 non-commercial Twitter users. In a field experiment, the profs randomly selected some of those users and, through the use of other synthetic accounts, increased the selected group's followers. At first, they noticed that as the selected group's followers increased, so did the posting rate. However, when that group reached a level of stature — a moderately large amount of followers — the posting rate declined significantly.
"Users began to realize it was harder to continue to attract more followers with their current strategy, so they slowed down.When posting activity no longer leads to additional followers, people will view Twitter as a non-evolving, static structure, like TV."
Based on the analyses, the profs predict Twitter posts by everyday people will slow down, yet celebrities and commercial users will continue to post for financial gain.
The paper is attached on Slideshare.
AN INTEGRATED RANKING ALGORITHM FOR EFFICIENT INFORMATION COMPUTING IN SOCIAL...ijwscjournal
Social networks have ensured the expanding disproportion between the face of WWW stored traditionally in search engine repositories and the actual ever changing face of Web. Exponential growth of web users and the ease with which they can upload contents on web highlights the need of content controls on material published on the web. As definition of search is changing, socially-enhanced interactive search methodologies are the need of the hour. Ranking is pivotal for efficient web search as the search performance mainly depends upon the ranking results. In this paper new integrated ranking model based on fused rank of web object based on popularity factor earned over only valid interlinks from multiple social forums is proposed. This model identifies relationships between web objects in separate social networks based on the object inheritance graph. Experimental study indicates the effectiveness of proposed Fusion based ranking algorithm in terms of better search results.
Presented at the Workshop on Advanced Research Methods (WARM) at the University of Urbino, 30 September 2010.
For further information on the research project see: http://mappingonlinepublics.net
Tumblr 2014 - statistical overview and comparison with popular social servicesStephan Tschierschwitz
What is Tumblr: A Statistical Overview and Comparison with other popular social services, including blogosphere,
Twitter and Facebook, in answering a couple of key
questions: What is Tumblr? How is Tumblr different from
other social media networks?
Can Web Search Be Enhanced For User-GeneratedEvan Atkinson
With so much content on the web this paper aims to answer the question how users can get the most out of their web searches with regards to user-generated content. The system in which we use for web searches can be modified or optimized for better web search result for users. The main goal of this literature review is to look into the research on web search optimization mainly focusing on research in the areas of tags, algorithms, and URLs. These sources on web search show that it has the ability to be enhanced via a few different avenues. With enhanced web search capabilities this would allow users to gather better results tailored to them specifically.
Twitter is going to become much less important as a person to person (peer to peer) communication medium and instead become more of a content-delivery medium like TV, where content is broadcast to a large number of followers. It's just going to become a new way to follow celebrities, corporations, and the like.
These are the findings of research by two business school professors. Their paper "Intrinsic versus Image-Related Motivations in Social Media: Why do People Contribute to Twitter?", was published in the journal Marketing Science. The professors are Olivier Toubia of Columbia Business School and Andrew T. Stephen of the University of Pittsburgh.
In Professor Toubia’s words, “Get ready for a TV-like Twitter".
The research examined the motivations behind why everyday people, with no financial incentive, contribute to Twitter.The study examined roughly 2500 non-commercial Twitter users. In a field experiment, the profs randomly selected some of those users and, through the use of other synthetic accounts, increased the selected group's followers. At first, they noticed that as the selected group's followers increased, so did the posting rate. However, when that group reached a level of stature — a moderately large amount of followers — the posting rate declined significantly.
"Users began to realize it was harder to continue to attract more followers with their current strategy, so they slowed down.When posting activity no longer leads to additional followers, people will view Twitter as a non-evolving, static structure, like TV."
Based on the analyses, the profs predict Twitter posts by everyday people will slow down, yet celebrities and commercial users will continue to post for financial gain.
The paper is attached on Slideshare.
AN INTEGRATED RANKING ALGORITHM FOR EFFICIENT INFORMATION COMPUTING IN SOCIAL...ijwscjournal
Social networks have ensured the expanding disproportion between the face of WWW stored traditionally in search engine repositories and the actual ever changing face of Web. Exponential growth of web users and the ease with which they can upload contents on web highlights the need of content controls on material published on the web. As definition of search is changing, socially-enhanced interactive search methodologies are the need of the hour. Ranking is pivotal for efficient web search as the search performance mainly depends upon the ranking results. In this paper new integrated ranking model based on fused rank of web object based on popularity factor earned over only valid interlinks from multiple social forums is proposed. This model identifies relationships between web objects in separate social networks based on the object inheritance graph. Experimental study indicates the effectiveness of proposed Fusion based ranking algorithm in terms of better search results.
Presented at the Workshop on Advanced Research Methods (WARM) at the University of Urbino, 30 September 2010.
For further information on the research project see: http://mappingonlinepublics.net
Tumblr 2014 - statistical overview and comparison with popular social servicesStephan Tschierschwitz
What is Tumblr: A Statistical Overview and Comparison with other popular social services, including blogosphere,
Twitter and Facebook, in answering a couple of key
questions: What is Tumblr? How is Tumblr different from
other social media networks?
Can Web Search Be Enhanced For User-GeneratedEvan Atkinson
With so much content on the web this paper aims to answer the question how users can get the most out of their web searches with regards to user-generated content. The system in which we use for web searches can be modified or optimized for better web search result for users. The main goal of this literature review is to look into the research on web search optimization mainly focusing on research in the areas of tags, algorithms, and URLs. These sources on web search show that it has the ability to be enhanced via a few different avenues. With enhanced web search capabilities this would allow users to gather better results tailored to them specifically.
Multi-Mode Conceptual Clustering Algorithm Based Social Group Identification ...inventionjournals
The problem of web search time complexity and accuracy has been visited in many research papers, and the authors discussed many approaches to improve the search performance. Still the approaches does not produce any noticeable improvement and struggles with more time complexity as well. To overcome the issues identified, an efficient multi mode conceptual clustering algorithm has been discussed in this paper, which identifies the similar interested user groups by clustering their search context according to different conceptual queries. Identified user groups are shared with the related conceptual queries and their results to reduce the time complexity. The multi mode conceptual clustering, performs grouping of search queries and users according to number of users and their search pattern. The concept of search is identified by using Natural language processing methods and the web logs produced by the default web search engines. The author designed a dedicated web interface to collect the web log about the user search and the same data has been used to cluster the social groups according to number of conceptual queries. The search results has been shared between the users of identified social groups which reduces the search time complexity and improves the efficiency of web search in better manner
A Meteoroid on Steroids: Ranking Media Items Stemming from Multiple Social Ne...Gabriela Agustini
g. In this paper, we focus on the ranking aspect
and show how, for a given set of media items, the most adequate ranking criterion combination can be found by interactively applying different criteria and seeing their effect onthe-fly. This leads us to an empirically optimized media item
ranking formula, which takes social network interactions into
account. While the ranking formula is not universally applicable, it can serve as a good starting point for an individually
adapted formula, all within the context of Social Media Illustrator. A demo of the application is available publicly online
at the URL http://social-media-illustrator.herokuapp.com/.
In online social media platforms, users can express their ideas by posting original content or by adding comments and responses to existing posts, thus generating virtual discussions and conversations. Studying these conversations is essential for understanding the online communication behavior of users. This study proposes a novel approach to retrieve popular patterns on online conversations using network-based analysis. The analysis consists of two main stages: intent analysis and network generation. Users’ intention is detected using keyword-based categorization of posts and comments, integrated with classification through Naïve Bayes and Support Vector Machine algorithms for uncategorized comments. A continuous human-in-the-loop approach further improves the keyword-based classification. To build and understand communication patterns among the users, we build conversation graphs starting from the hierarchical structure of posts and comments, using a directed multigraph network. The experiments categorize 90% comments with 98% accuracy on a real social media dataset. The model then identifies relevant patterns in terms of shape and content; and finally determines the relevance and frequency of the patterns. Results show that the most popular online discussion patterns obtained from conversation graphs resemble real-life interactions and communication.
Social media in government - presentation to NSW HealthCraig Thomler
This presentation provides an overview of how governments in Australia are using social media, risks they may face and how to address these with structured processes and guidelines. It finishes with some quick case studies of excellent use of social media by the public sector.
A LINK-BASED APPROACH TO ENTITY RESOLUTION IN SOCIAL NETWORKScsandit
Social networks initially had been places for people to contact each other, find friends or new
acquaintances. As such they ever proved interesting for machine aided analysis. Recent
developments, however, pivoted social networks to being among the main fields of information
exchange, opinion expression and debate. As a result there is growing interest in both analyzing
and integrating social network services. In this environment efficient information retrieval is
hindered by the vast amount and varying quality of the user-generated content. Guiding users to
relevant information is a valuable service and also a difficult task, where a crucial part of the
process is accurately resolving duplicate entities to real-world ones. In this paper we propose a
novel approach that utilizes the principles of link mining to successfully extend the methodology
of entity resolution to multitype problems. The proposed method is presented using an
illustrative social network-based real-world example and validated by comprehensive
evaluation of the results.
Welcome to the Metrics and Social Web Services workshoplisbk
Welcome slides to be used by Brian Kelly, UKOLN in a workshop on "Metrics and Social Web Services: Quantitative Evidence for their Use & Impact" to be held at the Open University on 11 July 2011.
See http://www.ukoln.ac.uk/web-focus/events/workshops/eim-2011-07/
Lecture 5: Personalization on the Social Web (2014)Lora Aroyo
This is the fifth lecture in the Social Web course (2014) at the VU University Amsterdam. Visit the website for more information: http://thesocialweb2014.wordpress.com/
What role do “power learners” play in online learning communities?@cristobalcobo
This study focusses on the role of highly active participants in online learning communities on Facebook. These people, often known as “power users” in the literature on social computing, are a common feature of a wide range of online learning groups, and are responsible not only for creating most of the content but also for getting discussion going and providing a basis for other’s participation. We test whether similar dynamics hold true in the context of online learning.
Based on a transactional dataset of almost 10,000 interactions with an online community of 32 postgraduate students who were following the same online course, we find evidence that power users also exist in the context of online learning. However, whilst they do create a lot of content, we find that they are not fundamental to keeping the group together, and in fact are less adept at creating content which generates responses than other “normal” users. This suggests that online learning communities may have different dynamics to other types of electronic community: it also suggests that design efforts should not be focused solely on attracting a small core of “power learners”. Rather, diverse types of users are needed for online learning communities to survive and prosper.
Authors:
Cristóbal Cobo, Center for Research - Ceibal Foundation, Uruguay
Monica Bulger, Data & Society Research Institute, United States
Jonathan Bright, Oxford Internet Institute, United Kingdom
Ryan den Rooijen, Oxford Internet Institute, United Kingdom
Presented at the LINC Conference (MIT, 2016) Digital Inclusion: Transforming Education through Technology.
Who are the top influencers and what characterizes them?Nicola Procopio
A method capable of finding influential users by exploiting the contents of the messages posted by them to express opinions on items, by modeling these contents with a three-layer network.
Multi-Mode Conceptual Clustering Algorithm Based Social Group Identification ...inventionjournals
The problem of web search time complexity and accuracy has been visited in many research papers, and the authors discussed many approaches to improve the search performance. Still the approaches does not produce any noticeable improvement and struggles with more time complexity as well. To overcome the issues identified, an efficient multi mode conceptual clustering algorithm has been discussed in this paper, which identifies the similar interested user groups by clustering their search context according to different conceptual queries. Identified user groups are shared with the related conceptual queries and their results to reduce the time complexity. The multi mode conceptual clustering, performs grouping of search queries and users according to number of users and their search pattern. The concept of search is identified by using Natural language processing methods and the web logs produced by the default web search engines. The author designed a dedicated web interface to collect the web log about the user search and the same data has been used to cluster the social groups according to number of conceptual queries. The search results has been shared between the users of identified social groups which reduces the search time complexity and improves the efficiency of web search in better manner
A Meteoroid on Steroids: Ranking Media Items Stemming from Multiple Social Ne...Gabriela Agustini
g. In this paper, we focus on the ranking aspect
and show how, for a given set of media items, the most adequate ranking criterion combination can be found by interactively applying different criteria and seeing their effect onthe-fly. This leads us to an empirically optimized media item
ranking formula, which takes social network interactions into
account. While the ranking formula is not universally applicable, it can serve as a good starting point for an individually
adapted formula, all within the context of Social Media Illustrator. A demo of the application is available publicly online
at the URL http://social-media-illustrator.herokuapp.com/.
In online social media platforms, users can express their ideas by posting original content or by adding comments and responses to existing posts, thus generating virtual discussions and conversations. Studying these conversations is essential for understanding the online communication behavior of users. This study proposes a novel approach to retrieve popular patterns on online conversations using network-based analysis. The analysis consists of two main stages: intent analysis and network generation. Users’ intention is detected using keyword-based categorization of posts and comments, integrated with classification through Naïve Bayes and Support Vector Machine algorithms for uncategorized comments. A continuous human-in-the-loop approach further improves the keyword-based classification. To build and understand communication patterns among the users, we build conversation graphs starting from the hierarchical structure of posts and comments, using a directed multigraph network. The experiments categorize 90% comments with 98% accuracy on a real social media dataset. The model then identifies relevant patterns in terms of shape and content; and finally determines the relevance and frequency of the patterns. Results show that the most popular online discussion patterns obtained from conversation graphs resemble real-life interactions and communication.
Social media in government - presentation to NSW HealthCraig Thomler
This presentation provides an overview of how governments in Australia are using social media, risks they may face and how to address these with structured processes and guidelines. It finishes with some quick case studies of excellent use of social media by the public sector.
A LINK-BASED APPROACH TO ENTITY RESOLUTION IN SOCIAL NETWORKScsandit
Social networks initially had been places for people to contact each other, find friends or new
acquaintances. As such they ever proved interesting for machine aided analysis. Recent
developments, however, pivoted social networks to being among the main fields of information
exchange, opinion expression and debate. As a result there is growing interest in both analyzing
and integrating social network services. In this environment efficient information retrieval is
hindered by the vast amount and varying quality of the user-generated content. Guiding users to
relevant information is a valuable service and also a difficult task, where a crucial part of the
process is accurately resolving duplicate entities to real-world ones. In this paper we propose a
novel approach that utilizes the principles of link mining to successfully extend the methodology
of entity resolution to multitype problems. The proposed method is presented using an
illustrative social network-based real-world example and validated by comprehensive
evaluation of the results.
Welcome to the Metrics and Social Web Services workshoplisbk
Welcome slides to be used by Brian Kelly, UKOLN in a workshop on "Metrics and Social Web Services: Quantitative Evidence for their Use & Impact" to be held at the Open University on 11 July 2011.
See http://www.ukoln.ac.uk/web-focus/events/workshops/eim-2011-07/
Lecture 5: Personalization on the Social Web (2014)Lora Aroyo
This is the fifth lecture in the Social Web course (2014) at the VU University Amsterdam. Visit the website for more information: http://thesocialweb2014.wordpress.com/
What role do “power learners” play in online learning communities?@cristobalcobo
This study focusses on the role of highly active participants in online learning communities on Facebook. These people, often known as “power users” in the literature on social computing, are a common feature of a wide range of online learning groups, and are responsible not only for creating most of the content but also for getting discussion going and providing a basis for other’s participation. We test whether similar dynamics hold true in the context of online learning.
Based on a transactional dataset of almost 10,000 interactions with an online community of 32 postgraduate students who were following the same online course, we find evidence that power users also exist in the context of online learning. However, whilst they do create a lot of content, we find that they are not fundamental to keeping the group together, and in fact are less adept at creating content which generates responses than other “normal” users. This suggests that online learning communities may have different dynamics to other types of electronic community: it also suggests that design efforts should not be focused solely on attracting a small core of “power learners”. Rather, diverse types of users are needed for online learning communities to survive and prosper.
Authors:
Cristóbal Cobo, Center for Research - Ceibal Foundation, Uruguay
Monica Bulger, Data & Society Research Institute, United States
Jonathan Bright, Oxford Internet Institute, United Kingdom
Ryan den Rooijen, Oxford Internet Institute, United Kingdom
Presented at the LINC Conference (MIT, 2016) Digital Inclusion: Transforming Education through Technology.
Who are the top influencers and what characterizes them?Nicola Procopio
A method capable of finding influential users by exploiting the contents of the messages posted by them to express opinions on items, by modeling these contents with a three-layer network.
HADOOP based Recommendation Algorithm for Micro-video URLdbpublications
In the recent years usage social media applications pervade in our daily life which makes the Social Networking Sites (SNSs) being dependent on users for content generation. Considering user interest, contents produced by individual SNSs significantly leaves some of the interest based content undiscovered. This led to facilitate features such as “like”, “share”, “hashtags” functions to deliver the content from one platform to another platform. These allowed users to interact with multiple SNSs but limited to receive contents for separate SNSs. Although Open Identity allowed users for single sign-in in multiple platforms, it still remained to target multiple platforms. A Unified Access Model is proposed to internet-based-content modeling where the content for the users could be images or videos or text. Videos of short length termed as “micro-videos” are more popular both for the viewers and also the producers. The work carried out provides a recommendation algorithm for micro-video url, which compared to traditional recommendation algorithms such as content based recommendation, the big data uses parallel computing framework. High performance computing is achieved by using slope one algorithm that uses Mapreduce and Hadoop techniques. Hence, the proposed recommendation system for micro-video url can achieve high performance parallel computing, which can be used by the producers and viewers.
NOVEL MACHINE LEARNING ALGORITHMS FOR CENTRALITY AND CLIQUES DETECTION IN YOU...ijaia
The goal of this research project is to analyze the dynamics of social networks using machine learning techniques to locate maximal cliques and to find clusters for the purpose of identifying a target demographic. Unsupervised machine learning techniques are designed and implemented in this project to analyze a dataset from YouTube to discover communities in the social network and find central nodes. Different clustering algorithms are implemented and applied to the YouTube dataset. The well-known Bron-Kerbosch algorithm is used effectively in this research to find maximal cliques. The results obtained from this research could be used for advertising purposes and for building smart recommendation systems. All algorithms were implemented using Python programming language. The experimental results show that we were able to successfully find central nodes through clique-centrality and degree centrality. By utilizing clique detection algorithms, the research shown how machine learning algorithms can detect close knit groups within a larger network.
NOVEL MACHINE LEARNING ALGORITHMS FOR CENTRALITY AND CLIQUES DETECTION IN YOU...gerogepatton
The goal of this research project is to analyze the dynamics of social networks using machine learning techniques to locate maximal cliques and to find clusters for the purpose of identifying a target demographic. Unsupervised machine learning techniques are designed and implemented in this project to analyze a dataset from YouTube to discover communities in the social network and find central nodes. Different clustering algorithms are implemented and applied to the YouTube dataset. The well-known Bron-Kerbosch algorithm is used effectively in this research to find maximal cliques. The results obtained from this research could be used for advertising purposes and for building smart recommendation systems. All algorithms were implemented using Python programming language. The experimental results show that we were able to successfully find central nodes through clique-centrality and degree centrality. By utilizing clique detection algorithms, the research shown how machine learning algorithms can detect close knit groups within a larger network.
Novel Machine Learning Algorithms for Centrality and Cliques Detection in You...gerogepatton
The goal of this research project is to analyze the dynamics of social networks using machine learning techniques to locate maximal cliques and to find clusters for the purpose of dentifying a target
demographic. Unsupervised machine learning techniques are designed and implemented in this project to analyze a dataset from YouTube to discover communities in the social network and find central nodes. Different clustering algorithms are implemented and applied to the YouTube dataset. The well-known Bron-Kerbosch algorithm is used effectively in this research to find maximal cliques. The results obtained
from this research could be used for advertising purposes and for building smart recommendation systems.
All algorithms were implemented using Python programming language. The experimental results show that
we were able to successfully find central nodes through clique-centrality and degree centrality. By utilizing
clique detection algorithms, the research shown how machine learning algorithms can detect close knit
groups within a larger network.
A Meteoroid on Steroids: Ranking Media Items Stemming from Multiple Social Ne...Gabriela Agustini
We have developed an application called Social Media
Illustrator that allows for finding media items on multiple
social networks, clustering them by visual similarity, ranking
them by different criteria, and finally arranging them in media galleries that were evaluated to be perceived as aesthetically pleasing. In this paper, we focus on the ranking aspect
and show how, for a given set of media items, the most adequate ranking criterion combination can be found by interactively applying different criteria and seeing their effect onthe-fly. This leads us to an empirically optimized media item
ranking formula, which takes social network interactions into
account. While the ranking formula is not universally applicable, it can serve as a good starting point for an individually
adapted formula, all within the context of Social Media Illustrator. A demo of the application is available publicly online
at the URL http://social-media-illustrator.herokuapp.com/.
HP Laboratories probes key behavioral factors which influence the development of social learning strategies. KBI combines simulator design and social learning strategies observed by cutting edge company research to develop valuable performance support and improvement tools for the semi-conductor manufacturing community.
Big Data Analytics- USE CASES SOLVED USING NETWORK ANALYSIS TECHNIQUES IN GEPHIRuchika Sharma
This report is done as a part in completion of our Big Data Analysis Course at Jindal Global Business School.
In this report, we have mainly focused on literature review of 10 use-cases in the visualization task. We have worked on use cases pertaining to varied use of social media site Twitter in the political, cultural and business context; use by drug marketers and musicians among others.
Sampling of User Behavior Using Online Social NetworkEditor IJCATR
The popularity of online networks provides an opportunity to study the characteristics of online social network graphs is important, both to improve current systems and to design new application of online social networks. Although personalized search has been proposed for many years and many personalization strategies have been investigated, it is still unclear whether personalization is consistently effective on different queries for different users, and under different search contexts. In this paper, we study performance of information collection in a dynamic social network. By analyzing the results, we reveal that personalized search has significant improvement over common web search.
The mixing time of thee sampling process strongly depends on the characteristics of the graph.
The Influcence of Twitter on Academic EnvironmentMartin Ebner
Draft version of article of the book "Social Media and the New Academic Environment: Pedagogical Challenges" http://www.igi-global.com/book/social-media-new-academic-environment/69841#description
Social Media for Marketing: An Analysis of Digg.com Engagement and User BehaviorTyler Pace
In this report, we present an analysis of user engagement with social media via Digg.com. Viewer engagement was measured with OTOinsight’s Quantemo™ neuromarketing research system. Quantemo™ utilizes a multi-modal approach that combines self-report, physiological and neurological data to holistically and reliably measure user engagement with digital media. Analyzing the results from the Quantemo™ sources, we present a set of four insights concerning how users engage with social media and how the cues in social media systems positively inform user behavior.
User testing and focus group report at Manchester University (C-SAP collectio...CSAPSubjectCentre
Focus group and user testing of the front-end website http://methods.hud.ac.uk/ at the University of Manchester on 27th July 2011. Part of the OER Phase 2 C-SAP Collections Project
OTOinsights "An Analysis of Digg.com Engagement and User Behavior"One to One
This study presents an analysis of user engagement with social media via Digg.com. Understanding the behavior of Digg.com users will help marketers to better represent and promote their material on Digg.com as well as provide insights into the practices of social media users in general.
Multi-cluster Kubernetes Networking- Patterns, Projects and GuidelinesSanjeev Rampal
Talk presented at Kubernetes Community Day, New York, May 2024.
Technical summary of Multi-Cluster Kubernetes Networking architectures with focus on 4 key topics.
1) Key patterns for Multi-cluster architectures
2) Architectural comparison of several OSS/ CNCF projects to address these patterns
3) Evolution trends for the APIs of these projects
4) Some design recommendations & guidelines for adopting/ deploying these solutions.
APNIC Foundation, presented by Ellisha Heppner at the PNG DNS Forum 2024APNIC
Ellisha Heppner, Grant Management Lead, presented an update on APNIC Foundation to the PNG DNS Forum held from 6 to 10 May, 2024 in Port Moresby, Papua New Guinea.
Bridging the Digital Gap Brad Spiegel Macon, GA Initiative.pptxBrad Spiegel Macon GA
Brad Spiegel Macon GA’s journey exemplifies the profound impact that one individual can have on their community. Through his unwavering dedication to digital inclusion, he’s not only bridging the gap in Macon but also setting an example for others to follow.
1.Wireless Communication System_Wireless communication is a broad term that i...JeyaPerumal1
Wireless communication involves the transmission of information over a distance without the help of wires, cables or any other forms of electrical conductors.
Wireless communication is a broad term that incorporates all procedures and forms of connecting and communicating between two or more devices using a wireless signal through wireless communication technologies and devices.
Features of Wireless Communication
The evolution of wireless technology has brought many advancements with its effective features.
The transmitted distance can be anywhere between a few meters (for example, a television's remote control) and thousands of kilometers (for example, radio communication).
Wireless communication can be used for cellular telephony, wireless access to the internet, wireless home networking, and so on.
This 7-second Brain Wave Ritual Attracts Money To You.!nirahealhty
Discover the power of a simple 7-second brain wave ritual that can attract wealth and abundance into your life. By tapping into specific brain frequencies, this technique helps you manifest financial success effortlessly. Ready to transform your financial future? Try this powerful ritual and start attracting money today!
# Internet Security: Safeguarding Your Digital World
In the contemporary digital age, the internet is a cornerstone of our daily lives. It connects us to vast amounts of information, provides platforms for communication, enables commerce, and offers endless entertainment. However, with these conveniences come significant security challenges. Internet security is essential to protect our digital identities, sensitive data, and overall online experience. This comprehensive guide explores the multifaceted world of internet security, providing insights into its importance, common threats, and effective strategies to safeguard your digital world.
## Understanding Internet Security
Internet security encompasses the measures and protocols used to protect information, devices, and networks from unauthorized access, attacks, and damage. It involves a wide range of practices designed to safeguard data confidentiality, integrity, and availability. Effective internet security is crucial for individuals, businesses, and governments alike, as cyber threats continue to evolve in complexity and scale.
### Key Components of Internet Security
1. **Confidentiality**: Ensuring that information is accessible only to those authorized to access it.
2. **Integrity**: Protecting information from being altered or tampered with by unauthorized parties.
3. **Availability**: Ensuring that authorized users have reliable access to information and resources when needed.
## Common Internet Security Threats
Cyber threats are numerous and constantly evolving. Understanding these threats is the first step in protecting against them. Some of the most common internet security threats include:
### Malware
Malware, or malicious software, is designed to harm, exploit, or otherwise compromise a device, network, or service. Common types of malware include:
- **Viruses**: Programs that attach themselves to legitimate software and replicate, spreading to other programs and files.
- **Worms**: Standalone malware that replicates itself to spread to other computers.
- **Trojan Horses**: Malicious software disguised as legitimate software.
- **Ransomware**: Malware that encrypts a user's files and demands a ransom for the decryption key.
- **Spyware**: Software that secretly monitors and collects user information.
### Phishing
Phishing is a social engineering attack that aims to steal sensitive information such as usernames, passwords, and credit card details. Attackers often masquerade as trusted entities in email or other communication channels, tricking victims into providing their information.
### Man-in-the-Middle (MitM) Attacks
MitM attacks occur when an attacker intercepts and potentially alters communication between two parties without their knowledge. This can lead to the unauthorized acquisition of sensitive information.
### Denial-of-Service (DoS) and Distributed Denial-of-Service (DDoS) Attacks
1. The YouTube Social Network
Mirjam Wattenhofer
Google Zurich
mirjam@google.com
Roger Wattenhofer
ETH Zurich
wattenhofer@ethz.ch
Zack Zhu∗
ETH Zurich
zazhu@ethz.ch
Abstract
Today, YouTube is the largest user-driven video con-
tent provider in the world; it has become a major plat-
form for disseminating multimedia information. A ma-
jor contribution to its success comes from the user-to-
user social experience that differentiates it from tradi-
tional content broadcasters. This work examines the so-
cial network aspect of YouTube by measuring the full-
scale YouTube subscription graph, comment graph, and
video content corpus. We find YouTube to deviate sig-
nificantly from network characteristics that mark tradi-
tional online social networks, such as homophily, re-
ciprocative linking, and assortativity. However, compar-
ing to reported characteristics of another content-driven
online social network, Twitter, YouTube is remarkably
similar. Examining the social and content facets of user
popularity, we find a stronger correlation between a
user’s social popularity and his/her most popular con-
tent as opposed to typical content popularity. Finally,
we demonstrate an application of our measurements for
classifying YouTube Partners, who are selected users
that share YouTube’s advertisement revenue. Results
are motivating despite the highly imbalanced nature of
the classification problem.
Introduction
YouTube is a key international platform for socially-enabled
media diffusion. According to public statistics, more than
48 hours of video content is uploaded every minute and 3
billion views are generated every day. To complement the
content broadcast/consume experience, YouTube connects
seamlessly with major online social networks (OSNs) such
as Facebook, Twitter, and Google+ to facilitate off-site diffu-
sion. In fact, 12 million users have linked their YouTube ac-
count with at least one such OSN for auto-sharing, and more
than 150 years of YouTube content is watched on Facebook
every day.
More importantly, YouTube serves as a popular social net-
work on its own, connecting registered users through sub-
scriptions that notify subscribers of social and content up-
dates of the subscribed-to users. In this paper, we lever-
∗
Zack Zhu conducted this research while visiting Google. He is
currently at the Wearable Computing Laboratory in ETH Zurich.
Copyright c 2012, Association for the Advancement of Artificial
Intelligence (www.aaai.org). All rights reserved.
age full-scale data of the YouTube social network to answer
practical questions from a graph theoretic point of view. We
shed light on the following:
1. What can be observed from the complete YouTube social
network topology? How does it compare with other social
networks in terms of intrinsic properties and emergent ob-
servations?
2. On the YouTube platform, how do users connect and in-
teract with each other? What is the relationship between
the explicit and implicit social graphs describing the sub-
scription and commenting relationships?
3. What constitutes popularity on YouTube? How does
a user’s topological (social) popularity correlate with
his/her content popularity?
Our analyses will illustrate that YouTube deviates sig-
nificantly from traditional OSN characteristics. However,
it concurs with the observations of Kwak, Lee, Park, and
Moon for the Twittersphere (2010). We will see a surprising
dichotomy of content and social activities on the YouTube
platform, indicating that YouTube is, distinctly, as much a
social network as it is a content-diffusion platform. Finally,
we note social popularity on YouTube correlates more with
the maximum content popularity achieved as opposed to the
summary measures of content popularity.
These observations lead to the conjecture that a new class
of social network is emerging, a type that facilitates indirect
socialization via a gluing content layer in between directed
users-to-user interaction. Potentially, a paradigm shift is tak-
ing place for OSNs such that what constitutes “social” now
incorporates user-content-user interaction in addition to the
traditional user-user interaction. Through intrinsically dif-
ferent linking and interacting characteristics, these content-
driven social networks create new social dynamics and ne-
cessitate further research to better understand their role in
the processes of socialization and information diffusion.
Background and Related Work
Recent surge of OSN popularity has attracted the attention
of researchers from a variety of fields. Here, the surveyed
works are divided into two categories: OSN measurements
and machine learning-based OSN applications.
2. OSN Measurements
Researchers have taken advantage of the YouTube Data API
to measure a variety of metrics in relation to video popular-
ity on YouTube. Studies by Cha et al. (2007), Benevenuto
et al. (2009), and Cheng et al. (2008) all analyze this video
corpus for the purposes of understanding video popularity.
However, by measuring at the video-level, user-based social
characteristics are largely omitted. We build on these works
by aggregating YouTube’s video corpus metrics at the user
level to complement content metrics with social topology.
In this way, we are able to make the connection between
video content popularity and corresponding social popular-
ity. Even though these works make efforts to avoid sam-
pling biases while accessing the data through a rate-limiting
YouTube API and/or online crawlers, the datasets collected
are only fractions of the entire corpus. In this work, we ob-
tain data from within YouTube to allow complete measure-
ments.
Researchers Mislove, Marcon, Gummadi, Druschel, and
Bhattacharjee (2007), Krishnamurthy et al. (2008), and
Kwak et al. (2010), have reported measurements of vari-
ous major online social networks. In the work of Mislove
et al. (2007), an array of graph-based measurements are pre-
sented for multiple popular online social networks, includ-
ing YouTube. They present a framework of measurements
that we adopt here for ease of comparison. In their mea-
surement methodology, a mix of API and HTML scraping
techniques are used to obtain a sampled version of the social
graph. However, as the authors themselves pointed out, their
methodology is limited when trying to extrapolate observa-
tions to the entire YouTube population. This work addresses
this concern and compares our results where appropriate. In
Krishnamurthy et al. (2008), the authors examine topologi-
cal features of a sampled Twitter network as well as content
uploaded from users. This work is similar to what we present
for YouTube as we analyze measurements from two social
graphs and the video corpus. Recently, Kwak et al. (2010)
conducts one of the first full crawls of a major online social
network by measuring the entire Twittersphere. The size and
coverage of their dataset is comparable to what we present
here.
OSN Applications
In terms of user classification, De Choudhury et al. (2010)
proposes threshold networks with non-arbitrary thresholds
for increased accuracy in both link prediction and user clas-
sification. In this work, the idea of thresholding to prune
real-world datasets is used to illustrate an interesting rela-
tionship between explicit and implicit social relationships.
Hong et al. (2011) leverage network characteristics to suc-
cessfully predict popular messages and Bakshy et al. (2011)
classify “influential” users according to re-tweet quantities.
A key similarity between these works is their use of vari-
ous topological metrics calculated from the social graph. In
our work, such features are utilized as well in our classifica-
tion application. On top of the explicit social graph, topology
measures of an implicit social graph and aggregated user-
level metrics from the video corpus are used as well.
Table 1: Nodal feature descriptions
Name Description
user Encrypted user id
sub.out Out degree on subscription graph
sub.in In degree on subscription graph
avg.pub.out Average out degree of users subscribed to
avg.pub.in Average in degree of users subscribed to
avg.sub.out Average out degree of subscribers
avg.sub.in Average in degree of subscribers
reciprocal # of reciprocal links on subscription graph
sub.pagerank PageRank of the subscription graph
com.in In degree on the comment graph
com.out Out degree on the comment graph
com.pagerank PageRank on the comment graph
max.fav Max # of times any video is favourited
med.fav Median # of times any video is favourited
min.fav Min # of times any video is favourited
max.views Max # of times any video is viewed
med.views Median # of times any video is viewed
min.views Min # of times any video is viewed
max.coms Max # of comments any video received
med.coms Median # of comments any video received
min.coms Min # of comments any video received
max.raters Max # of raters for any video
med.raters Median # of raters for any video
min.raters Min # of raters for any video
max.avg.rating Max of average ratings for any video
med.avg.rating Med of average ratings for any video
min.avg.ratings Min of average ratings for any video
main.cat Category that most videos are uploaded in
uploads Number of videos posted
Measuring All of YouTube
As mentioned in the previous section, a multitude of work
has sampled various major OSNs through online crawls
and/or API usage. However, few measurement projects have
captured whole social graphs without compromise. This
work leverages the data and computing power available
within Google to shed light on a major social platform.
The data collection process mainly utilizes MapReduce
(Dean and Ghemawat 2008) and Pregel (Malewicz et al.
2010), a large-scale proprietary graph computing frame-
work, to leverage Google’s computing resources. Therefore,
the runtime to capture entire datasets can be completed in
tens of minutes, capturing and processing complete social
graphs on the YouTube social network. We base our anal-
yses of the YouTube social network on three main corpora
of data: the explicit social graph depicting subscriptions, the
implicit social graph depicting commenting activities, and
aggregated metrics of user-uploaded content. These datasets
were captured in August 2011. We removed axis labels on
our plots to preserve data confidentiality.
We compose a directed graph to represent the subscription
relationships of registered YouTube users. Each node repre-
sents one such user while a link points from a subscriber to
the user subscribed-to. Therefore, this graph is composed of
3. registered users who have subscribed to at least one user or
received at least one subscription. Similarly, the comment
graph is composed of users who have posted or received at
least one comment. Again, links point from the commenter
to the comment-receiving user. Both graphs contain nodes
on the order of hundreds of millions and links on the order
of billions, comparable to the measurement size of Kwak et
al. (2010) for Twitter.
The third corpus of data is an aggregation of YouTube
video metrics to the uploader level. For each uploader µ ∈
N who has uploaded at least one video, we can construct
a video vector vµ. Then, for each of our video-level met-
rics (e.g. view count, number of video comments, etc.) we
aggregate by taking the minimum, median, and maximum
of vµ. For example, a specific user’s median average rating
refers to the scalar mµ = median(v1
µ, v2
µ, ..., vn
µ), where
each vn
denotes the average rating for the nth
video that
user µ has uploaded. Table 1 presents the user features accu-
mulated from the three datasets. The naming convention in
Table 1 will be referred to consistently from here on.
Degree Distribution of Social Graphs
Starting off with basic degree distribution analysis of both
social graphs, Figure 1 plots the log-log complementary cu-
mulative distribution function (CCDF). As done in most
OSN studies, the degree distributions are typically gener-
ated as log-log CCDF to better illustrate the tail behaviour
on both ends. To interpret the plots, it can be understood,
for an (x, y) pair, a fraction y of the population has a de-
gree more than x. Noticeably, there is a sharp kink in the
subscription out-degree curve at x = x∗
. This is an artifact
of the YouTube subscription rule that limits the number of
subscriptions for users who do not have a significant num-
ber of subscribers themselves. In both graphs, there exists
extremely popular users who have millions of subscribers
and/or commenters. However, about half of the sampled
population has one or zero subscriber and/or commenter. In
the comment graph, the out-degree distribution also does not
fit the power-law signature. Fitting the power-law distribu-
tion (via maximum likelihood estimation) to the in-degree
of the subscription graph and the comment graph, scaling
exponents of 1.55 and 1.44 are found, respectively. These
exponents differ from the majority of real-world social net-
works, which have been measured between 2 and 3 (Kwak et
al. 2010) as well as 1.99 (Mislove et al. 2007) for a sampled
YouTube subscription graph.
A Content-Driven OSN
Traditionally, researchers have modelled social networks,
online or offline, as undirected links between users. Intrin-
sically different for YouTube, the de facto mode of linking
is through directed subscription links. Furthermore, user in-
teraction is largely through uploaded video content. For ex-
ample, as opposed to interacting directly (e.g. wall posts,
direct messages), much of the interaction on YouTube takes
place in a video-centered manner, such as rating another’s
video or leaving a video comment. Therefore, user inter-
action becomes very much a user-content-user relationship
Degree Distributions
Degrees
CCDF
q
q
q
q q q qq
qq
qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq
q
q
q
q
q
q
q
q
q
q
q
In−degree
Out−degree
x*
q
q q qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq q
q
q
q
q
q
q
Comment Graph Degree Distributions
Degrees
CCDF
q In−degree
Out−degree
Figure 1: Degree distribution of subscription graph (top) and
comment graph (bottom) plotted on log-log scales.
where users interact with each other through a gluing layer
of uploaded content. These two inherent characteristics of
a content-driven OSN, such as YouTube, may explain why
significant differences exist from traditional OSNs.
In our measurement, we find the YouTube subscription
graph deviates in three aspects that mark traditional OSNs:
assortative linking, user homophily, and reciprocity. In addi-
tion, contrary to traditional OSN studies that have illustrated
social interactions as a strong signal for social links (Xiang,
Neville, and Rogati 2010; Kahanda and Neville 2009), we
note a surprising dichotomy of commenting activities and
subscription links on the YouTube platform.
Assortativity, Reciprocity, and Homophily In Figure 2,
the assortative linking property can be examined for the sub-
scription graph. We log-bin user in-degrees on the x-axis
and plot the distribution of average publisher (users receiv-
ing the subscription) in-degrees on the y-axis in the form of
a box-plot. It is clear that the median of bins across most
in-degrees hold steady as users consistently subscribe to
those with much more popularity (via in-degree) than that of
5. on Twitter. Here, our results for YouTube show a lack of
homophily and reciprocity to confirm this phenomenon of
content-driven OSNs.
A Dichotomy of Interaction and Subscription Overlap-
ping the subscription graph and the comment graph, we
study the nodes who exist in both graphs and compare their
incoming links. Formally, for each node µ, we can ana-
lyze the overlap of its commenter set Cµ ∈ {c1, c2, ..., cn}
and subscriber set Sµ ∈ {s1, s2, ..., sn}. Denoting a set
Oµ := Sµ Cµ, we calculate the overlap percentage as
ρµ =
Oµ
Sµ Cµ
.
Averaging over all n nodes that exist in both graphs, we
find ¯ρ = 9.6% (s.d. of 1.9%). Comparing the overlapped
set with each of the two neighbourhood sets, it is found
that, averaging over all users, ¯α = 1
N
N
µ=0
Oµ
Sµ
= 18.1%
and ¯β = 1
N
N
µ=0
Oµ
Cµ
= 16.5%. These results show that,
on average, only a small portion of a user’s subscribers are
also commenters and vice versa. This differs from tradi-
tional OSNs such as Facebook since links are formed based
on social relationships and interaction is basis for relation-
ship. Here, we observe the user-content-user relationship
that differentiates the interaction dynamic for YouTube as
a content-driven OSN.
Sensibly, it is expected that users leave comments on
videos to address the video content, without necessarily im-
plicating a social or influence relationship with the uploader.
On the other hand, it is surprising that subscribers are also
not likely to comment on videos uploaded by users they
subscribe to, as indicated by a low ¯α. At the same time,
it is found that both the subscription graph and the com-
ment graphs are as active as each other with similar number
of nodes and number of unique (for comment graph) pair-
wise links. This suggests an interesting nature of YouTube—
there is a dichotomy between the dynamics of “content”
(user→content) and the dynamics of “social” (user→user),
where content consumption and social influence are simi-
larly active, but largely, separate components of the same
system.
Naturally, commenting relationships between users can
be captured as a directed graph with weights, where each
weight represents the frequency of comments in the direc-
tion of the link. Therefore, a modified comment graph can be
generated by pruning edges with a threshold, τ, below some
frequency. Numerically, for τ = 1, 2, 5, 10, the resulting
¯ρ, ¯α, and ¯β are plotted in Figure 3. Expectedly, the thresh-
olded commenter set steadily decreases in its ability to recall
subscription links (¯ρ). However, the thresholding effect sig-
nificantly increases the overlap proportion between the in-
tersection and the commenter set, ¯β. From Figure 3, we can
see that on average, >50% of commenters who have com-
mented equal to or more than 10 times are subscribers, com-
pared to less than 20% without thresholding. In effect, sim-
ply thresholding on comment frequency produces a smaller
set of commenters who are more likely to be subscribers
Overlap Proportions
Percentage
01020304050
t=1 t=2 t=5 t=10
rho
alpha
beta
Figure 3: Implict-explicit social graph overlap for various
comment threshold levels.
as well. This shows that although the majority of the com-
menter and subscriber sets follow the dichotomy mentioned
above, a significant portion of repeat commenters break this
dichotomy between commenters and subscribers.
What is YouTube Popularity?
Although various methods exist, the proxy measure of popu-
larity on YouTube comes from the number of subscribers. In
this work, we measure and compute additional features that
represent social and content popularity. In this section, we
provide some analysis of how these features relate to each
other.
The top plot of Figure 4 depicts in-degree of users (with
at least one upload) against the number of videos uploaded
(undeleted) on log-log scales. There is a linearly increasing
trend in the median of each logscale-bin, suggesting that,
typically, users increase the number of uploads as they be-
come more popular. However, this increase in median flat-
lines and picks up again for extremely popular users. De-
spite the trend observed in the median of each bin, a large
number of outliers exist on the lower-end of the in-degree
scale. Amongst these, some users with 0 or 1 subscriber
are uploading thousands of videos. This points to the fact
that although many users take advantage of the subscription
service to link to others, a significant number of users sim-
ply use YouTube as a content diffusion network without any
need to connect “socially”.
In the same figure, we plot the relationship of PageRank
and In-Degree for the subscription graph. The main idea be-
hind PageRank is to allow propagation of influence over
the network (Easley and Kleinberg 2010). Instead of just
counting the number of edges, it takes into account who
subscribes. From the bottom plot of Figure 4, we see a
linearly increasing relationship between a user’s in-degree
(also log-binned) and PageRank. This is not surprising as a
user with more subscribers obtain “influentialness” from a
larger number of subscribers. However, a large number of
outliers with relatively high PageRank exist in bins contain-
ing low in-degree users. In these cases, the relatively few
7. False positive rate
Truepositiverate
0.0 0.2 0.4 0.6 0.8 1.0
0.00.20.40.60.81.0
*
*
*
*
*
*
*
*
*******
********************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************* * * * * * * * * * *
* All
outdeg
indeg
reciprocal
com.in
com.out
pagerank
max.fav
fav
min.fav
max.views
views
min.views
main.cat
max.coms
coms
min.coms
uploads
max.raters
raters
min.raters
max.avg.rating
avg.rating
min.avg.rating
com.pagerank
ROC Curve for P1 Partners
False positive rate
Truepositiverate
0.0 0.2 0.4 0.6 0.8 1.0
0.00.20.40.60.81.0
*
*
*
*
*
*
*
**
*
****
**
*
*
*
********
********************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************** * * * * * * * * *
* All
outdeg
indeg
reciprocal
com.in
com.out
pagerank
max.fav
fav
min.fav
max.views
views
min.views
main.cat
max.coms
coms
min.coms
uploads
max.raters
raters
min.raters
max.avg.rating
avg.rating
min.avg.rating
com.pagerank
ROC Curve for P2 Partners
False positive rate
Truepositiverate
0.0 0.2 0.4 0.6 0.8 1.0
0.00.20.40.60.81.0
*
*
*
*
*
*
****
*
********
*************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************************** * * * * * * * * * * * *
* All
outdeg
indeg
reciprocal
com.in
com.out
pagerank
max.fav
fav
min.fav
max.views
views
min.views
main.cat
max.coms
coms
min.coms
uploads
max.raters
raters
min.raters
max.avg.rating
avg.rating
min.avg.rating
com.pagerank
ROC Curve for P3 Partners
Figure 6: Receiver operator characteristic curve for YouTube partner classification
process. There exists three categories of user partners in the
YPP, which we denote as P1, P2, P3. Typically, partners in
the P1 group are private users who have gained significant
popularity and consistently influences the YouTube commu-
nity. P2 and P3 partners are mainly companies that establish
contracts with YouTube for diffusing content as part of their
business. In our setup, a binary-classifier is used to classify
each category independently.
The YPP Classification Framework
A critical challenge to the YPP classification problem is the
highly-skewed nature of YPP instances, which is a tiny frac-
tion of the YouTube user population. Due to this imbalance,
the classifier needs to carefully avoid over-classifying nega-
tively such that promising users are not passed as false neg-
atives. On the other hand, a higher number of false positives
is not as critical since this tool serves as part of a discovery
process, where manual selection follows.
Classifier Setup Formally, a feature vector ¯fµ can be con-
structed for each user µ, where µ ∈ N of the set of users
who have existing measurements for the three aforemen-
tioned data sources. Then, a feature matrix F ∈ d×N
can
be constructed from the N users with d = 24 features each.
For each of the 3 types of partners, a vector l ∈ l×N
con-
tains the binary label the the partner type to be classified.
In the training and testing phases of the classifier, a
10-fold cross-validation setup is adopted where {F, l}
is column-split into {FT R, lT R} ∼ 90% of N and
{FT E, lT E} ∼ 10% of N. Due to the computation limits
of running the classifier process in the statistical program
R (R Development Core Team 2010), F is uniformly sam-
pled to be approximately 35% of the users who have com-
plete feature information. We use the randomForest package
(Liaw and Wiener 2002) in R to train and test the classifier.
To ensure there is no shortage of positive instances exposed,
the training data contains all positive instances in FT R while
negative instances are sampled to maintain a 1:1 ratio with
the number of positive instances used. However, it should
be noted that all testing results reflect the highly-imbalanced
real-world ratio found in the original data.
Table 2: AUCs of YPP classification
Mean AUC Std. Dev.
P1 Partners 0.9682098 0.02123823
P2 Partners 0.9580012 0.03234237
P3 Partners 0.9428346 0.04128529
Table 3: Top Gini entropy reducing features
Rank P1 P2 P3
1 indeg pagerank pagerank
2 max.fav indeg indeg
3 pagerank com.in com.in
Classifier Performance In Figure 6, the ROC curve is
shown for each of the three types of partners. High AUC is
obtained when all features are used in the classification pro-
cess. Also plotted are the ROC curves of the individual fea-
tures when used as the only predictor. From the ROC curves,
it is apparent that the trained model is able to successfully
utilize a mixture of high and low performing features. Table
2 shows a tabulation of the averaged AUC scores in the test-
ing phase for a 10-fold cross-validation setup. Table 3 lists
the top 3 features for each partner category in terms of Gini
entropy reduction. In the classification results observed, our
classifier results in some false positives that drive down pre-
cision, however, false negatives remain close to 0 in all three
classes. The classifier does a formidable job of correctly fil-
tering out a large number of non-partner users. Therefore,
as intended, this classifier may serve as a tool to pre-select
real-world users for manual partner selection in the YPP.
Conclusions
In this work, we tie together three full-scale datasets to better
understand the nature of the YouTube social network. Com-
pared to recent work, this is one of the most comprehensive
measurement studies of a major OSN to date. This work was
possible due to the availability of data and computing re-
sources from within Google.
8. We found that the content-driven nature of the YouTube
social network differentiates itself from traditional social
networks in terms of user linking and interaction behaviours.
Comparing the subscription and comment graphs, we find
very little overlap between commenters and subscribers, in-
dicating a dichotomy of “social” and “content” activities
within the same system. Examining popularity, we notice
video “hits” are more . Finally, we successfully leverage our
measurements to classify for pre-filtering potential YouTube
partners for manual selection.
This work is one of the first steps towards full-scale OSN
measurement and analysis. We propose three areas for fu-
ture. First, many computationally intensive graph metrics,
such as ones involving 2-hop ego networks, were not at-
tempted due to the size of the dataset. These metrics pro-
vide additional insight to understand the topology of the so-
cial graphs and are invaluable in applications such as link
prediction. Second, we do not discuss temporal dynamics
of the social graphs in terms of their evolution. For exam-
ple, tracking the evolution of low in-degree/high PageR-
ank users may reveal interesting insights to how YouTube
celebrities emerge. Finally, understanding the interrelation
between social graphs and content broadcast/consumption
patterns, including temporal analysis, could lead to insights
on which/how “viral” videos spread on the YouTube net-
work.
Acknowledgments
We would like to thank Salvatore Scellato for his insights.
References
Bakshy, E.; Hofman, J. M.; Mason, W. A.; and Watts, D. J.
2011. Everyone’s an influencer: quantifying influence on
twitter. In Proceedings of the fourth ACM international con-
ference on Web search and data mining, WSDM ’11, 65–74.
New York, NY, USA: ACM.
Benevenuto, F.; Rodrigues, T.; Almeida, V.; Almeida, J.; and
Ross, K. 2009. Video interactions in online video social net-
works. ACM Transactions on Multimedia Computing Com-
munications and Applications 5(4):1–25.
Cha, M.; Kwak, H.; Rodriguez, P.; Ahn, Y.-Y.; and Moon,
S. 2007. I tube, you tube, everybody tubes: analyzing the
world’s largest user generated content video system. In Pro-
ceedings of the 7th ACM SIGCOMM conference on Internet
measurement, IMC ’07, 1–14. New York, NY, USA: ACM.
Cha, M.; Haddadi, H.; Benevenuto, F.; and Gummadi, K. P.
2010. Measuring User Influence in Twitter: The Million Fol-
lower Fallacy. In Proceedings of the 4th International AAAI
Conference on Weblogs and Social Media (ICWSM).
Cha, M.; Mislove, A.; and Gummadi, K. P. 2009. A
measurement-driven analysis of information propagation in
the flickr social network. In Proceedings of the 18th interna-
tional conference on World wide web, WWW ’09, 721–730.
New York, NY, USA: ACM.
Cheng, X.; Dale, C.; and Liu, J. 2008. Statistics and so-
cial network of youtube videos. In Quality of Service, 2008.
IWQoS 2008. 16th International Workshop on, 229 –238.
De Choudhury, M.; Mason, W. A.; Hofman, J. M.; and
Watts, D. J. 2010. Inferring relevant social networks from
interpersonal communication. In Proceedings of the 19th
international conference on World wide web, WWW ’10,
301–310. New York, NY, USA: ACM.
Dean, J., and Ghemawat, S. 2008. Mapreduce: simplified
data processing on large clusters. Commun. ACM 51:107–
113.
Easley, D., and Kleinberg, J. M. 2010. Networks, Crowds,
and Markets: Reasoning About a Highly Connected World.
Cambridge University Press.
Hong, L.; Dan, O.; and Davison, B. D. 2011. Predicting
popular messages in twitter. In Proceedings of the 20th inter-
national conference companion on World wide web, WWW
’11, 57–58. New York, NY, USA: ACM.
Kahanda, I., and Neville, J. 2009. Using transactional infor-
mation to predict link strength in online social networks.
Krishnamurthy, B.; Gill, P.; and Arlitt, M. 2008. A few
chirps about twitter. In Proceedings of the first workshop on
Online social networks, WOSN ’08, 19–24. New York, NY,
USA: ACM.
Kumar, R.; Novak, J.; and Tomkins, A. 2006. Structure and
evolution of online social networks. In Proceedings of the
12th ACM SIGKDD international conference on Knowledge
discovery and data mining, KDD ’06, 611–617. New York,
NY, USA: ACM.
Kwak, H.; Lee, C.; Park, H.; and Moon, S. 2010. What is
Twitter, a social network or a news media? In Proceedings of
the 19th international conference on World wide web WWW
10, 591. ACM Press.
Liaw, A., and Wiener, M. 2002. Classification and Regres-
sion by randomForest. R News 2(3):18–22.
Malewicz, G.; Austern, M. H.; Bik, A. J. C.; Dehnert, J. C.;
Horn, I.; Leiser, N.; and Czajkowski, G. 2010. Pregel: a
system for large-scale graph processing. In Proceedings of
the 2010 international conference on Management of data,
SIGMOD ’10, 135–145. ACM.
McPherson, M.; Smith-Lovin, L.; and Cook, J. M. 2001.
Birds of a Feather: Homophily in Social Networks. Annual
Review of Sociology 27(1):415–444.
Mislove, A.; Marcon, M.; Gummadi, K. P.; Druschel, P.; and
Bhattacharjee, B. 2007. Measurement and analysis of online
social networks. Proceedings of the 7th ACM SIGCOMM
conference on Internet measurement IMC 07 29.
R Development Core Team. 2010. R: A Language and En-
vironment for Statistical Computing. R Foundation for Sta-
tistical Computing, Vienna, Austria. ISBN 3-900051-07-0.
Spearman, C. 2011. Spearman ’ s rank correlation coeffi-
cient. Amer J Psychol 15(September):1–5.
Weng, J.; Lim, E.-P.; Jiang, J.; and He, Q. 2010. TwitterRank
: Finding Topic-sensitive Influential Twitterers. New York
Paper 504:261–270.
Xiang, R.; Neville, J.; and Rogati, M. 2010. Modeling rela-
tionship strength in online social networks. Proceedings of
the 19th international conference on World wide web WWW
10 981.