Sciweavers

388 search results - page 28 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
LWA
2004
13 years 10 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
ICDM
2006
IEEE
113views Data Mining» more  ICDM 2006»
14 years 2 months ago
Mining Maximal Generalized Frequent Geographic Patterns with Knowledge Constraints
In frequent geographic pattern mining a large amount of patterns is well known a priori. This paper presents a novel approach for mining frequent geographic patterns without assoc...
Vania Bogorny, João Francisco Valiati, Sand...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
14 years 8 days ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
14 years 1 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
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 10 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou