@inproceedings{5b97865f2b35495e88dd1816fca24032,

title = "On dualization in products of forests",

abstract = "Let P = Pi ×… × Pn 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.",

keywords = "Data mining, Dualization, Forest, Incremental algorithms, Poset",

author = "Elbassioni, {Khaled M.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002 ; Conference date: 14-03-2002 Through 16-03-2002",

year = "2002",

doi = "10.1007/3-540-45841-7_11",

language = "British English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "142--153",

editor = "Helmut Alt and Afonso Ferreira",

booktitle = "STACS 2002 - 19th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings",

address = "Germany",

}