The parameterized complexity of enumerating frequent itemsets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4169 LNCS, Issue , 2006, Pages 227-238

  Hamilton, Matthew ^a   Chaytor, Rhonda ^b   Wareham, Todd ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA MINING; PROBLEM SOLVING;

ALGORITHM DESIGN; ITEMSETS; PARAMETERIZED COMPLEXITY;

DATABASE SYSTEMS;

EID: 33750236245     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_21     Document Type: Conference Paper

References (33)

1. Hamilton, M.: B.Sc.h Dissertation, The Parameterized Complexity of Enumerating Frequent Itemsets (2005)
2. Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules between Sets of Items in Large Databases. In Buneman, P., Jajodia, S., eds.: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. (1993) 207-216
3. Zaki, M.J., Ogihara, M.: Theoretical Foundations of Association Rules. In: In Proceedings of 3rd SIGMOD'98 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'98). (1998)
4. Koyutürk, M., Grama, A., Szpankowski, W.: An Efficient Algorithm for Detecting Frequent Subgraphs in Biological Networks. In: ISMB/ECCB (Supplement of Bioinformatics). (2004) 200-207
5. Grossman, R., Kasif, S., Moore, R., Rocke, D., Ullman, J.: Data mining research: Opportunities and challenges. A Report of three NSF Workshops on Mining Large, Massive, and Distributed Data (1998)
6. Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharm, R.S.: Discovering All Most Specific Sentences. ACM Transactions on Database Systems 28(2) (2003) 140-174
7. Lin, D.I., Kedem, Z.M.: Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set. In: Proceedings of the 6th International Conference on Extending Database Technology (EDBT), Lecture Notes in Computer Science. Volume 1377. (1998) 105-119
8. Zaki, M.J., Hsiao, C.J.: Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure. IEEE Transactions on Knowlege and Data Engineering 17(4) (2005) 462-478
9. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In Bocca, J.B., Jarke, M., Zaniolo, C., eds.: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), Morgan Kaufmann (1994) 487-499
10. Goethals, B.: Survey on Frequent Pattern Mining (2003)
11. Zaki, M.J., Gouda, K.: Fast Vertical Mining Using Diffsets. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, ACM Press (2003) 326-335
12. Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: Introduction to fimi03. In: Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations. (2003)
13. Yang, G.: The Complexity of Mining Maximal Frequent Itemsets and Maximal Frequent Patterns. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. (2004) 344-353
14. Wareham, H.T.: Systematic Parameterized Complexity Analysis in Computational Phonology. PhD thesis, University of Victoria (1999)
15. Seno, M., Karypis, G.: SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint. In: Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM). (2002) 418-425
16. Arvind, V., Raman, V.: Approximation Algorithms for Some Parameterized Counting Problems. In: Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science. Volume 2518. (2002) 453-464
17. Damaschke, P.: Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. In: Proceedings of 1st International Workshop on Parameterized and Exact Computation (IWPEC'2004), Lecture Notes in Computer Science. Volume 3162. (2004) 1-12
18. Fernau, H.: On Parameterized Enumeration. In: Proceedings of the 8th Annual International Conference on Computing and Combinatorics (COCOON), Lecture Notes In Computer Science. Volume 2387. (2002) 564-573
19. Flum, J., Grohe, M.: The Parameterized Complexity of Counting Problems. SIAM Journal on Computing 33(4) (2004) 892-922
20. McCartin, C.: Parameterized Counting Problems. In: Mathematical Foundations of Computer Science 2002, 27th International Symposium (MFCS 2002), Lecture Notes in Computer Science. Volume 2420. (2002) 556-567
21. Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing 8(3) (1979) 410-421
22. Garey, M.R., Johnson, D.S.: Computers and Intractablity: A Guide to the Theory of NP-Completeness. Freeman (1979)
23. Downey, R.G., Fellows, M.R.: Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM Journal on Computing 24(4) (1995) 873-921
24. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer-Verlag (1999)
25. Guo, J., Niedermeier, R.: Exact algorithms and applications for tree-like weighted set cover. Journal of Discrete Algorithms (Accepted June 2005 (to appear))
26. Gottlob, G., Grohe, M., Musliu, N., Samer, M., Scarcello, F.: Hypertree decompositions: Structure, algorithms, and applications. In: Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science. Volume 3787. (2005) 1-15
27. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Applied Mathematics 145(1) (2004) 11-21
28. Jiong G., Huffner, F., Niedermeier, R.: A Structural View on Parameterizing Problems: Distance from Triviality. In: Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004), Lecture Notes in Computer Science. Volume 3162. (2004) 162-173
29. Fernau, H., Niedermeier, R.: An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. In Ambos-Spies, K., et al., eds.: 38. Workshop über Komplexitätstheorie, Datenstrukturen und effiziente Algorithmen. Volume 44. (1999) 8
30. Chen, J., Kanj, I.A.: Constrained Minimum Vertex Cover in Bipartite Graphs: Complexity and Parameterized Algorithms. Journal of Computer and System Sciences 67(4) (2003) 833-847
31. Chlebík, M., Chlebíková, J.: Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. In: Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Computer Science. Volume 3111. (2004) 174-186
32. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langsten, M.A., Suters, W.H., Symons, C.T.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALC). (2004) 62-69
33. Afrati, F.N., Gionis, A., Mannila, H.: Approximating a collection of frequent sets. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. (2004) 12-19