Sciweavers

113 search results - page 16 / 23
» Efficient Discovery of Frequent Approximate Sequential Patte...
Sort
View
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
13 years 6 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
ICDE
1999
IEEE
148views Database» more  ICDE 1999»
14 years 9 months ago
Efficient Mining of Partial Periodic Patterns in Time Series Database
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
Jiawei Han, Guozhu Dong, Yiwen Yin
SSD
1995
Springer
146views Database» more  SSD 1995»
13 years 11 months ago
Discovery of Spatial Association Rules in Geographic Information Databases
Spatial data mining, i.e., discovery of interesting, implicit knowledge in spatial databases, is an important task for understanding and use of spatial data- and knowledge-bases. I...
Krzysztof Koperski, Jiawei Han
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
ICML
2007
IEEE
14 years 8 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...