Area References

  1. R. Agrawal, T. Imielinski and A. Swami, Mining associations between sets of items in massive databases, Proc. 1993 ACM-SIGMOD Int. Conf. on Management of Data, pp. 207-216.
  2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo, Fast discovery of association rules, In U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy eds., Advances in Knowledge Discovery and Data Mining, 307-328, AAAI Press, Menlo Park, California, 1996.
  3. R. Agrawal and R. Srikant, Mining sequential patterns, Proc. 11th International Conference on Data Engineering, 1995, pp.3-14.
  4. M. Anthony and N. Biggs, Computational Learning Theory, Cambridge University Press, 1992.
  5. R.J. Bayardo, Efficiently mining long patterns from databases, Proc. the 1998 ACM-SIGMOD International Conference on Management of Data, pp. 85-93.
  6. P. Bertolazzi and A. Sassano, An $O(mn)$ time algorithm for regular set-covering problems, Theoretical Computer Science 54 (1987) 237-247.
  7. J.C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation 123 (1995) pp. 50-63.
  8. M.M. Bongard, Pattern Recognition, Rochelle Park, NJ Hayden Book Co, Spartan Books, 1970.
  9. E. Boros, V. Gurvich, and P.L. Hammer, Dual subimplicants of positive Boolean functions, Optimization Methods and Software, 10 (1998) 147-156. (RUTCOR Research Report 11-1993).
  10. E. Boros, P.L. Hammer and J.N. Hooker, Predicting cause-effect relationships from incomplete discrete observations, SIAM J. Discrete Math., 7 (1994), 481-491.
  11. E. Boros, P.L. Hammer, T. Ibaraki and K. Kawakami, Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle, SIAM J. Comput., 26 (1997) 93-109.
  12. E. Boros, T. Ibaraki and K. Makino, Logical analysis of binary data with missing bits, Artificial Intelligence 107 (1999) 219-263.
  13. S. Brin, R. Motwani, and C. Silverstein, Beyond market basket: Generalizing association rules to correlations, Proc. the 1997 ACM-SIGMOD Conference on Management of Data, pp. 265-276.
  14. S. Brin, R. Motwani, J. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In: Proceedings of the 1997 ACM-SIGMOD Conference on Management of Data, pp. 255-264.
  15. C. J. Colbourn, The combinatorics of network reliability, Oxford University Press, 1987.
  16. Y. Crama, Dualization of regular Boolean functions, Discrete Applied Mathematics, 16 (1987) 79-85.
  17. C. Domingo, N. Mishra, and L. Pitt, Efficient read-$k$ monotone CNF/DNF dualization using a learning with membership queries approach, Machine Learning, 37 (1999) 89-110.
  18. G. Dong and J. Li, Efficient mining of emerging patterns, Proc. the 1999 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 43-52.
  19. T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM Journal on Computing, 24 (1995) 1278-1304.
  20. T. Eiter, G. Gottlob, K. Makino, New results on monotone dualization and generating hypergraph transversals, to appear in Proc. 34th Annual ACM Symposium on Theory of Computing (STOC 2002).
  21. K. Elbassioni, On dualization in products of forests, in: Proc. 19th International Symposium on Theoretical Aspects of Computer Science, STACS 2002, (H. Alt and A. Ferreira, eds.), Lecture Nores in Computer Science 2285, pp. 143-153, 2002.
  22. K. Elbassioni, Dualization in products of bounded-width lattices, Manuscript.
  23. D. Eppstein, Arboricity and bipartite subgraph listing algorithms, Information Processing Letters 51 (1994), pp. 207-211.
  24. M.I. Fredman and L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms. J. of Algorithms, 21 (1996) 618-628.
  25. M. Galán, I. García-Vargas, F.V. Fernández and A. Rodríguez-Vázquez, A new matroid intersection algorithm for symbolic large circuit analysis, in Proc. 4th Int. Workshop on Symbolic Methods and Applications to Circuit Design, Oct. 1996.
  26. L.A. Goldberg, Efficient algorithms for listing combinatorial objects, Distinguished Dissertations in Computer Science, (Cambridge University Press, Cambridge, 1993.)
  27. D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen, Data mining, hypergraph transversals and machine learning. In: Proceedings of the 16th ACM-SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, (1997) pp. 12-15.
  28. V. Gurvich, To the theory of multistep games, U.S.S.R. Comput. Math. and Math. Phys., 13 (1973) 1485-1500.
  29. V. Gurvich, Nash-solvability of games in pure strategies, U.S.S.R. Comput. Math. and Math. Phys., 15 (1975) 357-371.
  30. V. Gurvich, Nash equilibrium in pure strategies, Soviet Math. Dokl., 38, 3, 597-602.
  31. V. Gurvich and L. Khachiyan, On the frequency of the most frequently occurring variable in dual DNFs, Discrete Mathematics 169 (1997) 245-248.
  32. V. Gurvich and L. Khachiyan, On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discrete Applied Mathematics 96-97 (1999), 363-373.
  33. J. Han, Y. Cai and N. Cercone, Data driven discovery of quantitative rules in relational databases, IEEE Transactions on Knowledge and Data Engineering, Vol. 5 No. 1, (1993) pp. 29-40.
  34. J. Han and Y. Fu, Discovery of multiple-level association rules from large databases, Proc. 21st International Conference on Very Large Data Bases, pp. 420-431, Zurich, Swizerland, 1995.
  35. J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, Proc. the 2000 ACM-SIGMOD Conference on Management of Data, pp. 1-12.
  36. T. Helgason, Aspects of the theory of hypermatroids, in Hypergraph Seminar, Lecture Notes in Math. 411 (1975) Springer, pp. 191-214.
  37. D.S. Johnson, M. Yannakakis and C.H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, 27 (1988) 119-123.
  38. R. Karp and M, Luby, Monte-Carlo algorithms for enumeration and reliability problems, in Proc. 24th IEEE Symp. on Foundations of Computer Science (1983) 56-64.
  39. L. Khachiyan, Transversal hypergraphs and families of polyhedral cones, in : Advances in Convex Analysis and Global Optimization, Honoring the memory of K. Carathéodory, (N. Hadjisavvas and P. Pardalos Eds.), 105-118, Kluwer Academic Publishers, Dordrecht/Boston/London, 2001.
  40. S.O. Kuznetsov, Interpretation on graphs and complexity characteristics of a search for specific patterns, Nauchn. Tekh. Inf., Ser. 2 (Automatic Document. Math. Linguist.) 23(1), (1989) pp. 23-37.
  41. S.O. Kuznetsov, Fast algorithm for construction of all intersections of the objects from a finite semi-lattice, Nauchn. Tekh. Inf., Ser. 2 (Automatic Document. Math. Linguist.) 9(1), (1993) pp. 11-21.
  42. E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM Journal on Computing, 9 (1980) 558-565.
  43. D. Lin and Z.M. Kedem, Pincer-search: a new algorithm for discovering the maximum frequent set, Proc. 6th European Conference on Extending Database Technology, to appear.
  44. L. Lovász, Submodular functions and convexity. In: Mathematical Programming: The State of the Art, Bonn 1982, pp. 235-257, (Springer Verlag, 1983).
  45. K.~Makino, Efficient dualization of O(log n)-term monotone disjunctive normal forms, to appear in Discrete Applied Mathematics. (Technical Report 00-07, Discrete Mathematics and Systems Science, Osaka University, 2000.)
  46. K. Makino and T. Ibaraki, Interior and exterior functions of Boolean functions, Discrete Applied Mathematics, 69 (1996) pp. 209-231.
  47. K.~Makino and T.~Ibaraki. The maximum latency and identification of positive Boolean functions. SIAM J. Comput., 26 (1997) 1363--1383.
  48. K. Makino and T. Ibaraki, A fast and simple algorithm for identifying 2-monotonic positive Boolean functions, Journal of Algorithms, 26 (1998) 291-305.
  49. K. Makino and T. Ibaraki, Inner-core and outer-core functions of partially defined Boolean functions, Discrete Applied Mathematics, 96-97, (1999), 307-326.
  50. Manilla and K.J. Räihä, Design by example: An application of Armstrong relations, Comp. System. Sci. 22 (1986) 126-141.
  51. H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery. Series of Publications C C-1997-8, University of Helsinki, Department of Computer Science (1997).
  52. H. Mannila and H. Toivonen, Multiple uses of frequent sets and condensed representations. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, (1996) pp. 189-194.
  53. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1 (1997), 259-289.
  54. C.G.H. McDiarmid, Rado's theorem for polymatroids, Math. Proc. Cambridge Phil. Soc. 78 (1975) 263-281.
  55. S. Muroga, Threshold Logic and Its Applications, Wiley-Interscience, 1971.
  56. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering frequent closed itemsets for association rules. Proc. 7th ICDT Conference, Jerusalem, Israel, January 10-12, 1999; Lecture Notes in Computer Science, 1540, pp. 398-416, Springer Verlag, 1999.
  57. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Closed set based discovery of small covers for association rules, Proc. 15emes Journees Bases de Donnees Avancees, BDA, pp. 361-381, 1999.
  58. E. Prisner, Graphs with few cliques, Graph theory, combinatorics and algorithms, 1,2 (Kalamazoo, MI, 1992) pp. 945-956, Wisley-Intersi. Publ., Wisley, New York, 1995.
  59. U.N. Peled and B. Simeone, Polynomial-time algorithm for regular set-covering and threshold synthesis, Discrete Applied Mathematics 12 (1985) 57-69.
  60. U.N. Peled and B. Simeone, An O(nm)-time algorithm for computing the dual of a regular Boolean function, Discrete Applied Mathematics 49 (1994) 309-323.
  61. J.S. Provan and D.R. Shier, A Paradigm for Listing (s, t)-Cuts in Graphs. Algorithmica 15(4) (1996) 351-372
  62. K. G. Ramamurthy, Coherent Structures and Simple Games, Kluwer Academic Publishers, 1990.
  63. R.C. Read, Every one is a winner, or how to avoid isomorphism when cataloging combinatorial configurations, Ann. Discrete Math., 2 (1978) 107-120
  64. R.C. Read and R.E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks 5 (1975) 237-252.
  65. R.H. Sloan, K. Takata, G. Turan, On frequent sets of Boolean matrices, Annals of Mathematics and Artificial Intelligence 24 (1998) 1-4.
  66. R. Srikant and R. Agrawal, Mining generalized association rules, Proc. 21st International Conference on Very Large Data Bases, pp. 407-419, Zurich, Swizerland, 1995.
  67. R. Srikant and R. Agrawal, Mining quantitative association rules in large relational tables, Proc. of the ACM-SIGMOD 1996 Conference on Management of Data, pp. 1-12, Montreal, Canada, June 1996.
  68. H. Tamaki. Space-efficient enumeration of minimal transversals of a hypergraph. IPSJ-AL 75 (2000) 29-36.
  69. S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, A new algorithm for generating all maximal independent sets, SIAM J. Comput., 6 (1977) 505-517.
  70. J.D. Ullman, Principles of Database and Knowledge Base Systems, Vols. 1 and 2, Computer Science Press, 1988.
  71. D.J.A.~Welsh, Matroid Theory (Academic Press, London, New York, San Francisco 1976).
  72. M.J. Zaki and M. Ogihara, Theoretical foundations of association rules, 3rd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, June 1998.