387 search results - page 48 / 78 » Mining Approximative Descriptions of Sets Using Rough Sets |
PAKDD
2009
ACM
14 years 3 days ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
VISUALIZATION
1996
IEEE
13 years 11 months ago
1996
IEEE
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
DEXA
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...