Sciweavers

85 search results - page 12 / 17
» An Efficient Algorithm for Maintaining Frequent Closed Items...
Sort
View
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
13 years 5 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...
DKE
2006
125views more  DKE 2006»
13 years 7 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
GIS
2007
ACM
14 years 8 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
ICDM
2006
IEEE
114views Data Mining» more  ICDM 2006»
14 years 1 months ago
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zha...
CIKM
2009
Springer
14 years 7 days ago
A novel approach for privacy mining of generic basic association rules
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
Moez Waddey, Pascal Poncelet, Sadok Ben Yahia