Every day, new information, products and services are being offered by providers on the World Wide Web. At the same time, the number of consumers and the diversity of their intere...
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Current search engines generally employ link analysis techniques to web-page re-ranking. However, the same techniques are problematic in small webs, such as websites or intranet w...
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
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...