Sciweavers

417 search results - page 41 / 84
» Rough Sets Similarity-Based Learning from Databases
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Learning a two-stage SVM/CRF sequence classifier
Learning a sequence classifier means learning to predict a sequence of output tags based on a set of input data items. For example, recognizing that a handwritten word is "ca...
Guilherme Hoefel, Charles Elkan
RECOMB
2008
Springer
14 years 8 months ago
Automatic Parameter Learning for Multiple Network Alignment
We developed Gr?mlin 2.0, a new multiple network aligner with (1) a novel scoring function that can use arbitrary features of a multiple network alignment, such as protein deletion...
Jason Flannick, Antal F. Novak, Chuong B. Do, Bala...
IVC
2007
176views more  IVC 2007»
13 years 7 months ago
Kernel-based distance metric learning for content-based image retrieval
ct 8 For a specific set of features chosen for representing images, the performance of a content-based image retrieval (CBIR) system 9 depends critically on the similarity or diss...
Hong Chang, Dit-Yan Yeung
ACIIDS
2010
IEEE
171views Database» more  ACIIDS 2010»
13 years 10 months ago
Evolving Concurrent Petri Net Models of Epistasis
Abstract. A genetic algorithm is used to learn a non-deterministic Petri netbased model of non-linear gene interactions, or statistical epistasis. Petri nets are computational mode...
Michael Mayo, Lorenzo Beretta
FOCS
2010
IEEE
13 years 5 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan