{"type":"ScholarlyArticle","title":"Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms","authors":[{"name":"Panagiotis Mandros","slug":"panagiotis-mandros","given":"Panagiotis","family":"Mandros","affiliation":"Max Planck Institute for Informatics , Saarbrücken , Germany"},{"name":"Mario Boley","slug":"mario-boley","given":"Mario","family":"Boley","affiliation":"Monash University , Melbourne , Australia"},{"name":"Jilles Vreeken","slug":"jilles-vreeken","given":"Jilles","family":"Vreeken","affiliation":"CISPA Helmholtz Center for Information Security , Saarbrücken , Germany"}],"abstract":"The reliable fraction of information is an attractive score for quantifying (functional) dependencies in high-dimensional data. In this paper, we systematically explore the algorithmic implications of using this measure for optimization. We show that the problem is NP-hard, justifying worst-case exponential-time as well as heuristic search methods. We then substantially improve the practical performance for both optimization styles by deriving a novel admissible bounding function that has an unbounded potential for additional pruning over the previously proposed one. Finally, we empirically investigate the approximation ratio of the greedy algorithm and show that it produces highly competitive results in a fraction of time needed for complete branch-and-bound style search.","doi":"10.24963/ijcai.2019/864","url":"https://ijcai.org/proceedings/2019/864","pdf":"https://ijcai.org/proceedings/2019/0864.pdf","markdown":"https://ijcai.org/proceedings/2019/864.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/864","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Best Sister Conferences","track":"Best Sister Conferences","number":864,"pages":{"first":6206,"last":6210},"keywords":["Machine Learning: Data Mining"],"videos":[],"references":[{"position":1,"raw":"[Alcalà-Fdez et al., 2011] Jesús Alcalà-Fdez, Alberto Fernàndez, Juliàn Luengo, Joaquìn Derrac, and Salvador Garcìa. Keel data-mining software tool: Data set reposi- tory, integration of algorithms and experimental analysis framework. Multiple-Valued Logic and Soft Computing, 17(2-3):255-287, 2011.","title":"Jesús Alcalà-Fdez, Alberto Fernàndez, Juliàn Luengo, Joaquìn Derrac, and Salvador Garcìa. Keel data-mining software tool: Data set repository, integration of algorithms and experimental analysis framework","authors":"Alcalà-Fdez","year":"2011","venue":"Multiple-Valued Logic and Soft Computing","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Brown et al., 2012] Gavin Brown, Adam Pocock, Ming-Jie Zhao, and Mikel Luján. Conditional likelihood maximi- sation: A unifying framework for information theoretic feature selection. J. Mach. Learn. Res., 13:27-66, January 2012.","title":"Conditional likelihood maximisation: A unifying framework for information theoretic feature selection","authors":"Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luján","year":"2012","venue":"J. Mach. Learn. Res","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cavallo and Pittarelli, 1987] Roger Cavallo and Michael Pittarelli. The theory of probabilistic databases. In Proceed- ings of the 13th International Conference on Very Large Data Bases (VLDB), Brighton, UK, pages 71-81, 1987.","title":"The theory of probabilistic databases","authors":"Pittarelli Cavallo, Roger Cavallo, Michael Pittarelli","year":"1987","venue":"Proceedings of the 13th International Conference on Very Large Data Bases (VLDB)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ghiringhelli et al., 2015] Luca M Ghiringhelli, Jan Vybiral, Sergey V Levchenko, Claudia Draxl, and Matthias Scheffler. Big data of materials science: Critical role of the descriptor. Physical review letters, 114(10):105503, 2015.","title":"Big data of materials science: Critical role of the descriptor","authors":"Jan Luca M Ghiringhelli, Vybiral, V Sergey, Claudia Levchenko, Matthias Draxl, Scheffler","year":"2015","venue":"Physical review letters","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Giannella and Robertson, 2004] Chris Giannella and Ed- ward L. Robertson. On approximation measures for func- tional dependencies. Information Systems, 29(6):483-507, 2004.","title":"On approximation measures for functional dependencies","authors":"Chris Giannella, Edward L Robertson","year":"2004","venue":"Information Systems","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Guyon and Elisseeff, 2003] Isabelle Guyon and André Elis- seeff. An introduction to variable and feature selection. J. Mach. Learn. Res., 3:1157-1182, March 2003.","title":"Isabelle Guyon and André Elisseeff. An introduction to variable and feature selection","authors":"Elisseeff Guyon","year":"2003","venue":"J. Mach. Learn. Res","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Huhtala et al., 1999] Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, and Hannu Toivonen. Tane: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2):100-111, 1999.","title":"Tane: An efficient algorithm for discovering functional and approximate dependencies","authors":"Huhtala","year":"1999","venue":"The Computer Journal","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Kruse and Naumann, 2018] Sebastian Kruse and Felix Nau- mann. Efficient discovery of approximate dependencies. Proc. VLDB Endow., 11(7):759-772, March 2018.","title":"Efficient discovery of approximate dependencies","authors":"Naumann Kruse, Sebastian Kruse, Felix Naumann","year":"2018","venue":"Proc. VLDB Endow","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Lancaster, 1969] H.O. Lancaster. The chi-squared distribu- tion. Wiley series in probability and mathematical statistics. Probability and mathematical statistics. Wiley, 1969.","title":"The chi-squared distribution","authors":"H O Lancaster","year":"1969","venue":"Wiley series in probability and mathematical statistics. Probability and mathematical statistics","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Mandros et al., 2017] Panagiotis Mandros, Mario Boley, and Jilles Vreeken. Discovering reliable approximate functional dependencies. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '17. ACM, 2017.","title":"Discovering reliable approximate functional dependencies","authors":"Panagiotis Mandros, Mario Boley, Jilles Vreeken","year":"2017","venue":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '17","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Mandros et al., 2018] Panagiotis Mandros, Mario Boley, and Jilles Vreeken. Discovering reliable dependencies from data: Hardness and improved algorithms. In 2018 IEEE International Conference on Data Mining (ICDM), pages 317-326. IEEE, 2018.","title":"Discovering reliable dependencies from data: Hardness and improved algorithms","authors":"Panagiotis Mandros, Mario Boley, Jilles Vreeken","year":"2018","venue":"IEEE International Conference on Data Mining (ICDM)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Ouyang et al., 2017] Runhai Ouyang, Stefano Curtarolo, Emre Ahmetcik, Matthias Scheffler, and Luca Ghiringhelli. Sisso: a compressed-sensing method for systematically identifying efficient physical models of materials proper- ties. (1710.03319), 2017.","title":"Sisso: a compressed-sensing method for systematically identifying efficient physical models of materials properties","authors":"Ouyang","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Ramakrishnan and Gehrke, 2000] Raghu Ramakrishnan and Johannes Gehrke. Database Management Systems. McGraw-Hill Higher Education, 2nd edition, 2000. [Reimherr and Nicolae, 2013] Matthew Reimherr and Dan L Nicolae. On quantifying dependence: A framework for developing interpretable measures. Statistical Science, 28(1):116-130, 2013.","title":"On quantifying dependence: A framework for developing interpretable measures","authors":"Gehrke Ramakrishnan, Raghu Ramakrishnan, Johannes Gehrke","year":"2000","venue":"McGraw-Hill Higher Education","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Romano et al., 2016] Simone Romano, Nguyen Xuan Vinh, James Bailey, and Karin Verspoor. A framework to adjust dependency measure estimates for chance. In Proceed- ings of the SIAM International Conference on Data Mining (SDM), Miami, FL. SIAM, 2016.","title":"A framework to adjust dependency measure estimates for chance","authors":"Simone Romano, Xuan Nguyen, James Vinh, Karin Bailey, Verspoor","year":"2016","venue":"Proceedings of the SIAM International Conference on Data Mining (SDM)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Roulston, 1999] Mark S Roulston. Estimating the errors on measured entropy and mutual information. Physica D: Nonlinear Phenomena, 125(3):285-294, 1999.","title":"Estimating the errors on measured entropy and mutual information","authors":"Mark S Roulston","year":"1999","venue":"Physica D: Nonlinear Phenomena","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Song et al., 2012] Le Song, Alex Smola, Arthur Gretton, Justin Bedo, and Karsten Borgwardt. Feature selection via dependence maximization. JMLR, 13:1393-1434, 2012.","title":"Feature selection via dependence maximization","authors":"Le Song, Alex Smola, Arthur Gretton, Justin Bedo, Karsten Borgwardt","year":"2012","venue":"JMLR","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Vinh et al., 2010] Nguyen Xuan Vinh, Julien Epps, and James Bailey. Information theoretic measures for clus- terings comparison: Variants, properties, normalization and correction for chance. Journal of Machine Learning Research, 11(Oct):2837-2854, 2010.","title":"Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance","authors":"Xuan Nguyen, Julien Vinh, James Epps, Bailey","year":"2010","venue":"Journal of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Webb, 1995] G. I. Webb. Opus: An efficient admissible algorithm for unordered search. Journal of Artificial Intelli- gence Research, 3:431-465, 1995.","title":"Opus: An efficient admissible algorithm for unordered search","authors":"G I Webb","year":"1995","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Ziarko, 2002] Wojciech Ziarko. Rough set approaches for discovery of rules and attribute dependencies. Handbook of data mining and knowledge discovery, pages 328-338, 2002.","title":"Rough set approaches for discovery of rules and attribute dependencies","authors":"Wojciech Ziarko","year":"2002","venue":"Handbook of data mining and knowledge discovery","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}