231 search results - page 19 / 47 » Mining Sequential Patterns Using Graph Search Techniques |
SPIRE
1998
Springer
15 years 1 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
KDD
2004
ACM
15 years 9 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
174
click to vote
ICDE
2004
IEEE
15 years 10 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
DAWAK
2000
Springer
15 years 1 months ago
2000
Springer
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...