1 / 1

Rek-means A k-means Based Clustering Algorithm

Domenico Daniele Bloisi and Luca Iocchi Sapienza University of Rome Dipartimento di Informatica e Sistemistica via Ariosto 25, 00185 Rome, Italy. Rek-means A k-means Based Clustering Algorithm.

buckminster-prince
Download Presentation

Rek-means A k-means Based Clustering Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Domenico Daniele Bloisi and Luca IocchiSapienza University of RomeDipartimento di Informatica e Sistemisticavia Ariosto 25, 00185 Rome, Italy Rek-means A k-means Based Clustering Algorithm • The Algorithm: Rek-means is a new clustering method based on k-means that has been implemented on the ARGOS video surveillance system in the city of Venice. • K-means limitations: in using k-means, one encounters a major difficulty, i.e., how to choose the k initial clusters. k-means centroids true centroids • Rek-means: The prefix "Re" stands for rectangle. • AD-Test: a validating test is performed using the Anderson-Darling Statistic. • Experiments: several tests show the effectiveness of Rek-means in correctly distinguishing boats that are very close.

More Related