Sciweavers

7 search results - page 1 / 2
» Mining maximal hyperclique pattern: A hybrid search strategy
Sort
View
ISCI
2007
81views more  ISCI 2007»
13 years 4 months ago
Mining maximal hyperclique pattern: A hybrid search strategy
Yaochun Huang, Hui Xiong, Weili Wu, Ping Deng, Zho...
ICTAI
2006
IEEE
13 years 11 months ago
Preserving Patterns in Bipartite Graph Partitioning
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
Tianming Hu, Chao Qu, Chew Lim Tan, Sam Yuan Sung,...
DATAMINE
2006
88views more  DATAMINE 2006»
13 years 4 months ago
Hyperclique pattern discovery
Existing algorithms for mining association patterns often rely on the support-based pruning strategy to prune a combinatorial search space. However, this strategy is not effective ...
Hui Xiong, Pang-Ning Tan, Vipin Kumar
ICPADS
2006
IEEE
13 years 11 months ago
Parallel Leap: Large-Scale Maximal Pattern Mining in a Distributed Environment
When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets d...
Mohammad El-Hajj, Osmar R. Zaïane
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
14 years 5 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj