1 Network Intelligence and Networked Intelligence 网络智能和网络化智能 Deyi Li ( 李 德 毅 ) Aug. 1, 2006.

Slides:



Advertisements
Similar presentations
Six degrees: The science of a connected age By Duncan J. Watts Brian Lewis INF 385Q December 1, 2005 Brian Lewis INF 385Q December 1, 2005.
Advertisements

Topologies of Complex Networks Functions vs. Structures Lun Li Advisor: John C. Doyle Co-advisor: Steven H. Low Collaborators: David Alderson (NPS) Walter.
Topology and Dynamics of Complex Networks FRES1010 Complex Adaptive Systems Eileen Kraemer Fall 2005.
Complex Networks Advanced Computer Networks: Part1.
Network analysis Sushmita Roy BMI/CS 576
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
Neural Networks  A neural network is a network of simulated neurons that can be used to recognize instances of patterns. NNs learn by searching through.
Chapter Thirteen Conclusion: Where We Go From Here.
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.
Synopsis of “Emergence of Scaling in Random Networks”* *Albert-Laszlo Barabasi and Reka Albert, Science, Vol 286, 15 October 1999 Presentation for ENGS.
5/16/2015Intelligent Systems and Soft Computing1 Introduction Introduction Hebbian learning Hebbian learning Generalised Hebbian learning algorithm Generalised.
Cascading failures in interdependent networks and financial systems -- Departmental Seminar Xuqing Huang Advisor: Prof. H. Eugene Stanley Collaborators:
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
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.
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.
Identifying Patterns in Road Networks Topographic Data and Maps Henri Lahtinen Arto Majoinen.
Global topological properties of biological networks.
Artificial Neural Networks (ANNs)
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Triangulation of network metaphors The Royal Netherlands Academy of Arts and Sciences Iina Hellsten & Andrea Scharnhorst Networked Research and Digital.
Systematic Analysis of Interactome: A New Trend in Bioinformatics KOCSEA Technical Symposium 2010 Young-Rae Cho, Ph.D. Assistant Professor Department of.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Graph Theory in 50 minutes. This Graph has 6 nodes (also called vertices) and 7 edges (also called links)
Understanding Populations The Human Population From 1900 to 2003, the population tripled in size to reach 6.3 billion people Today, the human population.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
Tennessee Technological University1 The Scientific Importance of Big Data Xia Li Tennessee Technological University.
Complex network geometry and navigation Dmitri Krioukov CAIDA/UCSD F. Papadopoulos, M. Kitsak, kc claffy, A. Vahdat M. Á. Serrano, M. Boguñá UCSD, December.
Chapter 9 Neural Network.
SOFTWARE DESIGN.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Artificial Neural Networks. The Brain How do brains work? How do human brains differ from that of other animals? Can we base models of artificial intelligence.
FRE 2672 TFG Self-Organization - 01/07/2004 Engineering Self-Organization in MAS Complex adaptive systems using situated MAS Salima Hassas LIRIS-CNRS Lyon.
Topology and Evolution of the Open Source Software Community Advisors: Dr. Vincent W. Freeh Dr. Kevin Bowyer Supported in part by the National Science.
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
CROSS-CUTTING CONCEPTS IN SCIENCE Concepts that unify the study of science through their common application across the scientific fields They enhance core.
I Robot.
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
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.
Network Community Behavior to Infer Human Activities.
National Research Council Of the National Academies
Clusters Recognition from Large Small World Graph Igor Kanovsky, Lilach Prego Emek Yezreel College, Israel University of Haifa, Israel.
An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.
Self-organizing algorithms Márk Jelasity. Decide Object control measure control loop Centralized Mindset: Control Loop ● problem solving, knowledge (GOFAI)
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.
Structures of Networks
Preparing for the Cognitive Generation of Decision Support
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
A Network Model of Knowledge Acquisition
Assessing Hierarchical Modularity in Protein Interaction Networks
Project Oxygen… Shashwat Shriparv
Department of Computer Science University of York
Topology and Dynamics of Complex Networks
Lecture 9: Network models CS 765: Complex Networks
Introducing complex networks into quantum regime
Chapter 1-4: Scientific Models & Knowledge
Presentation transcript:

