Sciweavers

1013 search results - page 28 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
ICGI
2004
Springer
14 years 1 months ago
Identifying Clusters from Positive Data
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
John Case, Sanjay Jain, Eric Martin, Arun Sharma, ...
CLUSTER
2004
IEEE
13 years 11 months ago
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
Hashim H. Mohamed, Dick H. J. Epema
PICS
1998
13 years 9 months ago
Quantifying Perceptual Image Quality
This paper describes a more efficient paired comparison method that reduces the number of trials necessary for converting a table of paired comparisons into scalar data. Instead o...
D. Amnon Silverstein, Joyce E. Farrell
SDM
2003
SIAM
110views Data Mining» more  SDM 2003»
13 years 9 months ago
Mixture Models and Frequent Sets: Combining Global and Local Methods for 0-1 Data
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
Jaakko Hollmén, Jouni K. Seppänen, Hei...
KDD
1999
ACM
117views Data Mining» more  KDD 1999»
13 years 12 months ago
Identifying Distinctive Subsequences in Multivariate Time Series by Clustering
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
Tim Oates