Abstract
A crucial problem of machine learning is the management of unclean probabilistic databases. We approach this problem by applying recent results and methods from quantum information to detect a specific class of database corruption. We present a quantifier of the global corruption of the probabilistic database and show its relationship with detection protocols based on generalized Bell inequalities. Furthermore, we show a relation between the noise generating the corruption and information encoded in the database schema. Finally, we discuss how our work indicates a way to export quantum information results to study noise in probabilistic databases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
