Sciweavers

732 search results - page 23 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
ICDE
2008
IEEE
120views Database» more  ICDE 2008»
14 years 9 months ago
Direct Discriminative Pattern Mining for Effective Classification
The application of frequent patterns in classification has demonstrated its power in recent studies. It often adopts a two-step approach: frequent pattern (or classification rule) ...
Hong Cheng, Xifeng Yan, Jiawei Han, Philip S. Yu
ACMSE
2009
ACM
14 years 2 months ago
A hybrid approach to mining frequent sequential patterns
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
Erich Allen Peterson, Peiyi Tang
IS
2007
13 years 7 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 9 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 1 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han