%0 Journal Article
%J Computational Intelligence
%D 2010
%T Pattern Space Maintenance for Data Updates and Interactive Mining
%A Mengling Feng
%A Guozhu Dong
%A Jinyan Li
%A Yap-Peng Tan
%A Limsoon Wong
%K Data mining algorithms
%K data update and interactive mining
%K frequent pattern
%K incremental maintenance
%X This paper addresses the incremental and decremental maintenance of the frequent pattern space. We conduct an in-depth investigation on how the frequent pattern space evolves under both incremental and decremental updates. Based on the evolution analysis, a new data structure, Generator-Enumeration Tree (GE-tree), is developed to facilitate the maintenance of the frequent pattern space. With the concept of GE-tree, we propose two novel algorithms, Pattern Space Maintainer+ (PSM+) and Pattern Space Maintainer- (PSM-), for the incremental and decremental maintenance of frequent patterns. Experimental results demonstrate that the proposed algorithms, on average, outperform the representative state-of-the-art methods by an order of magnitude.
%B Computational Intelligence
%V 26
%P 282-317
%8 08/2010
%G eng
%N 3
%0 Book Section
%D 2009
%T Maintenance of Frequent Patterns: A Survey
%A Jinyan Li
%A Limsoon Wong
%A Mengling Feng
%A Guozhu Dong
%X This chapter surveys the maintenance of frequent patterns in transaction datasets. It is written to be accessible to researchers familiar with the field of frequent pattern mining. The frequent pattern main-tenance problem is summarized with a study on how the space of frequent patterns evolves in response to data updates. This chapter focuses on incremental and decremental maintenance. Four major types of maintenance algorithms are studied: Apriori-based, partition-based, prefix-tree-based, and concise-representation-based algorithms. The authors study the advantages and limitations of these algorithms from both the theoretical and experimental perspectives. Possible solutions to certain limitations are also proposed. In addition, some potential research opportunities and emerging trends in frequent pat-tern maintenance are also discussed.
%G eng
%0 Book Section
%D 2009
%T Mining Conditional Contrast Patterns
%A Guozhu Dong
%A Guimei Liu
%A Limsoon Wong
%A Jinyan Li
%X This chapter considers the problem of 'conditional contrast pattern mining.' It is related to contrast mining, where one considers the mining of patterns/models that contrast two or more datasets, classes, conditions, time periods, and so forth. Roughly speaking, conditional contrasts capture situations where a small change in patterns is associated with a big change in the matching data of the patterns. More precisely, a conditional contrast is a triple (B, F_{1}, F_{2}) of three patterns; B is the condition/context pattern of the conditional contrast, and F_{1} and F_{2} are the contrasting factors of the conditional contrast. Such a conditional contrast is of interest if the difference between F_{1} and F_{2} as itemsets is relatively small, and the difference between the corresponding matching dataset of B∪F_{1} and that of B∪F_{2 is relatively large. It offers insights on 'discriminating' patterns for a given condition B. Conditional contrast mining is related to frequent pattern mining and analysis in general, and to the mining and analysis of closed pattern and minimal generators in particular. It can also be viewed as a new direction for the analysis (and mining) of frequent patterns. After formalizing the concepts of conditional contrast, the chapter will provide some theoretical results on conditional contrast mining. These results (i) relate conditional contrasts with closed patterns and their minimal generators, (ii) provide a concise representation for conditional contrasts, and (iii) establish a so-called dominance-beam property. An efficient algorithm will be proposed based on these results, and experiment results will be reported. Related works will also be discussed.
%G eng
%0 Conference Paper
%B Evolution and Maintenance of Frequent Pattern Space When Transactions Are Removed. Proceedings of PAKDD
%D 2007
%T Evolution and Maintenance of Frequent Pattern Space When Transactions Are Removed. Proceedings of PAKDD
%A Jinyan Li
%A Limsoon Wong
%A Yap-Peng Tan
%A Mengling Feng
%A Guozhu Dong
%B Evolution and Maintenance of Frequent Pattern Space When Transactions Are Removed. Proceedings of PAKDD
%G eng
%0 Conference Paper
%B Minimum Description Length (MDL) Principle: Generators Are Preferable to Closed Patterns
%D 2006
%T Minimum Description Length (MDL) Principle: Generators Are Preferable to Closed Patterns
%A Limsoon Wong
%A Jinyan Li
%A Guozhu Dong
%A H. Li
%A Jian Pei
%B Minimum Description Length (MDL) Principle: Generators Are Preferable to Closed Patterns
%G eng
%0 Journal Article
%D 2004
%T DeEPs: A New Instance-based Discovery and Classification System
%A Limsoon Wong
%A Kotagiri Ramamohanarao
%A Jinyan Li
%A Guozhu Dong
%G eng
%0 Journal Article
%D 2003
%T Incremental Recomputation in Local Languages
%A Leonid Libkin
%A Limsoon Wong
%A Guozhu Dong
%G eng
%0 Journal Article
%D 2000
%T Local Properties of Query Languages
%A Guozhu Dong
%A Limsoon Wong
%A Leonid Libkin
%G eng
%0 Journal Article
%D 1999
%T CAEP: Classification by Aggregating Emerging Patterns
%A Limsoon Wong
%A Guozhu Dong
%A Xiuzhen Zhang
%A Jinyan Li
%G eng
%0 Journal Article
%D 1999
%T Maintaining Transitive Closure of Graphs in SQL
%A Leonid Libkin
%A Jianwen Su
%A Guozhu Dong
%A Limsoon Wong
%G eng
%0 Journal Article
%D 1999
%T Using CAEP to Predict Translation Initiation Sites from Genomic DNA Sequences
%A Xiuzhen Zhang
%A Limsoon Wong
%A Guozhu Dong
%G eng
%0 Journal Article
%D 1998
%T Relational expressive power of constraint query languages
%A Michael Benedikt
%A Leonid Libkin
%A Guozhu Dong
%A Limsoon Wong
%G eng
%0 Journal Article
%D 1997
%T Local properties of query languages
%A Limsoon Wong
%A Leonid Libkin
%A Guozhu Dong
%G eng
%0 Journal Article
%D 1997
%T Some Relationships between FOIES and Sigma 1 1 Arity Hierarchies
%A Guozhu Dong
%A Limsoon Wong
%G eng
%0 Journal Article
%J Journal of the ACM
%D 1996
%T Relational Expressive Power of Constraint Query Languages
%A Michael Benedikt
%A Guozhu Dong
%A Leonid Libkin
%A Limsoon Wong
%X The expressive power of first-order query languages with several classes of equality and inequality constraints is studied in this paper. We settle the conjecture that recursive queries such as parity test and transitive closure cannot be expressed in the relational calculus augmented with polynomial inequality constraints over the reals. Furthermore, noting that relational queries exhibit several forms of genericity, we establish a number of collapse results of the following form: The class of generic boolean queries expressible in the relational calculus augmented with a given class of constraints coincides with the class of queries expressible in the relational calculus (with or without an order relation). We prove such results for both the natural and active-domain semantics. As a consequence, the relational calculus augmented with polynomial inequalities expresses the same classes of generic boolean queries under both the natural and active-domain semantics. In the course of proving these results for the active-domain semantics, we establish Ramsey-type theorems saying that any query involving certain kinds of constraints coincides with a constraint free query on databases whose elements come from a certain innite subset of the domain. To prove the collapse results for the natural semantics, we make use of techniques from nonstandard analysis and from the model theory of ordered structures.
%B Journal of the ACM
%P 5-16
%G eng
%0 Conference Paper
%D 1995
%T On impossibility of decremental recomputation of recursive queries in relational calculus and SQ
%A Guozhu Dong
%A Leonid Libkin
%A Limsoon Wong
%I Fifth International Database Programming Languages Workshop
%G eng
}