Sciweavers

238 search results - page 46 / 48
» A Constraint Learning Algorithm for Blind Source Separation
Sort
View
CPAIOR
2006
Springer
13 years 11 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
INFORMS
1998
100views more  INFORMS 1998»
13 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 8 months ago
Predicting customer shopping lists from point-of-sale purchase data
This paper describes a prototype that predicts the shopping lists for customers in a retail store. The shopping list prediction is one aspect of a larger system we have developed ...
Chad M. Cumby, Andrew E. Fano, Rayid Ghani, Marko ...
CIKM
2010
Springer
13 years 6 months ago
Collaborative Dual-PLSA: mining distinction and commonality across multiple domains for text classification
:  Collaborative Dual-PLSA: Mining Distinction and Commonality across Multiple Domains for Text Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhon...
Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yu...
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 7 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh