Sciweavers

58 search results - page 4 / 12
» Empirical comparison of graph classification algorithms
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Improving web page classification by label-propagation over click graphs
In this paper, we present a semi-supervised learning method for web page classification, leveraging click logs to augment training data by propagating class labels to unlabeled si...
Soo-Min Kim, Patrick Pantel, Lei Duan, Scott Gaffn...
IJON
2010
178views more  IJON 2010»
13 years 6 months ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen
AAAI
2007
13 years 9 months ago
Cautious Inference in Collective Classification
Collective classification can significantly improve accuracy by exploiting relationships among instances. Although several collective inference procedures have been reported, they...
Luke McDowell, Kalyan Moy Gupta, David W. Aha
EVOW
2004
Springer
14 years 25 days ago
Binary Merge Model Representation of the Graph Colouring Problem
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
István Juhos, Attila Tóth, Jano I. v...
ICPR
2004
IEEE
14 years 8 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus