An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Discrete Applied Mathematics

Volumn 154, Issue 16, 2006, Pages 2350-2372

  Khachiyan, Leonid ^a   Boros, Endre ^b   Elbassioni, Khaled ^c   Gurvich, Vladimir ^b  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Dualization; Empty boxes; Frequent sets; Generation algorithms; Hypergraph transversals; Monotone properties

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

DUALIZATION; EMPTY BOXES; FREQUENT SETS; HYPERGRAPH TRANSVERSALS; MONOTONE PROPERTIES;

ALGORITHMS;

EID: 33747864496     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.04.012     Document Type: Article

References (27)

1. R. Agrawal, T. Imielinski, A. Swami, Mining associations between sets of items in massive databases, Proceedings of the 1993 ACM-SIGMOD International Conference, 1993, pp. 207-216.
2. Agrawal R., Mannila H., Srikant R., Toivonen H., and Verkamo A.I. Fast discovery of association rules. In: Fayyad U.M., Piatetsky-Shapiro G., Smyth P., and Uthurusamy R. (Eds). Advances in Knowledge Discovery and Data Mining (1996), AAAI Press, Menlo Park, CA 307-328
3. Anthony M., and Biggs N. Computational Learning Theory (1992), Cambridge University Press, Cambridge
4. J. Bailey, T. Manoukian, K. Ramamohanarao, A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns, in: The Proceedings of the Third IEEE International Conference on Data Mining (ICDM), Florida, USA, November 2003, pp. 485-488.
5. Bioch J.C., and Ibaraki T. Complexity of identification and dualization of positive Boolean functions. Inform. and Comput. 123 (1995) 50-63
6. Boros E., Elbassioni K., Gurvich V., and Khachiyan L. Generating dual-bounded hypergraphs. Optimization Methods and Software (OMS)-Part I 17 5 (2002) 749-781
7. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems, in: D. Bienstock, G. Nemhauser (Eds.), The 10th Conference on Integer Programming and Combinatorial Optimization (IPCO X), Lecture Notes in Computer Science, vol. 3064, June 2004, pp. 152-162.
8. Boros E., Elbassioni K., Gurvich V., Khachiyan L., and Makino K. Dual-bounded generating problems: all minimal integer solutions for a monotone system of linear inequalities. SIAM J. Comput. 31 5 (2002) 1624-1643
9. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, K. Makino, An intersection inequality for discrete distributions and related generation problems, in: Automata, Languages and Programming, 30th International Colloqium, ICALP 2003, Lecture Notes in Computer Science, vol. 2719, 2003, pp. 543-555.
10. Boros E., Gurvich V., Khachiyan L., and Makino K. Dual-bounded generating problems: partial and multiple transversals of a hypergraph. SIAM J. Comput. 30 6 (2001) 2036-2050
11. E. Boros, V. Gurvich, L. Khachiyan, K. Makino, On the complexity of generating maximal frequent and minimal infrequent sets, in: 19th International Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, vol. 2285, March 2002, pp. 133-141.
12. Chazelle B., (Scot) Drysdale III R.L., and Lee D.T. Computing the largest empty rectangle. SIAM J. Comput. 15 1 (1986) 550-555
13. Colbourn C.J. The Combinatorics of Network Reliability (1987), Oxford University Press, OXford
14. J. Edmonds, J. Gryz, D. Liang, R.J. Miller, Mining for empty rectangles in large data sets, in: Proceedings of the Eighth International Conference on Database Theory (ICDT), Lecture Notes in Computer Science, vol. 1973, January 2001, pp. 174-188.
15. Eiter T., and Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24 (1995) 1278-1304
16. Fredman M.L., and Khachiyan L. On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21 (1996) 618-628
17. D. Gunopulos, R. Khardon, H. Mannila, H. Toivonen, Data mining, hypergraph transversals and machine learning, in: Proceedings of the 16th ACM-PODS Conference, 1997, pp. 209-216.
18. Gurvich V. To theory of multistep games. USSR Comput. Math. and Math Phys. 13-6 (1973) 1485-1500
19. Gurvich V. Nash-solvability of games in pure strategies. USSR Comput. Math. and Math. Phys. 15 (1975) 357-371
20. Gurvich V., and Khachiyan L. On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discrete Appl. Math. 96-97 (1999) 363-373
21. D.J. Kavvadias, E.C. Stavropoulos, Evaluation of an algorithm for the transversal hypergraph problem, in: Proceedings of the Third Workshop on Algorithm Engineering (WAE'99), Lecture Notes in Computer Science, vol. 1668, 1999, pp. 72-84.
22. Lawler E., Lenstra J.K., and Rinnooy Kan A.H.G. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM J. Comput. 9 (1980) 558-565
23. Liu B., Ku L.-P., and Hsu W. Discovering interesting holes in data. Proceedings of the IJCAI (1997), Nagoya, Japan 930-935
24. B. Liu, K. Wang, L.-F. Mun, X.-Z. Qi, Using decision tree induction for discovering holes in data, in: Proceedings of the Fifth Pacific Rim International Conference on Artificial Intelligence, 1998, pp. 182-193.
25. Orlowski M. A new algorithm for the large empty rectangle problem. Algorithmica 5 1 (1990) 65-73
26. Read R.C. Every one a winner, or how to avoid isomorphism when cataloging combinatorial configurations. Ann. Discrete Math. 2 (1978) 107-120
27. Srikant R., and Agrawal R. Mining quantitative association rules in large relational tables. Proceedings of the ACM-SIGMOD 1996 International Conference on Management of Data. Montreal, Canada (June 1996) 1-12