LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.

Slides:



Advertisements
Similar presentations
Complex Networks Advanced Computer Networks: Part1.
Advertisements

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Network analysis Sushmita Roy BMI/CS 576
Semir Elezovikj Mo'taz Abdul Aziz Ali Al-Hami Howard Liu
Network biology Wang Jie Shanghai Institutes of Biological Sciences.
Analysis and Modeling of Social Networks Foudalis Ilias.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
Large-Scale Organization of Semantic Networks Mark Steyvers Josh Tenenbaum Stanford University.
Global topological properties of biological networks.
Search in a Small World JIN Xiaolong Based on [1].
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
The Very Small World of the Well-connected. (19 june 2008 ) Lada Adamic School of Information University of Michigan Ann Arbor, MI
Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
The Erdös-Rényi models
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Information Networks Power Laws and Network Models Lecture 3.
Analysis and Modeling of the Open Source Software Community Yongqin Gao, Greg Madey Computer Science & Engineering University of Notre Dame Vincent Freeh.
The United States air transportation network analysis Dorothy Cheung.
WORDNET Approach on word sense techniques - AKILAN VELMURUGAN.
Habitat Analysis and Conservation Management
Random Walks and Semi-Supervised Learning Longin Jan Latecki Based on : Xiaojin Zhu. Semi-Supervised Learning with Graphs. PhD thesis. CMU-LTI ,
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
WORD SENSE DISAMBIGUATION STUDY ON WORD NET ONTOLOGY Akilan Velmurugan Computer Networks – CS 790G.
Using Graph Theory to Study Neural Networks (Watrous, Tandon, Conner, Pieters & Ekstrom, 2012)
A Graph-based Friend Recommendation System Using Genetic Algorithm
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
The Small World of Human Language Ramon Ferrer i Cancho & Richard V. Sole presented by Emre Erdem.
3. SMALL WORLDS The Watts-Strogatz model. Watts-Strogatz, Nature 1998 Small world: the average shortest path length in a real network is small Six degrees.
Algorithms for Biological Networks Prof. Tijana Milenković Computer Science and Engineering University of Notre Dame Fall 2010.
Networks Igor Segota Statistical physics presentation.
Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.
COMS Network Theory Week 4: September 29, 2010 Dragomir R. Radev Wednesdays, 6:10-8 PM 325 Pupin Terrace Fall 2010.
Random Graph Generator University of CS 8910 – Final Research Project Presentation Professor: Dr. Zhu Presented: December 8, 2010 By: Hanh Tran.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
1 Finding Spread Blockers in Dynamic Networks (SNAKDD08)Habiba, Yintao Yu, Tanya Y., Berger-Wolf, Jared Saia Speaker: Hsu, Yu-wen Advisor: Dr. Koh, Jia-Ling.
Semantic Grounding of Tag Relatedness in Social Bookmarking Systems Ciro Cattuto, Dominik Benz, Andreas Hotho, Gerd Stumme ISWC 2008 Hyewon Lim January.
Class 2: Graph Theory IST402.
The Structure of Scientific Collaboration Networks by M. E. J. Newman CMSC 601 Paper Summary Marie desJardins January 27, 2009.
Information Retrieval Search Engine Technology (10) Prof. Dragomir R. Radev.
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
The simultaneous evolution of author and paper networks
Lecture 23: Structure of Networks
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Analysis of University Researcher Collaboration Network Using Co-authorship Jiadi Yao School of Electronic and Computer Science,
Structural Properties of Networks: Introduction
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Network analysis.
Lecture 23: Structure of Networks
Structural Properties of Networks: Introduction
Generative Model To Construct Blog and Post Networks In Blogosphere
Network Science: A Short Introduction i3 Workshop
Section 8.6 of Newman’s book: Clustering Coefficients
The Watts-Strogatz model
Network Biosignatures of Earth’s Atmosphere and Biosphere
Peer-to-Peer and Social Networks Fall 2017
Department of Computer Science University of York
Network Science: A Short Introduction i3 Workshop
Clustering Coefficients
Lecture 23: Structure of Networks
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Graphs G = (V,E) V is the vertex set.
Presentation transcript:

LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G

Overview  Language Network?  How it is analyzed as a Complex Network  What are the results  Can it be extended  Area of study  Compare with wordnet  Analyze results  Conclusion

 Studies started from 1970’s  Zifs law: Frequency of words decays as a power function of its rank  Mid 1990’s  Information transmission are made by words which interact with each other  After 2000s  Frequency distribution of words  Word interaction as a complex network Small world of human language Source: The small world of human language by Ferrer and Sole

Word Web of human language  Word web designed by Ferrer I Cancho and Richard V Sole in 2001 consisted words  Lexicon: set of words  Language = lexicon + grammar  Vertices of word web are distinct words and the undirected edges are interactions between words  Word web can be considered as a collaboration net where words are collaborators in language  Total number of connections grows unproportionally to the total number of vertices Source: Evolution of Networks by S.N.Dorogovtsev and J.F.F.Mendes

Word Web of human language Source: Evolution of Networks by S.N.Dorogovtsev and J.F.F.Mendes Degree distribution of Word Web Average number of connections k = 72 K cross and K cut regions – power law dependence due to size effect

Small world of human language  The co-occurrence of words in sentences reflects language organization in a subtle manner that can be described in terms of a graph of word interactions  Properties to be studied Small world effect Scale free distribution Source: The small world of human language by Ferrer and Sole

 Co-occurrence between words in the same sentence  Link between every pair of neighboring words  Toy graph linking words at a distance of 1 or 2 in the same sentence Small world of human language Source: The small world of human language by Ferrer and Sole

 Co-occurrence at a distance of one  Red flowers  Stay here  Getting dark  Co-occurrence at a distance of two  Hit the ball  Table of wood  Live in Nevada  Decide max distance according to min distance of the most co-occurrences Small world of human language Source: The small world of human language by Ferrer and Sole

 Four fold reasons  a context of two words is considered to be the lowest distance at which computational linguistics methods can be applied  Most of the relations exists in with a distance of two which studies the nature of interaction  Interested in making more links than more relations  Seeing syntactic dependencies to form the short distance link Small world of human language Source: The small world of human language by Ferrer and Sole

 Restricted graph (RWN) P ij > p i p j  Unrestricted graph (UWN) P ij < p i p j  spurious pair: presence of correlation between pair of words co-occurs less than expected of independent words Small world of human language Source: The small world of human language by Ferrer and Sole

Small world of human language Source: The small world of human language by Ferrer and Sole Graph of human language - Language set - mapping into graph - set of edges - edge between Black nodes - common words White nodes - rare words

 Small world effect  Clustering co-efficient “C” Should be higher than for a random graph Clustering co-efficient of a random graph = 1.55X10 -4  Path length “d” Should be equal to random graph Average path length of a random graph = 3 Small world of human language Source: The small world of human language by Ferrer and Sole

Small world of human language Source: The small world of human language by Ferrer and Sole 0 denoting existence of a link 1 denoting existence of a link Set of nearest neighbors Clustering co-efficient over W L,

Small world of human language Source: The small world of human language by Ferrer and Sole Average path length “d”: - Minimum path length Average path length of a word, Overall Average path length,

 Criteria for small world network  Results of wordweb Small world of human language Source: The small world of human language by Ferrer and Sole

Small world of human language Source: The small world of human language by Ferrer and Sole

Small world of human language Source: The small world of human language by Ferrer and Sole

Wordweb Vs Wordnet

Wordnet dataset

Wordnet analysis  Total number of words:  Total number of synsets:  Statistical analysis of the output characteristics taking single relation to form a complex network  Cause of small world property in comparison with thesaurus

Questions and Comments