In this paper, we propose an efficient algorithm LCM (Linear time Closed pattern Miner) for mining frequent closed patterns from large transaction databases.Expand

We present a linear-time algorithm to simulate the bottom-up traversal of a suffix tree with a suffix array combined with the longest common prefix information in suffix arrays.Expand

In this paper, we propose three algorithms LCMfreq, LCM, and LCMmax for mining all frequent set, frequent closed item sets, and maximal frequent sets, respectively, from transaction databases.Expand

We present an efficient algorithm Unotthat computes all frequent labeled unordered trees appearing in a large collection of data trees with frequency above a user-specified threshold.Expand

In this paper, we consider the problem of discovering interesting substructures from a large collection of semi-structured data in the framework of optimized pattern discovery and present an efficient algorithm that discovers the best labeled ordered trees that optimize a given statistical measure, such as the information entropy and the classification accuracy.Expand

We present an algorithm that exactly identifies every target Horn program H* in ACH(k) in polynomial time in p, m and n using O(pmnk+1) entailment equivalence and entailment membership queries.Expand