7387 search results - page 992 / 1478 » Knowledge-based data mining |
213
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
221
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
215
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
236
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
186
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...