Midterm Presentation Undergraduate Researchers: Graduate Student Mentor: Faculty Mentor: Jordan Cowart, Katie Allmeroth Krist Culmer Dr. Wenjun (Kevin)

Slides:



Advertisements
Similar presentations
V Alyssa Rosemartin 1, Lee Marsh 1, Ellen Denny 1, Bruce Wilson USA National Phenology Network, Tucson, AZ; 2 - Oak Ridge National Laboratory, Oak.
Advertisements

Understanding Cancer-based Networks in Twitter using Social Network Analysis Dhiraj Murthy Daniela Oliveira Alexander Gross Social Network Innovation Lab.
The Last Procedure Before First Functional Prototype Grant Boomer, Brett Papineau, Tanis Lopez, Archana Shrestha CS 383.
Graphs in Computer Science Tim Kimmet, VP Platform Team.
1 Social Influence Analysis in Large-scale Networks Jie Tang 1, Jimeng Sun 2, Chi Wang 1, and Zi Yang 1 1 Dept. of Computer Science and Technology Tsinghua.
Visual Mining of Communities in Complex Networks: Bringing Humans Into the Loop Perceptual Science and Technology REU Jack Murtagh & Florentina Ferati.
DEPARTMENT OF COMPUTER SCIENCE SOFTWARE ENGINEERING, GRAPHICS, AND VISUALIZATION RESEARCH GROUP 15th International Conference on Information Visualisation.
Social Network Analysis: Tasks and Tools Steven Loscalzo and Lei Yu Department of Computer Science Watson School of Engineering and Applied Science State.
1 Detecting Logic Vulnerabilities in E- Commerce Applications Presenter: Liu Yin Slides Adapted from Fangqi Sun Computer Science Department College of.
PageRank Identifying key users in social networks Student : Ivan Todorović, 3231/2014 Mentor : Prof. Dr Veljko Milutinović.
Final Presentation Undergraduate Researchers: Graduate Student Mentor: Faculty Mentor: Jordan Cowart, Katie Allmeroth Krist Culmer Dr. Wenjun Zeng Investigating.
EPortfolio Assessment Pilot. Agenda Purpose of the ePortfolio assessment pilot CSD use of ePortfolio English department use of ePortfolio Future applications.
Joanne Muellenbach, MLS, AHIP The Commonwealth Medical College Scranton, Pennsylvania June 26, 2012.
Design of a Click-tracking Network for Full-text Search Engine Group 5: Yuan Hu, Yu Ge, Youwen Gong, Zenghui Qiu and Miao Liu.
Large-Scale Cost-sensitive Online Social Network Profile Linkage.
Web Information Retrieval Projects Ida Mele. Rules Students can work in teams (max 3 people) The project must be delivered by the deadline that will be.
Models of Influence in Online Social Networks
Projects ( ) Ida Mele. Rules Students have to work in teams (max 2 people). The project has to be delivered by the deadline that will be published.
Relationship Between Student Surveys of Teaching and Course Quality Assurance Components for Online Courses Janine Lim Associate Dean, Online Higher Education.
Supporting the Automatic Construction of Entity Aware Search Engines Lorenzo Blanco, Valter Crescenzi, Paolo Merialdo, Paolo Papotti Dipartimento di Informatica.
A Distributed and Privacy Preserving Algorithm for Identifying Information Hubs in Social Networks M.U. Ilyas, Z Shafiq, Alex Liu, H Radha Michigan State.
Multigraph Sampling of Online Social Networks Minas Gjoka, Carter Butts, Maciej Kurant, Athina Markopoulou 1Multigraph sampling.
Introduction to Information Retrieval CS 5604: Information Storage and Retrieval ProjCINETViz by Maksudul Alam, S M Arifuzzaman, and Md Hasanuzzaman Bhuiyan.
Jason Polakis and Sotiris Ioannidis, FORTH-ICS, Greece; Marco Lancini, Federico Maggi, and Stefano Zanero, Politecnico di Milano, Italia; Georgios Kontaxis.
Browse design in digital libraries: Impact on user experience Xiangmin Zhang, Yuelin Li, Jingjing Liu & Ying Zhang SCILS, Rutgers University {xzhang,lynnlee,
Copyright © Allyn & Bacon 2008 POWER PRACTICE Chapter 7 The Internet and the World Wide Web START This multimedia product and its contents are protected.
FaceTrust: Assessing the Credibility of Online Personas via Social Networks Michael Sirivianos, Kyungbaek Kim and Xiaowei Yang in collaboration with J.W.
Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.
Understanding Cross-site Linking in Online Social Networks Yang Chen 1, Chenfan Zhuang 2, Qiang Cao 1, Pan Hui 3 1 Duke University 2 Tsinghua University.
ALICE TURCHANINOVA UNIVERSITY OF HOUSTON-DOWNTOWN PROF. IOANNIS PAVLIDIS Analyzing Human Activity Patterns via Mobile App.
PLoS ONE Application Journal Publishing System (JPS) First application built on Topaz application framework Web 2.0 –Uses a template engine to display.
COM1721: Freshman Honors Seminar A Random Walk Through Computing Lecture 2: Structure of the Web October 1, 2002.
The Guidance For Successful Graduation Project Mousa Al-Omari Alaa Bani Amer Abdullah Al-Doghim Mhmoud Shannag Ali Sameeh.
ON THE SELECTION OF TAGS FOR TAG CLOUDS (WSDM11) Advisor: Dr. Koh. Jia-Ling Speaker: Chiang, Guang-ting Date:2011/06/20 1.
12 Developing a Web Site Section 12.1 Discuss the functions of a Web site Compare and contrast style sheets Apply cascading style sheets (CSS) to a Web.
A Discrepancy Detector James Abello, CCICADA-DIMACS FACULTY ( Student: Nishchal Devanur CS Dept Rutgers Goal To detect the most influential.
A Collaborative Cloud-Based Multimedia Sharing Platform for Social Networking Environments Speaker : Chang,Kun-Hsiang /11/$26.00 ©2011.
Mining Social Networks for Personalized Prioritization Shinjae Yoo, Yiming Yang, Frank Lin, II-Chul Moon [KDD ’09] 1 Advisor: Dr. Koh Jia-Ling Reporter:
Binxing Jiao et. al (SIGIR ’10) Presenter : Lin, Yi-Jhen Advisor: Dr. Koh. Jia-ling Date: 2011/4/25 VISUAL SUMMARIZATION OF WEB PAGES.
NEWonline 2.0 What’s in it for you Features and functions of the Network’s all-new web platform June 15, 2009.
A Discrepancy Detector James Abello, CCICADA-DIMACS FACULTY ( Student: Nishchal Devanur CS Dept Rutgers Goal To detect the most influential.
EVENT DETECTION IN TIME SERIES OF MOBILE COMMUNICATION GRAPHS
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
Peer Centrality in Socially-Informed P2P Topologies Nicolas Kourtellis, Adriana Iamnitchi Department of Computer Science & Engineering University of South.
Exploit of Online Social Networks with Community-Based Graph Semi-Supervised Learning Mingzhen Mo and Irwin King Department of Computer Science and Engineering.
Detecting Communities Via Simultaneous Clustering of Graphs and Folksonomies Akshay Java Anupam Joshi Tim Finin University of Maryland, Baltimore County.
CyberInfrastructure for Network Analysis Importance of, contributions by network analysis Transformation of NA Support needed for NA.
Mining and Visualizing the Evolution of Subgroups in Social Networks Falkowsky, T., Bartelheimer, J. & Spiliopoulou, M. (2006) IEEE/WIC/ACM International.
Measuring Behavioral Trust in Social Networks
An Effective & Interactive Approach to Particle Tracking for DNA Melting Curve Analysis 李穎忠 DEPARTMENT OF COMPUTER SCIENCE & INFORMATION ENGINEERING NATIONAL.
Post-Ranking query suggestion by diversifying search Chao Wang.
Mining information from social media
Don’t Follow me : Spam Detection in Twitter January 12, 2011 In-seok An SNU Internet Database Lab. Alex Hai Wang The Pensylvania State University International.
Incorporating Site-level Knowledge for Incremental Crawling of Web Forums: A List-wise Strategy KDD 2009 Jiang-Ming Yang, Rui Cai, Chunsong Wang, Hua Huang,
GROUP PresentsPresents. WEB CRAWLER A visualization of links in the World Wide Web Software Engineering C Semester Two Massey University - Palmerston.
Intro to Canvas Inservice. Intro to Canvas – What is the purpose of this class?  You will be able to use this presentation to share with your teachers.
1 Discovering Web Communities in the Blogspace Ying Zhou, Joseph Davis (HICSS 2007)
Analysis of Massive Data Sets Prof. dr. sc. Siniša Srbljić Doc. dr. sc. Dejan Škvorc Doc. dr. sc. Ante Đerek Faculty of Electrical Engineering and Computing.
September 2003, 7 th EDG Conference, Heidelberg – Roberta Faggian, CERN/IT CERN – European Organization for Nuclear Research The GRACE Project GRid enabled.
1 Link Privacy in Social Networks Aleksandra Korolova, Rajeev Motwani, Shubha U. Nabar CIKM’08 Advisor: Dr. Koh, JiaLing Speaker: Li, HueiJyun Date: 2009/3/30.
GRAPH AND LINK MINING 1. Graphs - Basics 2 Undirected Graphs Undirected Graph: The edges are undirected pairs – they can be traversed in any direction.
Automated Experiments on Ad Privacy Settings
Multi-Layer Network Representation of the NTC Environment Lili Sun, Proof School Arijit Das, Computer Science Introduction The United States Army’s National.
NETVIZZ Facebook
Rosta Farzan and Keyang Zheng, School of Computing and Information
RELATIONSHIP MINING IN SOCIAL NETWORKS
Dieudo Mulamba November 2017
Data Exploration Of Wikipedia
Jincheng Gao CIS895 – MSE Project
Analyzing Massive Graphs - ParT I
Presentation transcript:

Midterm Presentation Undergraduate Researchers: Graduate Student Mentor: Faculty Mentor: Jordan Cowart, Katie Allmeroth Krist Culmer Dr. Wenjun (Kevin) Zeng A centrality measure to quantify social capital in a network

Outline Introduction ▫Key terms ▫The problem ▫Project Goals Related Work Data Collection & Analysis ▫Data Acquisition ▫Tools for Analysis Future Work 2

Outline Introduction ▫Key terms ▫The problem ▫Project Goals Related Work Data Collection & Analysis ▫Data Acquisition ▫Tools for Analysis Future Work 3

Key terms Centrality – The criticality (importance) of a node’s position within a network. Social Capital – The value of a node based on its ability to influence other nodes and access resources from diverse areas (communities) of the network. Community – “... a community is generally thought of as a part of a network where internal connections are denser than external ones.” 4

Two measures of centrality Eigenvector Centrality (EVC) Principal Component Centrality (PCC) 5

The problem Current measures of centrality take into account the node’s “connectedness” but do not consider a node’s “community membership” Want to incorporate social capital when computing a node’s centrality Why is this important? 6

Project Goals 1. Extract Facebook Data ▫Develop a Web Crawler  Crawl Mizzou’s Facebook page 2. Preliminary Analysis ▫Apply EVC and PCC to test data/collected data ▫Develop a visualization of data ▫Derive any interesting information from the data 3. Expand EVC/PCC to develop a new and improved centrality measure. 7

Outline Introduction ▫Key terms ▫The problem ▫Project Goals Related Work Data Collection & Analysis ▫Data Acquisition ▫Tools for Analysis Future Work 8

Related Work Ilyas et al. [1, 2] demonstrated shortcomings of EVC and then proposed and defined a new algorithm, PCC. Yang et al. [3] discussed the use of ground-truth (user defined) communities as a bench marking tool for community detection algorithms Xiao et al. [4] developed an algorithm for gathering Facebook data without the use of Facebook’s API Salamos et al. [5] shows that there is correlation between “liked” Facebook pages and communities. 9

Outline Introduction ▫Key terms ▫The problem ▫Project Goals Related Work Data Collection & Analysis ▫Data Acquisition ▫Tools for Analysis Future Work 10

Data Acquisition Stanford Large Network Dataset Collection ▫Provides a collection of more than 50 large network data sets that can include hundreds of thousands of nodes and edges Mizzou Facebook page ▫Ground-truth community consisting of individuals stating their education is from Mizzou 11

Data Acquisition How would we gather information from Facebook? ▫Facebook API or web crawler? Decided to go with a web crawler ▫Faster – Information is readily available, we don’t have to gather through an app ▫Other papers had exhibited problems with the Facebook API – they used web crawlers in the end 12

Data Acquisition - Web Crawler Features: ▫Python ▫Queue based ▫Breadth-first search (BFS) Libraries Used: ▫BeautifulSoup ▫Built in libraries (URLLib + RE) Only scrapes data from individuals that attend Mizzou 13

14

Data Acquisition - Web Crawler Information to be scraped: ▫Node’s URL (e.g. - katie.marie.5661) ▫Major ▫Gender ▫Home Town ▫Friends list ▫Likes (only those related to Mizzou) Keep track of nodes in Mizzou / Not in Mizzou / Private 15

Data Acquisition - Web Crawler Definition of private: ▫A page is considered private if the page returns a 404 error or if we cannot access the “All” friends tab

Data Acquisition - Web Crawler Where exactly are we gathering data from? ▫Major -> “About” page ▫Gender -> “About” page ▫Home Town -> “About” page 17

Data Acquisition - Web Crawler Where exactly are we gathering data from? ▫Node’s URL -> “Friends” page ▫Friends list -> “Friends” page 18

Data Acquisition - Web Crawler Where exactly are we gathering data from? ▫Likes -> “Likes” page 19

Data Acquisition - Web Crawler Output of data in a text file: ▫ (Node and friends) ▫Male (Gender) ▫Computer Science (Major) ▫Cobden, IL (Hometown) ▫Mizzou (Likes) Able to change major to a college ▫Computer Science -> College of Engineering 20

Tools for Analysis - Gephi An interactive network visualization and exploration platform ▫Able to change node size, color, and label ▫Can easily import graphs Also provides a graph analysis toolkit ▫Provides centrality measure plugins  Can create our own plugin 21

Facebook Graph 22 Nodes: 4039 Edges: 88234

Facebook Graph 23 Nodes: 4039 Edges: 88234

Outline Introduction ▫Key terms ▫The problem ▫Project Goals Related Work Data Collection & Analysis ▫Data Acquisition ▫Tools for Analysis Future Work 24

Future Work Crawl Facebook after receiving permission Build PCC Plugin for Gephi Formalize definition of social capital Define a method for scoring social capital ▫Apply method to test data and analyze results 25

Thank you! 26

References [1] M. U. Ilyas, H. Radha, “A KLT-inspired Node Centrality for Identifying Influential Neighborhoods in Graphs”, th Annual Conference on Information Sciences and Systems, IEEE, Princeton, NJ, March 2010, pp [2] M. U. Ilyas, H. Radha, “Identifying Influential Nodes in Online Social Networks Using Principal Component Centrality”, The 2011 IEEE International Conference on Communications, IEEE, Kyoto, June 2011, pp [3] J. Yang, J. Leskovec, “Defining and Evaluating Network Communities based on Ground-truth”, The 12th IEEE International Conference on Data Mining, IEEE, Brussels, Dec. 2012, pp [4] Z. Xiao, B. Liu, H. Hu, T. Zhang, “Design and Implementation of Facebook Crawler Based on Interaction Simulation”, The 11th IEEE International Conference On Trust, Security And Privacy In Computing And Communications, IEEE, Liverpool, June 2012, pp [5] N. Salamos, E. Voudigari, T. Papageorgiou, M. Vazirgianni,, “Design and Implementation of Facebook Crawler Based on Interaction Simulation”, 2012 IEEE International Conference on Green Computing and Communications, IEEE, Athens, Nov. 2012, pp