Sciweavers

113 search results - page 12 / 23
» Structural Machine Learning with Galois Lattice and Graphs
Sort
View
COLT
2004
Springer
15 years 2 months ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
15 years 10 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
80
Voted
CSCLP
2004
Springer
15 years 2 months ago
A Note on Bilattices and Open Constraint Programming
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
Arnaud Lallouet
ICML
2005
IEEE
15 years 10 months ago
Optimal assignment kernels for attributed molecular graphs
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another ...
Andreas Zell, Florian Sieker, Holger Fröhlich...
CORR
2011
Springer
208views Education» more  CORR 2011»
14 years 4 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...