图 书 馆
最小平均成本聚类Minimum Average Cost Clustering |
|
| 课程网址: | http://videolectures.net/nips2010_nagano_macc/ |
| 主讲教师: | Kiyohito Nagano |
| 开课单位: | 东京工业大学 |
| 开课时间: | 2011-03-25 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | A number of objective functions in clustering problems can be described with submodular functions. In this paper, we introduce the minimum average cost criterion, and show that the theory of intersecting submodular functions can be used for clustering with submodular objective functions. The proposed algorithm does not require the number of clusters in advance, and it will be determined by the property of a given set of data points. The minimum average cost clustering problem is parameterized with a real variable, and surprisingly, we show that all information about optimal clusterings for all parameters can be computed in polynomial time in total. Additionally, we evaluate the performance of the proposed algorithm through computational experiments. |
| 关 键 词: | 子模块函数; 最小平均成本; 最佳聚类 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-10-22：chenxin |
| 阅读次数: | 86 |