A Network Model of Knowledge Acquisition

Slides:



Advertisements
Similar presentations
How People Learn: Brain, Mind, Experience and School John D. Bransford, Ann L. Brown, and Rodney R. Cocking, editors.
Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Topology and Dynamics of Complex Networks FRES1010 Complex Adaptive Systems Eileen Kraemer Fall 2005.
Complex Networks Advanced Computer Networks: Part1.
‘Small World’ Networks (An Introduction) Presenter : Vishal Asthana
CS8803-NS Network Science Fall 2013
Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
School of Information University of Michigan Network resilience Lecture 20.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
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.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Error and Attack Tolerance of Complex Networks Albert, Jeong, Barabási (presented by Walfredo)
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 –
Network Formation Can we model it? Oh yeahhhhhhh!
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.
Crosscutting Concepts and Disciplinary Core Ideas February24, 2012 Heidi Schweingruber Deputy Director, Board on Science Education, NRC/NAS.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Illinois MSP Program Goals  To increase the content expertise of mathematics and science teachers; 4 To increase teaching skills through access to the.
“Adversarial Deletion in Scale Free Random Graph Process” by A.D. Flaxman et al. Hammad Iqbal CS April 2006.
Topology and Evolution of the Open Source Software Community Advisors: Dr. Vincent W. Freeh Dr. Kevin Bowyer Supported in part by the National Science.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.
How People Learn – Brain, Mind, Experience, and School (Bransford, Brown, & Cocking, 1999) Three core principles 1: If their (students) initial understanding.
Complex Network Theory – An Introduction Niloy Ganguly.
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.
Complex Network Theory – An Introduction Niloy Ganguly.
LECTURE 2 1.Complex Network Models 2.Properties of Protein-Protein Interaction Networks.
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Teachers Teaching With Technology 2010 Annual Meeting - Atlanta, GA Ray Barton, Olympus High, SLC, UT.
Information Retrieval Search Engine Technology (10) Prof. Dragomir R. Radev.
Class 4: It’s a Small World After All Network Science: Small World February 2012 Dr. Baruch Barzel.
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Topics In Social Computing (67810) Module 1 Introduction & The Structure of Social Networks.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Scale-free and Hierarchical Structures in Complex Networks L. Barabasi, Z. Dezso, E. Ravasz, S.H. Yook and Z. Oltvai Presented by Arzucan Özgür.
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
Board on Science Education Draft released 15 July 2011
Lecture 23: Structure of Networks
L – Modeling and Simulating Social Systems with MATLAB
Structures of Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Using Cognitive Science To Inform Instructional Design
Topics In Social Computing (67810)
Models of networks (synthetic networks or generative models): Random, Small-world, Scale-free, Configuration model and Random geometric model By: Ralucca.
Lecture 23: Structure of Networks
Models of networks (synthetic networks or generative models): Erdős-Rényi Random model, Watts-Strogatz Small-world, Barabási-Albert Preferential attachment,
Models of Network Formation
Models of Network Formation
Peer-to-Peer and Social Networks Fall 2017
Building a Conceptual Flow
Models of Network Formation
Department of Computer Science University of York
Models of Network Formation
Topology and Dynamics of Complex Networks
Peer-to-Peer and Social Networks
From the Synthetic networks slide deck (didn’t have a chance to go over them at that time) By: Ralucca Gera, NPS.
Lecture 23: Structure of Networks
Selecting & Developing Cases and Clinical Problems
Lecture 9: Network models CS 765: Complex Networks
Models of networks (synthetic networks or generative models)
Network Science: A Short Introduction i3 Workshop
Advanced Topics in Data Mining Special focus: Social Networks
From Connections to Function: The Mouse Brain Connectome Atlas
Presentation transcript:

A Network Model of Knowledge Acquisition Idea 1: a learner must thoughtfully develop a conceptual framework for their new knowledge. Idea 2: recent research in network science leads to an understanding of the structure and dynamics of networks. Networks for diverse systems share a set of common characteristics. If one assumes that acquired knowledge forms a network, then it should share these common characteristics 13th International Conference on Thinking

A key finding of “How People Learn” To develop competence in an area students must: have a deep foundation of factual knowledge, b) understand facts and ideas in a context of a conceptual framework and c) organize their knowledge in ways that facilitate retrieval and application.” 13th International Conference on Thinking

Transformation of students Adaptive Expertise “Flexible Thinking” The most powerful learning occurs when we move away from inert knowledge and towards flexible thinking. Mental Structure (Context And Organization) Routine Expertise “Inert Knowledge” Novice Expert Knowledge Adapted from John Bransford and the “Center for Learning in Formal and Informal Environments”. 13th International Conference on Thinking

13th International Conference on Thinking

Characteristics of networks What do you measure when you study a network? Average length (on connected components) Cluster coefficient Degree distribution Number of Links (k) Number of Nodes (with k Links) 13th International Conference on Thinking

Three important steps in the development of network science 1950’s Paul Erdös and Alfréd Rényi Random Network 1990’s Duncan Watts and Steve Strogatz Small World Systems 2000’s Albert-László Barabási, Reka Albert and Hawoong Jeong Scale-free Networks 13th International Conference on Thinking

13th International Conference on Thinking Random network Nodes are linked together at random. This figure has 300 nodes initially distributed around a circle and then connected in pairs at random This figure was generated using software developed by Uri Wilensky of Northwestern University and is incorporated in NetLogo: http://ccl.northwestern.edu/netlogo/models/. 13th International Conference on Thinking

13th International Conference on Thinking Small world network (a) (b) From D. J. Watts and S.H. Strogatz, “Collective dynamics of ‘small world’ networks”, Nature, Vol. 393, No. 4, pp 440-442 (1998). 13th International Conference on Thinking

13th International Conference on Thinking Scale-free network Network is formed by introducing new nodes connected with “preferential Attachment” This figure was generated using software developed by Uri Wilensky of Northwestern University and is incorporated in NetLogo: http://ccl.northwestern.edu/netlogo/models/. 13th International Conference on Thinking

Degree distribution Many nodes have this number of links Number of Links (k) Poisson Distribution Number of Nodes (with k Links) A few nodes have the min A few nodes have the max 13th International Conference on Thinking

Scale-free degree distribution A large number of nodes with few links Number of Links (k) Pareto Distribution Number of Nodes (with k Links) A small number of nodes with many links the hubs 13th International Conference on Thinking

13th International Conference on Thinking Some networks studies Network Size Average Length Cluster Coef. Scale Free Movie Actors 225,226 3.65 0.79 2.3 Math. Co – authorship 70,975 9.5 0.59 2.5 WWW 3325,729 11.2 0.11 2.26 Silkwood Park Food Web 154 3.4 0.15 1.13 C. Elegans 282 2.65 0.28 – Words: Synonyms 22,311 4.5 0.7 2.8 Power Grid 4,947 0.08 13th International Conference on Thinking

Network of acquired knowledge Knowledge Network – each “bit” of knowledge can be considered a node – bits are linked together in a network. – individual (like fingerprints) How does it develop? 13th International Conference on Thinking

13th International Conference on Thinking Novice learning Each bit of new knowledge is indistinguishable from others Joined at random to already existing bits Degree distribution is Poisson Distribution so there is a maximum number of links per node. 13th International Conference on Thinking

13th International Conference on Thinking Middle learning Some order begins to emerge but randomness remains Degree distribution is nearly a Poisson Distribution so there is a maximum number of links per node. 13th International Conference on Thinking

13th International Conference on Thinking Expert learning Hubs begin to appear as centers of organization Degree distribution is a Pareto Distribution so there is no limit to the number of links per node. 13th International Conference on Thinking

Evolution of knowledge organization Novice Learning stages flooding of independent and indistinguishable facts, linked at random network is featureless with no organization, Poisson degree distribution implies limits to number of links for any node Middle Learning stages as relationships among facts are observed information begins to cluster randomness is replaced with order, leading to a small world structure Expert Learning Stages thoughtful organization creates hubs and a scale free network Pareto distribution implies no limit to facts linked to a hub this is the transition advocated in “How People Learn” 13th International Conference on Thinking

Development of a knowledge network Middle Learning Novice Learning Expert Learning Small World Network Scale Free Network Random Network Structureless Clusters Hubs Bounded range Bounded Range Unbounded Range 13th International Conference on Thinking

How this influences learning ... Learners now – have a model of how the organization of knowledge evolves can assess their level of organization of knowledge can guide the improvement of their organization of concepts can discuss conceptual structures with others 13th International Conference on Thinking

13th International Conference on Thinking Understand the importance of learning for transfer the organization of acquired knowledge is a complex network which crosses disciplines Understand the importance of assessing learners prior knowledge new learning is linked to what is known 13th International Conference on Thinking