Sciweavers

1918 search results - page 71 / 384
» Discovering Cortical Algorithms
Sort
View
ICPR
2002
IEEE
15 years 11 months ago
A Robust Semi-Supervised EM-Based Clustering Algorithm with a Reject Option
In this paper, we address the problem of semisupervision in the framework of parametric clustering by using labeled and unlabeled data together. Clustering algorithms can take adv...
Christophe Saint-Jean, Carl Frélicot
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
15 years 4 months ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory
CEC
2003
IEEE
15 years 1 months ago
A modified ant colony algorithm for evolutionary design of digital circuits
Evolutionary computation presents a new paradigm shift in hardware design and synthesis. According to this paradigm, hardware design is pursued by deriving inspiration from biologi...
Mostafa Abd-El-Barr, Sadiq M. Sait, Bambang A. B. ...
CEC
2008
IEEE
15 years 4 months ago
New evaluation criteria for the convergence of continuous evolutionary algorithms
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
Ying Lin, Jian Huang, Jun Zhang
IJDMB
2006
90views more  IJDMB 2006»
14 years 9 months ago
An efficient motif discovery algorithm with unknown motif length and number of binding sites
: Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif&#...
Henry C. M. Leung, Francis Y. L. Chin