Sciweavers

65 search results - page 10 / 13
» Efficient mining of frequent episodes from complex sequences
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
SAC
2005
ACM
14 years 1 months ago
Mining concept associations for knowledge discovery in large textual databases
In this paper, we describe a new approach for mining concept associations from large text collections. The concepts are short sequences of words that occur frequently together acr...
Xiaowei Xu, Mutlu Mete, Nurcan Yuruk
ICCV
2009
IEEE
13 years 5 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
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
ISB
2002
140views more  ISB 2002»
13 years 7 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...