Sciweavers

479 search results - page 44 / 96
» Distances between Data Sets Based on Summary Statistics
Sort
View
ICDE
2011
IEEE
288views Database» more  ICDE 2011»
14 years 9 months ago
Optimal location queries in road network databases
— Optimal location (OL) queries are a type of spatial queries particularly useful for the strategic planning of resources. Given a set of existing facilities and a set of clients...
Xiaokui Xiao, Bin Yao 0002, Feifei Li
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 6 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
ESANN
2004
15 years 7 months ago
Fast semi-automatic segmentation algorithm for Self-Organizing Maps
Self-Organizing Maps (SOM) are very powerful tools for data mining, in particular for visualizing the distribution of the data in very highdimensional data sets. Moreover, the 2D m...
David Opolon, Fabien Moutarde
PR
1998
86views more  PR 1998»
15 years 5 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
BMCBI
2006
88views more  BMCBI 2006»
15 years 5 months ago
A two-sample Bayesian t-test for microarray data
Background: Determining whether a gene is differentially expressed in two different samples remains an important statistical problem. Prior work in this area has featured the use ...
Richard J. Fox, Matthew W. Dimmic