Sciweavers

1402 search results - page 260 / 281
» Personalized privacy preservation
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
15 years 10 months ago
Extracting discriminative concepts for domain adaptation in text mining
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
Bo Chen, Wai Lam, Ivor Tsang, Tak-Lam Wong
168
Voted
PODS
2009
ACM
119views Database» more  PODS 2009»
15 years 10 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
15 years 10 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
15 years 10 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu