In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
— Since sequential patterns may exist in multiple sequence databases, we propose algorithm PropagatedMine+ to efficiently discover multi-domain sequential patterns. Prior works ...
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...