A Possibilistic Density Based Clustering for Discovering Clusters of Arbitrary Shapes and Densities in High Dimensional Data.
Noha A. YousriMohamed S. KamelMohamed A. IsmailPublished in: ICONIP (3) (2012)
Keyphrases
- high dimensional data
- density based clustering
- clusters of arbitrary shapes
- dimensionality reduction
- high efficiency
- high dimensional
- nearest neighbor
- clustering algorithm
- high dimensionality
- low dimensional
- data sets
- arbitrary shape
- categorical data
- similarity search
- data points
- data analysis
- outlier detection
- data distribution
- dimension reduction
- distributed data mining
- input data
- high dimensional spaces
- high dimensional datasets
- text data
- data structure
- k means
- pattern recognition
- dimensional data
- feature selection