Sciweavers

745 search results - page 91 / 149
» A Preference Model for Structured Supervised Learning Tasks
Sort
View
IJCAI
1989
14 years 11 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine
AAAI
2010
14 years 11 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
14 years 11 months ago
Semi-supervised Feature Selection via Spectral Analysis
Feature selection is an important task in effective data mining. A new challenge to feature selection is the so-called “small labeled-sample problem” in which labeled data is...
Zheng Zhao, Huan Liu
BIBM
2008
IEEE
142views Bioinformatics» more  BIBM 2008»
15 years 4 months ago
Using Global Sequence Similarity to Enhance Biological Sequence Labeling
Identifying functionally important sites from biological sequences, formulated as a biological sequence labeling problem, has broad applications ranging from rational drug design ...
Cornelia Caragea, Jivko Sinapov, Drena Dobbs, Vasa...
INTERSPEECH
2010
14 years 4 months ago
Deep-structured hidden conditional random fields for phonetic recognition
We extend our earlier work on deep-structured conditional random field (DCRF) and develop deep-structured hidden conditional random field (DHCRF). We investigate the use of this n...
Dong Yu, Li Deng