SlideShare a Scribd company logo
Summer School
“Achievements and Applications of Contemporary Informatics,
         Mathematics and Physics” (AACIMP 2011)
              August 8-20, 2011, Kiev, Ukraine




            Graph Based Clustering

                                 Erik Kropat

                     University of the Bundeswehr Munich
                      Institute for Theoretical Computer Science,
                        Mathematics and Operations Research
                                Neubiberg, Germany
Real World Networks

• Biological Networks
  −   Gene regulatory networks
  −   Metabolic networks
  −   Neural networks
  −   Food webs
                                               food web



                                 • Technological Networks
                                   − Telecommunication networks
                                   − Internet
                                   − Power grids

             power grid
Real World Networks

• Social Networks
    −    Communication networks
    −    Organizational networks
    −    Social media
    −    Online communities
                                                                                                    social networks



                                                                              • Economic Networks
                                                                                   − Financial market networks
                                                                                   − Trade networks
                                                                                   − Collaboration networks

               economic networks


Source: Frank Schweitzer et al., “Economic Networks: The New Challenges,” Science 325, no. 5939 (July 24, 2009): 422-425.
Graph-Theory

• Graph theory can provide more detailed information
  about the inner structure of the data set in terms of
    −   cliques          (subsets of nodes where each pair of elements is connected)
    −   clusters         (highly connected groups of nodes)
    −   centrality       (important nodes, hubs)
    −   outliers . . .   (unimportant nodes)

• Applications
    − social network analysis
    − diffusion of information
    − spreading of diseases or rumours

⇒    marketing campaigns, viral marketing, social network advertising
Graph-Based Clustering

• Collection of a wide range of very popular clustering algorithms
  that are based on graph-theory.
• Organize information in large datasets to facilitate users
  for faster access to required information.
Idea

• Objects are represented as nodes in a complete or connected graph.
• Assign a weight to each branch between the two nodes x and y.
  The weight is defined by the distance d(x,y) between the nodes.


Clustering
                                 Distance between
                                      clusters
                                                            Distance between
                                                                 objects
Idea




                               graph




       minimal spanning tree           clusters
Graph Based Clustering

Hierarchical method
(1) Determine a minimal spanning tree (MST)
(2) Delete branches iteratively
    New connected components = Cluster




                                                  4

                                                      6       5


                                              1           8


                                                      3
Minimal Spanning Trees
Minimal Spanning Tree

A minimal spanning tree of a connected graph G = (V,E)
is a connected subgraph with minimal weight
that contains all nodes of G and has no cycles.

                       c                                     c

             4                                      4
                 6           5                          6        5
    b                                    b

     1                8                   1                 8

    a            3               d       a              3             d

          graph G = (V, E)                    minimal spanning tree
Minimal spanning trees can be calculated with...

(1) Prim’s algorithm.
(2) Kruskal’s algorithm.

                                                               c

                                                       4

                                                           6       5
                                                   b

                                                   1           8

                                                   a       3           d
Example – Prims’s Algorithm

Set VT = {a}, ET = { }           Choose an edge (x,y) with minimal weight
                                 such that x ∈ VT and y ∉ VT.
                                 VT = {a,b} and ET = { (a,b) }.


                     c                                     c

           4                                      4

               6         5                            6           5
 b                                       b

 1                  8                    1                8


 a             3             d           a            3               d
Example– Prims’s Algorithm

Choose an edge (x,y) with minimal weight   Choose an edge (x,y) with minimal weight
such that x ∈ VT and y ∉ VT.               such that x ∈ VT and y ∉ VT.
VT = {a,b,d} and ET = { (a,b), (a,d) }.    VT = {a,b,c,d} and ET = { (a,b), (a,d),(b,c) }.


                           c                                             c

                  4                                            4

                      6        5                                   6         5
        b                                             b

        1                 8                           1                 8

    c                                             c
        a             3             d                 a            3              d
Prim’s Algorithm


 INPUT:       Weighted graph G = (V, E), undirected + connected
 OUTPUT:      Minimal spanning tree T = (VT, ET)

 (1) Set VT = {v}, ET = { }, where v is an arbitrary node from V (starting point).
 (2) REPEAT
 (3)   Choose an edge (a,b) with minimal weight, such that a ∈ VT and b ∉ VT.
 (4)   Set VT = VT ∪ {b} and ET = ET ∪ { (a,b) }.
 (5) UNTIL VT = V
Kruskal’s Algorithm


 INPUT:        Weighted graph G = (V, E), undirected + connected
 OUTPUT:       Minimal spanning tree T = (VT, ET)

 (1) Set VT = V, ET = { }, H = E.
 (2) Initialize a queue to contain all edges in G, using the weights in ascending
     order as keys.
 (3) WHILE H ≠ { }
 (4)       Choose an edge e ∈ H with minimal weight.
 (5)       Set H = H  {e}.
 (6)       If (VT, ET ∪ {e}) has no cycles, then ET = ET ∪ {e} .
 (7) END
Branch Deletion
Delete Branches - Different Strategies

(1) Delete the branch with maximum weight.
(2) Delete inconsistent branches.
(3) Delete by analysis of weights.
(1) Delete the branch with maximum weight

• In each step, create two new clusters
  by deleting the branch with maximum weight.
• Repeat until the given number of clusters is reached.

                                               2
                                           2           2

                                                   4




                           2                3

                                  6
                           2
Example: Delete the branch with maximum weight

                                                    2
                                               2            2


                                                        4




                        2                       3
                                                            Minimum spanning tree
                                6
                        2



Ordered weights of branches:   6, 4, 3, 2, 2, 2, 2, 2.
Example: Delete the branch with maximum weight

                                                    2
                                               2            2


                                                        4




                         2                      3

                                   6
                         2



Ordered weights of branches:   6, 4, 3, 2, 2, 2, 2, 2.
Step 1: Delete branch (weight 6)       ⇒   2 clusters
Example: Delete the branch with maximum weight

                                                    2
                                               2            2


                                                        4




                         2                      3

                                   6
                         2




Ordered weights of branches:   6, 4, 3, 2, 2, 2, 2, 2.
Step 1: Delete branch (weight 6)       ⇒   2 clusters
Step 2: Delete branch (weight 4)       ⇒   3 clusters
(2) Delete inconsistent branches

• A branch e is inconsistent, if the corresponding weight de
                                           _
  is (much) larger than a reference value de .
                       _
• The reference value de can be defined by the average weight
  of all branches adjacent to e.

                                                  _
                                                          3+2+1
                                                  de   = _________ = 2
                                                             3
                  1
                          e            3

                          6                                     _
                  2
                                                  d e = 6 > 2 = de
                                                  ⇒ e inconsistent
(3) Delete by analysis of weights
• Perform an “analysis” of all weights of branches in the MST.
  Determine a threshold S.
• The threshold can be estimated by
  histograms on the weights of branches (= length of branches).
• Delete a branches, if the corresponding weight higher than the threshold S.
                   Number




                                                 Number




                                  S

                             weight of branch             weight of branch
                            (length of branch)
Exercise                                  d

                               3                      20

                                              5
                        e                                  c
                               9                  8


                         1                                 4
                               15     g           6

                                          12
                         f                                 b

                               10                     2


                                       a

Find a minimal spanning tree and provide a clustering of the graph
by deleting all inconsistent branches.
Example

Set VT = {a}, ET = { }   Choose an edge (x,y) with minimal weight
                         such that x ∈ VT and y ∉ VT.
Example

Choose an edge (x,y) with minimal weight   Choose an edge (x,y) with minimal weight
such that x ∈ VT and y ∉ VT.               such that x ∈ VT and y ∉ VT.
Example

Choose an edge (x,y) with minimal weight   Choose an edge (x,y) with minimal weight
such that x ∈ VT and y ∉ VT.               such that x ∈ VT and y ∉ VT.
Example
          Choose an edge (x,y) with minimal weight
          such that x ∈ VT and y ∉ VT.




                    minimal spanning tree
Example
          For each branch calculate the reference value
              (average weight of adjacent branches)
                                    d

                        3
                        (3)   (4.5) 5
               e                                        c


                1 (3)                               (4) 4
                                g          6
                                        (3.6)
                f                                       b
                                         (5)
                                                2


                                  a
Example
                Delete inconsistent branches
          (weight is larger than the reference value)
                               d
                                         2 clusters
                       3
                       (3)
              e                              c


               1 (3)                     (4) 4
                               g

              f                              b
                             Noise?


                               a
Summary
Summary

• In graph based clustering objects are represented as nodes
  in a complete or connected graph.
• The distance between two objects is given by the weight
  of the corresponding branch.
• Hierarchical method
     (1) Determine a minimal spanning tree (MST)
     (2) Delete branches iteratively
• Visualization of information in large datasets.
Literature

• V. Kumar, M. Steinbach, P.-N. Tan
  Introduction to Data Mining.
  Addison Wesley, 2005.

Other work mentioned in the presentation
• J.A. Dunne, R.J. Williams, N.D. Martinez, R.A. Wood, D.H. Erwin
  Compilation and Network Analyses of Cambrian Food Webs.
  PLoS Biol 6(4): e102. doi:10.1371/journal.pbio.0060102

• F. Schweitzer, G. Fagiolo, D. Sornette, F. Vega-Redondo,
  A. Vespignani, D.R. White
  Economic Networks: The New Challenges.
  Science 325, no. 5939 (July 24, 2009): 422-425.
Thank you very much!
Ad

More Related Content

What's hot (20)

DBSCAN : A Clustering Algorithm
DBSCAN : A Clustering AlgorithmDBSCAN : A Clustering Algorithm
DBSCAN : A Clustering Algorithm
Pınar Yahşi
 
Machine Learning with Decision trees
Machine Learning with Decision treesMachine Learning with Decision trees
Machine Learning with Decision trees
Knoldus Inc.
 
Graph coloring using backtracking
Graph coloring using backtrackingGraph coloring using backtracking
Graph coloring using backtracking
shashidharPapishetty
 
3.2 partitioning methods
3.2 partitioning methods3.2 partitioning methods
3.2 partitioning methods
Krish_ver2
 
Support vector machine
Support vector machineSupport vector machine
Support vector machine
zekeLabs Technologies
 
Birch Algorithm With Solved Example
Birch Algorithm With Solved ExampleBirch Algorithm With Solved Example
Birch Algorithm With Solved Example
kailash shaw
 
K mean-clustering algorithm
K mean-clustering algorithmK mean-clustering algorithm
K mean-clustering algorithm
parry prabhu
 
Support Vector Machines ( SVM )
Support Vector Machines ( SVM ) Support Vector Machines ( SVM )
Support Vector Machines ( SVM )
Mohammad Junaid Khan
 
Fuzzy arithmetic
Fuzzy arithmeticFuzzy arithmetic
Fuzzy arithmetic
Mohit Chimankar
 
Decision Tree Learning
Decision Tree LearningDecision Tree Learning
Decision Tree Learning
Milind Gokhale
 
Asymptotic Notation and Data Structures
Asymptotic Notation and Data StructuresAsymptotic Notation and Data Structures
Asymptotic Notation and Data Structures
Amrinder Arora
 
Spanning trees
Spanning treesSpanning trees
Spanning trees
Shareb Ismaeel
 
Ensemble learning
Ensemble learningEnsemble learning
Ensemble learning
Haris Jamil
 
Linear regression
Linear regressionLinear regression
Linear regression
MartinHogg9
 
K means clustering
K means clusteringK means clustering
K means clustering
keshav goyal
 
Probabilistic Reasoning
Probabilistic ReasoningProbabilistic Reasoning
Probabilistic Reasoning
Junya Tanaka
 
Bayesian Networks - A Brief Introduction
Bayesian Networks - A Brief IntroductionBayesian Networks - A Brief Introduction
Bayesian Networks - A Brief Introduction
Adnan Masood
 
Recurrent Neural Network (RNN) | RNN LSTM Tutorial | Deep Learning Course | S...
Recurrent Neural Network (RNN) | RNN LSTM Tutorial | Deep Learning Course | S...Recurrent Neural Network (RNN) | RNN LSTM Tutorial | Deep Learning Course | S...
Recurrent Neural Network (RNN) | RNN LSTM Tutorial | Deep Learning Course | S...
Simplilearn
 
Divide and Conquer - Part 1
Divide and Conquer - Part 1Divide and Conquer - Part 1
Divide and Conquer - Part 1
Amrinder Arora
 
Dbscan algorithom
Dbscan algorithomDbscan algorithom
Dbscan algorithom
Mahbubur Rahman Shimul
 
DBSCAN : A Clustering Algorithm
DBSCAN : A Clustering AlgorithmDBSCAN : A Clustering Algorithm
DBSCAN : A Clustering Algorithm
Pınar Yahşi
 
Machine Learning with Decision trees
Machine Learning with Decision treesMachine Learning with Decision trees
Machine Learning with Decision trees
Knoldus Inc.
 
Graph coloring using backtracking
Graph coloring using backtrackingGraph coloring using backtracking
Graph coloring using backtracking
shashidharPapishetty
 
3.2 partitioning methods
3.2 partitioning methods3.2 partitioning methods
3.2 partitioning methods
Krish_ver2
 
Birch Algorithm With Solved Example
Birch Algorithm With Solved ExampleBirch Algorithm With Solved Example
Birch Algorithm With Solved Example
kailash shaw
 
K mean-clustering algorithm
K mean-clustering algorithmK mean-clustering algorithm
K mean-clustering algorithm
parry prabhu
 
Support Vector Machines ( SVM )
Support Vector Machines ( SVM ) Support Vector Machines ( SVM )
Support Vector Machines ( SVM )
Mohammad Junaid Khan
 
Decision Tree Learning
Decision Tree LearningDecision Tree Learning
Decision Tree Learning
Milind Gokhale
 
Asymptotic Notation and Data Structures
Asymptotic Notation and Data StructuresAsymptotic Notation and Data Structures
Asymptotic Notation and Data Structures
Amrinder Arora
 
Ensemble learning
Ensemble learningEnsemble learning
Ensemble learning
Haris Jamil
 
Linear regression
Linear regressionLinear regression
Linear regression
MartinHogg9
 
K means clustering
K means clusteringK means clustering
K means clustering
keshav goyal
 
Probabilistic Reasoning
Probabilistic ReasoningProbabilistic Reasoning
Probabilistic Reasoning
Junya Tanaka
 
Bayesian Networks - A Brief Introduction
Bayesian Networks - A Brief IntroductionBayesian Networks - A Brief Introduction
Bayesian Networks - A Brief Introduction
Adnan Masood
 
Recurrent Neural Network (RNN) | RNN LSTM Tutorial | Deep Learning Course | S...
Recurrent Neural Network (RNN) | RNN LSTM Tutorial | Deep Learning Course | S...Recurrent Neural Network (RNN) | RNN LSTM Tutorial | Deep Learning Course | S...
Recurrent Neural Network (RNN) | RNN LSTM Tutorial | Deep Learning Course | S...
Simplilearn
 
Divide and Conquer - Part 1
Divide and Conquer - Part 1Divide and Conquer - Part 1
Divide and Conquer - Part 1
Amrinder Arora
 

Viewers also liked (20)

Graph Clustering and cluster
Graph Clustering and clusterGraph Clustering and cluster
Graph Clustering and cluster
Adil Mehmoood
 
Graph Based Machine Learning with Applications to Media Analytics
Graph Based Machine Learning with Applications to Media AnalyticsGraph Based Machine Learning with Applications to Media Analytics
Graph Based Machine Learning with Applications to Media Analytics
NYC Predictive Analytics
 
Capturing the Mirage: Machine Learning in Media and Entertainment Industries
Capturing the Mirage: Machine Learning in Media and Entertainment IndustriesCapturing the Mirage: Machine Learning in Media and Entertainment Industries
Capturing the Mirage: Machine Learning in Media and Entertainment Industries
Domino Data Lab
 
Semi-supervised concept detection by learning the structure of similarity graphs
Semi-supervised concept detection by learning the structure of similarity graphsSemi-supervised concept detection by learning the structure of similarity graphs
Semi-supervised concept detection by learning the structure of similarity graphs
Symeon Papadopoulos
 
RDFa Tutorial
RDFa TutorialRDFa Tutorial
RDFa Tutorial
Ivan Herman
 
A la croisĂŠe des Graphes
A la croisĂŠe des GraphesA la croisĂŠe des Graphes
A la croisĂŠe des Graphes
Cyril HIJAR
 
Facebook ConfĂŠrence "Ne vous limitez pas Ă  la Fan page et aux Like"
Facebook ConfĂŠrence "Ne vous limitez pas Ă  la Fan page et aux Like"Facebook ConfĂŠrence "Ne vous limitez pas Ă  la Fan page et aux Like"
Facebook ConfĂŠrence "Ne vous limitez pas Ă  la Fan page et aux Like"
Arnaud ROFIDAL
 
A Graph-based Clustering Scheme for Identifying Related Tags in Folksonomies
A Graph-based Clustering Scheme for Identifying Related Tags in FolksonomiesA Graph-based Clustering Scheme for Identifying Related Tags in Folksonomies
A Graph-based Clustering Scheme for Identifying Related Tags in Folksonomies
Symeon Papadopoulos
 
vts_7560_10802
vts_7560_10802vts_7560_10802
vts_7560_10802
Mohamed Farouk
 
Clustering for Beginners
Clustering for BeginnersClustering for Beginners
Clustering for Beginners
Sayeed Mahmud
 
Introduction Ă  l'analyse de rĂŠseaux avec R
Introduction Ă  l'analyse de rĂŠseaux avec RIntroduction Ă  l'analyse de rĂŠseaux avec R
Introduction Ă  l'analyse de rĂŠseaux avec R
Laurent Beauguitte
 
Realtime Learning: Using Triggers to Know What the ?$# is Going On
Realtime Learning: Using Triggers to Know What the ?$# is Going OnRealtime Learning: Using Triggers to Know What the ?$# is Going On
Realtime Learning: Using Triggers to Know What the ?$# is Going On
Domino Data Lab
 
Document clustering and classification
Document clustering and classification Document clustering and classification
Document clustering and classification
Mahmoud Alfarra
 
Label propagation - Semisupervised Learning with Applications to NLP
Label propagation - Semisupervised Learning with Applications to NLPLabel propagation - Semisupervised Learning with Applications to NLP
Label propagation - Semisupervised Learning with Applications to NLP
David Przybilla
 
GRAPH COLORING AND ITS APPLICATIONS
GRAPH COLORING AND ITS APPLICATIONSGRAPH COLORING AND ITS APPLICATIONS
GRAPH COLORING AND ITS APPLICATIONS
Manojit Chakraborty
 
2010 Branch Network Optimization Presentation
2010 Branch Network Optimization Presentation2010 Branch Network Optimization Presentation
2010 Branch Network Optimization Presentation
Chris Gill
 
Ch08
Ch08Ch08
Ch08
nathanurag
 
K means Clustering
K means ClusteringK means Clustering
K means Clustering
Edureka!
 
Network Proposal Power Point
Network Proposal Power PointNetwork Proposal Power Point
Network Proposal Power Point
guest7fbe17
 
The Actionable Guide to Doing Better Semantic Keyword Research #BrightonSEO (...
The Actionable Guide to Doing Better Semantic Keyword Research #BrightonSEO (...The Actionable Guide to Doing Better Semantic Keyword Research #BrightonSEO (...
The Actionable Guide to Doing Better Semantic Keyword Research #BrightonSEO (...
Paul Shapiro
 
Graph Clustering and cluster
Graph Clustering and clusterGraph Clustering and cluster
Graph Clustering and cluster
Adil Mehmoood
 
Graph Based Machine Learning with Applications to Media Analytics
Graph Based Machine Learning with Applications to Media AnalyticsGraph Based Machine Learning with Applications to Media Analytics
Graph Based Machine Learning with Applications to Media Analytics
NYC Predictive Analytics
 
Capturing the Mirage: Machine Learning in Media and Entertainment Industries
Capturing the Mirage: Machine Learning in Media and Entertainment IndustriesCapturing the Mirage: Machine Learning in Media and Entertainment Industries
Capturing the Mirage: Machine Learning in Media and Entertainment Industries
Domino Data Lab
 
Semi-supervised concept detection by learning the structure of similarity graphs
Semi-supervised concept detection by learning the structure of similarity graphsSemi-supervised concept detection by learning the structure of similarity graphs
Semi-supervised concept detection by learning the structure of similarity graphs
Symeon Papadopoulos
 
RDFa Tutorial
RDFa TutorialRDFa Tutorial
RDFa Tutorial
Ivan Herman
 
A la croisĂŠe des Graphes
A la croisĂŠe des GraphesA la croisĂŠe des Graphes
A la croisĂŠe des Graphes
Cyril HIJAR
 
Facebook ConfĂŠrence "Ne vous limitez pas Ă  la Fan page et aux Like"
Facebook ConfĂŠrence "Ne vous limitez pas Ă  la Fan page et aux Like"Facebook ConfĂŠrence "Ne vous limitez pas Ă  la Fan page et aux Like"
Facebook ConfĂŠrence "Ne vous limitez pas Ă  la Fan page et aux Like"
Arnaud ROFIDAL
 
A Graph-based Clustering Scheme for Identifying Related Tags in Folksonomies
A Graph-based Clustering Scheme for Identifying Related Tags in FolksonomiesA Graph-based Clustering Scheme for Identifying Related Tags in Folksonomies
A Graph-based Clustering Scheme for Identifying Related Tags in Folksonomies
Symeon Papadopoulos
 
Clustering for Beginners
Clustering for BeginnersClustering for Beginners
Clustering for Beginners
Sayeed Mahmud
 
Introduction Ă  l'analyse de rĂŠseaux avec R
Introduction Ă  l'analyse de rĂŠseaux avec RIntroduction Ă  l'analyse de rĂŠseaux avec R
Introduction Ă  l'analyse de rĂŠseaux avec R
Laurent Beauguitte
 
Realtime Learning: Using Triggers to Know What the ?$# is Going On
Realtime Learning: Using Triggers to Know What the ?$# is Going OnRealtime Learning: Using Triggers to Know What the ?$# is Going On
Realtime Learning: Using Triggers to Know What the ?$# is Going On
Domino Data Lab
 
Document clustering and classification
Document clustering and classification Document clustering and classification
Document clustering and classification
Mahmoud Alfarra
 
Label propagation - Semisupervised Learning with Applications to NLP
Label propagation - Semisupervised Learning with Applications to NLPLabel propagation - Semisupervised Learning with Applications to NLP
Label propagation - Semisupervised Learning with Applications to NLP
David Przybilla
 
GRAPH COLORING AND ITS APPLICATIONS
GRAPH COLORING AND ITS APPLICATIONSGRAPH COLORING AND ITS APPLICATIONS
GRAPH COLORING AND ITS APPLICATIONS
Manojit Chakraborty
 
2010 Branch Network Optimization Presentation
2010 Branch Network Optimization Presentation2010 Branch Network Optimization Presentation
2010 Branch Network Optimization Presentation
Chris Gill
 
K means Clustering
K means ClusteringK means Clustering
K means Clustering
Edureka!
 
Network Proposal Power Point
Network Proposal Power PointNetwork Proposal Power Point
Network Proposal Power Point
guest7fbe17
 
The Actionable Guide to Doing Better Semantic Keyword Research #BrightonSEO (...
The Actionable Guide to Doing Better Semantic Keyword Research #BrightonSEO (...The Actionable Guide to Doing Better Semantic Keyword Research #BrightonSEO (...
The Actionable Guide to Doing Better Semantic Keyword Research #BrightonSEO (...
Paul Shapiro
 
Ad

Similar to Graph Based Clustering (20)

Extracting biclusters of similar values with Triadic Concept Analysis
Extracting biclusters of similar values with Triadic Concept AnalysisExtracting biclusters of similar values with Triadic Concept Analysis
Extracting biclusters of similar values with Triadic Concept Analysis
INSA Lyon - L'Institut National des Sciences AppliquĂŠes de Lyon
 
SISAP17
SISAP17SISAP17
SISAP17
Yasuo Tabei
 
An Efficient Convex Hull Algorithm for a Planer Set of Points
An Efficient Convex Hull Algorithm for a Planer Set of PointsAn Efficient Convex Hull Algorithm for a Planer Set of Points
An Efficient Convex Hull Algorithm for a Planer Set of Points
Kasun Ranga Wijeweera
 
11L_2024_DSCS_EN_Trees2_Prim_Kraskal.pptx
11L_2024_DSCS_EN_Trees2_Prim_Kraskal.pptx11L_2024_DSCS_EN_Trees2_Prim_Kraskal.pptx
11L_2024_DSCS_EN_Trees2_Prim_Kraskal.pptx
RavanGulmetov
 
Strassen's Matrix Multiplication divide and conquere algorithm
Strassen's Matrix Multiplication divide and conquere algorithmStrassen's Matrix Multiplication divide and conquere algorithm
Strassen's Matrix Multiplication divide and conquere algorithm
Ahmad177077
 
MATLABgraphPlotting.pptx
MATLABgraphPlotting.pptxMATLABgraphPlotting.pptx
MATLABgraphPlotting.pptx
PrabhakarSingh646829
 
Hierarchical (2)l ppt for data and analytics
Hierarchical (2)l ppt for data and analyticsHierarchical (2)l ppt for data and analytics
Hierarchical (2)l ppt for data and analytics
DrMADHURI6
 
Neural Networks: Principal Component Analysis (PCA)
Neural Networks: Principal Component Analysis (PCA)Neural Networks: Principal Component Analysis (PCA)
Neural Networks: Principal Component Analysis (PCA)
Mostafa G. M. Mostafa
 
DATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREE
DATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREEDATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREE
DATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREE
nguyenminhhuy2905
 
Steven Duplij, Raimund Vogl, "Polyadic Braid Operators and Higher Braiding Ga...
Steven Duplij, Raimund Vogl, "Polyadic Braid Operators and Higher Braiding Ga...Steven Duplij, Raimund Vogl, "Polyadic Braid Operators and Higher Braiding Ga...
Steven Duplij, Raimund Vogl, "Polyadic Braid Operators and Higher Braiding Ga...
Steven Duplij (Stepan Douplii)
 
Ch07 linearspacealignment
Ch07 linearspacealignmentCh07 linearspacealignment
Ch07 linearspacealignment
BioinformaticsInstitute
 
Introduction to MATLAB
Introduction to MATLABIntroduction to MATLAB
Introduction to MATLAB
Damian T. Gordon
 
