Sciweavers

18 search results - page 3 / 4
» Compact data structure and scalable algorithms for the spars...
Sort
View
CIKM
2011
Springer
12 years 4 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 6 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
CIKM
2008
Springer
13 years 6 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
13 years 11 months ago
Clustering Distributed Time Series in Sensor Networks
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-sh...
Jie Yin, Mohamed Medhat Gaber
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...