KeisukeKamataki writeup of Cohen soft info 2000

This is a review of Cohen_2000_hardening_soft_information_sources by user:KeisukeKamataki.

Summary: This paper explores the technique to harden information in soft database so that we can access such information in hard database structured which allows us fast data access. They consider inconsistent/duplicated soft information comes from the same fact and using the idea of 'interpretation arcs I', they try to find the parameter I and H which maximizes the joint distribution Pr(H,I,S). The computation to find optimal I is NP-hard, but they come up with the practical approach, a greedy hardening algorithm and solves problem in almost linear time.

I like: This paper does not only addresses a very practical issue, but also explores theoretical analysis for optimal solution and an efficient algorithm to solve the problem in desirable time. It would be all the better if this paper also included experiments and evaluations.