Sciweavers

2027 search results - page 273 / 406
» Learning and Generalization with the Information Bottleneck
Sort
View
DGO
2007
174views Education» more  DGO 2007»
15 years 8 months ago
A bootstrapping approach for identifying stakeholders in public-comment corpora
A stakeholder is an individual, group, organization, or community that has an interest or stake in a consensus-building process. The goal of stakeholder identification is identify...
Jaime Arguello, Jamie Callan
ECIR
2003
Springer
15 years 7 months ago
Discretizing Continuous Attributes in AdaBoost for Text Categorization
Abstract. We focus on two recently proposed algorithms in the family of “boosting”-based learners for automated text classification, AdaBoost.MH and AdaBoost.MHKR . While the ...
Pio Nardiello, Fabrizio Sebastiani, Alessandro Spe...
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 7 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
NIPS
2003
15 years 7 months ago
Computing Gaussian Mixture Models with EM Using Equivalence Constraints
Density estimation with Gaussian Mixture Models is a popular generative technique used also for clustering. We develop a framework to incorporate side information in the form of e...
Noam Shental, Aharon Bar-Hillel, Tomer Hertz, Daph...
IDA
2006
Springer
15 years 6 months ago
Structural hidden Markov models: An application to handwritten numeral recognition
We introduce in this paper a generalization of the widely used hidden Markov models (HMM's), which we name "structural hidden Markov models" (SHMM). Our approach is ...
Djamel Bouchaffra, Jun Tan