Using Pattern Search Methods for Minimizing Clustering Problems
Clustering is one of an interesting data mining topics that can be applied in many fields. Recently, the problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization,and an algorithm for solving the cluster analysis problem based on nonsmooth optimization techniques i...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Article |
| 语言: | English |
| 出版: |
World Academy of Science, ENG and Technology (WASET)
2010
|
| 主题: | |
| 在线阅读: | http://psasir.upm.edu.my/id/eprint/17551/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | Clustering is one of an interesting data mining topics
that can be applied in many fields. Recently, the problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization,and an algorithm for solving the cluster analysis problem based on nonsmooth optimization techniques is developed. This optimization problem has a number of characteristics that make it
challenging: it has many local minimum, the optimization variables can be either continuous or categorical, and there are no exact analytical derivatives. In this study we show how to apply a particular class of optimization methods known as pattern search methods to address these challenges. These methods do not explicitly use derivatives, an important feature that has not been addressed in previous studies. Results of numerical experiments are presented which demonstrate the effectiveness of the proposed method. |
|---|