WorksheetsSNA Module 2
Total questions: 15
Worksheet time: 8mins
_______ is a relationship between two entities
Mining
Graph
Network
Link
Assign class labels to entities based on their link characteristics is comes under _____
Link-based Object Ranking (LOR)
Link-based Object Classification (LOC)
Link prediction
Link Mining
The_____ of a node is the number of edges incident on it
degree
value
weight
centrality
The ____ of a graph is the number of existing edges divided by
the number of possible ones (assuming no duplicates or loops)
ego alters
degree
density
connectedness
The _____ of vertex v in graph G is
defined as the subgraph of G induced by v and its neighbors
whole network
egocentric network
complete network
social network
_______ Centrality is a category of measures that rate
the centrality of a node by its closeness (distance) to other nodes
Betweeness
Information
Degree
Closeness
How does Google® rank web pages in order to
provide meaningful search results?
Page Rank
Link Analysis
Link Prediction
Web Graph
PageRank is an algorithm that addresses the
____ problem (Link-Based Object Ranking).
LDR
LBR
LAR
LCR
The ______ package contains the function ‘page.rank’ that is
capable of taking a graph object as an input and computing the
PageRank of the vertices in the graph object.
‘igraph’
‘graph’
‘agraph’
‘bgraph’
Expansion for HITS ____
Hyper Interactive Tree Search
Hyper Interactive
Topic Search
Hyper-Induced
Topic Search
Hyperlink-Induced
Topic Search
A vertex
has
many pages linking
to it (High Indegree)
Authority
Hub
Updated Authority
Updated Hub
A vertex
points to many other
vertices (High Outdegree)
Outdegree
Authority
Hub
Indegree
In HITS preprocessor ____ Set is a Set of pages most relevant to user’s
query
Grown
Base
Root
Node
In HITs algorithm, generally the upper
bound for k is ____
10
6
3
20
The _____ method is a
simple measure that takes into account
the intersection set of the neighbors of
the vertices u and v.
Adamic-Adar
Jaccard’s coefficient
common neighbors
Unseen bigrams
