Data Science

Please solve as handwritten

1. Consider the following set of words: network, social, structure, individuals, specific, interdependency, friendship, kinship, financial, exchange, dislike, relationships, beliefs, knowledge, prestige. a. Derive a matrix by finding the Jaccard distance between each pair of words Jaccard distance = 1 - [(size of intersection as common letters) /(size of union of the letters in both words)]. b. Replace each distance below the average distance by ZERO C. Assume the outcome from Part (b) is your adjacency matrix for the social network of words; 1. Find the density of the graph 2. Find a clique in the network, if any 3. Find eigenvector centrality 4. Find clustering co-efficient, degree, betweenness and closeness centrality for "specific" 5. Find all independent paths between relationships" and "friendship