1039 search results - page 70 / 208 » Kernels and Regularization on Graphs |
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
92
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
104
Voted
NIPS
2004
15 years 2 months ago
2004
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...
EMNLP
2009
14 years 10 months ago
2009
In this paper, we propose a novel class of graphs, the tripartite directed acyclic graphs (tDAGs), to model first-order rule feature spaces for sentence pair classification. We in...
128
Voted
COMGEO
2007
ACM
15 years 19 days ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...