Large-Scale Organization of Semantic Networks Mark Steyvers Josh Tenenbaum Stanford University.

Slides:



Advertisements
Similar presentations
CS8803-NS Network Science Fall 2013
Advertisements

Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
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.
Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.
Jure Leskovec, CMU Kevin Lang, Anirban Dasgupta, Michael Mahoney Yahoo! Research.
Information Networks Small World Networks Lecture 5.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
Search in Power-Law Networks Presented by Hakim Weatherspoon CS294-4: Peer-to-Peer Systems Slides also borrowed from the following paper Path Finding Strategies.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
1 A Random-Surfer Web-Graph Model (Joint work with Avrim Blum & Hubert Chan) Mugizi Rwebangira.
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
CS728 Lecture 5 Generative Graph Models and the Web.
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
Small-World File-Sharing Communities Adriana Iamnitchi, Matei Ripeanu and Ian Foster,
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
Networks FIAS Summer School 6th August 2008 Complex Networks 1.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Web as Graph – Empirical Studies The Structure and Dynamics of Networks.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
CS Lecture 6 Generative Graph Models Part II.
A probabilistic approach to semantic representation Paper by Thomas L. Griffiths and Mark Steyvers.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
Summary from Previous Lecture Real networks: –AS-level N= 12709, M=27384 (Jan 02 data) route-views.oregon-ix.net, hhtp://abroude.ripe.net/ris/rawdata –
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.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.
“Adversarial Deletion in Scale Free Random Graph Process” by A.D. Flaxman et al. Hammad Iqbal CS April 2006.
1 presentation of article: Small-World File-Sharing Communities Article: Adriana Iamnitchi, Matei Ripeanu, Ian Foster Presentation: Periklis Akritidis.
Age of acquisition and frequency of occurrence: Implications for experience based models of word processing and sentence parsing Marc Brysbaert.
COLOR TEST COLOR TEST. Social Networks: Structure and Impact N ICOLE I MMORLICA, N ORTHWESTERN U.
Topology and Evolution of the Open Source Software Community Advisors: Dr. Vincent W. Freeh Dr. Kevin Bowyer Supported in part by the National Science.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
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.
Complex Networks Measures and deterministic models Philippe Giabbanelli.
Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.
Class 9: Barabasi-Albert Model-Part I
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
How Do “Real” Networks Look?
1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.
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.
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
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
Network (graph) Models
Lecture 23: Structure of Networks
Structures of Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Topics In Social Computing (67810)
How Do “Real” Networks Look?
Lecture 23: Structure of Networks
Generative Model To Construct Blog and Post Networks In Blogosphere
The Watts-Strogatz model
How Do “Real” Networks Look?
How Do “Real” Networks Look?
The likelihood of linking to a popular website is higher
How Do “Real” Networks Look?
Department of Computer Science University of York
Peer-to-Peer and Social Networks
Lecture 23: Structure of Networks
Lecture 9: Network models CS 765: Complex Networks
Presentation transcript:

Large-Scale Organization of Semantic Networks Mark Steyvers Josh Tenenbaum Stanford University

Graph theoretic analyses: Collaboration network of film actors, scientists Watts & Strogatz (1998); Newman (2001) Neural network of worm: C. elegans Watts & Strogatz (1998) WWW Barabasi & Albert (1999)

Link structure of semantic networks: Small-world & scale free What produces such link structures? Semantic growth Relation to age-of-acquisition effects Behavioral effects of link structure Overview

Word Association Nelson et al. (1999) n words = 5,000+

Roget’s Thesaurus Categories 1,000 Word forms 29,000+

Wordnet George Miller Word forms 122,000+ Word senses 99,000+

1. Short path lengthsL = average length of shortest path between two nodes One class of Small World Networks: Word Association Roget WordNet 3 x number of triangles number of connected triples of vertices C=0C=1 2. Local clustering C = Power-law  = exponent in power-law  degree distribution distribution Random Graphs n = number of nodes , ,000+

