Sciweavers

1529 search results - page 61 / 306
» A slant removal algorithm
Sort
View
ICTAI
2006
IEEE
14 years 4 months ago
Minimum Spanning Tree Based Clustering Algorithms
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
Oleksandr Grygorash, Yan Zhou, Zach Jorgensen
FSKD
2005
Springer
101views Fuzzy Logic» more  FSKD 2005»
14 years 4 months ago
Geometrical Probability Covering Algorithm
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
Junping Zhang, Stan Z. Li, Jue Wang
IJAR
2007
130views more  IJAR 2007»
13 years 10 months ago
Bayesian network learning algorithms using structural restrictions
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
Luis M. de Campos, Javier Gomez Castellano
PERCOM
2006
ACM
14 years 10 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece
ISNN
2007
Springer
14 years 4 months ago
Memetic Algorithms for Feature Selection on Microarray Data
In this paper, we present two novel memetic algorithms (MAs) for gene selection. Both are synergies of Genetic Algorithm (wrapper methods) and local search methods (filter methods...
Zexuan Zhu, Yew-Soon Ong