Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Structure of media attention

627 views

Published on

Presentation at ECCS2014

Published in: Science
  • Be the first to comment

  • Be the first to like this

Structure of media attention

  1. 1. The structure of media attention V.A. Traag, R. Reinanda, J. Hicks, G. Van Klinken KITLV, Leiden, the Netherlands e-Humanities, KNAW, Amsterdam, the Netherlands September 30, 2014 e Humanities Royal Netherlands Academy of Arts and Sciences
  2. 2. Background Research focus Study elite (network) behaviour. Relation with political developments. Data: newspaper articles. How can we use them? Data Current corpus: Joyo/Indonesian News Service, 2004{2012. Contains about 140 263 articles.
  3. 3. Network Building the network 1 Detect names automatically . I Budhisantoso would ask Kalla to team up with Yudhoyono . 2 Disambiguate names. I Susilo Bambang Yudhoyono or Dr. Yudhoyono , etc. . . 3 Co-occurrence in sentence (record frequency). I Budhisantoso would ask Kalla to team up with Yudhoyono . K 1 B Y 1 1
  4. 4. Network Building the network 1 Detect names automatically . I Budhisantoso would ask Kalla to team up with Yudhoyono . 2 Disambiguate names. I Susilo Bambang Yudhoyono or Dr. Yudhoyono , etc. . . 3 Co-occurrence in sentence (record frequency). I Budhisantoso would ask Kalla to team up with Yudhoyono . K 1 B Y 1 1
  5. 5. Network Building the network 1 Detect names automatically . I Budhisantoso would ask Kalla to team up with Yudhoyono . 2 Disambiguate names. I Susilo Bambang Yudhoyono or Dr. Yudhoyono , etc. . . 3 Co-occurrence in sentence (record frequency). I Budhisantoso would ask Kalla to team up with Yudhoyono . K 1 B Y 1 1
  6. 6. Network Building the network 1 Detect names automatically . I Budhisantoso would ask Kalla to team up with Yudhoyono . 2 Disambiguate names. I Susilo Bambang Yudhoyono or Dr. Yudhoyono , etc. . . 3 Co-occurrence in sentence (record frequency). I Budhisantoso would ask Kalla to team up with Yudhoyono . K 1 B Y 1 1
  7. 7. Strength 101 100 100 101 102 103 Degree Average weight Joyo NYT 100 101 102 103 104 Degree Data Hubs co-occur more frequently.
  8. 8. Strength 101 100 100 101 102 103 Degree Average weight Joyo NYT 100 101 102 103 104 Degree Data Bipartite Hubs co-occur more frequently.
  9. 9. Clustering 100 10−1 10−2 100 101 102 103 10−3 Degree Clustering Joyo NYT 100 101 102 103 104 Degree Data Hubs tend to cluster less.
  10. 10. Clustering 100 10−1 10−2 100 101 102 103 10−3 Degree Clustering Joyo NYT 100 101 102 103 104 Degree Data Bipartite Hubs tend to cluster less.
  11. 11. Clustering 100 10−1 100 101 102 103 Degree Weighted Clustering Joyo NYT 100 101 102 103 104 Degree Data Hubs tend to cluster less (also weighted).
  12. 12. Clustering 100 10−1 100 101 102 103 Degree Weighted Clustering Joyo NYT 100 101 102 103 104 Degree Data Bipartite Hubs tend to cluster less (also weighted).
  13. 13. Neighbour degree 103 102 100 101 102 103 101 Degree Neighbour Degree Joyo NYT 100 101 102 103 104 Degree Data Hubs tend to connect to low degree nodes.
  14. 14. Neighbour degree 103 102 100 101 102 103 101 Degree Neighbour Degree Joyo NYT 100 101 102 103 104 Degree Data Bipartite Hubs tend to connect to low degree nodes.
  15. 15. Weighted Neighbour degree 103 102 100 101 102 103 Degree Weighted Neighbour Degree Joyo NYT 100 101 102 103 104 Degree Data But hubs connect much stronger to other hubs.
  16. 16. Weighted Neighbour degree 103 102 100 101 102 103 Degree Weighted Neighbour Degree Joyo NYT 100 101 102 103 104 Degree Data Bipartite But hubs connect much stronger to other hubs.
  17. 17. Predict weight 100 101 102 103 104 104 103 102 101 100 Weight Predicted Weight Joyo NYT 100 101 102 103 104 Weight Data wij J ij exp((si sj )
  18. 18. )
  19. 19. Predict weight 100 101 102 103 104 104 103 102 101 100 Weight Predicted Weight Joyo NYT 100 101 102 103 104 Weight Data Bipartite wij J ij exp((si sj )
  20. 20. )
  21. 21. Core-periphery Summary Results Hubs attract much more weight. Most of the weight between hubs. Low degree node connect to hubs. Low degree nodes cluster locally. Consistent with core-periphery structure. But, seems also present in bipartite randomisation. Largest deviations, empirically: Degree is lower, average weight is higher. Weighted neighbour degree increases.
  22. 22. Model Simple model to overcome deviations: 1 Create empty sentence 2 Add certain number of nodes 1 Either random node (with PA) 2 Or random neighbour (with PA) Probability (ki + 1)

×