arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1709.06444cs.LG
收藏

基于预算的可扩展支持向量聚类

Scalable Support Vector Clustering Using Budget

Faculty of Information Technology, VNUHCM-University of Science(越南国立大学胡志明市分校自然科学大学信息技术学院);Centre for Pattern Recognition and Data Analytics, Deakin University(迪肯大学模式识别与数据分析中心)

Tung Pham, Trung Le, Hang Dang

摘要:

基于支持度的聚类由于其在解决复杂多样的聚类或孤立点检测问题中的应用,近年来引起了广泛的关注。基于支持度的聚类方法通常要经历两个阶段:发现新的领域和进行聚类分配。为了找到新颖的域,当前求解器给出的训练时间通常在训练大小上超过二次,因此排除了对大规模数据集使用基于支持度的聚类方法。在本文中,我们提出了应用随机梯度下降(SGD)框架的第一阶段的支持为基础的聚类发现域的新颖性和一个新的策略来执行聚类分配。然而,直接将SGD应用于基于支持度的聚类的第一阶段容易受到核化的诅咒,即模型大小随时间推移积累的数据大小线性增长。为了解决这个问题,我们调用预算方法,它允许我们将模型大小限制在一个小的预算。我们的聚类分配新策略通过将完整训练集上的聚类分配任务减少到一个显着更小的集合上的相同任务来实现快速计算。我们还提供了一个严格的理论分析所提出的方法的收敛速度。最后,我们验证了我们提出的方法在著名的数据集聚类显示,所提出的方法提供了一个可比的聚类质量,同时实现显着的加速与基线相比。

英文摘要:

Owing to its application in solving the difficult and diverse clustering or outlier detection problem, support-based clustering has recently drawn plenty of attention. Support-based clustering method always undergoes two phases: finding the domain of novelty and performing clustering assignment. To find the domain of novelty, the training time given by the current solvers is typically over-quadratic in the training size, and hence precluding the usage of support-based clustering method for large-scale datasets. In this paper, we propose applying Stochastic Gradient Descent (SGD) framework to the first phase of support-based clustering for finding the domain of novelty and a new strategy to perform the clustering assignment. However, the direct application of SGD to the first phase of support-based clustering is vulnerable to the curse of kernelization, that is, the model size linearly grows up with the data size accumulated overtime. To address this issue, we invoke the budget approach which allows us to restrict the model size to a small budget. Our new strategy for clustering assignment enables a fast computation by means of reducing the task of clustering assignment on the full training set to the same task on a significantly smaller set. We also provide a rigorous theoretical analysis about the convergence rate for the proposed method. Finally, we validate our proposed method on the well-known datasets for clustering to show that the proposed method offers a comparable clustering quality while simultaneously achieving significant speedup in comparison with the baselines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