Maximum Volume Clustering
نویسندگان
چکیده
The large volume principle proposed by Vladimir Vapnik, which advocates that hypotheses lying in an equivalence class with a larger volume are more preferable, is a useful alternative to the large margin principle. In this paper, we introduce a clustering model based on the large volume principle called maximum volume clustering (MVC), and propose two algorithms to solve it approximately: a soft-label and a hard-label MVC algorithms based on sequential quadratic programming and semi-definite programming, respectively. Our MVC model includes spectral clustering and maximum margin clustering as special cases, and is substantially more general. We also establish the finite sample stability and an error bound for soft-label MVC method. Experiments show that the proposed MVC approach compares favorably with state-of-the-art clustering algorithms.
منابع مشابه
Maximum volume clustering: a new discriminative clustering approach
The large volume principle proposed by Vladimir Vapnik, which advocates that hypotheses lying in an equivalence class with a larger volume are more preferable, is a useful alternative to the large margin principle. In this paper, we introduce a new discriminative clustering model based on the large volume principle called maximum volume clustering (MVC), and then propose two approximation schem...
متن کاملAutomatic Segmentation of the Gross Tumor Volume in Prostate Carcinoma Using Fuzzy Clustering in Gallium-68 PSMA PET/CT Scan
Introduction: Modern radiotherapy (RT) techniques allow a highly precise deposition of the radiation dose in tumor. So, high conformal tumor doses can be reached while sparing critical organs at risk. Materials and Methods: This study was conducted in three phases. In the first phase; Fourteen patients with primary or recurrent prostate cancer receive Gallium-...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملA Multi-Objective Approach to Fuzzy Clustering using ITLBO Algorithm
Data clustering is one of the most important areas of research in data mining and knowledge discovery. Recent research in this area has shown that the best clustering results can be achieved using multi-objective methods. In other words, assuming more than one criterion as objective functions for clustering data can measurably increase the quality of clustering. In this study, a model with two ...
متن کاملA Survey on Exact and Approximation Algorithms for Clustering
Given a set of point P in Rd, a clustering problem is to partition P into k subsets {P1, P2, · · · , Pk} in such a way that a given objective function is minimized. The most studied cost functions for a cluster, μ(Pi), are maximum or average radius of Pi, maximum diameter of Pi, and maximum width of Pi. The overall objective function is ⊕ μ(Pi), where ⊕ is typically the Lp-norm operator. The mo...
متن کامل