Sciweavers

2020 search results - page 199 / 404
» KDD Process Planning
Sort
View
ICASSP
2007
IEEE
15 years 11 months ago
Fast Line-Based Imaging of Small Sample Features
This project aims to reduce the time required to attain more detailed scans of small interesting regions present in a quick first-pass sample image. In particular, we concentrate...
Mark A. Iwen, Gurjit S. Mandair, Michael D. Morris...
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 5 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
160
Voted
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 5 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 5 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
151
Voted
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
16 years 5 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...