Sciweavers

1217 search results - page 68 / 244
» On compressing frequent patterns
Sort
View
154
Voted
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 3 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
15 years 10 months ago
Privacy Preserving Pattern Discovery in Distributed Time Series
The search for unknown frequent pattern is one of the core activities in many time series data mining processes. In this paper we present an extension of the pattern discovery pro...
Josenildo Costa da Silva, Matthias Klusch
141
Voted
DATAMINE
2008
89views more  DATAMINE 2008»
15 years 3 months ago
Mining conjunctive sequential patterns
Abstract. In this paper we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative examp...
Chedy Raïssi, Toon Calders, Pascal Poncelet
216
Voted
INCDM
2010
Springer
486views Data Mining» more  INCDM 2010»
15 years 5 months ago
Finding Temporal Patterns in Noisy Longitudinal Data: A Study in Diabetic Retinopathy
This paper describes an approach to temporal pattern mining using the concept of user de ned temporal prototypes to de ne the nature of the trends of interests. The temporal patt...
Vassiliki Somaraki, Deborah Broadbent, Frans Coene...
KDID
2004
137views Database» more  KDID 2004»
15 years 5 months ago
Condensed Representation of EPs and Patterns Quantified by Frequency-Based Measures
Emerging patterns (EPs) are associations of features whose frequencies increase significantly from one class to another. They have been proven useful to build powerful classifiers ...
Arnaud Soulet, Bruno Crémilleux, Fran&ccedi...