1214 search results - page 29 / 243 » Labeling Points with Weights |
154
click to vote
PAKDD
2010
ACM
15 years 11 months ago
2010
ACM
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
161
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
143
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Behavioral Signal Processing aims at automating behavioral coding schemes such as those prevalent in psychology and mental health research. This paper describes methods to quantif...
187
click to vote
FOIKS
2008
Springer
15 years 7 months ago
2008
Springer
Supervised learning deals with the inference of a distribution over an output or label space Y conditioned on points in an observation space X , given a training dataset D of pair...
166
click to vote
EMNLP
2010
15 years 4 months ago
2010
Confidence-Weighted linear classifiers (CW) and its successors were shown to perform well on binary and multiclass NLP problems. In this paper we extend the CW approach for sequen...