113 search results - page 23 / 23 » Efficient Discovery of Frequent Approximate Sequential Patte... |
IEAAIE
2009
Springer
13 years 12 months ago
2009
Springer
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...
GBRPR
2007
Springer
13 years 9 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...