Sciweavers

4039 search results - page 94 / 808
» A Method for Dynamic Clustering of Data
Sort
View
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 8 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
ICPP
2000
IEEE
15 years 8 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
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
16 years 5 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
ICCV
2007
IEEE
16 years 6 months ago
Noise Robust Spectral Clustering
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
Zhenguo Li, Jianzhuang Liu, Shifeng Chen, Xiaoou T...
EGPGV
2004
Springer
175views Visualization» more  EGPGV 2004»
15 years 9 months ago
Interactive Parallel Visualization of Large Particle Datasets
This paper presents a new interactive parallel method for direct visualization of large particle datasets. Based on a parallel rendering cluster, a frame rate of 9 frames-per-seco...
Kevin Liang, Patricia Monger, Huge Couchman