Sciweavers

2100 search results - page 134 / 420
» Learning to rank on graphs
Sort
View
ISNN
2004
Springer
15 years 11 months ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
ICML
2006
IEEE
16 years 7 months ago
Higher order learning with graphs
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
Sameer Agarwal, Kristin Branson, Serge Belongie
ECIR
2009
Springer
16 years 3 months ago
Investigating Learning Approaches for Blog Post Opinion Retrieval
Blog post opinion retrieval is the problem of identifying posts which express an opinion about a particular topic. Usually the problem is solved using a 3 step process in which rel...
Shima Gerani, Mark James Carman, Fabio Crestani
JMLR
2008
108views more  JMLR 2008»
15 years 6 months ago
A Recursive Method for Structural Learning of Directed Acyclic Graphs
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
Xianchao Xie, Zhi Geng
AAAI
2006
15 years 7 months ago
Predicting Electricity Distribution Feeder Failures Using Machine Learning Susceptibility Analysis
A Machine Learning (ML) System known as ROAMS (Ranker for Open-Auto Maintenance Scheduling) was developed to create failure-susceptibility rankings for almost one thousand 13.8kV-...
Philip Gross, Albert Boulanger, Marta Arias, David...