1 Network Intelligence and Networked Intelligence 网络智能和网络化智能 Deyi Li ( 李 德 毅 ) Aug. 1, 2006

2 Challenge to AI for Knowledge Representation

3 Study on Knowledge Representation one-dimensional representation: one-dimensional representation: predicate calculus, natural language understanding, etc. predicate calculus, natural language understanding, etc. two-dimensional representation: two-dimensional representation: pattern recognition, neural network learning, etc. pattern recognition, neural network learning, etc. attention on evolutional networks with uncertainty was less paid unfortunately. attention on evolutional networks with uncertainty was less paid unfortunately.

4 Networks are present everywhere. All we need is an eye for them.

5 We are witnessing a revolution in the making as scientists from all different disciplines discover that complexity has a strict architecture. We have come to grasp the important knowledge of networks. We are witnessing a revolution in the making as scientists from all different disciplines discover that complexity has a strict architecture. We have come to grasp the important knowledge of networks.

6 Networks interact with one another and are recursive. Networks interact with one another and are recursive. Getting such a diverse group to agree on a common core of knowledge representation about networks is a significant challenge to both Cognitive Science and Artificial Intelligence. Getting such a diverse group to agree on a common core of knowledge representation about networks is a significant challenge to both Cognitive Science and Artificial Intelligence.

7 Networks Evolution and Growth drive the fundamental issue that forms our view of network representation and network intelligence. Networks Evolution and Growth drive the fundamental issue that forms our view of network representation and network intelligence.

8 Paul.Erdos Albert Barabasi Reka Albert Steven Strogatz Alfred Renyi Duncan Watts ER pure random graph(1960) WS small world model (1998) BA scale-free model(1999)

9 “Small worlds” and “power law distributions” are generic properties of networks in general. “Small worlds” and “power law distributions” are generic properties of networks in general. There is a new knowledge representation out there that is the network representation. There is a new knowledge representation out there that is the network representation.

10 It’s the fact that all of these real world networks can be explained and understood using the same concepts, and the same mathematics, that makes network representation so important in AI research in the information age. It’s the fact that all of these real world networks can be explained and understood using the same concepts, and the same mathematics, that makes network representation so important in AI research in the information age.

11 Mining Typical Topologies from Real Complex Networks

12 typical topologies with randomness

13 An evolutional and growth network may be by and large characterized by an ideal typical model

14 Expectation of topologies at different scales: Small world network Small world network Scale free network Scale free network Hub Network Hub Network Star Network Star Network Mining Typical Topology from Real World Networks at Multi-scale

15 Extend more properties of networks the mass of a node the mass of a node physical distance between two nodes physical distance between two nodes the age of a node the age of a node betweenness of a link betweenness of a link betweenness of a node betweenness of a node

16 With the extended properties of networks, we may map relational data into networked representation and propose a new direction that is networked data mining. With the extended properties of networks, we may map relational data into networked representation and propose a new direction that is networked data mining.

17 A detailed networked data

18 Mining typical topology with a middle granularity

19 Mining typical topology with a large granularity

20 Discover critical links and important communities from a real network

21 Many networks are inhomogeneous, consisting lot of an undifferentiated mass of nodes, but of distinct groups.

22 Mining communities Classification: The typical problem in networked data mining is that of dividing all the nodes of a network into some number of groups, while minimizing the number of links that run between nodes in different groups. Classification: The typical problem in networked data mining is that of dividing all the nodes of a network into some number of groups, while minimizing the number of links that run between nodes in different groups. Clustering: Given a network structure, try to divide into communities in such a way that every node belongs only to one of the communities. Clustering: Given a network structure, try to divide into communities in such a way that every node belongs only to one of the communities.

23  Community model can capture the hierarchical feature of a Network.

24 A link removal method A link removal method based on link betweenness Input : Initial network topology , the number of community Output : network communities Step 1. Calculate the betweenness for all links in the network. Step 2. Remove the link with the highest betweenness. Step 3.Re-calculate betweennesses for all links affected by the removal. Step 4.Repeat from step 2 until generating specified numbers of communities.

