Rank: 343194 based on 0 downloads (last 30 days) and 0 file submitted
photo

subrajeet

E-mail
Company/University
National Institute of Technology, Rourkela

Personal Profile:

PhD Scholar, National Institute of Technology, Rourkela


 

Watch this Author's files

 

Comments and Ratings by subrajeet View all
Updated File Comments Rating
19 Nov 2011 Snake : Active Contour Snake Segmentation (Kass et al), 2D/3D including GVF and balloon force (Easy to read code) Author: Dirk-Jan Kroon

25 Oct 2010 kmeans clustering Fully vectorized kmeans algorithm. Fast yet simple (10 lines) Author: Mo Chen

Even if we choose the cluster centers initially still there is no guarantee that we will get the same clusters every time.
There is one paperon this and a specific clustering technique to solve this problem But I am unable to code it properly. Can you have a look on this algorithm called Quality Threshold (QT) based clustering.

Heyer, L. J., Kruglyak, S., Yooseph, S. (1999). Exploring expression
% data: Identification and analysis of coexpressed genes. Genome Research
% 9, 1106–1115.
%
% http://genome.cshlp.org/content/9/11/1106.full
% http://genome.cshlp.org/content/9/11/1106/F5.large.jpg

24 Oct 2010 kmeans clustering Fully vectorized kmeans algorithm. Fast yet simple (10 lines) Author: Mo Chen

Thanks for the posting Michael. I have a small query is thery any clustering technique by which the cluster results will remain same everytime we run the code.
Please kindly tell.

Contact us