Document Details

Document Type : Article In Journal 
Document Title :
on convergence theorem
على نظرية التقارب
 
Subject : on convergence theorem 
Document Language : English 
Abstract : The K-means algorithm is a commonly used technique in cluster analysis. In this paper, several questions about the algorithm are addressed. The clustering problem is first cast as a nonconvex mathematical program. Then, a rigorous proof of the finite convergence of the K-means-type algorithm is given for any metric. It is shown that under certain conditions the algorithm may fail to converge to a local minimum, and that it converges under differentiability conditions to a Kuhn-Tucker point. Finally, a method for obtaining a local-minimum solution is given. 
ISSN : 1138-8927 
Journal Name : Mathematical Sciences and Applications. 
Volume : 15 
Issue Number : 1 
Publishing Year : 1422 AH
2002 AD 
Article Type : Article 
Added Date : Wednesday, March 20, 2013 

Researchers

Researcher Name (Arabic)Researcher Name (English)Researcher TypeDr GradeEmail
سهام جلال الصيادsayad, Siham Investigator  

Files

File NameTypeDescription
 35278.pdf pdf 

Back To Researches Page