Sciweavers

446 search results - page 36 / 90
» Randomization in Privacy-Preserving Data Mining
Sort
View
SADM
2011
13 years 4 months ago
Random survival forests for high-dimensional data
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...
Hemant Ishwaran, Udaya B. Kogalur, Xi Chen, Andy J...
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
14 years 3 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
KDD
1998
ACM
193views Data Mining» more  KDD 1998»
14 years 2 months ago
Methods for Linking and Mining Massive Heterogeneous Databases
Manyreal-world KDDexpeditions involve investigation of relationships betweenvariables in different, heterogeneousdatabases. Wepresent a dynamic programmingtechnique for linking re...
José C. Pinheiro, Don X. Sun
SDM
2010
SIAM
146views Data Mining» more  SDM 2010»
13 years 11 months ago
Evaluating Query Result Significance in Databases via Randomizations
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
Markus Ojala, Gemma C. Garriga, Aristides Gionis, ...
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 4 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...