Implementation of Genetic Algorithm in K Mean Algorithm

Question

1.00/5 (1 vote)

See more:

Hi
I need to implement genetic algorithm in K Mean algorithm to choose initial cluster.
Please provide me any Idea as I am very new in it.

Posted 5-Nov-13 16:25pm

Danish Shamshad

Add a Solution

Comments

Sergey Alexandrovich Kryukov 6-Nov-13 0:30am

Idea? Idea of what? You already told us the idea, the rest is the known algorithm. What are your concerns?
And — are you serious? — no platform, no language, no nothing...
You are probably at wrong forum... :-)
—SA

Danish Shamshad 7-Nov-13 13:13pm

Hi Sergey
I have a list of point(x,y) I need to select n cluster.
I need solution in c# or in c language.
I need the basic idea how to start and where to start

Sergey Alexandrovich Kryukov 7-Nov-13 13:29pm

Start with reading on the algorithm description and also on cluster analysis.
—SA

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Arnaldo P. Castaño · Answer 1 · 2013-11-07T03:10:00

The genetic algorithm is a metaheuristic, specifically a population based metaheuristic. The algorithm is divided into 4 stages which are.

1-Create initial population (randomly)
2-Select parents.
3-Create offspring from parents using operators of mutation and reproduction.
4-From parents and offspring create new population.
5-Go to step 2 until a stopping criteria has been reached.

If you are using the GA for clustering then you should give a codification, to every individual in the population, of course every individual will be a clustering. Using GA to generate an initial solution in a KMeans is a good idea.