16 search results - page 2 / 4 » Finding Clusters in subspaces of very large, multi-dimension... |
PAKDD
2007
ACM
14 years 2 months ago
2007
ACM
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
ICDE
2004
IEEE
14 years 10 months ago
2004
IEEE
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
SDM
2003
SIAM
13 years 10 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...