Sciweavers

729 search results - page 88 / 146
» Hyperclique pattern discovery
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 5 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
15 years 1 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
EUROCRYPT
2005
Springer
15 years 5 months ago
Predicting and Distinguishing Attacks on RC4 Keystream Generator
In this paper we analyze the statistical distribution of the keystream generator used by the stream ciphers RC4 and RC4A. Our first result is the discovery of statistical biases o...
Itsik Mantin
HIPC
1999
Springer
15 years 4 months ago
High Performance Data Mining
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
Vipin Kumar, Jaideep Srivastava
ECML
2007
Springer
15 years 3 months ago
Finding Composite Episodes
Mining frequent patterns is a major topic in data mining research, resulting in many seminal papers and algorithms on item set and episode discovery. The combination of these, call...
Ronnie Bathoorn, Arno Siebes