Mining Closed Discriminative Dyadic Sequential Patterns
Conference Proceeding Article
A lot of data are in sequential formats. In this study, we are interested in sequential data that goes in pairs. There are many interesting datasets in this format coming from various domains including parallel textual corpora, duplicate bug reports, and other pairs of related sequences of events. Our goal is to mine a set of closed discriminative dyadic sequential patterns from a database of sequence pairs each belonging to one of the two classes +ve and -ve. These dyadic sequential patterns characterize the discriminating facets contrasting the two classes. They are potentially good features to be used for the classification of dyadic sequential data. They can be used to characterize and flag correct and incorrect translations from parallel textual corpora, automate the manual and time consuming duplicate bug report detection process, etc. We provide a solution of this new problem by proposing new search space traversal strategy, projected database structure, pruning properties, and novel mining algorithms. To demonstrate the scalability and utility of our solution, we have experimented with both synthetic and real datasets. Experiment results show that our solution is scalable. Mined patterns are also able to improve the accuracy of one possible downstream application, namely the detection of duplicate bug reports using pattern-based classification.
International Conference on Extending Database Technology (EDBT)
LO, David; CHENG, Hong; and Lucia, -.
Mining Closed Discriminative Dyadic Sequential Patterns. (2011). International Conference on Extending Database Technology (EDBT). 21-32. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1358