A Novel Algorithm for Fast and Scalable Subspace Clustering of High-Dimensional Data

Journal of Big Data - United Kingdom
doi 10.1186/s40537-015-0027-y
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Density-Connected Subspace Clustering for High-Dimensional Data

2004English

Combination of Difference Subspace and Oppurtunistic Clustering on High Dimensional Data

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2014English

Cross Breed Clustering Algorithm for High Dimensional Data

International Journal of Innovative Technology and Exploring Engineering
Mechanics of MaterialsElectronic EngineeringCivilStructural EngineeringElectricalComputer Science
2019English

An Efficient Density Parameter-Light in Enhanced Subspace Clustering in High Dimensional Data

International Journal of Advanced Science and Technology
EnergyEngineeringComputer Science
2019English

Scalable Collaborative Targeted Learning for High-Dimensional Data

Statistical Methods in Medical Research
Health Information ManagementEpidemiologyStatisticsProbability
2017English

Scalable Visualization for High-Dimensional Single-Cell Data

2016English

Distance Based K-Means Clustering Algorithm for Determining Number of Clusters for High Dimensional Data

Decision Science Letters
Decision Sciences
2020English

Analyzing High-Dimensional Data by Subspace Validity

English

A Scalable K-Hop Clustering Algorithm for Pseudolinear MANET

International Journal of Computer Applications
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy