Sciweavers

381 search results - page 12 / 77
» On the advantage over a random assignment
Sort
View
NAACL
2003
13 years 10 months ago
Shallow Parsing with Conditional Random Fields
Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling...
Fei Sha, Fernando C. N. Pereira
ICPR
2004
IEEE
14 years 10 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
ICASSP
2007
IEEE
14 years 3 months ago
Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
Jue Wu, Albert C. S. Chung
EMNLP
2006
13 years 10 months ago
A Hybrid Markov/Semi-Markov Conditional Random Field for Sequence Segmentation
Markov order-1 conditional random fields (CRFs) and semi-Markov CRFs are two popular models for sequence segmentation and labeling. Both models have advantages in terms of the typ...
Galen Andrew
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
13 years 26 days ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...