The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
In this paper, we study the behavior of collaborative filtering based recommendations under evolving user profile scenarios. We propose a systematic validation methodology that ...
Olfa Nasraoui, Jeff Cerwinske, Carlos Rojas, Fabio...
We show that the e-commerce domain can provide all the right ingredients for successful data mining. We describe an integrated architecture for supporting this integration. The ar...
Suhail Ansari, Ron Kohavi, Llew Mason, Zijian Zhen...
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
We address here two major challenges presented by dynamic data mining: 1) the stability challenge: we have implemented a rigorous incremental density-based clustering algorithm, i...