Sciweavers

436 search results - page 5 / 88
» Automatic Subspace Clustering of High Dimensional Data for D...
Sort
View
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
13 years 8 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
CGF
2011
12 years 9 months ago
Visualizing High-Dimensional Structures by Dimension Ordering and Filtering using Subspace Analysis
High-dimensional data visualization is receiving increasing interest because of the growing abundance of highdimensional datasets. To understand such datasets, visualization of th...
Bilkis J. Ferdosi, Jos B. T. M. Roerdink
ICPP
2000
IEEE
13 years 10 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
ECML
2006
Springer
13 years 10 months ago
Subspace Metric Ensembles for Semi-supervised Clustering of High Dimensional Data
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
Bojun Yan, Carlotta Domeniconi
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
11 years 8 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...