504 search results - page 70 / 101 » PCS: An Efficient Clustering Method for High-Dimensional Dat... |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Markov models have been widely utilized for modelling user web navigation behaviour. In this work we propose a dynamic clustering-based method to increase a Markov model's ac...
ECML
2005
Springer
13 years 9 months ago
2005
Springer
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
DAC
2001
ACM
14 years 8 months ago
2001
ACM
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...