Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/54623
Title: | Incremental clustering techniques | Authors: | Nian, Xingyu. | Keywords: | DRNTU::Engineering::Electrical and electronic engineering | Issue Date: | 2013 | Abstract: | Recent years have witnessed the explosive growth of online data. Unlike traditional offline data, online data has its unique characteristics: constantly evolving and arriving in streaming manner. Many online clustering methods have been proposed to efficiently handle the online data. In this project, the incremental Spectral Clustering (iSC) algorithm [1] has been researched and implemented. The iSC algorithm can efficiently handle the changes, insertions or deletions of data objects by incrementally updating eigenvalue system. Additionally, some iSC related topics have been explored and implemented, which includes the data grouping technique, the automatic determination of the number of clusters and the clustering result matching. Moreover, this project also studied and implemented the online Non-negative Matrix Factorization (NMF) algorithm [2] to gain more exposure in the field of clustering. Afterwards, various experiments have been conducted to evaluate the above mentioned algorithms and techniques. | URI: | http://hdl.handle.net/10356/54623 | Schools: | School of Electrical and Electronic Engineering | Rights: | Nanyang Technological University | Fulltext Permission: | restricted | Fulltext Availability: | With Fulltext |
Appears in Collections: | EEE Student Reports (FYP/IA/PA/PI) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FYP Report V0.6.pdf Restricted Access | 1.65 MB | Adobe PDF | View/Open |
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.