Sciweavers

274 search results - page 5 / 55
» The Information Bottleneck EM Algorithm
Sort
View
CIKM
2011
Springer
12 years 7 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
NIPS
2003
13 years 8 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...
AAAI
2006
13 years 9 months ago
Overcoming the Brittleness Bottleneck using Wikipedia: Enhancing Text Categorization with Encyclopedic Knowledge
When humans approach the task of text categorization, they interpret the specific wording of the document in the much larger context of their background knowledge and experience. ...
Evgeniy Gabrilovich, Shaul Markovitch
LATIN
2004
Springer
14 years 25 days ago
On the Competitiveness of AIMD-TCP within a General Network
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
Jeff Edmonds
KAIS
2007
75views more  KAIS 2007»
13 years 7 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann