Sciweavers

942 search results - page 39 / 189
» Efficiently Mining Long Patterns from Databases
Sort
View
79
Voted
EDBT
2004
ACM
162views Database» more  EDBT 2004»
15 years 9 months ago
Non-contiguous Sequence Pattern Queries
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
Nikos Mamoulis, Man Lung Yiu
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
15 years 1 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin
IS
2008
14 years 9 months ago
Efficient mining of frequent episodes from complex sequences
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
Kuo-Yu Huang, Chia-Hui Chang
IRI
2007
IEEE
15 years 4 months ago
Automated Multimedia Systems Training Using Association Rule Mining
User feedback is widely deployed in recent multimedia research to refine retrieval performance. However, most of the existing online learning algorithms handle interactions of a s...
Na Zhao, Shu-Ching Chen, Stuart Harvey Rubin
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
15 years 10 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou