Sciweavers

2497 search results - page 281 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
GROUP
2010
ACM
15 years 2 months ago
Design, implementation, and evaluation of an approach for determining when programmers are having difficulty
Previous research has motivated the idea of automatically determining when programmers are having difficulty, provided an initial algorithm (unimplemented in an actual system), an...
Jason Carter, Prasun Dewan
KDD
2008
ACM
199views Data Mining» more  KDD 2008»
16 years 4 months ago
Building semantic kernels for text classification using wikipedia
Document classification presents difficult challenges due to the sparsity and the high dimensionality of text data, and to the complex semantics of the natural language. The tradi...
Pu Wang, Carlotta Domeniconi
PKDD
2010
Springer
162views Data Mining» more  PKDD 2010»
15 years 2 months ago
Expectation Propagation for Bayesian Multi-task Feature Selection
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
Daniel Hernández-Lobato, José Miguel...
ICDM
2010
IEEE
128views Data Mining» more  ICDM 2010»
15 years 2 months ago
User-Based Active Learning
Active learning has been proven a reliable strategy to reduce manual efforts in training data labeling. Such strategies incorporate the user as oracle: the classifier selects the m...
Christin Seifert, Michael Granitzer
DMIN
2009
222views Data Mining» more  DMIN 2009»
15 years 2 months ago
P-Sensitive K-Anonymity for Social Networks
-- The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in th...
Roy Ford, Traian Marius Truta, Alina Campan