Sciweavers

1422 search results - page 99 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
15 years 4 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
141
Voted
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 6 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
231
Voted
ICDM
2006
IEEE
145views Data Mining» more  ICDM 2006»
15 years 9 months ago
Stability Region Based Expectation Maximization for Model-based Clustering
In spite of the initialization problem, the ExpectationMaximization (EM) algorithm is widely used for estimating the parameters in several data mining related tasks. Most popular ...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...
SIGMOD
2004
ACM
100views Database» more  SIGMOD 2004»
16 years 3 months ago
Cost-Based Labeling of Groups of Mass Spectra
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
Lei Chen 0003, Zheng Huang, Raghu Ramakrishnan
IWANN
2009
Springer
15 years 9 months ago
Data Mining in Complex Diseases Using Evolutionary Computation
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...
Vanessa Aguiar, Jose A. Seoane, Ana Freire, Cristi...