Image Home
Image People
Image Publication
Image Applications
Image Data & Code
Image Library
Image Seminar
Image Link
Image Album



Search LAMDA
»

LGMMC

Description: LGMMC is a package for maximum margin based clustering. The package includes the MATLAB code of the algorithm LG-MMC. There are two kinds of codes. One is used for small data with linear and rbf kernel. The other is used for large scale data with linear kernel only. It is very easy to implement LG-MMC in these two setting. You just need to read/run experiment.m file in the package. Moreover, we include two simple data sets as examples.

Reference: Y.-F. Li, I. W. Tsang, J. T. Kwok, and Z.-H. Zhou. Tighter and convex maximum margin clustering. In: Proceedings of the 12th International Conference on Artificial Intelligence and Statistics (AISTATS'09), Clearwater Beach, FL, 2009, 328-335.

ATTN: This package is free for academic usage. You can run it at your own risk. For other purposes, please contact Prof. Zhi-Hua Zhou (zhouzh@nju.edu.cn).

Requirement: This package was developed with MATLAB and C++. In particular, this package includes a new software LG-MMC C++, you need to first run make.m file to complier the C++ files (just like libsvm).

ATTN2: This package was developed by Mr. Yu-Feng Li (liyf@lamda.nju.edu.cn). For any problem concerning the code, please feel free to contact Mr. Li.



Download: code (816KB)
  Name Size
- LGMMC_v2.rar 246.71 KB

Image
PoweredBy
(for FireFox 3+ and IE 7+)
Contact LAMDA: (email) contact@lamda.nju.edu.cn (tel) +86-25-89685926. © LAMDA, 2016