Digital humanities Filtering.

Slides:



Advertisements
Similar presentations
Network Overview Discovery and Exploration for Excel (NodeXl) Hands On Exercise Presented by: Samer Al-khateeb Class: Social Media Mining and Analytics.
Advertisements

 Copyright 2011 Digital Enterprise Research Institute. All rights reserved. Digital Enterprise Research Institute Enabling Networked Knowledge.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Lecture 9 Measures and Metrics. Structural Metrics Degree distribution Average path length Centrality Degree, Eigenvector, Katz, Pagerank, Closeness,
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
A Study on Detection Based Automatic Speech Recognition Author : Chengyuan Ma Yu Tsao Professor: 陳嘉平 Reporter : 許峰閤.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
Community Detection in a Large Real-World Social Network Karsten Steinhaeuser Nitesh V. Chawla DIAL Research Group University of Notre.
Tuple – InfoVis Publication Browser CS533 Project Presentation by Alex Gukov.
1 NetInsight Hands-On 10 October 2007
Brent Kievit-Kylar Indiana University. A Visual Word Similarity Tool How can two words be compared? – Similar letters (dog, god) – Similar looking objects.
AGB 260: Agribusiness Information Technology Sort, Filters, Pivot Tables, and Pivot Charts.
Biological Networks Lectures 6-7 : February 02, 2010 Graph Algorithms Review Global Network Properties Local Network Properties 1.
Network properties Slides are modified from Networks: Theory and Application by Lada Adamic.
Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.
By Chris Zachor.  Introduction  Background  Changes  Methodology  Data Collection  Network Topologies  Measures  Tools  Conclusion  Questions.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Class 10: Introduction to CINET Using CINET for network analysis and visualization Network Science: Introduction to CINET 2015 Prof. Boleslaw K. Szymanski.
© 2008 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice Lesson # 8 HP UCMDB 8.0 Essentials.
Configure your animation in Xtplot, then check “Save animation to image files” and click Run. Save images here Choose PNG, JPEG, TIFF, or Bitmap.
CHOOSE 1 OF THESE.
Importance Measures on Nodes Lecture 2 Srinivasan Parthasarathy 1.
From digital to craft: How to make a data matrix with SNS data There are many applications that allow its users to visualize different networks directly.
The Overview Panel on Gephi 0.9.1
Centralities (Gephi and Python)
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Central nodes (Python and Gephi).
COP 4540 Database Management
WHAT ARE THEY DOING? DIGITAL CAMERA COOK SHOP READ SING DRIVE PLAY!
DIGITAL FILTERS h = time invariant weights (IMPULSE RESPONSE FUNCTION)
Principles of Network Analysis
WHAT ARE THEY DOING? DIGITAL CAMERA COOK SHOP READ SING DRIVE PLAY!
Personalized Social Image Recommendation
Click here for the answer. Click here for the answer.
Gephi Gephi is a tool for exploring and understanding graphs. Like Photoshop (but for graphs), the user interacts with the representation, manipulate the.
Click here for the answer. Click here for the answer.
Click here for the answer. Click here for the answer.
INFORMATION RETRIEVAL TECHNIQUES BY DR. ADNAN ABID
Using Friendship Ties and Family Circles for Link Prediction
Google Scholar, ShareLaTeX, and Gephi
Network Science: A Short Introduction i3 Workshop
Section 7.12: Similarity By: Ralucca Gera, NPS.
AGB 260: Agribusiness Data Literacy
Peer-to-Peer and Social Networks Fall 2017
Choose your characters and drag them onto the slide
Movies v Plays
Choose your characters and drag them onto the slide
Central Nodes (Python and Gephi).
Gephi.
*IEEE Web Services *Virtual Community *SAMIEEE
Choose your characters and drag them onto the slide
CS224N: Query Focused Multi-Document Summarization
Korea University of Technology and Education
Choose your characters and drag them onto the slide
Choose your characters and drag them onto the slide
Choose your characters and drag them onto the slide
Refresh: Click Here.
Centralities Using Gephi and Python Prof. Ralucca Gera,
Choose your characters and drag them onto the slide
Choose your characters and drag them onto the slide
Network topology. Network topology. Nodes are linked by edges. Node size represents a quantifiable node property (e.g. fold-change in two different experimental.
The Overview Panel on Gephi 0.9.1
Choose your characters and drag them onto the slide
Choose your characters and drag them onto the slide
Choose your characters and drag them onto the slide
Digital Filters.
Analyzing Massive Graphs - ParT I
Choose your characters and drag them onto the slide
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 7
Presentation transcript:

Digital humanities Filtering

Filtering Filtering exercise Chinese/English Buddhists study keyword co-occurrence 1987~ Compare modularity analysis before and after filtering Giant component Clustering coefficient Edge weights Frequency

modularity analysis before filtering Run

Select

Results: Modularity: 0.651 Modularity with resolution: 0.651 Number of Communities: 312

Notice: under Node Overview Clustering coefficient analysis Run Notice: under Node Overview Not under Dynamic

Choose undirected

Results: Average Clustering Coefficient: 0.827

Filter Queries 1.Frequency 2.Edge weights 3.Clustering coefficient 4. Giant component Queries

Giant Component Topology Giant Component “ Drag filter here” under Queries

Clustering coefficient Attributes Range Clustering coefficient “ Drag subfilter here” under Giant Component Open

Clustering coefficient click Type 0.09

“ Drag subfilter here” under Clustering coefficient Edge Weight Edges edge whight “ Drag subfilter here” under Clustering coefficient Type in 0.6

Frequency Attributes Range total “ Drag subfilter here” under edge whight Type in 3

After filtering Filter

modularity analysis after filtering Results: Modularity: 0.875 Modularity with resolution: 0.875 Number of Communities: 24

Also Presidential speech Compare modularity analysis before and after filtering Try filter insignificant terms and come up with a better modularity analysis Use Marvel social network and aNobii book co-ownership , Movie viewing data to play with filtering, centrality, and modularity analysis

An example of high frequency and low clustering coefficient term “Buddhists”