Sciweavers

2695 search results - page 201 / 539
» Learning Graph Matching
Sort
View
ICML
2003
IEEE
16 years 4 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
ALT
2008
Springer
16 years 8 days ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
FLAIRS
2003
15 years 4 months ago
Identifying Inhabitants of an Intelligent Environment Using a Graph-Based Data Mining System
The goal of the MavHome smart home project is to build an intelligent home environment that is aware of its inhabitants and their activities. Such a home is designed to provide ma...
Ritesh Mehta, Diane J. Cook, Lawrence B. Holder
138
Voted
CORR
2002
Springer
82views Education» more  CORR 2002»
15 years 3 months ago
Using eigenvectors of the bigram graph to infer morpheme identity
This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain po...
Mikhail Belkin, John A. Goldsmith
CSL
2008
Springer
15 years 5 months ago
On Counting Generalized Colorings
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
Tomer Kotek, Johann A. Makowsky, Boris Zilber