Social Media Analysis - Introduction

Flow of information is the transmission of information from one node to another. The information is disseminated through social media interaction.

Motivation:

  • How strong are links among people
  • How to predict links in future


The global effects and local effects are differentiated with this social media analytic.

Web is the place where people consume and create content. They interact with each other. Product reviews, social media sites, book reviews etc are analysed

In 2010, fb traffic exceeds google traffic. Human behaviour, marketing analytic and human sentiments are mapped using millions of social media data chunks.

It provides insights to large amount of business analytic applications which are used for improvements in industry and handling consumers.

Consumer generated content is non-grammatical and uncertain. But this mapping is required to examine human behavior. So, it needs to be converted into actionable data. The data is noisy, non-edited and non-authenticated.

Applications

  • Reputation or Brand Management (Consume brand analytics)
  • Marketing brand analytics
  • Mining product review (features liked, new requests on product)
  • Traces of human activities
  • Citizens response for political and governmental issues
  • Mining data for political campaigns.
  • Real time local news mining to produce well organized summary of events
  • Viral Marketing
  • Online data mining can give some useful insights
  • Identify sentiments and topics






Comments

Post a Comment

Popular posts from this blog

Analysis and Research trends using Word Co-occurrence Network

Image
Co-occurrence networks   are basically used to provide and give a graphic visualization of potential relationships between people, community, organizations, concepts or other entities represented within the form of written material. The generation and visualization of   co-occurrence   networks has become practical with the advent of electronically stored and save the text amenable to   text mining . By way of definition, co-occurrence networks are the collective interconnection of terms based on their paired presence within a specified unit of text. Networks are generated by connecting pairs of terms using a set of criteria defining co-occurrence. For example, terms A and B may be said to “co-occur” if they both appear in a particular article. Another article may contain terms B and C. Linking A to B and B to C creates a co-occurrence network of these three terms. Rules to define co-occurrence within a   text corpus   can be set according to desired criteria. For example, more str
Read more

Significance of Woman in Data Science

Image
Research scientists, regardless of gender, are doing great in this field. This has been evidenced by a great conference " Global Women in Data Science " hosted by Stanford University (livestream) for 75+ locations all over the world on 3rd February 2017. Many talented academic researchers and practitioners have successful connected to make their dreams and goals burst into reality. It has been sponsored by Microsoft, Google, WalmartLabs, SAP and many more A Grade firms.  Fig 1: Global Women in Data Science Another great initiative, Women in Machine Learning   has been hosted on Facebook. Many female potential researchers join hands for research in machine learning. Many of them have achieved great milestones and many are still on the way.  The world is full of talented, successful and fantastic female speakers Women in Machine Learning and Data science are often un-noticable by traditional recruiters and we can turn it down. Another initiative at Meetup.c
Read more

Different types of clustering for textual documents

Clustering Model 1: Nearest Neighbour Algorithms: KD-Trees and Locality Sensitive Hashing Core Machine Learning Concepts: Distance Metrics and Approximation Algorithms Problem Domain: Finding similar documents Nearest neighbour: Find distance between all other documents and query document. Retrieve the document which is closest Critical Component Document Representation Computing Distances Scaling to large dataset: KD Trees - Not appropriate for very high dimensional documents Thus, Locality sensitive hashing is used for approximate nearest neighbour search. Clustering Model 2: Capturing uncertainty in clustering: Mixture Models Any document can be related to t i topic by x%. Can learn users topic preferences Making soft assignments to clusters -Expectation Maximization Clustering Model 3: Latent dirichlet allocation Mixed membership Probability of words in vocabulary Unsupervised learning task
Read more