Sciweavers

101 search results - page 2 / 21
» Efficiently Mining Frequent Patterns from Dense Datasets Usi...
Sort
View
ICCV
2009
IEEE
13 years 2 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 2 months ago
Discovery of Geospatial Discriminating Patterns from Remote Sensing Datasets.
Large amounts of remotely sensed data calls for data mining techniques to fully utilize their rich information content. In this paper, we study new means of discovery and summariz...
Wei Ding 0003, Tomasz F. Stepinski, Josue Salazar
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
13 years 5 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 6 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
IPPS
2008
IEEE
13 years 11 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...