Power law tail Exponential tail e.g., random graphs (Erdös-Réyni) or Watts & Strogatz (1998) model Exponential: Power law: HUBS

 =3.01  =3.19  =3.11

Zipf’s (1949) “Law of Meaning” Word frequency rank #meanings Slope in rank plot a=.466 Slope in distribution plot  = 3.15 Adamic (2000):  =1+1/a

Link structure of semantic networks: Small-world & scale free What produces such link structures? Semantic growth Relation to age-of-acquisition effects Behavioral effects of link structure Overview

H.A. Simon (1955). Power laws in distributions: –Scientists by number of papers published –Cities by population –Income by size -> “rich get richer” growth-like stochastic process Barabasi et al. (1999). Power laws in WWW –in-degree & out-degree -> growth processes

Proposal: Power-law degree distributions in semantic networks are signature of semantic growth within individual; lexical development across speakers; language evolution Disclaimer: We will not describe in detail any specific psychological mechanism

Growing Network Model Representation: Nodes represent words or concepts Edges represent semantic relations or associations Variables: k i = degree of node i u i = utility of node i based on word frequency:

Start with small fully connected network with M nodes A new node is inserted: 1)Choose a local neighborhood i (a neighborhood i of a node is formed by node i and its neighbors) 2)Make M connections into neighborhood repeat n times until network is large enough

new node Preferentially choose large neighborhoods: 1 new node Preferentially make M connections to nodes with high utility:

Word Association n Path LengthL (.04) ClusteringC (.007) coefficient Power-Law  coefficient Growing Network Model Barabasi & Albert (1999) Model

Power-laws in non-growing semantic representations?

LSA: Latent Semantic Analysis e.g., Landauer & Dumais (1997) Analyzed co-occurrence statistics in a large corpus Placed 60,000+ words in 300-dimensional space Good semantic neighbors volcano Hawaii ache relax soothe lava Convert LSA space to graph by variable thresholding on similarity measure

Tversky & Hutchinson (1986) Low dimensional geometric models are not suitable for representing conceptual similarity relations; upper bound on the number of points that can share the nearest neighbor

Ferrer & Solé (submitted): Connect two words if they co-occur within a small contextual window Slide window over large corpus No good semantic neighborhoods volcano -> was -> head -> ache (word association: volcano->hawaii->relax->soothe->ache) or tick -> tock -> made -> wonderful -> universe (word association: tick -> dog -> master -> universe)

Link structure of semantic networks: Small-world & scale free What produces such link structures? Semantic growth Relation to age-of-acquisition effects Behavioral effects of link structure Overview

Age of acquisition (AoA) effects Naming and lexical decision tasks Carroll & White (1973); Brysbaert et al. (2000) Locus of AoA effects? Brown & Watson (1987); Lambon Ralph et al. (1998) AoA is really cumulative frequency effect? Lewis, Gerhand & Ellis (1999) Need framework to understand AoA effects.

t=1…15 t=16…50 t= Prediction of model: early acquired nodes have more connections. Do words acquired early in life have more connections?

Language Evolution Words acquired early in English language are words with high degree (work in progress)

Link structure of semantic networks: Small-world & scale free What produces such link structures? Semantic growth Relation to age-of-acquisition effects Behavioral effects of link structure Overview

Behavioral effects of structural variables centrality Degree-centrality Authority (Eigenvector-centrality) Proposal: In cognitive system, search is biased toward facts, concepts or words with high centrality Naming and lexical decision latencies

Semantic Dementia Hodges & Patterson (1995)

Conclusion Link structure of semantic networks: a)shows non-trivial patterns b)shows signature of growth processes “rich get richer” respecting local neighborhoods c)is relevant for search strategies central words might be searched first. Paper will be available at www-psych.stanford.edu/~msteyver

But… Early acquired words become more central in your model but maybe Words that are more central are acquired earlier

Earliest year of quotation (in OED) vs. k (connectivity)