Mining constraint-based patterns using automatic relaxation

Intelligent Data Analysis

Volumn 13, Issue 1, 2009, Pages 109-133

  Soulet, Arnaud ^a   Crémilleux, Bruno ^b  

^a UNIVERSITÉ DE TOURS   (France)

^b UNIVERSITÉ DE CAEN   (France)

Author keywords

Constraint based mining; Monotonicity; Relaxation; Virtual patterns

Indexed keywords

EID: 61449172104     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/IDA-2009-0358     Document Type: Article

References (47)

1. R. Agrawal, T. Imielinski and A. N. Swami. Mining association rules between sets of items in large databases, in: SIGMOD Conference, P. Buneman and S. Jajodia, eds, ACM Press, 1993, pp. 207-216.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases, in: VLDB, J.B. Bocca, M. Jarke and C. Zaniolo, eds, Morgan Kaufmann, 1994, pp. 487-499.
3. R. Agrawal and R. Srikant, Mining sequential patterns, in: ICDE, P.S. Yu and A.L.P. Chen, eds, IEEE Computer Society, 1995, pp. 3-14.
4. C. Antunes and A.L. Oliveira. Constraint relaxations for discovering unknown sequential patterns, in: KDID 2004, Knowledge Discovery in Inductive Databases, Proceedings of the Third International Workshop on Knowledge Discovery inInductive Databases, Pisa, Italy, September 20, 2004, Revised Selected and Invited Papers, volume 3377 of Lecture Notes in Computer Science, B. Goethals and A. Siebes, eds, Springer, 2004, pp. 11-32.
5. R.J. Bayardo, The hows, whys, and whens of constraints in itemset and rule discovery, in: Proc. of the Workshop on Inductive Databases and Constraint Based Mining (IDW'05), 2005.
6. S. Bistarelli and F. Bonchi, Interestingness is not a dichotomy: Introducing softness in constrained pattern mining, in: PKDD, volume 3721 of Lecture Notes in Computer Science, A. Jorge, L. Torgo, P. Brazdil, R. Camacho and J. Gama, eds, Springer, 2005, pp. 22-33.
7. F. Bonchi, F. Giannotti, A. Mazzanti and D. Pedreschi, Exante: Anticipated data reduction in constrained pattern mining, in: PKDD, volume 2838 of Lecture Notes in Computer Science, N. Lavrac, D. Gamberger, H. Blockeel and L. Todorovski, eds, Springer, 2003, pp. 59-70.
8. F. Bonchi and C. Lucchese, On closed constrained frequent pattern mining, in: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), Brighton, UK, IEEE Computer Society, 1-4 November 2004, pp. 35-42.
9. F. Bonchi and C. Lucchese, Pushing tougher constraints in frequent pattern mining, in: Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, Hanoi, Vietnam, May 18-20, 2005, Proceedings, volume 3518 of Lecture Notes in Computer Science, T.B. Ho, D. Cheung and H. Liu, eds, Sprnger, 2005, pp. 114-124.
10. C. Bucila, J. Gehrke, D. Kifer and W. White, DualMiner: A dual-pruning algorithm for itemsets with constraints, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, ACM, July 23-26, 2002.
11. G. Dong and J. Li, Efficient mining of emerging patterns: Discovering trends and differences, in: Proceedings of the fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'99 New York, NY, USA, ACM Press, 1999, pp. 43-52.
12. M. El-Hajj and O.R. Zaïane, Non-recursive generation of frequent k-itemsets from frequent pattern tree representations, in: Data Warehousing and Knowledge Discovery, 5th International Conference, DaWaK 2003, Prague, Czech Republic, September 3-5, 2003, Proceedings, volume 2737 of Lecture Notes in Computer Science, Y. Kambayashi, M.K. Mohania and W. Wöß, eds, Springer, 2003, pp. 371-380.
13. M. El-Hajj, O.R. Zaïane and P. Nalos, Bifold constraint-based mining by simultaneous monotone and anti-monotone checking, in: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, IEEE Computer Society, 2005, pp. 146-153.
14. J. Fischer, Version Spaces in Constraint-based Data Mining, Master thesis, University of Freiburg, 2003.
15. K. Gade, J. Wang and G. Karypis, Efficient closed pattern mining in the presence of tough block constraint, in: ACM SIGKDD International Conference on Knowledge Discovery in Databases, 2004.
16. M.N. Garofalakis, R. Rastogi and K. Shim, SPIRIT: Sequential pattern mining with regular expression constraints, The VLDB Journal (1999), 223-234.
17. F. Geerts, B. Goethals and T. Mielikäinen, Tiling databases, in: Proceedings of the 7th International Conference on Discovery Science (DS'04), volume 3245, LNAI, 2004, pp. 278-289.
18. A. Giacometti, D. Laurent and C.T. Diop, Condensed representations for sets of mining queries, in: Proceedings of KDID'02, 2002.
19. D. Gunopulos, R. Khardon, H. Mannila and H. Toivonen, Data mining, hypergraph transversals, and machine learning, in: PODS, ACM Press 1997, pp. 209-216.
20. J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, in: SIGMOD Conference, W. Chen, J.F. Naughton and P.A. Bernstein, eds, ACM, 2000, pp. 1-12.
21. T. Imielinski and H. Mannila, A database perspective on knowledge discovery, in: Communication of the ACM, 1996, pp. 58-64.
22. B. Jeudy and F. Rioult, Database transposition for constrained closed pattern mining, in: Proceedings of Third International Workshop on Knowledge Discovery in Inductive Databases (KDID) co-located with ECML/ PKDD, 2004.
23. J. Klema, S. Blachon, A. Soulet, B. Crémilleux and O. Gandrillon, Constraintbased knowledge discovery from sage data, In Silico Biology 8 (2008), 157-175.
24. D.E. Knuth, The Art of Computer Programming, Third volumes, AddisonWesley, 1968.
25. S. Kramer, L.D. Raedt and C. Helma, Molecular feature mining in hiv data, in: KDD, 2001, pp. 136-143.
26. S.D. Lee and L.D. Raedt, An algebra for inductive query evaluation, in: Proceedings of the Second International Workshop on Inductive Databases (KDID'03), Rudjer Boskovic Institute, Zagreb, Croatia, September 2003, pp. 80-96.
27. H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Min Knowl Discov 1(3) (1997), 241-258.
28. H. Mannila, H. Toivonen and A.I. Verkamo, Discovering frequent episodes in sequences, in: KDD, 1995, pp. 210-215.
29. T.M. Mitchell, Generalization as search, Artif Intell 18(2) (1982), 203-226.
30. S. Morishita and J. Sese, Traversing itemset lattice with statistical metric pruning, in: PODS, ACM, 2000, pp. 226-236.
31. R.T. Ng, L.V.S. Lakshmanan, J. Han and A. Pang, Exploratory mining and pruning optimizations of constrained association rules, in: SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, L.M. Haas and A. Tiwary, eds, Seattle, Washington, USA, ACM Press, 1998, pp. 13-24.
32. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Discovering frequent closed itemsets for association rules, in: Proceedings of 7th International Conference on Database Theory (ICDT'99), volume 1540 of Lecture notes in artifial intelligence, Jerusalem, Israel, Springer Verlag, 1999, pp. 398-416.
33. J. Pei, J. Han and L.V.S. Lakshmanan, Mining frequent item sets with convertible constraints, in: ICDE, 2001, pp. 433-442.
34. J. Pei, J. Han and R. Mao, CLOSET: An efficient algorithm for mining frequent closed itemsets, in: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000, pp. 21-30.
35. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal and M. Hsu, Prefixspan: Mining sequential patterns by prefix-projected growth, in: ICDE, IEEE Computer Society, 2001, pp. 215-224.
36. J. Pei, J. Han and W. Wang, Mining sequential patterns with constraints in large databases, in: CIKM, ACM, 2002, pp. 18-25.
37. L.D. Raedt and S. Kramer, The levelwise version space algorithm and its application to molecular fragment finding, in: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001, B. Nebel, ed., Morgan Kaufmann, 2001, pp. 853-862.
38. A. Soulet and B. Crémilleux, An efficient framework for mining flexible constraints, in: Advances in Knowledge Discovery and Data Mining, 9th Paciffic-Asia Conference, PAKDD 2005, Hanoi, Vietnam, May 18-20, 2005, Proceedings, volume 3518 of Lecture Notes in Computer Science, T.B. Ho, D. Cheung and H. Liu, eds, Springer, 2005, pp. 661-671.
39. A. Soulet and B. Crémilleux, Exploiting virtual patterns for automatically pruning the search space, in: Knowledge Discovery in Inductive Databases, 4th International Workshop, KDID 2005, Porto, Portugal, October 3, 2005, Revised Selected and Invited Papers, volume 3933 of Lecture Notes in Computer Science, F. Bonchi and J.-F. Boulicaut, eds, Springer, 2005, pp. 202-221.
40. A. Soulet and B. Crémilleux, Optimizing constraint-based mining by automatically relaxing constraints, in: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005 Houston, Texas, USA, IEEE Computer Society, 2005, pp. 777-780.
41. R. Srikant, Q. Vu and R. Agrawal, Mining association rules with item constraints, in: KDD, 1997, pp. 67-73.
42. A. Termier, M.-C. Rousset and M. Sebag, Dryade: A new approach for discovering closed frequent trees in heterogeneous tree databases, in: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 1-4 November 2004, Brighton, UK, IEEE Computer Society, 2004, pp. 543-546.
43. J. Wang and J. Han, BIDE: Efficient mining of frequent closed sequence, in: ICDE, IEEE Computer Society, 2004, pp. 79-90.
44. K. Wang, Y. Jiang, J.X. Yu, G. Dong and J. Han, Divide-and-approximate: A novel constraint push strategy for iceberg cube mining, IEEE Trans Knowl Data Eng 17(3) (2005), 354-368.
45. X. Yan, J. Han and R. Afshar, CloSpan: Mining closed sequential patterns in large databases, in: Proceedings of the Third SIAM International Conference on Data Mining, D. Barbará and C. Kamath, eds, San Francisco, CA, USA, SIAM, May 1-3, 2003.
46. M.J. Zaki, Scalable algorithms for association mining, IEEE Trans Knowl Data Eng 12(2) (2000), 372-390.
47. M.J. Zaki, N. Parimi, N. De, F. Gao, B. Phoophakdee, J. Urban, V. Chaoji, M.A. Hasan and S. Salem, Towards generic pattern mining, in: Formal Concept Analysis, Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings, volume 3403 of Lecture Notes in Computer Science, B. Ganter and R. Godin, eds, Springer, 2005, pp. 1-20.