Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronic Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

Single Linkage Clustering by SIBSON

payel54

Newbie level 1
Joined
Aug 28, 2019
Messages
1
Helped
0
Reputation
0
Reaction score
0
Trophy points
1
Activity points
8
The Single Linkage algorithm by SIBSON named SLINK gives time complexity of O(n2) and space complexity of O(n).Is there anyone who can explain me that how the distance updation part of SLINK is done after merging 2 clusters .Say suppose , a,b,v,d,e are 5 points .We are creating the Av,Ad array by forming the distance matrix only once .Now after merging say aUb , the algorithm says it finds the nearest neighbour of aUb.But it does not store the distance matrix to reduce space complexity , then how can it determine the nearest neighbour of aUb?
 

Toggle Sidebar

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Top