Sciweavers

502 search results - page 52 / 101
» Learning from General Label Constraints
Sort
View
WWW
2007
ACM
14 years 9 months ago
Learning information intent via observation
Workers in organizations frequently request help from assistants by sending request messages that express information intent: an intention to update data in an information system....
Anthony Tomasic, Isaac Simmons, John Zimmerman
ICCV
2005
IEEE
14 years 2 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
ICASSP
2011
IEEE
13 years 12 days ago
Low-rank matrix completion by variational sparse Bayesian learning
There has been a significant interest in the recovery of low-rank matrices from an incomplete of measurements, due to both theoretical and practical developments demonstrating th...
S. Derin Babacan, Martin Luessi, Rafael Molina, Ag...
CONSTRAINTS
1998
62views more  CONSTRAINTS 1998»
13 years 8 months ago
Learning Game-Specific Spatially-Oriented Heuristics
This paper describes an architecture that begins with enough general knowledge to play any board game as a novice, and then shifts its decision-making emphasis to learned, game-sp...
Susan L. Epstein, Jack Gelfand, Esther Lock