Line 1: Line 1:
 
'''Graph Theory Clustering'''
 
'''Graph Theory Clustering'''
 +
 
dataset {x1, x2, ... , xd} no feature vector given.
 
dataset {x1, x2, ... , xd} no feature vector given.
 +
 
given dist(xi, xj)
 
given dist(xi, xj)
  
 
Construct a graph:
 
Construct a graph:
 +
 
node represents the objects.
 
node represents the objects.
 +
 
edges are relations between objects.
 
edges are relations between objects.
 +
 
edge weights represents distances.
 
edge weights represents distances.

Revision as of 10:26, 8 April 2008

Graph Theory Clustering

dataset {x1, x2, ... , xd} no feature vector given.

given dist(xi, xj)

Construct a graph:

node represents the objects.

edges are relations between objects.

edge weights represents distances.

Alumni Liaison

Abstract algebra continues the conceptual developments of linear algebra, on an even grander scale.

Dr. Paul Garrett