Sciweavers

526 search results - page 34 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
ECCV
2008
Springer
13 years 12 months ago
Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
Junbiao Pang, Qingming Huang, Shuqiang Jiang
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 10 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
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 10 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
SAC
2008
ACM
13 years 9 months ago
Efficient concept clustering for ontology learning using an event life cycle on the web
Ontology learning integrates many complementary techniques, including machine learning, natural language processing, and data mining. Specifically, clustering techniques facilitat...
Sangsoo Sung, Seokkyung Chung, Dennis McLeod
ICML
2010
IEEE
13 years 11 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...