Karthika, D. and Kalaiselvi, Dr.K. (2019) ISVS3CE: Incremental Support Vector Semi-Supervised Subspace Clustering Ensemble and ENhanced Bat Algorithm (ENBA) for High Dimensional Data Clustering. International Journal of Recent Technology and Engineering (IJRTE), 8 (2). pp. 930-939. ISSN 22773878
![[thumbnail of B1724078219.pdf]](https://ir.vistas.ac.in/style/images/fileicons/archive.png)
B1724078219.pdf
Download (774kB)
Abstract
ISVS3CE: Incremental Support Vector Semi-Supervised Subspace Clustering Ensemble and ENhanced Bat Algorithm (ENBA) for High Dimensional Data Clustering Research Scholar , Department of Computer Science, VELS Institute of Science, Technology & Advanced Studies (Formerly VELS University), Chennai, India D. Karthika Dr.K. Kalaiselvi Professor& Head, Department of Computer Science, VELS Institute of Science, Technology & Advanced Studies (Formerly VELS University), Chennai, India
In the recent work, Incremental Soft Subspace Based Semi-Supervised Ensemble Clustering (IS4EC) framework was proposed which helps in detecting clusters in the dataset. IS4EC framework also increases the results of clustering by reducing the intra-cluster distance and increasing the inter-cluster distance with increased cluster quality. It cannot attain acceptable results while handling high dimensional data. However, decreasing the dimensional subspace becomes extremely difficult issue. In IS4EC framework, to choose the optimal ensemble members also extremely becomes challenging issue. In order to solve these issues of traditional cluster ensemble methods, first propose an Incremental Support vector Semi-Supervised Subspace Clustering Ensemble (ISVS3CE) framework which makes utilized of benefits of the random subspace algorithm and the Constraint Propagation (CP) algorithm. Here the centroid values were selected by using the Support Vector Machine (SVM) classifier. In the ISVS3CE framework, Incremental Ensemble Member Chosen (IEMC) process is performed by using the ENhanced Bat Algorithm (ENBA), and the normalized cut algorithm is introduced to perform high dimensional data clustering. The ISVS3CE framework is successful for solving high dimensional data issue, at the same time as the CP algorithm is valuable for incorporating the prior information. Results demonstrate that the proposed ISVS3CE framework performs well on datasets by means of very high dimensionality, and better than the traditional clustering ensemble methods.
07 30 2019 930 939 CC-BY-NC-ND 4.0 10.35940/BEIESP.CrossMarkPolicy www.ijrte.org true 10.35940/ijrte.B1724.078219 https://www.ijrte.org/portfolio-item/B1724078219/ https://www.ijrte.org/wp-content/uploads/papers/v8i2/B1724078219.pdf
Item Type: | Article |
---|---|
Subjects: | Computer Science Engineering > Algorithms |
Divisions: | Computer Science |
Depositing User: | Mr IR Admin |
Date Deposited: | 12 Oct 2024 05:56 |
Last Modified: | 12 Oct 2024 05:56 |
URI: | https://ir.vistas.ac.in/id/eprint/9729 |