Sciweavers

89 search results - page 4 / 18
» A Fast Algorithm for Finding Correlation Clusters in Noise D...
Sort
View
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
14 years 7 days ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
SAC
2004
ACM
14 years 1 months ago
Time-frequency feature detection for time-course microarray data
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...
Jiawu Feng, Paolo Emilio Barbano, Bud Mishra
DATAMINE
1999
113views more  DATAMINE 1999»
13 years 7 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 9 months ago
Finding Time-Lagged 3D Clusters
Existing 3D clustering algorithms on gene ? sample ? time expression data do not consider the time lags between correlated gene expression patterns. Besides, they either ignore the...
Xin Xu, Ying Lu, Kian-Lee Tan, Anthony K. H. Tung
BMCBI
2006
136views more  BMCBI 2006»
13 years 8 months ago
Metric for Measuring the Effectiveness of Clustering of DNA Microarray Expression
Background: The recent advancement of microarray technology with lower noise and better affordability makes it possible to determine expression of several thousand genes simultane...
Raja Loganantharaj, Satish Cheepala, John Clifford