Sciweavers

46 search results - page 3 / 10
» Approximated Consistency for the Automatic Recording Problem
Sort
View
ICALP
2009
Springer
14 years 6 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 5 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 5 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
ATAL
2005
Springer
13 years 11 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 3 months ago
Interesting Subset Discovery and Its Application on Service Processes
Various real-life datasets can be viewed as a set of records consisting of attributes explaining the records and set of measures evaluating the records. In this paper, we address t...
Maitreya Natu, Girish Keshav Palshikar