Sciweavers

1651 search results - page 168 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Learning from labeled and unlabeled data on a directed graph
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
Bernhard Schölkopf, Dengyong Zhou, Jiayuan Hu...
CHI
2004
ACM
14 years 8 months ago
Social interaction in 'there'
Persistent online environments, such as multi-player games, exhibit a complex social organisation. These environments often feature large social groupings and elaborate cooperativ...
Barry Brown, Marek Bell
ISMIS
2003
Springer
14 years 1 months ago
Traffic Sign Recognition in Disturbing Environments
Traffic sign recognition is a difficult task if we aim at detecting and recognizing signs in images captured from unfavorable environments. Complex background, weather, shadow, and...
Hsiu-Ming Yang, Chao-Lin Liu, Kun-Hao Liu, Shang-M...
ICALP
1998
Springer
14 years 9 days ago
Bridges for Concatenation Hierarchies
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...
Jean-Eric Pin
JMLR
2008
133views more  JMLR 2008»
13 years 8 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan