Sciweavers

446 search results - page 69 / 90
» Randomization in Privacy-Preserving Data Mining
Sort
View
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
13 years 24 days ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
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...
Yunlong He, Renato Monteiro, Haesun Park
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 10 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
14 years 10 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
ICDM
2009
IEEE
211views Data Mining» more  ICDM 2009»
14 years 4 months ago
Discovering Organizational Structure in Dynamic Social Network
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
Jiangtao Qiu, Zhangxi Lin, Changjie Tang, Shaojie ...
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
13 years 11 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire