Abstract
Let P = P 1 ×…×P n be the product of n partially ordered sets, each with an acyclic precedence graph in which either the in-degree or the out-degree of each element is bounded. Given a subset A ⊆ P, it is shown that the set of maximal independent elements of A in P can be incrementally generated in quasi-polynomial time. We discuss some applications in data mining related to this dualization problem.
Partially supported by DIMACS, the National Science Foundation’s Center for Discrete Mathematics and Theoretical Computer Science.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Agrawal, T. Imielinski and A. Swami, Mining association rules between sets of items in massive databases. In Proc. the 1993 ACM-SIGMOD Int. Conf. Management of Data, pp. 207–216.
R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases. In Proc. 20th Int. Conf. Very Large Data Bases, pp. 487–499, 1994.
R. Agrawal and R. Srikant, Mining sequential patterns. In Proc. 11th Int. Conf. Data Engineering, pp. 3–14, 1995.
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A. I. Verkamo, Fast discovery of association rules. In Advancesin Knowledge Discovery and Data Mining, pp. 307–328, AAAI Press, Menlo Park, California, 1996.
M. Anthony and N. Biggs, Computational Learning Theory, Cambridge University Press, 1992.
J. C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation, 123 (1995) pp. 50–63.
E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino, On generating all minimal integer solutions for a monotone system of linear inequalities. In Automata, Languagesand Programming, 28th Int. Colloquium, ICALP 2001,LNCS 2076, pp. 92–103 (Springer Verlag, Berlin, Heidelberg, New York, July 2001).
E. Boros, V. Gurvich, L. Khachiyan and K. Makino, An inequality limiting the number of maximal frequent sets, DIMACS tech. report 2000-37, Rutgers Univ.
E. Boros, V. Gurvich, L. Khachiyan and K. Makino, Generating weighted transversals of a hypergraph, in Proceedings of the 2nd Japanese-Hungarian Symposium on Discrete Mathematicsand ItsApplic ations, pp. 13–22, Hungarian Academy of Sciences, Budapest, Hungary, April 20–23, 2001.
S. Brin, R. Motwani and C. Silverstein, Beyond market basket: Generalizing association rules to correlations. In Proc. the 1997 ACM-SIGMOD Int. Conf. Management of Data, pp. 265–276.
C. J. Colbourn, The combinatoricsof network reliability, Oxford Univ. Press, 1987.
T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM Journal on Computing, 24 (1995) pp. 1278–1304.
M. L. Fredman and L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, Journal of Algorithms, 21 (1996) pp. 618–628.
D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen, Data mining, hypergraph transversals and machine learning. In Proc. 16th ACM-SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, (1997) pp. 12–15.
V. Gurvich and L. Khachiyan, On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions, Discrete Applied Mathematics, 1996–97, issue 1–3, (1999) pp. 363–373.
J. Han and Y. Fu, Discovery of multiple-level association rules from large databases. In Proc. 21st Int. Conf. Very Large Data Bases, pp. 420–431, 1995.
K. Makino and T. Ibaraki, Interior and exterior functions of Boolean functions, Discrete Applied Mathematics, 69 (1996) pp. 209–231.
H. Mannila, and H. Toivonen, Discovery of frequent episodes in event sequences, Data Mining and Knowledge Discovery, 1 (1997) pp. 259–289.
R. C. Read, Every one a winner, or how to avoid isomorphism when cataloging combinatorial configurations, Annalsof Discrete Math. 2 (1978) pp. 107–120.
R. Srikant and R. Agrawal, Mining generalized association rules. In Proc. 21st Int. Conf. Very Large Data Bases, pp. 407–419, 1995.
R. Srikant and R. Agrawal, Mining quantitative association rules in large relational tables. In Proc. of the ACM-SIGMOD 1996 Int. Conf. Management of Data, pp. 1–12, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elbassioni, K.M. (2002). On Dualization in Products of Forests. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_11
Download citation
DOI: https://doi.org/10.1007/3-540-45841-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43283-8
Online ISBN: 978-3-540-45841-8
eBook Packages: Springer Book Archive