Sciweavers

353 search results - page 20 / 71
» From graph states to two-graph states
Sort
View
JMLR
2006
125views more  JMLR 2006»
13 years 7 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
NDSS
2005
IEEE
14 years 1 months ago
Enriching Intrusion Alerts Through Multi-Host Causality
Current intrusion detection systems point out suspicious states or events but do not show how the suspicious state or events relate to other states or events in the system. We sho...
Samuel T. King, Zhuoqing Morley Mao, Dominic G. Lu...
EMNLP
2010
13 years 5 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
ICML
2003
IEEE
14 years 8 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
CCCG
2008
13 years 9 months ago
On the Complexity of Point Recolouring in Geometric Graphs
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
Henk Meijer, Yurai Núñez Rodrí...