Sciweavers

388 search results - page 11 / 78
» Reconstructing Many Partitions Using Spectral Techniques
Sort
View
ICDM
2003
IEEE
98views Data Mining» more  ICDM 2003»
14 years 25 days ago
On the Privacy Preserving Properties of Random Data Perturbation Techniques
Privacy is becoming an increasingly important issue in many data mining applications. This has triggered the development of many privacy-preserving data mining techniques. A large...
Hillol Kargupta, Souptik Datta, Qi Wang, Krishnamo...
ICMLA
2008
13 years 9 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 months ago
Kernel k-means: spectral clustering and normalized cuts
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...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
JMLR
2010
147views more  JMLR 2010»
13 years 2 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
FC
2007
Springer
147views Cryptology» more  FC 2007»
13 years 11 months ago
Certificate Revocation Using Fine Grained Certificate Space Partitioning
A new certificate revocation system is presented. The basic idea is to divide the certificate space into several partitions, the number of partitions being dependent on the PKI en...
Vipul Goyal