Sciweavers

177 search results - page 2 / 36
» Mining fault tolerant frequent patterns using pattern growth...
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
13 years 10 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
DASFAA
2006
IEEE
126views Database» more  DASFAA 2006»
13 years 11 months ago
An Efficient Approach for Mining Top-K Fault-Tolerant Repeating Patterns
Abstract. In this paper, an efficient strategy for mining top-K non-trivial faulttolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences...
Jia-Ling Koh, Yu-Ting Kung
ADMA
2006
Springer
220views Data Mining» more  ADMA 2006»
13 years 10 months ago
Mining and Validation of Localized Frequent Web Access Patterns with Dynamic Tolerance
Mining user profiles is a crucial task for Web usage mining, and can be accomplished by mining frequent patterns. However, in the Web usage domain, sessions tend to be very sparse,...
Olfa Nasraoui, Suchandra Goswami
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...
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
13 years 9 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin