Sciweavers

446 search results - page 46 / 90
» Randomization in Privacy-Preserving Data Mining
Sort
View
EDM
2009
116views Data Mining» more  EDM 2009»
13 years 7 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan
NIPS
2008
13 years 11 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 10 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
14 years 10 months ago
Constrained optimization for validation-guided conditional random field learning
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...
Minmin Chen, Yixin Chen, Michael R. Brent, Aaron E...
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
14 years 1 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing