Sciweavers

3123 search results - page 541 / 625
» Focusing on pattern matching
Sort
View
ITS
2010
Springer
157views Multimedia» more  ITS 2010»
15 years 8 months ago
A Computational Model of Accelerated Future Learning through Feature Recognition
Accelerated future learning, in which learning proceeds more effectively and more rapidly because of prior learning, is considered to be one of the most interesting measures of ro...
Nan Li, William W. Cohen, Kenneth R. Koedinger
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 8 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
BIBE
2007
IEEE
141views Bioinformatics» more  BIBE 2007»
15 years 8 months ago
Graph and Topological Structure Mining on Scientific Articles
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...
Fan Wang, Ruoming Jin, Gagan Agrawal, Helen Piontk...
ECOWS
2009
Springer
15 years 8 months ago
An Analysis of Windows Workflow's Control-Flow Expressiveness
The Windows Workflow Foundation (WF) has been introduced as part of the .NET framework as a means of creating workflow-centric applications. Its intended field of application is br...
Marco Zapletal, Wil M. P. van der Aalst, Nick Russ...
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
15 years 8 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong