Utilize este identificador para referenciar este registo:
http://hdl.handle.net/10773/16485
Título: | Two-Step-SDP approach to clustering and dimensionality reduction |
Autor: | Macedo, Eloísa |
Palavras-chave: | Data Mining Clustering PCA Semidefinite Programming |
Data: | Set-2015 |
Editora: | International Academic Press |
Resumo: | Inspired by the recently proposed statistical technique called clustering and disjoint principal component analysis (CDPCA), this paper presents a new algorithm for clustering objects and dimensionality reduction, based on Semidefinite Programming (SDP) models. The Two-Step-SDP algorithm is based on SDP relaxations of two clustering problems and on a K-means step in a reduced space. The Two-Step-SDP algorithm was implemented and tested in R, a widely used open source software. Besides returning clusters of both objects and attributes, the Two-Step-SDP algorithm returns the variance explained by each component and the component loadings. The numerical experiments on different data sets show that the algorithm is quite efficient and fast. Comparing to other known iterative algorithms for clustering, namely, the K-means and ALS algorithms, the computational time of the Two-Step-SDP algorithm is comparable to the K-means algorithm, and it is faster than the ALS algorithm. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/16485 |
ISSN: | 2310-5070 |
Versão do Editor: | http://www.iapress.org/index.php/soic/article/view/145 |
Aparece nas coleções: | CIDMA - Artigos OGTCG - Artigos |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
macedo_TwostepSDP_SOIC_open.pdf | posprint | 183.03 kB | Adobe PDF | Ver/Abrir |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.