Author:
Elbassioni Khaled,Hagen Matthias,Rauf Imran
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proc. SIGMOD 1993, pp. 207–216 (1993)
2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. VLDB 1994, pp. 487–499 (1994)
3. Boros, E., Elbassioni, K.M., Gurvich, V., Khachiyan, L.: An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. Parallel Processing Letters 10(4), 253–266 (2000)
4. Boros, E., Elbassioni, K.M., Gurvich, V., Khachiyan, L.: An inequality for polymatroid functions and its applications. Discrete Applied Mathematics 131(2), 255–281 (2003)
5. Lecture Notes in Computer Science;E. Boros,2004
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献