Sciweavers

24680 search results - page 4687 / 4936
» Learning
Sort
View
IUI
2009
ACM
14 years 5 months ago
Discovering frequent work procedures from resource connections
Intelligent desktop assistants could provide more help for users if they could learn models of the users’ workflows. However, discovering desktop workflows is difficult becau...
Jianqiang Shen, Erin Fitzhenry, Thomas G. Dietteri...
SAC
2009
ACM
14 years 5 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
SAC
2009
ACM
14 years 5 months ago
LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...
Márcio P. Basgalupp, Rodrigo C. Barros, And...
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 5 months ago
Robust web extraction: an approach based on a probabilistic tree-edit model
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
Nilesh N. Dalvi, Philip Bohannon, Fei Sha
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 5 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
« Prev « First page 4687 / 4936 Last » Next »