Deck 2: Social Network Analysis and Clustering Algorithms
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/25
Play
Full screen (f)
Deck 2: Social Network Analysis and Clustering Algorithms
1
Eigenvector centrality is an
A)An Important nodes has usually important friends
B)Centrality of the given central nodes
C)None of the above
D)All of the above
A)An Important nodes has usually important friends
B)Centrality of the given central nodes
C)None of the above
D)All of the above
An Important nodes has usually important friends
2
Katz centrality can be
A)Used to compute centrality in directed networks
B)Suitable in the analysis of directed acyclic graphs
C)Also used in estimating relative status of actor
D)All of the above
A)Used to compute centrality in directed networks
B)Suitable in the analysis of directed acyclic graphs
C)Also used in estimating relative status of actor
D)All of the above
All of the above
3
Page rank is the method
A)For rating the importance of web pages objectively and mechanically.
B)Used in google search engine
C)A simple way to count the number of times a web page is citated
D)All of the above
A)For rating the importance of web pages objectively and mechanically.
B)Used in google search engine
C)A simple way to count the number of times a web page is citated
D)All of the above
All of the above
4
The most popular social networking website twitter makes use of HITS algorithm in suggesting user account to follow
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
5
PageRank is based on the 'random suffer' idea and the web is seen as a markov chain
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
6
vertices that have a high probability of occurring on a randomly chosen shortest path between two nodes are said to have high
A)Centrality
B)Betweeness centrality
C)Eigenvector centrality
D)None of the above
A)Centrality
B)Betweeness centrality
C)Eigenvector centrality
D)None of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
7
The number of actors outside the group that are connected to the member of that group is
A)Eigenvector centrality
B)Betweeness centrality
C)Degree centrality of the group
D)None of the above
A)Eigenvector centrality
B)Betweeness centrality
C)Degree centrality of the group
D)None of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
8
Transitivity is the tendency for friend of friends to be friend and enemy of enemy to be enemy
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
9
In any directed graph if all edges are reciprocal, can have maximum of |E|=
A)1
B)0
C)2
D)None of the above
A)1
B)0
C)2
D)None of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
10
Reciprocity can be computed using
A)Simple Matrix
B)Adjacency Matrix
C)Eigen Vector
D)None of the above
A)Simple Matrix
B)Adjacency Matrix
C)Eigen Vector
D)None of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
11
Social Status theory measures how inconsistent individuals are in assigning status to their neighbors.
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
12
A pair of nodes said to be structurally equivalent to the extent that
A)They occupy identical locations in a network
B)They are connected to exactly the same others
C)They have the identical relations to all outside actors.
D)All of the above
A)They occupy identical locations in a network
B)They are connected to exactly the same others
C)They have the identical relations to all outside actors.
D)All of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
13
In case the documents do not share any attributes or words, the cosine similarity results in……….
A)High
B)Intermediate
C)0
D)All of the above
A)High
B)Intermediate
C)0
D)All of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
14
Which social network is considered the most popular for business to business marketing?
A)Facebook
B)Orkut
C)Ryze
D)LinkedIn
A)Facebook
B)Orkut
C)Ryze
D)LinkedIn
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
15
The first step when marketing with social networks is to identify the goals and strategies.
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
16
What is the term adopted for updates by Twitter users?
A)Tweets
B)Twoots
C)Twinks
D)Post
A)Tweets
B)Twoots
C)Twinks
D)Post
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
17
Web Crawler is also called as
A)Link Directory
B)Search Optimizer
C)Web Spider
D)Web Manager
A)Link Directory
B)Search Optimizer
C)Web Spider
D)Web Manager
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
18
The 'Sociogram' technique is used to study
A)Human Relations
B)Vocational Interest
C)Achievement
D)Professional
A)Human Relations
B)Vocational Interest
C)Achievement
D)Professional
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
19
Can decision trees be used for performing clustering?
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
20
What is the minimum no. of variables/ features required to perform clustering?
A)0
B)1
C)2
D)3
A)0
B)1
C)2
D)3
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
21
For two runs of K-Mean clustering is it expected to get same clustering results?
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
22
Is it possible that Assignment of observations to clusters does not change between successive iterations in K-Means
A)Yes
B)No
C)Can't say
D)None of these
A)Yes
B)No
C)Can't say
D)None of these
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
23
Which of the following algorithm is most sensitive to outliers?
A)K-means
B)K-medians
C)K-modes
D)K-medoids
A)K-means
B)K-medians
C)K-modes
D)K-medoids
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
24
Which of the following are the high and low bounds for the existence of F-Score?
A)[0,1]
B)(0,1)
C)[-1,1]
D) None of the above
A)[0,1]
B)(0,1)
C)[-1,1]
D) None of the above
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck
25
Which of the following method is used for finding optimal of cluster in K-Mean algorithm?
A)Elbow method
B)Manhattan method
C)All of the above
D)None of these
A)Elbow method
B)Manhattan method
C)All of the above
D)None of these
Unlock Deck
Unlock for access to all 25 flashcards in this deck.
Unlock Deck
k this deck