Sciweavers

2027 search results - page 253 / 406
» Learning and Generalization with the Information Bottleneck
Sort
View
CIKM
2005
Springer
16 years 1 days ago
Query expansion using random walk models
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
Kevyn Collins-Thompson, Jamie Callan
WWW
2006
ACM
16 years 7 months ago
Detecting online commercial intention (OCI)
Understanding goals and preferences behind a user's online activities can greatly help information providers, such as search engine and E-Commerce web sites, to personalize c...
Honghua (Kathy) Dai, Lingzhi Zhao, Zaiqing Nie, Ji...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 7 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
POPL
2010
ACM
16 years 3 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
CVPR
2008
IEEE
16 years 8 months ago
Taylor expansion based classifier adaptation: Application to person detection
Because of the large variation across different environments, a generic classifier trained on extensive data-sets may perform sub-optimally in a particular test environment. In th...
Cha Zhang, Raffay Hamid, Zhengyou Zhang