Question 1

__________provides solution for directed graph problems.

Accepted Answer

A) Eigenvector 
B) Katz 
C) PageRank 
D) none 
A) Eigenvector 
B) Katz 
C) PageRank 
D) none C

Question 2

Befriending is an example of ___________behaviour.

Accepted Answer

A) User-User 
B) User-Community 
C) User-Entity 
D) none 
A) User-User 
B) User-Community 
C) User-Entity 
D) none A

Question 3

Social Balance Theory also known as ______________

Accepted Answer

A) Nodal balance theory 
B) structural balance theory 
C) Network balance theory 
D) none 
A) Nodal balance theory 
B) structural balance theory 
C) Network balance theory 
D) none B

Question 4

Number of friends of an individual in a community considered as

Accepted Answer

A) Class variable 
B) Class attribute 
C) Class vector 
D) none 
A) Class variable 
B) Class attribute 
C) Class vector 
D) none

Question 5

Which centrality can not be generalized for group of nodes.

Accepted Answer

A) Closeness 
B) degree 
C) betweenness 
D) Katz 
A) Closeness 
B) degree 
C) betweenness 
D) Katz

Question 6

__________Clustering estimates how strongly neighbors of a node are themselves connected

Accepted Answer

A) global 
B) local 
C) central 
D) average 
A) global 
B) local 
C) central 
D) average

Question 7

When edges (v1; v2) and (v2; v3) are formed,if (v3; v1) is also formed, it is ____________

Accepted Answer

A) reciprocity 
B) Transitivity 
C) centrality 
D) None 
A) reciprocity 
B) Transitivity 
C) centrality 
D) None

Question 8

Social balance theory says friend/foe relationships are _________

Accepted Answer

A) consistent 
B) determinant 
C) conjugate 
D) adjacent 
A) consistent 
B) determinant 
C) conjugate 
D) adjacent

Question 9

A transitive behavior needs at least___________edges.

Accepted Answer

A) two 
B) three 
C) more than one 
D) five 
A) two 
B) three 
C) more than one 
D) five

Question 10

When discussing individual behavior, Our focus is on _______ individuals

Accepted Answer

A) two 
B) one 
C) more than one 
D) more 
A) two 
B) one 
C) more than one 
D) more

Question 11

Number of friends are ___________proportional to probability of joining community.

Accepted Answer

A) Directly 
B) Indirectly 
C) inversely 
D) not 
A) Directly 
B) Indirectly 
C) inversely 
D) not

Question 12

___________clustering is computed for the network

Accepted Answer

A) global 
B) local 
C) central 
D) average 
A) global 
B) local 
C) central 
D) average

Question 13

Similarity between two nodes can be computed by measuring their_____equivalence

Accepted Answer

A) Nodal 
B) global 
C) structural 
D) central 
A) Nodal 
B) global 
C) structural 
D) central

Question 14

User-_______ behaviour is content generation

Accepted Answer

A) User 
B) Community 
C) Entity 
D) none 
A) User 
B) Community 
C) Entity 
D) none

Question 15

___________behavior emerges when a population of individuals behave in a similar way

Accepted Answer

A) Collective 
B) individual 
C) group 
D) none 
A) Collective 
B) individual 
C) group 
D) none

Question 16

Communities are mostly______________

Accepted Answer

A) explicit 
B) implicit 
C) compact 
D) none 
A) explicit 
B) implicit 
C) compact 
D) none

Question 17

Eigenvector centrality defined for ____________ graphs

Accepted Answer

A) directed 
B) undirected 
C) both a & b 
D) None of these 
A) directed 
B) undirected 
C) both a & b 
D) None of these

Question 18

Individuals are inclined toward an activity when their_____are engaged in the same activity.

Accepted Answer

A) friends 
B) foes 
C) relatives 
D) none 
A) friends 
B) foes 
C) relatives 
D) none

Question 19

________centrality considers how important nodes are in connecting other nodes.

Accepted Answer

A) Eigenvector 
B) Betweenness 
C) degree 
D) Katz 
A) Eigenvector 
B) Betweenness 
C) degree 
D) Katz

Question 20

Transitivity and reciprocity are used in ____________networks.

Accepted Answer

A) Directed 
B) Undirected 
C) weighted 
D) None 
A) Directed 
B) Undirected 
C) weighted 
D) None

__________provides solution for directed graph problems.

Befriending is an example of ___________behaviour.

Social Balance Theory also known as ______________

Number of friends of an individual in a community considered as

Which centrality can not be generalized for group of nodes.

__________Clustering estimates how strongly neighbors of a node are themselves connected

When edges (v1; v2) and (v2; v3) are formed,if (v3; v1) is also formed, it is ____________

Social balance theory says friend/foe relationships are _________

A transitive behavior needs at least___________edges.

When discussing individual behavior, Our focus is on _______ individuals

Number of friends are ___________proportional to probability of joining community.

___________clustering is computed for the network

Similarity between two nodes can be computed by measuring their_____equivalence

User-_______ behaviour is content generation

___________behavior emerges when a population of individuals behave in a similar way

Communities are mostly______________

Eigenvector centrality defined for ____________ graphs

Individuals are inclined toward an activity when their_____are engaged in the same activity.

________centrality considers how important nodes are in connecting other nodes.

Transitivity and reciprocity are used in ____________networks.

Media, Analytics, and Data Mining Techniques

Social Network Analysis and Clustering Algorithms

Network Analysis and Behavior Modeling in Social Media

Exploring User Migration, Security, and Data Mining in Social Media Sites

Data Mining and Clustering: Key Concepts and Tasks

Social Media and Networking

Exploring Network Visualization and Analysis Tools: Techniques, Measures, and Applications

Data Mining and Network Analysis: Key Concepts and Techniques

Network Analysis and Social Media

Social Media Analytics and Data Extraction

Social Media Analysis and Modeling Techniques

Various Aspects of Social Media and Prediction Techniques

Filters

Exam 9: Network Analysis and Individual Behavior: Understanding Centrality, Transitivity, and Social Dynamics

__________provides solution for directed graph problems.

Befriending is an example of ___________behaviour.

Social Balance Theory also known as ______________

Number of friends of an individual in a community considered as

Which centrality can not be generalized for group of nodes.

__________Clustering estimates how strongly neighbors of a node are themselves connected

When edges (v1; v2) and (v2; v3) are formed,if (v3; v1) is also formed, it is ____________

Social balance theory says friend/foe relationships are _________

A transitive behavior needs at least___________edges.

When discussing individual behavior, Our focus is on _______ individuals

Number of friends are ___________proportional to probability of joining community.

___________clustering is computed for the network

Similarity between two nodes can be computed by measuring their_____equivalence

User-_______ behaviour is content generation

___________behavior emerges when a population of individuals behave in a similar way

Communities are mostly______________

Eigenvector centrality defined for ____________ graphs

Individuals are inclined toward an activity when their_____are engaged in the same activity.

________centrality considers how important nodes are in connecting other nodes.

Transitivity and reciprocity are used in ____________networks.

Media, Analytics, and Data Mining Techniques

Social Network Analysis and Clustering Algorithms

Network Analysis and Behavior Modeling in Social Media

Exploring User Migration, Security, and Data Mining in Social Media Sites

Data Mining and Clustering: Key Concepts and Tasks

Social Media and Networking

Exploring Network Visualization and Analysis Tools: Techniques, Measures, and Applications

Data Mining and Network Analysis: Key Concepts and Techniques

Network Analysis and Social Media

Social Media Analytics and Data Extraction

Social Media Analysis and Modeling Techniques

Various Aspects of Social Media and Prediction Techniques

Filters