can anyone write the code for the following algorithm.
my mail is <EMAIL SNIPPED>


Object list = [1,2,3...n], where
n- number of tuples/records
m- number of attributes
Phase I
The steps involved in this phase are detailed
below:
Step 1: Construct a dissimilarity matrix ‘d’
using the measurement in definition2.
Step 2. Compute the threshold value, minimum
dissimilarity of each object,
m(Oj).
Step 3. Construct a neighbour matrix ‘neigh’.
Step 4. Select the first member of an object list,
form a new cluster with this object as a member.
Group the neighbors of object based on the criteria
given in definition 5. Remove the clustered objects
from the object list.
Step 5. Repeat the above step until the object list
becomes empty.
Phase II
The steps involved in merging of clusters are
detailed below:
Step 1: Select the cluster with least number of
objects.
Step 2. The objects in the selected cluster are
relocated based on the Cluster Merging Criteria.
(Definition 6.)
Step 3. The above steps are repeated until no
more merging is possible.
Phase III
Compute the mode of each column or attribute of
all objects in each cluster. If the number of cluster
produced in Phase II is ‘K1’, then this phase results in
‘K1’ tuples. Consider this as a dataset with “K1”
tuples with ‘m’ attributes and repeat Phase I and
Phase II.

Edited 6 Years Ago by peter_budo: Keep It On The Site - Do not post asking for an answer to be sent to you via email or PM.

We aren't going to do your homework for you. And really, if you can't even do your computer science homework without copying someone else, you don't belong in the industry. Do this field a favor and switch majors, unless you're ready to pull your weight.

Even if we wanted to give hints in order to get you started, the description you posted is impossible you understand:

Construct a dissimilarity matrix ‘d’
using the measurement in definition2.

What is this suppose to mean?! Don't assume that we are in your class and know what you are talking about.

And don't post your email, it is against the forum rules. Also if you want some help start by showing what you have so far.

Comments
We aren't in their class - unfortunately, they're not in their class either ;)
This article has been dead for over six months. Start a new discussion instead.