Sciweavers

3245 search results - page 457 / 649
» Mining Transformed Data Sets
Sort
View
ICDM
2010
IEEE
105views Data Mining» more  ICDM 2010»
15 years 4 months ago
On the Vulnerability of Large Graphs
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
Hanghang Tong, B. Aditya Prakash, Charalampos E. T...
ICDM
2010
IEEE
142views Data Mining» more  ICDM 2010»
15 years 4 months ago
Causal Discovery from Streaming Features
In this paper, we study a new research problem of causal discovery from streaming features. A unique characteristic of streaming features is that not all features can be available ...
Kui Yu, Xindong Wu, Hao Wang, Wei Ding
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 4 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
EDM
2009
120views Data Mining» more  EDM 2009»
15 years 4 months ago
Improving Student Question Classification
Students in introductory programming classes often articulate their questions and information needs incompletely. Consequently, the automatic classification of student questions to...
Cecily Heiner, Joseph L. Zachary