Sciweavers

1709 search results - page 38 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
134
Voted
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
15 years 7 months ago
A Hybrid Approach to Discover Bayesian Networks From Databases Using Evolutionary Programming
This paper describes a novel data mining approach that employs evolutionary programming to discover knowledge represented in Bayesian networks. There are two different approaches ...
Man Leung Wong, Shing Yan Lee, Kwong-Sak Leung
PLDI
1995
ACM
15 years 6 months ago
Tile Size Selection Using Cache Organization and Data Layout
When dense matrix computations are too large to fit in cache, previous research proposes tiling to reduce or eliminate capacity misses. This paper presents a new algorithm for ch...
Stephanie Coleman, Kathryn S. McKinley
VLDB
2007
ACM
107views Database» more  VLDB 2007»
16 years 2 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 2 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
ADMA
2006
Springer
127views Data Mining» more  ADMA 2006»
15 years 8 months ago
Feature Selection for Complex Patterns
Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be cha...
Peter Schenkel, Wanqing Li, Wanquan Liu