Discuss how you would formulate the optimization problem and how the stochastic gradientdescent steps are related to traditional logistic regression.

1.       Consider the string ababcdef. List all 2-shingles and 3-shingles, using each alphabet as a token.

2.       Show that the PageRank computation with teleportation is an eigenvector computation on an appropriately constructed probability transition matrix.

3.       Show that the hub and authority scores in HITS can be computed by dominant eigenvector computations on AAT and AT A respectively. Here, A is the adjacency matrix of the graph G = (S, A), as defined in the chapter.

4.       Propose an alternative to the ranking SVM based on logistic regression. Discuss how you would formulate the optimization problem and how the stochastic gradientdescent steps are related to traditional logistic regression.

find the cost of your paper

Suggest a modification of the binary search algorithm that emulates this strategy for a list of names.

1. Suppose that a list contains the values 20 44 48 55 62 66 74 88 93 99 at index positions 0 through 9. Trace the values of the variables….

Explain why insertion sort works well on partially sorted lists.

1. Which configuration of data in a list causes the smallest number of exchanges in a selection sort? Which configuration of data causes the largest number of exchanges? 2. Explain….

Draw a class diagram that shows the relationships among the classes in this new version of the system

Jack decides to rework the banking system, which already includes the classes BankView, Bank, SavingsAccount, and RestrictedSavingsAccount. He wants to add another class for checking accounts. He sees that savings….