Sciweavers

282 search results - page 49 / 57
» Optimal randomization for privacy preserving data mining
Sort
View
PKDD
2009
Springer
153views Data Mining» more  PKDD 2009»
14 years 2 months ago
Subspace Regularization: A New Semi-supervised Learning Method
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
Yan-Ming Zhang, Xinwen Hou, Shiming Xiang, Cheng-L...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 8 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
ICDM
2009
IEEE
126views Data Mining» more  ICDM 2009»
14 years 2 months ago
Convex Non-negative Matrix Factorization in the Wild
Abstract—Non-negative matrix factorization (NMF) has recently received a lot of attention in data mining, information retrieval, and computer vision. It factorizes a non-negative...
Christian Thurau, Kristian Kersting, Christian Bau...
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
14 years 2 months ago
Load Shedding for Window Joins on Multiple Data Streams
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
Yan-Nei Law, Carlo Zaniolo
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
13 years 9 months ago
Adaptive Informative Sampling for Active Learning
Many approaches to active learning involve periodically training one classifier and choosing data points with the lowest confidence. An alternative approach is to periodically cho...
Zhenyu Lu, Xindong Wu, Josh Bongard