DSC 651 - Chapter 3 - Hierarchical
DSC 651 - Chapter 3 - Hierarchical
REPRESENTATION AND
REPORTING
• A network graph uses information from both the link and node data sets to generate a
graphical depiction of the network.
• The nodes and links in a network graph can be arranged in various layout patterns.
• In computer science, a graph is an abstract data type that is meant to implement the
undirected graph and directed graph concepts from graph theory in mathematics.
WHERE CAN RELATIONAL-NETWORK GRAPH BE
APPLIED?
• 1. Social Networks:
• Example Dataset: Facebook friends, Twitter followers, LinkedIn connections.
• Use Case: Representing relationships between individuals in a social network. Nodes can
represent users, and edges can represent connections or interactions between them.
• 2. Biological Networks:
• Example Dataset: Protein-protein interactions, gene regulatory networks.
• Use Case: Modeling interactions between biological entities such as proteins or genes. Nodes can
represent biological entities, and edges can represent interactions or relationships between them.
WHERE CAN RELATIONAL-NETWORK GRAPH BE
APPLIED?
• 3. Knowledge Graphs:
• Example Dataset: Linked open data, semantic web data.
• Use Case: Capturing and representing relationships between different entities in a knowledge domain.
Nodes can represent entities, and edges can represent relationships or connections between them.
• 4. Supply Chain Networks:
• Example Dataset: Suppliers, manufacturers, distributors, retailers.
• Use Case: Analyzing the relationships between entities in a supply chain. Nodes can represent different
entities in the supply chain, and edges can represent the flow of goods or information between them.
WHERE CAN RELATIONAL-NETWORK GRAPH BE
APPLIED?
• 5. Collaboration Networks:
• Example Dataset: Co-authorship networks, collaboration in research.
• Use Case: Illustrating collaborations between researchers or authors. Nodes can represent
individuals, and edges can represent collaborations or co-authorships.
• 6. Citation Networks:
• Example Dataset: Academic papers, citations between papers.
• Use Case: Visualizing the citation relationships between academic papers. Nodes can
represent papers, and edges can represent citations.
WHERE CAN RELATIONAL-NETWORK GRAPH BE
APPLIED?
• 7. Finance and Economic Networks:
• Example Dataset: Financial transactions, economic dependencies.
• Use Case: Analyzing financial transactions or dependencies between economic entities.
Nodes can represent financial entities, and edges can represent transactions or
dependencies.
DIFFERENT
TYPES OF
NETWORK
ANALYSIS
DIFFERENT TYPES OF NETWORK ANALYSIS
• 3. Centrality Analysis - It helps one in identifying the relevance of the different entities
in your network and analyzing the central entities. One can use this to find the most
highly accessed websites or web pages for further analysis. When we talk about graphs
we can use this to find the most highly accessed node in the graph database. eg.
Reachability analysis
• 4. Community Analysis - This method is a distance and density-based analysis which
is used to identify communities of people or devices in a huge network. For this we
can say detecting a target audience by identifying people on a social network can be an
example of the same. eg. Social network and groups analysis
DIFFERENT TYPES OF NETWORK ANALYSIS
• Nodes (or Vertices): These are the individual entities in the network. In a social context, nodes can represent
people, organizations, or any other social actors.
• Edges (or Ties): These are the connections or relationships between nodes. In a social network, edges represent
interactions, relationships, or connections between individuals or entities.
• Network Structure: The overall pattern of relationships within the network, including how nodes are
connected and the arrangement of these connections.
• Centrality: Measures the importance or influence of a node within the network. Nodes with high centrality are
often considered key players in the social structure.
KEY CONCEPTS IN SOCIAL NETWORK ANALYSIS
• Clustering: Refers to the tendency of nodes to form groups or clusters. Clustering can
indicate the presence of subgroups or communities within the larger network.
• Degree: The number of connections a node has. Nodes with a high degree are more
connected within the network.
• Betweenness Centrality: Measures the extent to which a node lies on the shortest paths
between other nodes. Nodes with high betweenness centrality can be crucial for
information flow in the network.
OVERVIEW OF NETWORK CHARTS IN POWER BI
VISUAL LIBRARY POWERED BY R IN POWER BI
• In Power BI Desktop and the Power BI service, you can use R-powered Power BI
visuals without any knowledge of R and without any R scripting. This enables you to
harness the analytic and visual power of R visuals, and R scripts, without learning R or
doing any programming yourself
DISCUSSIO
N
DISCUSSIO
N – FRAUD
DETECTION
DISCUSSION
DISCUSSIO
N