25 Mining Communities

26 Mining clusters in a complex network using data field method and finding virtual kernels Given a traffic network, find virtual traffic centers Given a traffic network, find virtual traffic centers

27 Node mass may represent its degree from data field point of view

28 Node mass may also represent its betweenness from data field point of view

29 Emergence Computation

30 A subtle urge to synchronize is pervasive in nature indeed synchronized clapping synchronized clapping fireflies flashing fireflies flashing menstrual cycles of women menstrual cycles of women adaptive path minimization by ants adaptive path minimization by ants wasp and termite nest building wasp and termite nest building army ant raiding army ant raiding fish schooling and bird flocking fish schooling and bird flocking pattern formation in animal coats pattern formation in animal coats coordinated cooperation in slime molds coordinated cooperation in slime molds

31 Nature Vol. 403, 24 Feb.2000

32 The emergence of synchronized clapping is a delightful expression of self-organization on a human scale The emergence of synchronized clapping is a delightful expression of self-organization on a human scale

33 emergence mechanism For everybody in the audience there are 3 measurements: For everybody in the audience there are 3 measurements: 1.time difference at the beginning of the applause (TDB) 2.interval time of a clap to the next one (IT, represented by △ t) 3.the clapping strength (CS)

34 If there is no any interaction among audience, the distributions of everybody’s TDB, IT and CS, even the number of clap times all follow a kind of poisson curve like. If there is no any interaction among audience, the distributions of everybody’s TDB, IT and CS, even the number of clap times all follow a kind of poisson curve like. If there are interactions among audience, the influence to each other depends on the distance (say r ij ) between them. If there are interactions among audience, the influence to each other depends on the distance (say r ij ) between them.

35 Assume: all the clap strengths are the same. all the clap strengths are the same. “following the many” is fundamental mechanism and pervasive applicable. “following the many” is fundamental mechanism and pervasive applicable. Therefore the relationship of persons in the audience, that is the structure of the network, encoding how people influence each other is set up in formula 1 Therefore the relationship of persons in the audience, that is the structure of the network, encoding how people influence each other is set up in formula 1

36 somebody’s just-happened clap moment is t i and the next IT (say △ t i ’) is based on his current IT (say △ t i ) and influenced by the distanced person who’s just-happened clap is measured by △ t j and clapped moment t j somebody’s just-happened clap moment is t i and the next IT (say △ t i ’) is based on his current IT (say △ t i ) and influenced by the distanced person who’s just-happened clap is measured by △ t j and clapped moment t j σ represents distance influence factor σ represents distance influence factor c 1 and c 2 are coupling factors c 1 and c 2 are coupling factors

37 The formula shows the fact that there is no an invisible control to all the audience, every body affects others and affected by others equally.

38 Single Clapping Single clappingSingle continuous clapping

39 general applause in a theatre

40 all the palms in the theatre came together after a long time applause

41 The ‘up here down there’ applause in the square

42 An experimental platform of emergence computation Visualization of courtesy applause and synchronized applause

43 It is difficult to distinguish the virtual general applause from the real one. It is also difficult to distinguish the virtual synchronous applause from the real one.

44 Network is the key to representing the complex world around us. Small changes in the topology, affecting only a few of the nodes, can open up hidden doors, allowing new possibilities to emerge.

45 Sum up Challenge to AI for Knowledge Representation Challenge to AI for Knowledge Representation Mining Typical Topologies from Real Complex Networks Mining Typical Topologies from Real Complex Networks Discover Critical Links and Important Communities from a Real Network Discover Critical Links and Important Communities from a Real Network Emergence Computation Emergence Computation

46 To be studied in the future: 1.better measurements of network structure in network representation 2.better understanding of the relationship between the architecture of a network and its function 3. better modeling of very large networks 4.mining common concepts of a network across different scales 5.robustness and security of networks 6.networked data mining 7.virtual reality of emergence.

47 Thanks 李 德 毅李 德 毅李 德 毅李 德 毅