Sciweavers

995 search results - page 47 / 199
» String Pattern Discovery
Sort
View
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
IADIS
2008
13 years 9 months ago
Aggregation in Confidence-Based Concept Discovery for Multi-Relational Data Mining
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational dat...
Yusuf Kavurucu, Pinar Senkul, Ismail Hakki Toroslu
DAGSTUHL
2004
13 years 9 months ago
Knowledge-Based Sampling for Subgroup Discovery
Subgroup discovery aims at finding interesting subsets of a classified example set that deviates from the overall distribution. The search is guided by a so-called utility function...
Martin Scholz
LWA
2004
13 years 9 months ago
Towards Knowledge-Intensive Subgroup Discovery
Subgroup discovery can be applied for exploration or descriptive induction in order to discover "interesting" subgroups of the general population, given a certain proper...
Martin Atzmüller, Frank Puppe, Hans-Peter Bus...
MST
2006
104views more  MST 2006»
13 years 7 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker