Sciweavers

3607 search results - page 386 / 722
» Learning with structured sparsity
Sort
View
168
Voted
ICML
2008
IEEE
16 years 7 months ago
Detecting statistical interactions with additive groves of trees
Discovering additive structure is an important step towards understanding a complex multi-dimensional function because it allows the function to be expressed as the sum of lower-d...
Daria Sorokina, Rich Caruana, Mirek Riedewald, Dan...
CVPR
2010
IEEE
16 years 3 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
MLG
2007
Springer
16 years 26 days ago
Inferring Vertex Properties from Topology in Large Networks
: Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic late...
Janne Sinkkonen, Janne Aukia, Samuel Kaski
WIRN
2005
Springer
16 years 5 days ago
Recursive Neural Networks and Graphs: Dealing with Cycles
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional ac...
Monica Bianchini, Marco Gori, Lorenzo Sarti, Franc...
174
Voted
ECML
2001
Springer
15 years 11 months ago
Discovering Admissible Simultaneous Equation Models from Observed Data
Conventional work on scienti c discovery such as BACON derives empirical law equations from experimental data. In recent years, SDS introducing mathematical admissibility constrain...
Takashi Washio, Hiroshi Motoda, Yuji Niwa