Sciweavers

252 search results - page 25 / 51
» Mining Frequent Patterns without Candidate Generation
Sort
View
JCIT
2010
174views more  JCIT 2010»
13 years 2 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
14 years 2 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
DSS
2006
129views more  DSS 2006»
13 years 8 months ago
A new approach to classification based on association rule mining
Classification is one of the key issues in the fields of decision sciences and knowledge discovery. This paper presents a new approach for constructing a classifier, based on an e...
Guoqing Chen, Hongyan Liu, Lan Yu, Qiang Wei, Xing...
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 2 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
SIGSOFT
2007
ACM
14 years 8 months ago
Mining API patterns as partial orders from source code: from usage scenarios to specifications
A software system interacts with third-party libraries through various APIs. Using these library APIs often needs to follow certain usage patterns. Furthermore, ordering rules (sp...
Mithun Acharya, Tao Xie, Jian Pei, Jun Xu