What is the number of possible clusterings of a data set of n points into k groups?

1.       What is the number of possible clusterings of a data set of n points into k groups? What does this imply about the convergence behavior of algorithms whose objective function is guaranteed not to worsen from one iteration to the next?

2.       Implement the group-average linkage clustering algorithm.

3.       As discussed in the chapter, explicit feature engineering methods can be made faster and more accurate with Nystr¨om sampling. Spectral clustering has also been presented as a special case of kernel methods with explicit feature engineering in this chapter. Discuss the difficulties in using Nystr¨om sampling with spectral clustering. Can you think of any way of providing a reasonable approximation? [The second part of the question is open-ended without a crisp answer.

find the cost of your paper

Write in essay format not in outline, bulleted, numbered or other list format.  

Write an essay of at least 500 words discussing the reasons for the two new auditing roles in Oracle 12c. Why did Oracle consider them necessary? What problems do they solve?….

Determine an appropriate termination condition (e.g., when cost function is less than a threshold, and/or after a given number of iterations).

 In this problem, we write a program to find the coefficients for a linear regression model for the dataset provided (data2.txt). Assume a linear model: y = w0 + w1*x…..

Explain the 4 ways to authenticate a user and supply an example of each?

Please select 5 questions to answer out of the 10 Provided.  Please submit a word file with your answers.  . Explain what Information Security is? 2. Explain the security triad?….