Loading in 5 sec....

Fast PNN-based Clustering Using K -nearest Neighbor GraphPowerPoint Presentation

Fast PNN-based Clustering Using K -nearest Neighbor Graph

- 99 Views
- Uploaded on

Download Presentation
## PowerPoint Slideshow about ' Fast PNN-based Clustering Using K -nearest Neighbor Graph' - laith-rhodes

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

Fast PNN-based Clustering Using K-nearest Neighbor Graph

Pasi Fränti, Olli Virmajoki and Ville Hautamäki

15.11.2003

UNIVERSITY OF JOENSUU

DEPARTMENT OF COMPUTER SCIENCE

FINLAND

Graph-based PNN

- Based on the exact PNN
- Search is limited only to the clusters that are connected by the graph structure
- Reduces the time complexity of every search from O(N) to O(k) (Example: N=4096, k=3-5)

Structure of the Graph-PNN

GraphPNN(X, M)S

FOR i 1 to N DO

si {xi};

FOR DO

Find k nearest neighbors;

REPEAT

(sa, sb) GetNearestClustersInGraph(S);

sab Merge(sa, sb);

Search the k nearest neighbors for sab;

Update the nodes that had sa and sb as neighbors;

UNTIL |S|=M;

(k=3)

Steps

Distance

calculations

Fast PNN

81 960 610

40 166 328

Graph-PNN simple

50 468 663

47 370

Graph-PNN

double linked

517 905

47 413

Observed number of steps and distance calculations for BridgeCreation of nearest neighbor graph

- Brute force O(N 2)
- MPS !
- Divide-and-conquer (to be considered)

Bridge (256256)

d = 16

N = 4096

M = 256

Miss America (360288)

d = 16

N = 6480

M = 256

House (256256)

d = 3

N = 34112

M =256

Image datasetsBIRCH 1

BIRCH 2

BIRCH 3

Time

MSE

Time

MSE

Time

MSE

Fast PNN

Full search

> 4 h

4.73

> 4 h

2.28

> 4 h

1.96

+PDS+MPS+Lazy

2397

4.73

2115

2.28

2316

1.96

Graph-PNN + GLA

Limited search MPS

41

4.64

16

2.28

44

1.90

Comparison of the Graph-PNN (k=5) with other methodsConclusions

- Small neighborhood size (k=3-5) can produce clustering with similar quality to that of full search.
- The number of steps and distance calculations is remarkable lower than that of the exact PNN.
- Graph creation is the bottleneck of the algorithm.

Download Presentation

Connecting to Server..