Sciweavers

528 search results - page 76 / 106
» Structure learning with independent non-identically distribu...
Sort
View
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 8 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
ICML
2010
IEEE
13 years 9 months ago
High-Performance Semi-Supervised Learning using Discriminatively Constrained Generative Models
We develop a semi-supervised learning method that constrains the posterior distribution of latent variables under a generative model to satisfy a rich set of feature expectation c...
Gregory Druck, Andrew McCallum
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
11 years 10 months ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman
CIKM
2011
Springer
12 years 8 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
ICCV
2007
IEEE
14 years 10 months ago
Learning Multiscale Representations of Natural Scenes Using Dirichlet Processes
We develop nonparametric Bayesian models for multiscale representations of images depicting natural scene categories. Individual features or wavelet coefficients are marginally de...
Jyri J. Kivinen, Erik B. Sudderth, Michael I. Jord...