377 search results - page 32 / 76 » Assessing Data Mining Results on Matrices with Randomization |
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
We explore in this paper the efficient clustering of item data. Different from those of the traditional data, the features of item data are known to be of high dimensionality and...
IRI
2003
IEEE
14 years 1 months ago
2003
IEEE
– We present a damage pattern mining framework for hurricane data on residential houses using aerial photographs with 1:3000 based scale. The vertical photographs are normally co...