Short communication: TOPSIS: Finding Top-K significant N-itemsets in sliding windows adaptively

Authors:
Bei Yang;Houkuan Huang;Zhifeng Wu
Affiliations:
School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China and School of Information Engineering, Zhengzhou University, Zhengzhou 450001, China;School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China;School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China
Venue:
Knowledge-Based Systems
Year:
2008

Citing 11
Cited 2

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Identifying frequent items in sliding windows over on-line packet streams

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Finding recent frequent itemsets adaptively over online data streams

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Frequent Itemsets without Support Threshold: With and without Item Constraints

IEEE Transactions on Knowledge and Data Engineering
Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Finding (Recently) Frequent Items in Distributed Data Streams

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Finding Maximal Frequent Itemsets over Online Data Streams Adaptively

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
CFI-Stream: mining closed frequent itemsets in data streams

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximate frequency counts over data streams

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
StatStream: statistical monitoring of thousands of data streams in real time

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

The agile improvement of MMORPGs based on the enhanced chaotic neural network

Knowledge-Based Systems
Mining top-k regular-frequent itemsets using database partitioning and support estimation

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Frequent itemset discovery in data streams is of great importance in different applications. However, the setting of a minimum support threshold is typically hard sometimes. It is interesting for users to find the most K significant n-itemsets (1=