Sciweavers

1215 search results - page 50 / 243
» Numbers in Multi-relational Data Mining
Sort
View
KDD
2003
ACM
145views Data Mining» more  KDD 2003»
16 years 6 days ago
Carpenter: finding closed patterns in long biological datasets
The growth of bioinformatics has resulted in datasets with new characteristics. These datasets typically contain a large number of columns and a small number of rows. For example,...
Feng Pan, Gao Cong, Anthony K. H. Tung, Jiong Yang...
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
15 years 4 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
DAWAK
2004
Springer
15 years 3 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
CLA
2007
15 years 1 months ago
ZART: A Multifunctional Itemset Mining Algorithm
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
Laszlo Szathmary, Amedeo Napoli, Sergei O. Kuznets...
PKDD
2004
Springer
147views Data Mining» more  PKDD 2004»
15 years 5 months ago
Using a Hash-Based Method for Apriori-Based Graph Mining
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
Phu Chien Nguyen, Takashi Washio, Kouzou Ohara, Hi...