Extremely fast K-Means for big data
이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
KMeans for big data using preconditioning and sparsification, Matlab implementation. This has three main features:
(1) it has good code: same accuracy and 100x faster than Matlab's K-means for some cases. It also incorporates the latest research, such as using K-Means++ for the initialization (Note: Matlab's R2015 K-Means now uses K-Means++ too). The code is well-documented and conforms to the conventions of Matlab's K-means function when possible.
(2) optionally, you can enable the precondition-and-sample feature which is a novel method to allow efficient processing when the datasets are extremely large and slow to work with.
(3) for datasets that are a few TB in size, you can use the read-from-disk option so that the entire matrix is never loaded into RAM all at once.
Installation is easy; run `setup_kmeans.m` and it will install the mex files for you if necessary, and setup the appropriate paths.
인용 양식
Stephen Becker (2026). Sparsified K-Means (https://github.com/stephenbeckr/SparsifiedKMeans), GitHub. 검색 날짜: .
GitHub 디폴트 브랜치를 사용하는 버전은 다운로드할 수 없음
| 버전 | 퍼블리시됨 | 릴리스 정보 | Action |
|---|---|---|---|
| 1.0.0.0 | Fixed typos in the description, no change to code (but github version is updated regularly) |
