Sciweavers

16 search results - page 1 / 4
» TSP: Mining Top-K Closed Sequential Patterns
Sort
View
91
Voted
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
15 years 3 months ago
TSP: Mining Top-K Closed Sequential Patterns
Sequential pattern mining has been studied extensively in data mining community. Most previous studies require the specification of a minimum support threshold to perform the min...
Petre Tzvetkov, Xifeng Yan, Jiawei Han
86
Voted
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
15 years 3 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
PAISI
2009
Springer
15 years 4 months ago
Discovering Compatible Top-K Theme Patterns from Text Based on Users' Preferences
Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and inform...
Yongxin Tong, Shilong Ma, Dan Yu, Yuanyuan Zhang, ...
123
Voted
ITNG
2006
IEEE
15 years 4 months ago
Closed Multidimensional Sequential Pattern Mining
We propose a new method, called closed multidimensional sequential pattern mining, for mining multidimensional sequential patterns. The new method is an integration of closed sequ...
Panida Songram, Veera Boonjing, Sarun Intakosum
DAWAK
2006
Springer
15 years 4 days ago
COBRA: Closed Sequential Pattern Mining Using Bi-phase Reduction Approach
Sequential pattern mining aims to find frequent patterns (guarded by a minimum support) in a database of sequences. As the support decreases the number of sequential patterns will...
Kuo-Yu Huang, Chia-Hui Chang, Jiun-Hung Tung, Chen...