Question 1

______________ centrality takes its maximum value

Accepted Answer

A) Closeness 
B) Betweenness 
C) Group 
D) None of these 
A) Closeness 
B) Betweenness 
C) Group 
D) None of these B

Question 2

The________ analyzes transitivity in an undirected graph.

Accepted Answer

A) Reciprocity 
B) clustering coefficient 
C) Centrality 
D) Closeness 
A) Reciprocity 
B) clustering coefficient 
C) Centrality 
D) Closeness B

Question 3

_____centrality is defined as the number of nodes from outside the group that are connected to group members.

Accepted Answer

A) Group degree 
B) Closeness 
C) Betweenness 
D) None of these 
A) Group degree 
B) Closeness 
C) Betweenness 
D) None of these A

Question 4

_______measures can be used to calculate similarity

Accepted Answer

A) Katz measure 
B) Rooted PageRank. 
C) Hitting and Commute Time 
D) all of the above 
A) Katz measure 
B) Rooted PageRank. 
C) Hitting and Commute Time 
D) all of the above

Question 5

__________considers closed loops of length 2

Accepted Answer

A) Transitivity 
B) Centrality 
C) Reciprocity 
D) None of these 
A) Transitivity 
B) Centrality 
C) Reciprocity 
D) None of these

Question 6

________is the behavior individuals exhibit with respect to other individuals.

Accepted Answer

A) user-user behavior 
B) User-Community Behavior 
C) User-Entity Behavior 
D) None of these 
A) user-user behavior 
B) User-Community Behavior 
C) User-Entity Behavior 
D) None of these

Question 7

To compute structural equivalence, we look at the________ shared by two nodes

Accepted Answer

A) nighborhood 
B) adjcent 
C) same 
D) None of these 
A) nighborhood 
B) adjcent 
C) same 
D) None of these

Question 8

In directed graphs_____________variants of degree centrality.

Accepted Answer

A) prestige 
B) gregariousness 
C) both a and b 
D) None of these 
A) prestige 
B) gregariousness 
C) both a and b 
D) None of these

Question 9

_________ models are sender-centric.

Accepted Answer

A) threshold models 
B) Cascade Models 
C) both a & b 
D) None of these 
A) threshold models 
B) Cascade Models 
C) both a & b 
D) None of these

Question 10

__________ examples of individual behavior modeling.

Accepted Answer

A) Cascade Models 
B) threshold models 
C) None of these 
D) both 
A) Cascade Models 
B) threshold models 
C) None of these 
D) both

Question 11

__________defines a normalized version of Katz centrality.

Accepted Answer

A) PageRank centrality 
B) eigenvector centrality 
C) Betweenness centrality 
D) None of these 
A) PageRank centrality 
B) eigenvector centrality 
C) Betweenness centrality 
D) None of these

Question 12

__________ Modeling allow for controlled experiments and simulations that can help study individuals in social media

Accepted Answer

A) An observable behavior 
B) Individual Behavior Modeling 
C) Feature-Behavior Association. 
D) None of these 
A) An observable behavior 
B) Individual Behavior Modeling 
C) Feature-Behavior Association. 
D) None of these

Question 13

__________algorithms determine features that contribute the most to the prediction of the class attribute.

Accepted Answer

A) classification 
B) Features selection 
C) both a & b 
D) None of these 
A) classification 
B) Features selection 
C) both a & b 
D) None of these

Question 14

___________for a node is simply its degree.

Accepted Answer

A) Degree 
B) Eigenvector 
C) Katz 
D) Closeness 
A) Degree 
B) Eigenvector 
C) Katz 
D) Closeness

Question 15

When a behavior diuses in a network, one can use _______model

Accepted Answer

A) threshold models 
B) Cascade Models 
C) both a & b 
D) None of these 
A) threshold models 
B) Cascade Models 
C) both a & b 
D) None of these

Question 16

__________defines how important a node is within a network.

Accepted Answer

A) Centrality 
B) Degree 
C) prominence 
D) None of these 
A) Centrality 
B) Degree 
C) prominence 
D) None of these

Question 17

When using network information, the similarity between two nodes can be computed by measuring their ________

Accepted Answer

A) structural equivalence 
B) their regular equivalence. 
C) both a and b 
D) None of these 
A) structural equivalence 
B) their regular equivalence. 
C) both a and b 
D) None of these

Question 18

transitive behavior needs at least ________edges.

Accepted Answer

A) Three 
B) two 
C) one 
D) four 
A) Three 
B) two 
C) one 
D) four

Question 19

__________algorithm will compute shortest paths from a single node to all other nodes.

Accepted Answer

A) Betweenness 
B) Brandes' 
C) Dijkstra's 
D) None of these 
A) Betweenness 
B) Brandes' 
C) Dijkstra's 
D) None of these

Question 20

______ theory measures how consistent individuals are in assigning status to their neighbors.

Accepted Answer

A) Social status 
B) clustering coefficient 
C) Closeness 
D) clustering coefficient. 
A) Social status 
B) clustering coefficient 
C) Closeness 
D) clustering coefficient.

______________ centrality takes its maximum value

The________ analyzes transitivity in an undirected graph.

_____centrality is defined as the number of nodes from outside the group that are connected to group members.

_______measures can be used to calculate similarity

__________considers closed loops of length 2

________is the behavior individuals exhibit with respect to other individuals.

To compute structural equivalence, we look at the________ shared by two nodes

In directed graphs_____________variants of degree centrality.

_________ models are sender-centric.

__________ examples of individual behavior modeling.

__________defines a normalized version of Katz centrality.

__________ Modeling allow for controlled experiments and simulations that can help study individuals in social media

__________algorithms determine features that contribute the most to the prediction of the class attribute.

___________for a node is simply its degree.

When a behavior diuses in a network, one can use _______model

__________defines how important a node is within a network.

When using network information, the similarity between two nodes can be computed by measuring their ________

transitive behavior needs at least ________edges.

__________algorithm will compute shortest paths from a single node to all other nodes.

______ theory measures how consistent individuals are in assigning status to their neighbors.

Media, Analytics, and Data Mining Techniques

Social Network Analysis and Clustering Algorithms

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 Individual Behavior: Understanding Centrality, Transitivity, and Social Dynamics

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 3: Network Analysis and Behavior Modeling in Social Media

______________ centrality takes its maximum value

The________ analyzes transitivity in an undirected graph.

_____centrality is defined as the number of nodes from outside the group that are connected to group members.

_______measures can be used to calculate similarity

__________considers closed loops of length 2

________is the behavior individuals exhibit with respect to other individuals.

To compute structural equivalence, we look at the________ shared by two nodes

In directed graphs_____________variants of degree centrality.

_________ models are sender-centric.

__________ examples of individual behavior modeling.

__________defines a normalized version of Katz centrality.

__________ Modeling allow for controlled experiments and simulations that can help study individuals in social media

__________algorithms determine features that contribute the most to the prediction of the class attribute.

___________for a node is simply its degree.

When a behavior di uses in a network, one can use _______model

__________defines how important a node is within a network.

When using network information, the similarity between two nodes can be computed by measuring their ________

transitive behavior needs at least ________edges.

__________algorithm will compute shortest paths from a single node to all other nodes.

______ theory measures how consistent individuals are in assigning status to their neighbors.

Media, Analytics, and Data Mining Techniques

Social Network Analysis and Clustering Algorithms

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 Individual Behavior: Understanding Centrality, Transitivity, and Social Dynamics

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

When a behavior diuses in a network, one can use _______model