12. The leader algorithm (Hartigan C4) represents each cluster using a point, kn
ID: 3779680 • Letter: 1
Question
12. The leader algorithm (Hartigan C4) represents each cluster using a point, known as a leader, and assigns each point to the cluster corresponding to the closest leader, unless this distance is above a user-specified threshold. In that case, the point becomes the leader of a new cluster Note that the algorithm described here is not quite the leader algorithm described in Hartigan, which assigns a point to the first leader that is within the threshold distance. The answers apply to the algorithm as stated in the problem. (a) What are the advantages and disadvantages of the leader algorithm as compared to K-means?Explanation / Answer
Advantages of leader algorithm
1.much reactiveto the market needs.
2.enlarges the financial clarity.
3.much enterpreneurial
4.produces enhanced level of inspiration and eagerness.
5.encourages distributed knowledge and decreases the likielihood of single person clitching ley information
6. aggreable manner to handle required complicated demands.
Disadvantages of leader algorithm
1.it deprecates the leadership place.
2.targets for leadership growth will decrease.
3.decision-making process is moderately decreases due to the participation of many people.
[B]The ways to improve the leader algorithm are as below
1.high ordered link based cyclic relationships:A couple of web pages P1 and P0 are involves direct link based cyclic relationships forms a link to the p1 and P1 forms a link whichmentions a 1 st ordered link based cyclic relationships.being this kind of reltionship is known as nth relationship .
2.Artificial link based similarity relationship:these are placed among the web pages depending on the pacified similarity whatever may be the hyperlink among them.a dictionary is utilized to tire them.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.