Skip to Main Content
ASME Press Select Proceedings

International Conference on Computer and Computer Intelligence (ICCCI 2011)

Yi Xie
Yi Xie
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

In this paper we propose an improvement to the clustering heuristic algorithm K-means. This improvement has been tested with databases of breast cancer. Today, clustering problems are everywhere; we can see its application in data mining, learning machines, knowledge discovery, data compression, pattern recognition, among others. One of the most popular and used clustering methods is the K -means , on this algorithm has been worked hard, basically have made several improvements, many of these base d on the definition of the initial parameters. In contrast, this paper proposes a ne w function to calculate the distance; this improvement comes from the experimental analysis of the classical algorithm. Experimentally, the improved algorithm showed a better quality solution being applied to population databases of breast cancer. Finally, we believe that this improvement may be useful in many types of applications, so this application can serve as a support tool for research on breast cancer and as a decision making in the allocation of resources for prevention and treatment.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal