{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T15:28:15Z","timestamp":1787585295304,"version":"build-2736575974"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/rcis.2015.7128905","type":"proceedings-article","created":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T11:56:17Z","timestamp":1435146977000},"page":"434-444","source":"Crossref","is-referenced-by-count":2,"title":["Concise representation of hypergraph minimal transversals: Approach and application on the dependency inference problem"],"prefix":"10.1109","author":[{"given":"M. Nidhal","family":"Jelassi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christine","family":"Largeron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sadok","family":"Ben Yahia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref30","author":"maier","year":"1983","journal-title":"The Theory of Relational Databases"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_51"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00107"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250958"},{"key":"ref13","first-page":"415","article-title":"A data mining formalization to improve hypergraph minimal transversal computation","volume":"80","author":"hebert","year":"2007","journal-title":"Fundamenta Informaticae"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972931.1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_10"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108005681"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970240639X"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0178-1"},{"key":"ref19","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"1994","journal-title":"Proc of International Conference on Very Large Data Bases (VLDB)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46439-5_24"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0117-x"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44801-2_11"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72667-8_50"},{"key":"ref6","article-title":"Algorithmic and computational complexity issues of MONET","author":"hagen","year":"2008"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0169-023X(94)90023-X"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/ICDM.2003.1250899","article-title":"Zigzag: a new algorithm for mining large Monet dependencies in database","author":"marchi","year":"2003","journal-title":"Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM'03)"},{"key":"ref8","author":"berge","year":"1989","journal-title":"Hypergraphs Combinatorics of Finite Sets"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57568-5_271"},{"key":"ref2","article-title":"Formal methods for mining structured objects","author":"garriga","year":"2006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0062"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45757-7_53"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CAHPC.2002.1180762"},{"key":"ref22","first-page":"228","article-title":"Approximation de bordures de motifs frquents par le calcul de traverses minimales approches d'hypergraphes","author":"durand","year":"2013","journal-title":"actes de 13 la Confrence Francophone sur l'Apprentissage Automatique CAP'12"},{"key":"ref21","article-title":"A low-cost approximate minimal hitting set algorithm and its application to model-based diagnosis","author":"abreu","year":"2009","journal-title":"Proceedings of the Eighth Symposium on Abstraction Reformulation and Approximation (SARA'09)"},{"key":"ref24","article-title":"Hypergraph Dualization Repository (2013)","author":"murakami","year":"0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.01.001"},{"key":"ref26","first-page":"139","article-title":"Database dependency discovery: a machine learning approach","volume":"12","author":"flach","year":"1999","journal-title":"AI communications"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655802"}],"event":{"name":"2015 IEEE 9th International Conference on Research Challenges in Information Science (RCIS)","location":"Athens, Greece","start":{"date-parts":[[2015,5,13]]},"end":{"date-parts":[[2015,5,15]]}},"container-title":["2015 IEEE 9th International Conference on Research Challenges in Information Science (RCIS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7121393\/7128853\/07128905.pdf?arnumber=7128905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T10:27:07Z","timestamp":1498213627000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7128905\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/rcis.2015.7128905","relation":{},"subject":[],"published":{"date-parts":[[2015,5]]}}}