M A T H E M A T I C A L M E T H O D S J N T U M O D E L P A P E R{Www
M A T H E M A T I C A L  M E T H O D S  J N T U  M O D E L  P A P E R{WwwM A T H E M A T I C A L  M E T H O D S  J N T U  M O D E L  P A P E R{Www
M A T H E M A T I C A L M E T H O D S J N T U M O D E L P A P E R{Www
guest3f9c6b
 
Eigenvalues and eigenvectors
Eigenvalues and eigenvectorsEigenvalues and eigenvectors
Eigenvalues and eigenvectors
iraq
 
Decision Maths 1 Chapter 3 Algorithms on Graphs (including Floyd A2 content)....
Decision Maths 1 Chapter 3 Algorithms on Graphs (including Floyd A2 content)....Decision Maths 1 Chapter 3 Algorithms on Graphs (including Floyd A2 content)....
Decision Maths 1 Chapter 3 Algorithms on Graphs (including Floyd A2 content)....
SintooChauhan6
 
Q1Perform the two basic operations of multiplication and divisio.docx
Q1Perform the two basic operations of multiplication and divisio.docxQ1Perform the two basic operations of multiplication and divisio.docx
Q1Perform the two basic operations of multiplication and divisio.docx
amrit47
 
Application of Bayesian and Sparse Network Models for Assessing Linkage Diseq...
Application of Bayesian and Sparse Network Models for Assessing Linkage Diseq...Application of Bayesian and Sparse Network Models for Assessing Linkage Diseq...
Application of Bayesian and Sparse Network Models for Assessing Linkage Diseq...
Gota Morota
 
UNIT-5-II IT-DATA VISUALIZATION TECHNIQUES
UNIT-5-II IT-DATA VISUALIZATION TECHNIQUESUNIT-5-II IT-DATA VISUALIZATION TECHNIQUES
UNIT-5-II IT-DATA VISUALIZATION TECHNIQUES
hemalathab24
 
Machine Learning and Stochastic Geometry: Statistical Frameworks Against Unce...
Machine Learning and Stochastic Geometry: Statistical Frameworks Against Unce...Machine Learning and Stochastic Geometry: Statistical Frameworks Against Unce...
Machine Learning and Stochastic Geometry: Statistical Frameworks Against Unce...
Koji Yamamoto
 
Introduction to Big Data Science
Introduction to Big Data ScienceIntroduction to Big Data Science
Introduction to Big Data Science
Albert Bifet
 
An Efficient Convex Hull Algorithm for a Planer Set of Points
An Efficient Convex Hull Algorithm for a Planer Set of PointsAn Efficient Convex Hull Algorithm for a Planer Set of Points
An Efficient Convex Hull Algorithm for a Planer Set of Points
Kasun Ranga Wijeweera
 
11L_2024_DSCS_EN_Trees2_Prim_Kraskal.pptx
11L_2024_DSCS_EN_Trees2_Prim_Kraskal.pptx11L_2024_DSCS_EN_Trees2_Prim_Kraskal.pptx
11L_2024_DSCS_EN_Trees2_Prim_Kraskal.pptx
RavanGulmetov
 
Strassen's Matrix Multiplication divide and conquere algorithm
Strassen's Matrix Multiplication divide and conquere algorithmStrassen's Matrix Multiplication divide and conquere algorithm
Strassen's Matrix Multiplication divide and conquere algorithm
Ahmad177077
 
Hierarchical (2)l ppt for data and analytics
Hierarchical (2)l ppt for data and analyticsHierarchical (2)l ppt for data and analytics
Hierarchical (2)l ppt for data and analytics
DrMADHURI6
 
Neural Networks: Principal Component Analysis (PCA)
Neural Networks: Principal Component Analysis (PCA)Neural Networks: Principal Component Analysis (PCA)
Neural Networks: Principal Component Analysis (PCA)
Mostafa G. M. Mostafa
 
DATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREE
DATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREEDATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREE
DATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREE
nguyenminhhuy2905
 
Steven Duplij, Raimund Vogl, "Polyadic Braid Operators and Higher Braiding Ga...
Steven Duplij, Raimund Vogl, "Polyadic Braid Operators and Higher Braiding Ga...Steven Duplij, Raimund Vogl, "Polyadic Braid Operators and Higher Braiding Ga...
Steven Duplij, Raimund Vogl, "Polyadic Braid Operators and Higher Braiding Ga...
Steven Duplij (Stepan Douplii)
 
Introduction to MATLAB
Introduction to MATLABIntroduction to MATLAB
Introduction to MATLAB
Damian T. Gordon
 
M A T H E M A T I C A L M E T H O D S J N T U M O D E L P A P E R{Www
M A T H E M A T I C A L  M E T H O D S  J N T U  M O D E L  P A P E R{WwwM A T H E M A T I C A L  M E T H O D S  J N T U  M O D E L  P A P E R{Www
M A T H E M A T I C A L M E T H O D S J N T U M O D E L P A P E R{Www
guest3f9c6b
 
Eigenvalues and eigenvectors
Eigenvalues and eigenvectorsEigenvalues and eigenvectors
Eigenvalues and eigenvectors
iraq
 
Decision Maths 1 Chapter 3 Algorithms on Graphs (including Floyd A2 content)....
Decision Maths 1 Chapter 3 Algorithms on Graphs (including Floyd A2 content)....Decision Maths 1 Chapter 3 Algorithms on Graphs (including Floyd A2 content)....
Decision Maths 1 Chapter 3 Algorithms on Graphs (including Floyd A2 content)....
SintooChauhan6
 
Q1Perform the two basic operations of multiplication and divisio.docx
Q1Perform the two basic operations of multiplication and divisio.docxQ1Perform the two basic operations of multiplication and divisio.docx
Q1Perform the two basic operations of multiplication and divisio.docx
amrit47
 
Application of Bayesian and Sparse Network Models for Assessing Linkage Diseq...
Application of Bayesian and Sparse Network Models for Assessing Linkage Diseq...Application of Bayesian and Sparse Network Models for Assessing Linkage Diseq...
Application of Bayesian and Sparse Network Models for Assessing Linkage Diseq...
Gota Morota
 
UNIT-5-II IT-DATA VISUALIZATION TECHNIQUES
UNIT-5-II IT-DATA VISUALIZATION TECHNIQUESUNIT-5-II IT-DATA VISUALIZATION TECHNIQUES
UNIT-5-II IT-DATA VISUALIZATION TECHNIQUES
hemalathab24
 
Machine Learning and Stochastic Geometry: Statistical Frameworks Against Unce...
Machine Learning and Stochastic Geometry: Statistical Frameworks Against Unce...Machine Learning and Stochastic Geometry: Statistical Frameworks Against Unce...
Machine Learning and Stochastic Geometry: Statistical Frameworks Against Unce...
Koji Yamamoto
 
Introduction to Big Data Science
Introduction to Big Data ScienceIntroduction to Big Data Science
Introduction to Big Data Science
Albert Bifet
 
Ad

More from SSA KPI (20)

Germany presentation
Germany presentationGermany presentation
Germany presentation
SSA KPI
 
Grand challenges in energy
Grand challenges in energyGrand challenges in energy
Grand challenges in energy
SSA KPI
 
Engineering role in sustainability
Engineering role in sustainabilityEngineering role in sustainability
Engineering role in sustainability
SSA KPI
 
Consensus and interaction on a long term strategy for sustainable development
Consensus and interaction on a long term strategy for sustainable developmentConsensus and interaction on a long term strategy for sustainable development
Consensus and interaction on a long term strategy for sustainable development
SSA KPI
 
Competences in sustainability in engineering education
Competences in sustainability in engineering educationCompetences in sustainability in engineering education
Competences in sustainability in engineering education
SSA KPI
 
Introducatio SD for enginers
Introducatio SD for enginersIntroducatio SD for enginers
Introducatio SD for enginers
SSA KPI
 
DAAD-10.11.2011
DAAD-10.11.2011DAAD-10.11.2011
DAAD-10.11.2011
SSA KPI
 
Talking with money
Talking with moneyTalking with money
Talking with money
SSA KPI
 
'Green' startup investment
'Green' startup investment'Green' startup investment
'Green' startup investment
SSA KPI
 
From Huygens odd sympathy to the energy Huygens' extraction from the sea waves
From Huygens odd sympathy to the energy Huygens' extraction from the sea wavesFrom Huygens odd sympathy to the energy Huygens' extraction from the sea waves
From Huygens odd sympathy to the energy Huygens' extraction from the sea waves
SSA KPI
 
Dynamics of dice games
Dynamics of dice gamesDynamics of dice games
Dynamics of dice games
SSA KPI
 
Energy Security Costs
Energy Security CostsEnergy Security Costs
Energy Security Costs
SSA KPI
 
Naturally Occurring Radioactivity (NOR) in natural and anthropic environments
Naturally Occurring Radioactivity (NOR) in natural and anthropic environmentsNaturally Occurring Radioactivity (NOR) in natural and anthropic environments
Naturally Occurring Radioactivity (NOR) in natural and anthropic environments
SSA KPI
 
Advanced energy technology for sustainable development. Part 5
Advanced energy technology for sustainable development. Part 5Advanced energy technology for sustainable development. Part 5
Advanced energy technology for sustainable development. Part 5
SSA KPI
 
Advanced energy technology for sustainable development. Part 4
Advanced energy technology for sustainable development. Part 4Advanced energy technology for sustainable development. Part 4
Advanced energy technology for sustainable development. Part 4
SSA KPI
 
Advanced energy technology for sustainable development. Part 3
Advanced energy technology for sustainable development. Part 3Advanced energy technology for sustainable development. Part 3
Advanced energy technology for sustainable development. Part 3
SSA KPI
 
Advanced energy technology for sustainable development. Part 2
Advanced energy technology for sustainable development. Part 2Advanced energy technology for sustainable development. Part 2
Advanced energy technology for sustainable development. Part 2
SSA KPI
 
Advanced energy technology for sustainable development. Part 1
Advanced energy technology for sustainable development. Part 1Advanced energy technology for sustainable development. Part 1
Advanced energy technology for sustainable development. Part 1
SSA KPI
 
Fluorescent proteins in current biology
Fluorescent proteins in current biologyFluorescent proteins in current biology
Fluorescent proteins in current biology
SSA KPI
 
Neurotransmitter systems of the brain and their functions
Neurotransmitter systems of the brain and their functionsNeurotransmitter systems of the brain and their functions
Neurotransmitter systems of the brain and their functions
SSA KPI
 
Germany presentation
Germany presentationGermany presentation
Germany presentation
SSA KPI
 
Grand challenges in energy
Grand challenges in energyGrand challenges in energy
Grand challenges in energy
SSA KPI
 
Engineering role in sustainability
Engineering role in sustainabilityEngineering role in sustainability
Engineering role in sustainability
SSA KPI
 
Consensus and interaction on a long term strategy for sustainable development
Consensus and interaction on a long term strategy for sustainable developmentConsensus and interaction on a long term strategy for sustainable development
Consensus and interaction on a long term strategy for sustainable development
SSA KPI
 
Competences in sustainability in engineering education
Competences in sustainability in engineering educationCompetences in sustainability in engineering education
Competences in sustainability in engineering education
SSA KPI
 
Introducatio SD for enginers
Introducatio SD for enginersIntroducatio SD for enginers
Introducatio SD for enginers
SSA KPI
 
DAAD-10.11.2011
DAAD-10.11.2011DAAD-10.11.2011
DAAD-10.11.2011
SSA KPI
 
Talking with money
Talking with moneyTalking with money
Talking with money
SSA KPI
 
'Green' startup investment
'Green' startup investment'Green' startup investment
'Green' startup investment
SSA KPI
 
From Huygens odd sympathy to the energy Huygens' extraction from the sea waves
From Huygens odd sympathy to the energy Huygens' extraction from the sea wavesFrom Huygens odd sympathy to the energy Huygens' extraction from the sea waves
From Huygens odd sympathy to the energy Huygens' extraction from the sea waves
SSA KPI
 
Dynamics of dice games
Dynamics of dice gamesDynamics of dice games
Dynamics of dice games
SSA KPI
 
Energy Security Costs
Energy Security CostsEnergy Security Costs
Energy Security Costs
SSA KPI
 
Naturally Occurring Radioactivity (NOR) in natural and anthropic environments
Naturally Occurring Radioactivity (NOR) in natural and anthropic environmentsNaturally Occurring Radioactivity (NOR) in natural and anthropic environments
Naturally Occurring Radioactivity (NOR) in natural and anthropic environments
SSA KPI
 
Advanced energy technology for sustainable development. Part 5
Advanced energy technology for sustainable development. Part 5Advanced energy technology for sustainable development. Part 5
Advanced energy technology for sustainable development. Part 5
SSA KPI
 
Advanced energy technology for sustainable development. Part 4
Advanced energy technology for sustainable development. Part 4Advanced energy technology for sustainable development. Part 4
Advanced energy technology for sustainable development. Part 4
SSA KPI
 
Advanced energy technology for sustainable development. Part 3
Advanced energy technology for sustainable development. Part 3Advanced energy technology for sustainable development. Part 3
Advanced energy technology for sustainable development. Part 3
SSA KPI
 
Advanced energy technology for sustainable development. Part 2
Advanced energy technology for sustainable development. Part 2Advanced energy technology for sustainable development. Part 2
Advanced energy technology for sustainable development. Part 2
SSA KPI
 
Advanced energy technology for sustainable development. Part 1
Advanced energy technology for sustainable development. Part 1Advanced energy technology for sustainable development. Part 1
Advanced energy technology for sustainable development. Part 1
SSA KPI
 
Fluorescent proteins in current biology
Fluorescent proteins in current biologyFluorescent proteins in current biology
Fluorescent proteins in current biology
SSA KPI
 
Neurotransmitter systems of the brain and their functions
Neurotransmitter systems of the brain and their functionsNeurotransmitter systems of the brain and their functions
Neurotransmitter systems of the brain and their functions
SSA KPI
 

Recently uploaded (20)

Contact Lens:::: An Overview.pptx.: Optometry
Contact Lens:::: An Overview.pptx.: OptometryContact Lens:::: An Overview.pptx.: Optometry
Contact Lens:::: An Overview.pptx.: Optometry
MushahidRaza8
 
How to Customize Your Financial Reports & Tax Reports With Odoo 17 Accounting
How to Customize Your Financial Reports & Tax Reports With Odoo 17 AccountingHow to Customize Your Financial Reports & Tax Reports With Odoo 17 Accounting
How to Customize Your Financial Reports & Tax Reports With Odoo 17 Accounting
Celine George
 
2541William_McCollough_DigitalDetox.docx
2541William_McCollough_DigitalDetox.docx2541William_McCollough_DigitalDetox.docx
2541William_McCollough_DigitalDetox.docx
contactwilliamm2546
 
Stein, Hunt, Green letter to Congress April 2025
Stein, Hunt, Green letter to Congress April 2025Stein, Hunt, Green letter to Congress April 2025
Stein, Hunt, Green letter to Congress April 2025
Mebane Rash
 
Grade 3 - English - Printable Worksheet (PDF Format)
Grade 3 - English - Printable Worksheet  (PDF Format)Grade 3 - English - Printable Worksheet  (PDF Format)
Grade 3 - English - Printable Worksheet (PDF Format)
Sritoma Majumder
 
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...
larencebapu132
 
How to Manage Purchase Alternatives in Odoo 18
How to Manage Purchase Alternatives in Odoo 18How to Manage Purchase Alternatives in Odoo 18
How to Manage Purchase Alternatives in Odoo 18
Celine George
 
Presentation of the MIPLM subject matter expert Erdem Kaya
Presentation of the MIPLM subject matter expert Erdem KayaPresentation of the MIPLM subject matter expert Erdem Kaya
Presentation of the MIPLM subject matter expert Erdem Kaya
MIPLM
 
GDGLSPGCOER - Git and GitHub Workshop.pptx
GDGLSPGCOER - Git and GitHub Workshop.pptxGDGLSPGCOER - Git and GitHub Workshop.pptx
GDGLSPGCOER - Git and GitHub Workshop.pptx
azeenhodekar
 
dynastic art of the Pallava dynasty south India
dynastic art of the Pallava dynasty south Indiadynastic art of the Pallava dynasty south India
dynastic art of the Pallava dynasty south India
PrachiSontakke5
 
YSPH VMOC Special Report - Measles Outbreak Southwest US 5-3-2025.pptx
YSPH VMOC Special Report - Measles Outbreak  Southwest US 5-3-2025.pptxYSPH VMOC Special Report - Measles Outbreak  Southwest US 5-3-2025.pptx
YSPH VMOC Special Report - Measles Outbreak Southwest US 5-3-2025.pptx
Yale School of Public Health - The Virtual Medical Operations Center (VMOC)
 
Introduction-to-Communication-and-Media-Studies-1736283331.pdf
Introduction-to-Communication-and-Media-Studies-1736283331.pdfIntroduction-to-Communication-and-Media-Studies-1736283331.pdf
Introduction-to-Communication-and-Media-Studies-1736283331.pdf
james5028
 
How to manage Multiple Warehouses for multiple floors in odoo point of sale
How to manage Multiple Warehouses for multiple floors in odoo point of saleHow to manage Multiple Warehouses for multiple floors in odoo point of sale
How to manage Multiple Warehouses for multiple floors in odoo point of sale
Celine George
 
Link your Lead Opportunities into Spreadsheet using odoo CRM
Link your Lead Opportunities into Spreadsheet using odoo CRMLink your Lead Opportunities into Spreadsheet using odoo CRM
Link your Lead Opportunities into Spreadsheet using odoo CRM
Celine George
 
Biophysics Chapter 3 Methods of Studying Macromolecules.pdf
Biophysics Chapter 3 Methods of Studying Macromolecules.pdfBiophysics Chapter 3 Methods of Studying Macromolecules.pdf
Biophysics Chapter 3 Methods of Studying Macromolecules.pdf
PKLI-Institute of Nursing and Allied Health Sciences Lahore , Pakistan.
 
APM Midlands Region April 2025 Sacha Hind Circulated.pdf
APM Midlands Region April 2025 Sacha Hind Circulated.pdfAPM Midlands Region April 2025 Sacha Hind Circulated.pdf
APM Midlands Region April 2025 Sacha Hind Circulated.pdf
Association for Project Management
 
Metamorphosis: Life's Transformative Journey
Metamorphosis: Life's Transformative JourneyMetamorphosis: Life's Transformative Journey
Metamorphosis: Life's Transformative Journey
Arshad Shaikh
 
pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulse
pulse  ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulsepulse  ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulse
pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulse
sushreesangita003
 
K12 Tableau Tuesday - Algebra Equity and Access in Atlanta Public Schools
K12 Tableau Tuesday  - Algebra Equity and Access in Atlanta Public SchoolsK12 Tableau Tuesday  - Algebra Equity and Access in Atlanta Public Schools
K12 Tableau Tuesday - Algebra Equity and Access in Atlanta Public Schools
dogden2
 
Kasdorf "Accessibility Essentials: A 2025 NISO Training Series, Session 5, Ac...
Kasdorf "Accessibility Essentials: A 2025 NISO Training Series, Session 5, Ac...Kasdorf "Accessibility Essentials: A 2025 NISO Training Series, Session 5, Ac...
Kasdorf "Accessibility Essentials: A 2025 NISO Training Series, Session 5, Ac...
National Information Standards Organization (NISO)
 
Contact Lens:::: An Overview.pptx.: Optometry
Contact Lens:::: An Overview.pptx.: OptometryContact Lens:::: An Overview.pptx.: Optometry
Contact Lens:::: An Overview.pptx.: Optometry
MushahidRaza8
 
How to Customize Your Financial Reports & Tax Reports With Odoo 17 Accounting
How to Customize Your Financial Reports & Tax Reports With Odoo 17 AccountingHow to Customize Your Financial Reports & Tax Reports With Odoo 17 Accounting
How to Customize Your Financial Reports & Tax Reports With Odoo 17 Accounting
Celine George
 
2541William_McCollough_DigitalDetox.docx
2541William_McCollough_DigitalDetox.docx2541William_McCollough_DigitalDetox.docx
2541William_McCollough_DigitalDetox.docx
contactwilliamm2546
 
Stein, Hunt, Green letter to Congress April 2025
Stein, Hunt, Green letter to Congress April 2025Stein, Hunt, Green letter to Congress April 2025
Stein, Hunt, Green letter to Congress April 2025
Mebane Rash
 
Grade 3 - English - Printable Worksheet (PDF Format)
Grade 3 - English - Printable Worksheet  (PDF Format)Grade 3 - English - Printable Worksheet  (PDF Format)
Grade 3 - English - Printable Worksheet (PDF Format)
Sritoma Majumder
 
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...
World war-1(Causes & impacts at a glance) PPT by Simanchala Sarab(BABed,sem-4...
larencebapu132
 
How to Manage Purchase Alternatives in Odoo 18
How to Manage Purchase Alternatives in Odoo 18How to Manage Purchase Alternatives in Odoo 18
How to Manage Purchase Alternatives in Odoo 18
Celine George
 
Presentation of the MIPLM subject matter expert Erdem Kaya
Presentation of the MIPLM subject matter expert Erdem KayaPresentation of the MIPLM subject matter expert Erdem Kaya
Presentation of the MIPLM subject matter expert Erdem Kaya
MIPLM
 
GDGLSPGCOER - Git and GitHub Workshop.pptx
GDGLSPGCOER - Git and GitHub Workshop.pptxGDGLSPGCOER - Git and GitHub Workshop.pptx
GDGLSPGCOER - Git and GitHub Workshop.pptx
azeenhodekar
 
dynastic art of the Pallava dynasty south India
dynastic art of the Pallava dynasty south Indiadynastic art of the Pallava dynasty south India
dynastic art of the Pallava dynasty south India
PrachiSontakke5
 
Introduction-to-Communication-and-Media-Studies-1736283331.pdf
Introduction-to-Communication-and-Media-Studies-1736283331.pdfIntroduction-to-Communication-and-Media-Studies-1736283331.pdf
Introduction-to-Communication-and-Media-Studies-1736283331.pdf
james5028
 
How to manage Multiple Warehouses for multiple floors in odoo point of sale
How to manage Multiple Warehouses for multiple floors in odoo point of saleHow to manage Multiple Warehouses for multiple floors in odoo point of sale
How to manage Multiple Warehouses for multiple floors in odoo point of sale
Celine George
 
Link your Lead Opportunities into Spreadsheet using odoo CRM
Link your Lead Opportunities into Spreadsheet using odoo CRMLink your Lead Opportunities into Spreadsheet using odoo CRM
Link your Lead Opportunities into Spreadsheet using odoo CRM
Celine George
 
Metamorphosis: Life's Transformative Journey
Metamorphosis: Life's Transformative JourneyMetamorphosis: Life's Transformative Journey
Metamorphosis: Life's Transformative Journey
Arshad Shaikh
 
pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulse
pulse  ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulsepulse  ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulse
pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulse
sushreesangita003
 
K12 Tableau Tuesday - Algebra Equity and Access in Atlanta Public Schools
K12 Tableau Tuesday  - Algebra Equity and Access in Atlanta Public SchoolsK12 Tableau Tuesday  - Algebra Equity and Access in Atlanta Public Schools
K12 Tableau Tuesday - Algebra Equity and Access in Atlanta Public Schools
dogden2
 

Graph Based Clustering

  • 1. Summer School “Achievements and Applications of Contemporary Informatics, Mathematics and Physics” (AACIMP 2011) August 8-20, 2011, Kiev, Ukraine Graph Based Clustering Erik Kropat University of the Bundeswehr Munich Institute for Theoretical Computer Science, Mathematics and Operations Research Neubiberg, Germany
  • 2. Real World Networks • Biological Networks − Gene regulatory networks − Metabolic networks − Neural networks − Food webs food web • Technological Networks − Telecommunication networks − Internet − Power grids power grid
  • 3. Real World Networks • Social Networks − Communication networks − Organizational networks − Social media − Online communities social networks • Economic Networks − Financial market networks − Trade networks − Collaboration networks economic networks Source: Frank Schweitzer et al., “Economic Networks: The New Challenges,” Science 325, no. 5939 (July 24, 2009): 422-425.
  • 4. Graph-Theory • Graph theory can provide more detailed information about the inner structure of the data set in terms of − cliques (subsets of nodes where each pair of elements is connected) − clusters (highly connected groups of nodes) − centrality (important nodes, hubs) − outliers . . . (unimportant nodes) • Applications − social network analysis − diffusion of information − spreading of diseases or rumours ⇒ marketing campaigns, viral marketing, social network advertising
  • 5. Graph-Based Clustering • Collection of a wide range of very popular clustering algorithms that are based on graph-theory. • Organize information in large datasets to facilitate users for faster access to required information.
  • 6. Idea • Objects are represented as nodes in a complete or connected graph. • Assign a weight to each branch between the two nodes x and y. The weight is defined by the distance d(x,y) between the nodes. Clustering Distance between clusters Distance between objects
  • 7. Idea graph minimal spanning tree clusters
  • 8. Graph Based Clustering Hierarchical method (1) Determine a minimal spanning tree (MST) (2) Delete branches iteratively New connected components = Cluster 4 6 5 1 8 3
  • 10. Minimal Spanning Tree A minimal spanning tree of a connected graph G = (V,E) is a connected subgraph with minimal weight that contains all nodes of G and has no cycles. c c 4 4 6 5 6 5 b b 1 8 1 8 a 3 d a 3 d graph G = (V, E) minimal spanning tree
  • 11. Minimal spanning trees can be calculated with... (1) Prim’s algorithm. (2) Kruskal’s algorithm. c 4 6 5 b 1 8 a 3 d
  • 12. Example – Prims’s Algorithm Set VT = {a}, ET = { } Choose an edge (x,y) with minimal weight such that x ∈ VT and y ∉ VT. VT = {a,b} and ET = { (a,b) }. c c 4 4 6 5 6 5 b b 1 8 1 8 a 3 d a 3 d
  • 13. Example– Prims’s Algorithm Choose an edge (x,y) with minimal weight Choose an edge (x,y) with minimal weight such that x ∈ VT and y ∉ VT. such that x ∈ VT and y ∉ VT. VT = {a,b,d} and ET = { (a,b), (a,d) }. VT = {a,b,c,d} and ET = { (a,b), (a,d),(b,c) }. c c 4 4 6 5 6 5 b b 1 8 1 8 c c a 3 d a 3 d
  • 14. Prim’s Algorithm INPUT: Weighted graph G = (V, E), undirected + connected OUTPUT: Minimal spanning tree T = (VT, ET) (1) Set VT = {v}, ET = { }, where v is an arbitrary node from V (starting point). (2) REPEAT (3) Choose an edge (a,b) with minimal weight, such that a ∈ VT and b ∉ VT. (4) Set VT = VT ∪ {b} and ET = ET ∪ { (a,b) }. (5) UNTIL VT = V
  • 15. Kruskal’s Algorithm INPUT: Weighted graph G = (V, E), undirected + connected OUTPUT: Minimal spanning tree T = (VT, ET) (1) Set VT = V, ET = { }, H = E. (2) Initialize a queue to contain all edges in G, using the weights in ascending order as keys. (3) WHILE H ≠ { } (4) Choose an edge e ∈ H with minimal weight. (5) Set H = H {e}. (6) If (VT, ET ∪ {e}) has no cycles, then ET = ET ∪ {e} . (7) END
  • 17. Delete Branches - Different Strategies (1) Delete the branch with maximum weight. (2) Delete inconsistent branches. (3) Delete by analysis of weights.
  • 18. (1) Delete the branch with maximum weight • In each step, create two new clusters by deleting the branch with maximum weight. • Repeat until the given number of clusters is reached. 2 2 2 4 2 3 6 2
  • 19. Example: Delete the branch with maximum weight 2 2 2 4 2 3 Minimum spanning tree 6 2 Ordered weights of branches: 6, 4, 3, 2, 2, 2, 2, 2.
  • 20. Example: Delete the branch with maximum weight 2 2 2 4 2 3 6 2 Ordered weights of branches: 6, 4, 3, 2, 2, 2, 2, 2. Step 1: Delete branch (weight 6) ⇒ 2 clusters
  • 21. Example: Delete the branch with maximum weight 2 2 2 4 2 3 6 2 Ordered weights of branches: 6, 4, 3, 2, 2, 2, 2, 2. Step 1: Delete branch (weight 6) ⇒ 2 clusters Step 2: Delete branch (weight 4) ⇒ 3 clusters
  • 22. (2) Delete inconsistent branches • A branch e is inconsistent, if the corresponding weight de _ is (much) larger than a reference value de . _ • The reference value de can be defined by the average weight of all branches adjacent to e. _ 3+2+1 de = _________ = 2 3 1 e 3 6 _ 2 d e = 6 > 2 = de ⇒ e inconsistent
  • 23. (3) Delete by analysis of weights • Perform an “analysis” of all weights of branches in the MST. Determine a threshold S. • The threshold can be estimated by histograms on the weights of branches (= length of branches). • Delete a branches, if the corresponding weight higher than the threshold S. Number Number S weight of branch weight of branch (length of branch)
  • 24. Exercise d 3 20 5 e c 9 8 1 4 15 g 6 12 f b 10 2 a Find a minimal spanning tree and provide a clustering of the graph by deleting all inconsistent branches.
  • 25. Example Set VT = {a}, ET = { } Choose an edge (x,y) with minimal weight such that x ∈ VT and y ∉ VT.
  • 26. Example Choose an edge (x,y) with minimal weight Choose an edge (x,y) with minimal weight such that x ∈ VT and y ∉ VT. such that x ∈ VT and y ∉ VT.
  • 27. Example Choose an edge (x,y) with minimal weight Choose an edge (x,y) with minimal weight such that x ∈ VT and y ∉ VT. such that x ∈ VT and y ∉ VT.
  • 28. Example Choose an edge (x,y) with minimal weight such that x ∈ VT and y ∉ VT. minimal spanning tree
  • 29. Example For each branch calculate the reference value (average weight of adjacent branches) d 3 (3) (4.5) 5 e c 1 (3) (4) 4 g 6 (3.6) f b (5) 2 a
  • 30. Example Delete inconsistent branches (weight is larger than the reference value) d 2 clusters 3 (3) e c 1 (3) (4) 4 g f b Noise? a
  • 32. Summary • In graph based clustering objects are represented as nodes in a complete or connected graph. • The distance between two objects is given by the weight of the corresponding branch. • Hierarchical method (1) Determine a minimal spanning tree (MST) (2) Delete branches iteratively • Visualization of information in large datasets.
  • 33. Literature • V. Kumar, M. Steinbach, P.-N. Tan Introduction to Data Mining. Addison Wesley, 2005. Other work mentioned in the presentation • J.A. Dunne, R.J. Williams, N.D. Martinez, R.A. Wood, D.H. Erwin Compilation and Network Analyses of Cambrian Food Webs. PLoS Biol 6(4): e102. doi:10.1371/journal.pbio.0060102 • F. Schweitzer, G. Fagiolo, D. Sornette, F. Vega-Redondo, A. Vespignani, D.R. White Economic Networks: The New Challenges. Science 325, no. 5939 (July 24, 2009): 422-425.
  • 34. Thank you very much!