Extending set-based dualization: Application to pattern mining

Frontiers in Artificial Intelligence and Applications

Volumn 242, Issue , 2012, Pages 630-635

  Nourine, Lhouari ^a   Petit, Jean Marc ^b  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

COMBINATORICS; HYPER GRAPH; MAXIMAL ELEMENTS; MINIMAL ELEMENTS; MINING PROBLEMS; MONOTONICS; PARTIAL ORDER; PATTERN MINING; SETS OF PATTERNS; WEAK REPRESENTATIONS;

DATA MINING;

EID: 84878805459     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-61499-098-7-630     Document Type: Conference Paper

References (19)

1. th International Conference on Very Large Databases, Santiago de Chile, Chile, pp. 487-499, (1994).
2. Hiroki Arimura and Takeaki Uno, 'Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems', in SDM, pp. 1087-1098, (2009).
3. Mikhail A. Babin and Sergei O. Kuznetsov, 'Enumerating minimal hypotheses and dualizing monotone boolean functions on lattices', in ICFCA, pp. 42-48, (2011).
4. Claude Berge, Graphs and Hypergraphs, North-Holland Mathematical Library 6, American Elsevier, 2d rev. ed. edn., 1976.
5. Mario Boley, Tamás Horváth, Axel Poigné, and Stefan Wrobel, 'Listing closed sets of strongly accessible set systems with applications to data mining', Theor. Comput. Sci., 411(3), 691-700, (2010).
6. Toon Calders and Jef Wijsen, 'On monotone data mining languages', in DBPL, pp. 119-132, (2001).
7. Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, and Mohammed Javeed Zaki, 'An integrated, generic approach to pattern mining: data mining template library', Data Min. Knowl. Discov., 17(3), 457-495, (2008).
8. Thomas Eiter and Georg Gottlob, 'Identifying the minimal transversals of a hypergraph and related problems.', SIAM J. Comput., 24(6), 1278-1304, (1995).
9. Thomas Eiter, Georg Gottlob, and Kazuhisa Makino, 'New results on monotone dualization and generating hypergraph transversals', SIAM J. Comput., 32, 514-537, (February 2003).
10. Thomas Eiter, Kazuhisa Makino, and Georg Gottlob, 'Computational aspects of monotone dualization: A brief survey', Discrete Appl. Math., 156, 2035-2049, (June 2008).
11. Khaled M. Elbassioni, 'Algorithms for dualization over products of partially ordered sets', SIAM J. Discrete Math., 23(1), 487-510, (2009).
12. Frédéric Flouvat, Fabien De Marchi, and Jean-Marc Petit, New Frontiers in Applied Data Mining, chapter The iZi Project: Easy Prototyping of Interesting Pattern Mining Algorithms, 1-15, LNAI 5669, SpringerVerlag, February 2010.
13. Michael L. Fredman and Leonid Khachiyan, 'On the complexity of du-alization of monotone disjunctive normal forms', J. Algorithms, 21(3), 618-628, (1996).
14. Alain Gély, Lhouari Nourine, and Bachir Sadi, 'Enumeration aspects of maximal cliques and bicliques', Discrete Applied Mathematics, 157(7), 1447-1459, (2009).
15. Arnaud Giacometti, Patrick Marcel, and Arnaud Soulet, 'A relational view of pattern discovery', in DASFAA, pp. 153-167, (2011).
16. Dimitrios Gunopulos, Roni Khardon, Heikki Mannila, Sanjeev Saluja, Hannu Toivonen, and Ram Sewak Sharm, 'Discovering all most specific sentences', ACM Trans. Database Syst., 28(2), 140-174, (2003).
17. Tao-Yuan Jen, Dominique Laurent, and Nicolas Spyratos, 'Computing supports of conjunctive queries on relational tables with functional dependencies', Fundam. Inform., 99(3), 263-292, (2010).
18. Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, and Lhouari Nourine, 'Enumeration of minimal dominating sets and variants', FCT'11, pp. 298-309. Springer-Verlag, (2011).
19. H. Mannila and Hannu Toivonen, 'Levelwise search and borders of theories in knowledge discovery', Data Mining and Knowledge Discovery, 1(3), 241-258, (1997).