Sciweavers

377 search results - page 10 / 76
» Assessing Data Mining Results on Matrices with Randomization
Sort
View
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 5 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
PODS
2003
ACM
156views Database» more  PODS 2003»
14 years 8 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...
ETRICS
2006
14 years 8 days ago
Privacy-Preserving Decision Tree Mining Based on Random Substitutions
Privacy-preserving decision tree mining is an important problem that has yet to be thoroughly understood. In fact, the privacypreserving decision tree mining method explored in the...
Jim Dowd, Shouhuai Xu, Weining Zhang
KDD
2001
ACM
187views Data Mining» more  KDD 2001»
14 years 9 months ago
Random projection in dimensionality reduction: applications to image and text data
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
Ella Bingham, Heikki Mannila
ICDM
2009
IEEE
113views Data Mining» more  ICDM 2009»
14 years 3 months ago
Spatiotemporal Relational Random Forests
Abstract—We introduce and validate Spatiotemporal Relational Random Forests, which are random forests created with spatiotemporal relational probability trees. We build on the do...
Timothy A. Supinie, Amy McGovern, John Williams, J...