Sciweavers

3837 search results - page 493 / 768
» Learning Approximate Consistencies
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
KDD
2003
ACM
214views Data Mining» more  KDD 2003»
16 years 7 months ago
Adaptive duplicate detection using learnable string similarity measures
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
Mikhail Bilenko, Raymond J. Mooney
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
16 years 7 months ago
Data Mining for Typhoon Image Collection
This paper introduces the application of data mining methods to the analysis and prediction of the typhoon. The testbed for this research is the typhoon image collection that we e...
Asanobu Kitamoto
SDM
2009
SIAM
220views Data Mining» more  SDM 2009»
16 years 3 months ago
Bayesian Cluster Ensembles.
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...
Hongjun Wang, Hanhuai Shan, Arindam Banerjee
ALT
2002
Springer
16 years 3 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...