Sciweavers

2695 search results - page 110 / 539
» Learning Graph Matching
Sort
View
106
Voted
NECO
2010
129views more  NECO 2010»
15 years 28 days ago
A Two-Layer Model of Natural Stimuli Estimated with Score Matching
We consider a hierarchical two-layer model of natural signals in which both layers are learned from the data. Estimation is accomplished by Score Matching, a recently proposed est...
Urs Köster, Aapo Hyvärinen
121
Voted
ICML
2006
IEEE
16 years 3 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
117
Voted
JMLR
2008
108views more  JMLR 2008»
15 years 2 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
FECS
2006
81views Education» more  FECS 2006»
15 years 3 months ago
Global Opportunities for Service Learning in Computer Science
: Service-learning matches knowledge with experience. It offers special benefits for computer science education. Opportunities for community and global engagement exist with direct...
Michael Losavio, David King, Adel Elmaghraby, Kevi...
107
Voted
SAC
2005
ACM
15 years 8 months ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa