Semisupervised clustering algorithm combining SUBCLU and constrained clustering for detecting groups in high dimensional datasets
সংরক্ষণ করুন:
| লেখক: | , |
|---|---|
| বিন্যাস: | artículo original |
| বর্তমান অবস্থা: | Versión publicada |
| প্রকাশনার তারিখ: | 2018 |
| বিবরন: | High dimensional data poses a challenge to traditional clustering algorithms, where the similarity measures are not meaningful, affecting the quality of the groups. As a result, subspace clustering algorithms have been proposed as an alternative, aiming to find all groups in all spaces of the dataset.By detecting groups on lower dimensional spaces, each group may belong to different subspaces of the original dataset. Therefore, attributes the user considers of interest may be excluded in some or all groups, decreasing the value of the result for the data analysts.In this project, a new algorithm is proposed, that combines SUBCLU and the clustering algorithms by constraint, which allows the users to identify variables as attributes of interest based on prior knowledge of domain, targeting direct group detection toward spaces that include user’s attributes of interest, and thereafter, generating more meaningful groups. |
| দেশ: | Portal de Revistas TEC |
| প্রতিষ্ঠান: | Instituto Tecnológico de Costa Rica |
| Repositorio: | Portal de Revistas TEC |
| ভাষা: | Español |
| OAI Identifier: | oai:ojs.pkp.sfu.ca:article/3904 |
| অনলাইন ব্যবহার করুন: | https://revistas.tec.ac.cr/index.php/tec_marcha/article/view/3904 |
| মুখ্য শব্দ: | Data mining subspaces SUBCLU clustering clustering by constraint Minería de datos subespacios algoritmo de agrupamiento agrupamiento por restricciones. |